Domain-free pure type systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1234, Issue , 1997, Pages 9-20

  Barthe, Gilles ^a   Sørensen, Morten Heine ^b  

^a CWI   (Netherlands)

^b UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING;

DOMAIN FREE; FEATURE DOMAIN; LAMBDA ABSTRACTION; PURE TYPE SYSTEMS;

COMPUTER PROGRAMMING LANGUAGES;

EID: 0002746635     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63045-7_2     Document Type: Conference Paper

References (16)

1. S. van Bakel, L. Liquori, S. Ronchi della Roncha, and P. Urzyczyn. Comparing cubes. In A. Nerode and Y.N. Matiyasevich, editors, Proceedings of LFCS’44, volume 813 of Lecture Notes in Computer Science, pages 353-365. Springer-Verlag, 1994.
2. An extended version is to appear in Annals of Pure and Applied Logic.
3. H. Barendregt. Introduction to Generalised Type Systems. J. Functional Programming, 1(2):125-154, April 1991.
4. H. Barendregt. Lambda calculi with types. In S. Abramsky, D. M. Gabbay, and T.S.E. Maibaum, editors, Handbook of Logic in Computer Science, pages 117-309. Oxford Science Publications, 1992. Volume 2.
5. G. Barthe, J. Hatclifi, and M.H. Sørensen. CPS-translation and applications: the cube and beyond. In O. Danvy, editor, Proc. of the 2nd ACM SIGPLAN Workshop on Continuations, number NS-96-13 in BRICS Notes, pages 4:1-31, 1996.
6. G. Barthe, J. Hatclifi, and M.H. Sørensen. Classical pure type systems. In Proceedings of MFPS’97, Electronic Notes in Theoretical Computer Science, 1997.
7. A. Church. A formulation of the simple theory of types. Journal of Symbolic Logic, 5:56-68, 1940.
8. H. Curry. Functionality in combinatory logic. Proceedings of the National Academy of Science USA, 20:584-590, 1934.
9. H. Geuvers. Logics and type systems. PhD thesis, University of Nijmegen, 1993.
10. H. Geuvers and M.-J. Nederhof. A modular proof of strong normalisation for the Calculus of Constructions. Journal of Functional Programming, 1:155-189, 1991.
11. H. Geuvers and B. Wemer. On the Church-Rosser property for expressive type systems and its consequence for their metatheoretic study. In Proceedings of LICS’94, pages 320-329. IEEE Computer Society Press, 1994.
12. P. Giannini and S. Ronchi Della Rocca. Characterization of typings in polymorphic type discipline. In Proceedings of LICS’88, pages 61-70. IEEE Computer Society Press, 1988.
13. D. Leivant. Polymorphic type inference. In Proceedings of POPL’83, pages 88-98. ACM Press, 1983.
14. L. Magnusson. The implementation of ALF: a proof editor based on Martin-Löf’s monomorphic type theory with explicit substitution. PhD thesis, Department of Computer Science, Chalmers University, 1994.
15. P. Severi. Normalisation in lambda calculus and its relation to type inference. PhD thesis, Department of Computer Science, Technical University of Eindhoven, 1996.
16. M.H. Sørensen. Strong normalization from weak normalization in typed λ-calculi. Information and Computation, 133(1):35-71, 1997.