Rewriting Modulo β in the λΠ-Calculus Modulo
The lambda-Pi-calculus Modulo is a variant of the lambda-calculus with dependent types where beta-conversion is extended with user-defined rewrite rules. It is an expressive logical framework and has been used to encode logics and type systems in a shallow way. Basic properties such as subject reduc...
| Päätekijä: | |
|---|---|
| Aineistotyyppi: | Artikkeli |
| Kieli: | English |
| Julkaistu: |
Open Publishing Association
2015-07-01
|
| Sarja: | Electronic Proceedings in Theoretical Computer Science |
| Linkit: | http://arxiv.org/pdf/1507.08055v1 |