Name
Abstract | ||
|---|---|---|
Extensions of the simply typed lambda calculus have been used as a metalanguage to represent "higher order term algebras", such as, for instance, formulas of the predicate calculus. In this representation bound variables of the object language are represented by bound variables of the metalanguage. This choice has various advantages but makes the notion of "recursive definition" on higher order term algebras more subtle than the corresponding notion on first order term algebras. Despeyroux, Pfenning and Schürmann pointed out the problems that arise in the proof of a canonical form theorem when one combines higher order representations with primitive recursion. In this paper we consider a stronger scheme of recursion and we prove that it captures all partial recursive functions on second order term algebras. We illustrate the system by considering typed programs to reduce to normal form terms of the untyped lambda calculus, encoded as elements of a second order term algebra. First order encodings based on de Bruijn indexes are also considered. The examples also show that a version of the intersection type disciplines can be helpful in some cases to prove the existence of a canonical form. Finally we consider interpretations of our typed systems in the pure lambda calculus and a new gödelization of the pure lambda calculus. |
Year | Venue | Keywords |
|---|---|---|
2001 | RTA | algebra,canonical form,theorem proving,functional programming,lambda calculus,second order |
Field | DocType | ISBN |
Discrete mathematics,Simply typed lambda calculus,Typed lambda calculus,Normalisation by evaluation,Algebra,Fixed-point combinator,System F,Algorithm,Church encoding,Director string,Pure type system,Mathematics | Conference | 3-540-42117-3 |
Citations | PageRank | References |
1 | 0.38 | 16 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alessandro Berarducci | 1 | 136 | 22.96 |
| Corrado Böhm | 2 | 487 | 413.44 |