Polymorphic DHOL is formalized with syntax, semantics, and a HOL translation, implemented in a logic-embedding tool and evaluated on TPTP formalizations to support automated proving.
Competing inheritance paths in dependent type theory: A case study in functional analysis
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.LO 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
A Rocq formalization defines simplicial Lagrange finite elements as records with geometric data, polynomial approximations, and unisolvence proofs for any dimension and polynomial degree.
citing papers explorer
-
Polymorphism Meets DHOL
Polymorphic DHOL is formalized with syntax, semantics, and a HOL translation, implemented in a logic-embedding tool and evaluated on TPTP formalizations to support automated proving.
-
A Rocq Formalization of Simplicial Lagrange Finite Elements
A Rocq formalization defines simplicial Lagrange finite elements as records with geometric data, polynomial approximations, and unisolvence proofs for any dimension and polynomial degree.