A third-order representation of the λµ-Calculus (2001)
Cached
Download Links
by
Andreas Abel
| Venue: | Electronic Notes in Theoretical Computer Science |
| Citations: | 6 - 1 self |
BibTeX
@INPROCEEDINGS{Abel01athird-order,
author = {Andreas Abel},
title = {A third-order representation of the λµ-Calculus},
booktitle = {Electronic Notes in Theoretical Computer Science},
year = {2001},
publisher = {Elsevier}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. Higher-order logical frameworks provide a powerful technology to reason about object languages with binders. This will be demonstrated for the case of the λµ-calculus with two different binders which can most elegantly be represented using a third-order constant. Since cases of third- and higher-order encodings are very rare in comparison with those of second order, a second-order representation is given as well and equivalence to the third-order representation is proven formally. 1
Citations
| 35 | A formalization of the strong normalization proof for System F - Altenkirch - 1993 |
| 7 | A computational interpretation of the λµ-calculus - Bierman - 1998 |
| 1 | A third-order representation of the λµ-calculus. Twelf code, available under http://www.cs.cmu.edu/˜abel/merlin01.tar.gz - Abel - 2001 |
| 1 | Parallel reduction in type free λµ-calculus - Baba, Hirokawa, et al. - 2001 |
