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...
| 第一著者: | |
|---|---|
| フォーマット: | 論文 |
| 言語: | English |
| 出版事項: |
Open Publishing Association
2015-07-01
|
| シリーズ: | Electronic Proceedings in Theoretical Computer Science |
| オンライン･アクセス: | http://arxiv.org/pdf/1507.08055v1 |