Equations: A Dependent Pattern-Matching Compiler - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Lecture Notes in Computer Science Year : 2010

Equations: A Dependent Pattern-Matching Compiler

Abstract

We present a compiler for definitions made by pattern matching on inductive families in the Coq system. It allows to write structured, recursive dependently-typed functions as a set of equations, automatically find their realization in the core type theory and generate proofs to ease reasoning on them. It provides a complete package to define and reason on functions in the proof assistant, substantially reducing the boilerplate code and proofs one usually has to write, also hiding the in- tricacies related to the use of dependent types and complex recursion schemes.

Dates and versions

inria-00628862 , version 1 (04-10-2011)

Identifiers

Cite

Matthieu Sozeau. Equations: A Dependent Pattern-Matching Compiler. Lecture Notes in Computer Science, 2010, 6172, ⟨10.1007/978-3-642-14052-5_29⟩. ⟨inria-00628862⟩
44 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More