#### Filter Results:

- Full text PDF available (0)

#### Publication Year

2012

2013

- This year (0)
- Last 5 years (2)
- Last 10 years (2)

#### Publication Type

#### Journals and Conferences

Learn More

- William R. Stirton
- Arch. Math. Log.
- 2012

The article investigates a system of polymorphically typed combinatory logic which is equivalent to Gödel’s T. A notion of (strong) reduction is defined over terms of this system and it is proved that the class of well-formed terms is closed under both bracket abstraction and reduction. The main new result is that the number of contractions needed to reduce… (More)

- William R. Stirton
- Arch. Math. Log.
- 2013

This article investigates a theory of type assignment (assigning types to lambda terms) called ETA which is intermediate in strength between the simple theory of type assignment and strong polymorphic theories like Girard’s F (Proofs and types. Cambridge University Press, Cambridge, 1989). It is like the simple theory and unlike F in that the typability and… (More)

- ‹
- 1
- ›