Comparing cubes of typed and type assignment systems

Annals of Pure and Applied Logic

Volumn 86, Issue 3, 1997, Pages 267-303

  Van Bakel, Steffen ^a   Liquori, Luigi ^a   Ronchi Della Rocca, Simona ^a   Urzyczyn, Pawel ^b  

^a UNIVERSITY OF TURIN   (Italy)

^b UNIVERSITY OF WARSAW   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031584448     PISSN: 01680072     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0168-0072(96)00036-X     Document Type: Article

References (21)

1. [1] H. Barendregt, M. Coppo, M. Dezani-Ciancaglini, A filter lambda model and the completeness of type assignment, J. Symbolic Logic 48 (4) (1983) 931-940.
2. [2] H.P. Barendregt, Introduction to generalised type systems, J. Functional Programming 1 (2) (1991) 125-154.
3. [3] H.P. Barendregt, Lambda calculi with types, in: S. Abramsky, Dov.M. Gabbay, T.S.E. Maibaum (Eds.), Handbook of Logic in Computer Science, vol. 2, Clarendon Press, Oxford, 1992, ch. 1, pp. 118-310.
4. [4] C.B. Ben-Yelles, g-Stratification is Equivalent to f-Stratification, Z. Math. Logik. Grundlag. Math. 27 (1981) 141-150.
5. [5] S. Berardi, Towards a mathematical analysis of type dependence in Coquand-Huet calculus of constructions and the other systems in Barendregt's cube, Technical report, Department of Computer Science, CMU, and Dipartimento di Matematica, Torino, 1988.
6. [6] T. Coquand, Metamathematical investigations of a calculus of constructions, in: P. Odifreddi (Ed.), Logic and Computer Science, Academic press, New York, 1991, pp. 91-122.
7. [7] T. Coquand, G. Huet, The calculus of constructions, Inform. and Comput. 76 (2,3) (1988) 95-120.
8. [8] H.B. Curry, Functionality in combinatory logic, in: Proc. Natl. Acad. Sci. U.S.A., 20 (1934) 584-590.
9. [9] G. Dowek, The undecidability of typability in the lambda-pi-calculus, in: M. Bezem, J.F. Groote (Eds.), Proc. of TLCA '93. Internat. Conf. on Typed Lambda Calculi and Applications, Utrecht, The Netherlands, Lecture Notes in Computer Science, vol. 664, Springer, Berlin, 1993, pp. 139-145.
10. [10] H. Geuvers, M. Nederhof, Modular proof of strong normalization for the calculus of constructions, J. Functional Programming 1 (2) (1991) 155-189.
11. [11] H. Geuvers, B. Werner, On the Church-Rosser property for expressive type systems and its consequences for their metatheoretic study, in: Proc. Annual IEEE Symp. on Logic in Computer Science (1994) 320-329.
12. [12] P. Giannini, F. Honsell, S. Ronchi della Rocca, Type inference: some results, some problems, Fund. Inform. 19 (1,2) (1993) 87-126.
13. [13] P. Giannini, S. Ronchi della Rocca, Characterization of typings in polymorphic type discipline, in: Proc. 3rd Annual IEEE Symp. on Logic in Computer Science, 1988, pp. 61-70.
14. [14] J.Y. Girard, The system F of variable types, Fifteen years later, Theoret. Comput. Sci. 45 (1986) 159-192.
15. [15] J.W. Klop, Combinatory Reduction Systems, Ph.D. thesis, Department of Computer Science, Rijksuniversiteit Utrecht, 1980.
16. [16] D. Leivant, Polymorphic type inference, in: Proc. 10th ACM Symp. on Principles of Programming Languages, Austin, Texas, 1983, pp. 88-98.
17. [17] R. Milner, A theory of type polymorphism in programming, J. Comput. System Sci. 17 (1978) 348-375.
18. ω's programs from proofs in the calculus of constructions, in: Proc. 16th Annual ACM Symp. on Principles of Programming Languages, Austin, Texas, 1989, ACM, New York.
19. [19] J.C. Reynolds, Towards a theory of type structures, in: B. Robinet (Ed.), Proc. Programming Symp. Paris, France. Lecture Notes in Computer Science, vol. 19, Springer, Berlin, 1974, pp. 408-425.
20. [20] J.P. Seldin, Progress report on generalised functionality, Ann. Math. Logic 17 (1979) 29-59.
21. [21] S. van Bakel, L. Liquori, S. Ronchi della Rocca, P. Urzyczyn. Comparing cubes, in: A. Nerode and Yu.V. Matiyasevich (Eds.) Proc. LFCS '94, 3rd Internat. Symp. on Logical Foundations of Computer Science, St. Petersburg, Russia, Lecture Notes in Computer Science, vol. 813, Springer, Berlin, 1994 pp. 353-365.