Equations: a dependent pattern-matching compiler

DOI10.1007/978-3-642-14052-5_29MaRDI QIDQ5747666zbMATH OpenOpenAlexFDO

Authors Matthieu Sozeau

Publication date 14 September 2010

Published in Interactive Theorem Proving (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-14052-5_29

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20)

Recommendations

• Eliminating Dependent Pattern Matching
• A New Elimination Rule for the Calculus of Inductive Constructions
• Overlapping and order-independent patterns. Definitional equality for all
• The view from the left
• Elaborating dependent (co)pattern matching: no pattern left behind

Cited in

(12)

• A formalisation of nominal \(\alpha\)-equivalence with A, C, and AC function symbols
• More Efficient Left-to-Right Pattern Matching in Non-sequential Equational Programs
• Foundations of dependent interoperability
• Mechanically certifying formula-based Noetherian induction reasoning
• Elaborating dependent (co)pattern matching: no pattern left behind
• Eliminating dependent pattern matching without K
• Overlapping and order-independent patterns. Definitional equality for all
• Eliminating Dependent Pattern Matching
• Ornaments for Proof Reuse in Coq
• Formal Verification of Bit-Vector Invertibility Conditions in Coq
• Builtin types viewed as inductive families
• Equations for hereditary substitution in Leivant's predicative system F: a case study

Describes a project that uses

Uses Software

• Coq
• LEGO
• Equations

This page was built for publication: Equations: a dependent pattern-matching compiler

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5747666)