The problem of characterizing sequents for which there is a unique proof in intuitionistic logic was first raised by Mints [Min77], initially studied in [BS82] and later in [Aot99]. We address this problem through game semantics and give a new and concise proof of [Aot99]. We also fully characterize a family of λ-terms for Aoto's theorem. The use of games also leads to a new characterization of principal typings for simply-typed λ-terms. These results show that game models can help proving strong structural properties in the simply-typed λ-calculus. © 2011 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Bourreau, P., & Salvati, S. (2011). Game semantics and uniqueness of type inhabitance in the simply-typed λ-calculus. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6690 LNCS, pp. 61–75). https://doi.org/10.1007/978-3-642-21691-6_8
Mendeley helps you to discover research relevant for your work.