Name
Abstract | ||
|---|---|---|
The definitional equality of an intensional type theory is its test of type compatibility. Today's systems rely on ordinary evaluation semantics to compare expressions in types, frustrating users with type errors arising when evaluation fails to identify two `obviously' equal terms. If only the machine could decide a richer theory! We propose a way to decide theories which supplement evaluation with `ν-rules', rearranging the neutral parts of normal forms, and report a successful initial experiment. We study a simple λ-calculus with primitive fold, map and append operations on lists and develop in Agda a sound and complete decision procedure for an equational theory enriched with monoid, functor and fusion laws. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1145/2502409.2502411 | Proceedings of the 2013 ACM SIGPLAN workshop on Dependently-typed programming |
Field | DocType | Volume |
Programming language,Simply typed lambda calculus,Expression (mathematics),Computer science,Type theory,Functor,Monoid,Append,Agda,Calculus,Semantics | Journal | abs/1304.0809 |
Citations | PageRank | References |
1 | 0.35 | 20 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Guillaume Allais | 1 | 12 | 2.00 |
| Conor McBride | 2 | 752 | 47.89 |
| Pierre Boutillier | 3 | 7 | 3.19 |