A Rocq formalization defines simplicial Lagrange finite elements as records with geometric data, polynomial approximations, and unisolvence proofs for any dimension and polynomial degree.
Hierarchy builder: Algebraic hierarchies made easy in Coq with Elpi (system description)
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
Coq framework with discrete lenses for typed, compositional definition and verification of quantum circuits.
citing papers explorer
-
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.
-
Typed compositional quantum computation with lenses
Coq framework with discrete lenses for typed, compositional definition and verification of quantum circuits.