Source
Abstract
Identifiers
journal ISSN : | 2449-836X , 0138-0680 |
DOI | 10.18778/0138-0680.45.1.01 |
Authors
Keywords
Additional information
Publisher
Fields of science
Bibliography
-
[1] T. Altenkirch and T. Coquand, A finitary subsystem of the polymorphic λ-calculus, Proceedings of the 5th International Conference on Typed Lambda Calculi and Applications (TLCA 2001), Lecture Notes in Computer Science 2044 (2001), pp. 22–28.
-
A. Beckmann, Exact bounds for lenghts of reductions in typed λ-calculus, The Journal of Symbolic Logic 66(3) (2001), pp. 1277–1285.
-
F. Ferreira, A simple proof of Parsons’ theorem, Notre Dame Journal of Formal Logic 46 (2005), pp. 83–91.