Basic simple type theory
On full abstraction for PCF: I, II, and III
Information and Computation
Innocent game models of untyped λ-calculus
Theoretical Computer Science - Special issue on theories of types and proofs
Principal type-schemes for functional programs
POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Uniqueness of Normal Proofs in Implicational Intuitionistic Logic
Journal of Logic, Language and Information
Hereditarily Sequential Functionals
LFCS '94 Proceedings of the Third International Symposium on Logical Foundations of Computer Science
Game Semantics for Untyped lambda beta eta-Calculus
TLCA '99 Proceedings of the 4th International Conference on Typed Lambda Calculi and Applications
Towards abstract categorial grammars
ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
On Long Normal Inhabitants of a Type
Journal of Logic and Computation
On the Membership Problem for Non-Linear Abstract Categorial Grammars
Journal of Logic, Language and Information
| Hi-index | 0.00 |
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.