Reviewing the classical and the de Bruijn notation for λ-calculus and pure type systems (2001)
| Venue: | Logic and Computation |
| Citations: | 2 - 0 self |
BibTeX
@ARTICLE{Kamareddine01reviewingthe,
author = {Fairouz Kamareddine},
title = {Reviewing the classical and the de Bruijn notation for λ-calculus and pure type systems},
journal = {Logic and Computation},
year = {2001},
volume = {11},
pages = {11--3}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
This article is a brief review of the type free λ-calculus and its basic rewriting notions, and of the pure type system framework which generalises many type systems. Both the type free λ-calculus and the pure type systems are presented using variable names and de Bruijn indices. Using the presentation of the λ-calculus with de Bruijn indices, we illustrate how a calculus of explicit substitutions can be obtained. In addition, de Bruijn's notation for the λ-calculus is introduced and some of its advantages are outlined.
