Subtyping recursion and parametric polymorphism in kernel fun

Information and Computation

Volumn 198, Issue 2, 2005, Pages 71-147

  Colazzo, Dario ^a   Ghelli, Giorgio ^a  

^a UNIVERSITY OF PISA   (Italy)

Author keywords

Kernel Fun; Recursive types; Subtyping; Type theory and type systems

Indexed keywords

ALGORITHMS; COMPUTER PROGRAMMING LANGUAGES; DATA STRUCTURES; FUNCTIONS; OPEN SYSTEMS; OPTIMIZATION; THEOREM PROVING; TREES (MATHEMATICS);

KERNEL FUN; RECURSIVE TYPES; SUBTYPING; TYPE THEORY AND TYPE SYSTEMS;

RECURSIVE FUNCTIONS;

EID: 17644382291     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ic.2004.11.003     Document Type: Article

References (37)

1. M. Abadi, and L. Cardelli A theory of objects 1996 Springer-Verlag Berlin
2. M. Abadi, M.P. Fiore, Syntactic considerations on recursive types, in: Proceedings of IEEE Symposium on Logic in Computer Science, 1996, pp. 242-252
3. A. Albano, L. Cardelli, and R. Orsini Galileo: a strongly typed, interactive conceptual language ACM Transactions on Database Systems 10 2 1985 230 260
4. A. Albano, G. Ghelli, and R. Orsini Fibonacci: a programming language for object databases VLDB Journal 4 3 1995 403 444
5. R.M. Amadio, and L. Cardelli Subtyping recursive types ACM Transactions on Programming Languages and Systems 15 4 1993 575 631
6. A. Arnold, and M. Nivat Metric interpretations of infinite trees and semantics of non deterministic recursive programs Theoretical Computer Science 11 2 1980 181 205
7. N. Benton, A. Kennedy, G. Russel, Compiling standard ML to java bytecodes, in: Proceedings of ACM SIGPLAN International Conference on Functional Programming, 1998, pp. 129-140
8. M. Brandt, F. Henglein, Coinductive axiomatization of recursive type equality and subtyping, in: Proceedings of Typed Lambda Calculi and Application, LNCS, 1997, pp. 63-81
9. K.B. Bruce, L. Cardelli, B.C. Pierce, Comparing object encodings, in: Proceedings of Theoretical Aspects of Computer Software, September 1996, pp. 415-438
10. L. Cardelli, and P. Wegner On understanding types, data abstraction, and polymorphism Computing Surveys 17 4 1985 471 522
11. L. Cardelli, Notes about F <: ω, October 1990, Unpublished manuscript
12. L. Cardelli, and G. Longo A semantic basis for Quest Journal of Functional Programming 1 4 1991 417 458
13. L. Cardelli, S. Martini, J.C. Mitchell, A. Scedrov, An extension of system F with subtyping, Information and Computation 109(1-2) (1994) 4-56, Preliminary version in TACS '91 (Sendai, Japan, pp. 750-770
14. L. Cardelli, S. Martini, J.C. Mitchell, A. Scedrov, An extension of system F with subtyping, Information and Computation 109(1-2) (1994) 4-56, Preliminary version in TACS '91 (Sendai, Japan, pp. 750-770)
15. F. Cardone, Relational semantics for recursive types and bounded quantification, in: Proceedings of International Colloquium on Automata, Languages, and Programmng, LNCS, 1989, pp. 164-178
16. D. Colazzo, G. Ghelli, Subtyping recursive types in kernel Fun, in: Proceedings of IEEE Symposium on Logic in Computer Science, 1999, pp. 137-146
17. J.O. Coplien, Pattern Languages of Program Design, Addison-Wesley, Reading, MA
18. ≤ Mathematical Structures in Computer Science 2 1 1992 55 91
19. S. Danforth, and C. Tomlinson Type theories and object-oriented programming ACM Computing Surveys 20 1 1988 29 72
20. K. Fisher, and J. Mitchell The development of type systems for object-oriented languages Theory and Practice of Object Systems 1 3 1996 189 220
21. V. Gapejev, M.Y. Levin, B.C. Pierce, Recursive subtyping revealed: functional pearl, in: Proceedings of ACM SIGPLAN International Conference on Functional Programming, 2000, 1995, pp. 221-231
22. G. Ghelli, Modelling features of object-oriented languages in second order functional languages with subtypes, in: REX Workshop, 1990, pp. 311-340
23. G. Ghelli, Complexity of kernel Fun subtype checking, in: Proceedings of ACM SIGPLAN International Conference on Functional Programming, 1996, pp. 134-145
24. ≤, in: Proceedings of Typed Lambda Calculi and Application, LNCS, 1993, pp. 146-162
25. G. Ghelli, Proof Theoretic Studies about a Minimal Type System Integrating Inclusion and Parametric Polymorphism, PhD thesis, Dipartimento di Informatica, Università di Pisa, March 1990, Tech. Rep. TD-6/90
26. ≤ type checking Theoretical Computer Science 139 1-2 1995 131 162
27. M.H. Gordon, R.M. Milner, C. Wadsworth, Edinburgh LCF, Volume 78 of LNCS, Springer-Verlag, Berlin, 1979
28. C.A. Gunter Semantics of programming languages: Structures and techniques, foundations of computing 1992 The MIT Press Cambridge
29. C.A. Gunter, and J.C. Mitchell Theoretical aspects of object-oriented programming: Types, semantics, and language design 1994 The MIT Press Cambridge
30. A.S.A. Jeffrey, A symbolic labelled transition system for coinductive subtyping of f-mu-sub types, in: Proceedings of IEEE Symposium on Logic in Computer Science, 2001, pp. 323-333
31. D. Katiyar, S. Sankar, Completely bounded quantification is decidable, in: Proceedings of ACM SIGPLAN Workshop on ML and its Applications, 1992
32. A. Kennedy, personal communication, 1998
33. D. Kozen, J. Palsberg, M.I. Schwartzbach, Efficient recursive subtyping, in: Proceedings of ACM Symposium on Principles of Programming Languages, 1993, pp. 419-428
34. G. Nelson Systems programming in Modula-3 1991 Prentice Hall London
35. B.C. Pierce Bounded quantification is undecidable Information and Computation 112 1 1994 131 165
36. A. Tarski A lattice-theoretical fixpoint theorem and its applications Pacific Journal of Mathematics 5 1955 285 309
37. J. Tiuryn, P. Urzyczyn, The subtyping problem for second-order types is undecidable, in: Proceedings of IEEE Symposium on Logic in Computer Science, pp. 74-85, 1996