Domain-free pure type systems

Journal of Functional Programming

Volumn 10, Issue 5, 2000, Pages 417-452

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

^a INRIA   (France)

^b UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0034368374     PISSN: 09567968     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0956796800003750     Document Type: Article

References (33)

1. Appel, A. (1992) Compiling with Continuations. Cambridge University Press.
2. Bakel, S. van, Liquori, L., Ronchi della Roncha, S. and Urzyczyn, P. (1994) Comparing cubes. In: Nerode, A. and Matiyasevich, Y. N. (eds.), Proceedings of LFCS'94: Lecture Notes in Computer Science, 813, pp. 353-365. Springer-Verlag.
3. Barendregt, H. (1992) Lambda calculi with types. In: Abramsky, S., Gabbay, D. M. and Maibaum, T.S.E. (eds.), Handbook of Logic in Computer Science, Vol. 2, pp. 117-309. Oxford Science Publications.
4. Barthe, G. (1995) Extensions of pure type systems. In: Dezani-Ciancaglini, M. and Plotkin, G. (eds.), Proceedings of TLCA'95: Lecture Notes in Computer Science, 902. Springer-Verlag.
5. Barthe, G., Hatcliff, J. and Sørensen, M. H. (1999) CPS-translation and applications: the cube and beyond. Higher-Order and Symbolic Computation, 12(2), 125-170.
6. Barthe, G., Hatcliff, J. and Sørensen, M.H. (1997) A notion of classical pure type system. In: Brookes, S. and Mislove, M. (eds.), Proceedings of MFPS'97. Electronic Notes in Theoretical Computer Science, 6.
7. Barthe, G. and Sørensen, M. H. (1997) Domain-free Pure Type Systems. In: Adian, S. and Nerode, A. (eds.), Logical Foundations of Computer Science: Lecture Notes in Computer Science, 1234, pp. 9-20. Springer-Verlag.
8. Berardi, S. (1990) Type dependence and constructive mathematics. PhD thesis, University of Torino.
9. Betarte, G. and Tasistro, A. (1998) Extension of Martin-Löf's theory of types with record types and subtyping: motivation, rules and type checking. In: Sambin, G. and Smith, J. (eds.), Twenty-five Years of Constructive Type Theory. Oxford University Press.
10. Church, A. (1940) A formulation of the simple theory of types. J. Symbolic Logic, 5, 56-68.
11. Coquand, T. and Herbelin, H. (1994) A-translation and looping combinators in pure type systems. J. Functional Programming, 4(1), 77-88.
12. Curry, H. (1934) Functionality in combinatory logic. Proceedings of the National Academy of Science USA, 20, 584-590.
13. Curry, H. and Feys, R. (1958) Combinatory Logic. North-Holland.
14. Dezani-Ciancaglini, M. and Plotkin, G. (eds). (1995) Proceedings of TLCA'95: Lecture Notes in Computer Science, 902. Springer-Verlag.
15. Dowek, G. (1993) The undecidability of typability in the Lambda-Pi-Calculus. In: Bezem, M. and Groote, J. F. (eds.), Proceedings of TLCA'93: Lecture Notes in Computer Science, 664, pp. 139-145. Springer-Verlag.
16. Fujita, K.-E. (1999) Type Inference for Domain-Free λ2. Technical Report, Department of Computer Science and Systems Engineering CSSE-5, Kyushu Institute of Technology, 1999.
17. Geuvers, J. H. (1993) Logics and type systems. PhD thesis, University of Nijmegen.
18. 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.
19. Geuvers, H. and Werner, B. (1994) On the Church-Rosser property for expressive type systems and its consequence for their metatheoretic study Proceedings of LICS'94, pp. 320-329. IEEE Press.
20. Giannini, P. and Ronchi Della Rocca, S. (1988) Characterization of typings in polymorphic type discipline. Proceedings of LICS'88, pp. 61-70. IEEE Press.
21. Girard, J.-Y. (1970) Une extension du système de fonctionelles recursives de Gödel et son application aux fondements de l'analyse. In: Fenstad, J. E. (ed.), The 2nd Scandinavian Logical Symposium, pp. 63-92. North-Holland.
22. Girard, J.-Y. (1972) Interprétation fonctionelle et élimination des coupures dans l'arithmétique d'ordre supérieur. PhD thesis, Université Paris VII.
23. Hurkens, A. (1995) A simplification of Girard's Paradox. In: Dezani-Ciancaglini, M. and Plotkin, G. (eds.), Proceedings of TLCA'95: Lecture Notes in Computer Science, 902. Springer-Verlag.
24. Klop, J.W., van Oostrom, V. and van Raamsdonk, F. (1993) Combinatory reduction systems: Introduction and survey. Theoretical Computer Science, 121(1-2), 279-308.
25. Leivant, D. (1983) Polymorphic type inference. Proceedings of POPL'83, pp. 88-98. ACM Press.
26. Luo, Z. (1994) Computation and Reasoning: A Type Theory for Computer Science. International Series of Monographs on Computer Science, Oxford University Press.
27. Magnusson, L. (1994) 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.
28. Pfenning, F. (1994) Elf: a meta-language for deductive systems. In: Bundy, A. (ed.), Proceedings of CADE-12: Lecture Notes in Artificial Intelligence, 814, pp. 811-815. Springer-Verlag.
29. Reynolds, J. (1974) Towards a theory of type structure. In: Robinet, B. (ed.), Proceedings of the programming symposium: Lecture Notes in Computer Science, 19, pp. 408-425. Springer-Verlag.
30. Schubert, A. (1998) Second-order unification and type inference for Church-style polymorphism. Proceedings of POPL'98, pp. 279-288. ACM Press.
31. Sørensen, M. H. (1997) Strong normalization from weak normalization in typed λ-calculi. Information & Computation, 133(1), 35-71.
32. Tasistro, A. (1997) Substitution, Record Types and Subtyping in Type Theory, with applications to the theory of programming. PhD thesis, Department of Computer Science, Chalmers Tekniska Högskola.
33. Terlouw, J. (1989) Een nadere bewijstheoretische analyse van GSTT's. Manuscript (in Dutch).