Exact bounds for lengths of reductions in typed λ-calculus

Journal of Symbolic Logic

Volumn 66, Issue 3, 2001, Pages 1277-1285

  Beckmann, Arnold ^a  

^a UNIVERSITY OF MÜNSTER   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0035636857     PISSN: 00224812     EISSN: None     Source Type: Journal    
DOI: 10.2307/2695106     Document Type: Article

References (6)

1. H. P. BARENDREGT, The lambda calculus. Studies in Logic, vol. 103, North-Holland, 1984.
2. H. GOGUEN, A typed operational semantics for type theory, Ph.D. thesis, University of Edinburgh, 1994.
3. R. LOADER, Notes on simply typed lambda calculus, Technical Report ECS-LFCS-98-381, Edinburgh.
4. H. SCHWICHTENBERG, Complexity of normalization in the pure typed lambda - calculus, The L. E. J. Brouwer centenary symposium (A. S. Troelstra and D. van Dalen, editors), North-Holland, 1982, pp. 453-457.
5. _, An upper bound for reduction sequences in the typed λ-calculus, Archive of Mathematical Logic, vol. 30 (1991), pp. 405-408.
6. F. VAN RAAMSDONK and P. SEVERI, On normalisation, Computer Science Report CS-R9545, Centrum for Wiskunde en Informatica, 1995.