The maximality of the typed lambda calculus and of cartesian closed categories
by
Zoran Petrić
| Venue: | Publ. Inst. Math. (N.S |
| Citations: | 17 - 0 self |
BibTeX
@ARTICLE{Petrić_themaximality,
author = {Zoran Petrić},
title = {The maximality of the typed lambda calculus and of cartesian closed categories},
journal = {Publ. Inst. Math. (N.S},
year = {},
pages = {1--19}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
From the analogue of Böhm’s Theorem proved for the typed lambda calculus, without product types and with them, it is inferred that every cartesian closed category that satisfies an equality between arrows not satisfied in free cartesian closed categories must be a preorder. A new proof is given here of these results, which were obtained previously by Richard Statman and Alex K. Simpson.
