Name
Abstract | ||
|---|---|---|
It is well known that reasoning about substitution is a huge \"distraction\" that inevitably gets in the way of formalizing interesting properties of languages with variable bindings. Most formalizations have their own separate definitions of terms and substitution, and properties about it. However there is a great deal of uniformity in the way substitution works and the reasons why its properties hold. We expose this uniformity by defining terms, substitution and α-equality generically in Coq by parametrizing them over a Context Free Grammar annotated with Variable binding information (CFGV). We also provide proofs of many properties about the above definitions (enough to formalize the PER semantics of Nuprl in Coq). Unlike many other tools which generate a custom definition of substitution for each input, all instantiations of our term model share the same substitution function. The proofs about this function have been accepted by Coq's typechecker once and for all. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1145/2631172.2631177 | LFMTP |
Keywords | Field | DocType |
formal definitions and theory,languages,verification,homotopy type theory,category theory,type theory | Discrete mathematics,Context-free grammar,Nuprl,Type theory,Homotopy type theory,Mathematical proof,Category theory,Agda,Calculus,Semantics,Mathematics | Conference |
Citations | PageRank | References |
1 | 0.41 | 14 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Abhishek Anand | 1 | 297 | 14.58 |
| Vincent Rahli | 2 | 43 | 9.21 |