Type-checking injective pure type systems

Journal of Functional Programming

Volumn 9, Issue 6, 1999, Pages 675-698

  Barthe, Gilles ^a  

^a INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0033263688     PISSN: 09567968     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0956796899003573     Document Type: Article

References (20)

1. Barendregt, H. (1991) Introduction to generalised type systems. J. Functional Programming 1(2), 125-154.
2. Barendregt, H. (1992) Lambda calculi with types. In: S. Abramsky, D. Gabbay and T. Maibaum, editors, Handbook of Logic in Computer Science, pp. 117-309. Oxford Science.
3. Barthe, G. (1998) The semi-full closure of Pure Type Systems. In: Brim, L., Gruska, J. and Zlatuska, J., editors, Proceedings of MFCS'98: Lecture Notes in Computer Science 1450, pp. 316-325. Springer-Verlag.
4. Barthe, G., Hatcliff, J. and Sorensen, M. H. B. (1998) An induction principle for Pure Type Systems. Manuscript.
5. Benthem Jutting, L. S. van (1993) Typing in pure type systems. Information & Computation 105(1), 30-41.
6. Benthem Jutting, L. S. van, McKinna, J. and Pollack, R. (1994) Checking algorithms for pure type systems. In: Barendregt, H. and Nipkow, T. editors, Proceedings of TYPES'93: Lecture Notes in Computer Science 806, pp. 19-61. Springer-Verlag.
7. Berardi, S. (1990) Type dependence and Constructive Mathematics. PhD thesis, University of Torino.
8. Coquand, T. and Herbelin, H. (1994) A-translation and looping combinators in pure type systems. J. Functional Programming 4(1), 77-88.
9. Geuvers, J. H. (1993) Logics and type systems. PhD thesis, University of Nijmegen.
10. Geuvers, J. H. and Nederhof, M. J. (1991) A Modular Proof of Strong Normalization for the Calculus of Constructions. J. Functional Programming 1(2), 155-189.
11. Harper, R. and Mitchell, J. C. (1993) On the type structure of Standard ML. ACM Trans. Programming Languages and Systems, 15(2), 211-252.
12. Peyton Jones, S. and Meijer, E. (1997) Henk: a typed intermediate language. Proceedings of the ACM Workshop on Types in Compilation.
13. Poll, E. (1993) A typechecker for bijective pure type systems. Technical Report CSN93/22, Technical University of Eindhoven.
14. Poll, E. (1998) Theoretical pearl: Expansion postponement for normalizing pure type systems. J. Functional Programming 8(10), 89-96.
15. Pollack, R. (1992) Typechecking in pure type systems. In: B. Nordström, editor, Informal Proceedings of Logical Frameworks'92, pp. 271-288.
16. Pollack, R. (1994) The Theory of LEGO: A Proof Checker for the Extended Calculus of Constructions. PhD thesis, University of Edinburgh.
17. Pollack, R. (1995) A verified type-checker. In: Dezani-Ciancaglini, M. and Plotkin, G., editors, Proceedings of TLCA'95: Lecture Notes in Computer Science 902, pp. 365-380 Springer-Verlag.
18. Severi, P. (1996) Normalisation in lambda calculus and its relation to type inference. PhD thesis, Technical University of Eindhoven.
19. Severi, P. (1998) Type inference for pure type systems. Information & Computation 143(1), 1-23.
20. Terlouw, J. (1989) Een nadere bewijstheoretische analyse van GSTT's. Manuscript (in Dutch).