Theoretical pearl: Expansion postponement for normalising pure type systems

Journal of Functional Programming

Volumn 8, Issue 1, 1998, Pages 89-96

  Poll, Erik ^a  

^a UNIVERSITY OF KENT   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0032377574     PISSN: 09567968     EISSN: None     Source Type: Journal    
DOI: 10.1017/S095679689700292X     Document Type: Article

References (6)

1. Barendregt, H. P. (1991) Introduction to generalised type systems. J. Functional Programming, 1(2): 124-154.
2. Barendregt, H. P. (1992) Lambda calculi with types. In: Gabbai, D. M., Abramsky, S. and Maibaum, T. S. E. (eds.), Handbook of Logic in Computer Science, Vol. 1. Oxford University Press.
3. Poll, E. (1993) A typechecker for bijective pure type systems. Computing Science Note (93/22), Eindhoven University of Technology.
4. Pollack, R. (1992) Typechecking in pure type systems. Informal Proceedings of the 1992 Workshop on Types for Programs and Proofs, pp. 271-288 of. Bastad, Sweden.
5. Pollack, R. (1994) The theory of LEGO. PhD thesis, University of Edinburgh.
6. van Benthem Jutting, B., McKinna, J. and Pollack, R. (1993) Checking algorithms for pure type systems. Types for Programs and Proofs: Lecture Notes in Computer Science 806, pp. 9-62. Springer-Verlag.