Recursive subtyping revealed

Journal of Functional Programming

Volumn 12, Issue 6, 2002, Pages 511-548

  Gapeyev, Vladimir ^a   Levin, Michael Y ^a   Pierce, Benjamin C ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

RECURSIVE SUBTYPING;

ALGORITHMS; COMPUTER SIMULATION; RECURSIVE FUNCTIONS; SEMANTICS;

COMPUTER PROGRAMMING LANGUAGES;

EID: 0036849162     PISSN: 09567968     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0956796802004318     Document Type: Article

References (27)

1. Abadi, M. and Fiore, M.P. (1996) Syntactic considerations on recursive types. Proceedings 11th Annual IEEE Symposium on Logic in Computer Science, LICS '96, pp. 242-252. IEEE Press.
2. Aczel, P. (1977) An introduction to inductive definitions. In: Barwise, J. (ed.), Handbook of Mathematical Logic, pp. 739-782. Studies in Logic and the Foundations of Mathematics, no. 90. North Holland.
3. Aczel, P. (1988) Non-well-founded sets. Stanford Center for the Study of Language and Information. CSLI Lecture Notes number 14.
4. Amadio, R.M. and Cardelli, L. (1993) Subtyping recursive types. ACM Trans. Programming Languages & Systems, 15(4), 575-631. (Preliminary version in POPL '91, pp. 104-118; also DEC Systems Research Center Research Report number 62, August 1990.).
5. Amadio, R.M. and Cardelli, L. (1993) Subtyping recursive types. ACM Trans. Programming Languages & Systems, 15(4), 575-631. (Preliminary version in POPL '91, pp. 104-118; also DEC Systems Research Center Research Report number 62, August 1990.).
6. Arbib, M. and Manes, E. (1975) Arrows, Structures, and Functors: The categorical imperative. Academic Press.
7. Barwise, J. and Moss, L. (1996) Vicious Circles: On the mathematics of non-wellfounded phenomena. Cambridge University Press.
8. Brandt, M. and Henglein, F. (1997) Coinductive axiomatization of recursive type equality and subtyping. In: Hindley, R. (ed.), Proc. 3rd Int. Conf. on Typed Lambda Calculi and Applications (TLCA): Lecture Notes in Computer Science 1210, pp. 63-81. Nancy, France. Springer-Verlag.
9. Cardone, F. and Coppo, M. (1991) Type inference with recursive types: Syntax and semantics. Information & Computation, 92(1), 48-80.
10. Courcelle, B. (1983) Fundamental properties of infinite trees. Theor. Comput. Sci., 25, 95-169.
11. Crary, K., Harper, R. and Puri, S. (1999) What is a recursive module? Proceedings ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), pp. 50-63.
12. Davey, B.A. and Priestley, H.A. (1990) Introduction to Lattices and Order. Cambridge University Press.
13. Ghelli, G. (1993) Recursive types are not conservative over F≤. In: Bezen, M. and Groote, J.F. (eds.), Proceedings International Conference on Typed Lambda Calculi and Applications (TLCA): Lecture Notes in Computer Science 664, pp. 146-162. Utrecht, The Netherlands. Springer-Verlag.
14. Gordon, A. (1995) A tutorial on co-induction and functional programming. Functional Programming, pp. 78-95. Glasgow, Scotland. Springer-Verlag.
15. Gunter, C.A. (1992) Semantics of Programming Languages: Structures and techniques. MIT Press.
16. Hosoya, H., Vouillon, J. and Pierce, B.C. (2000) Regular expression types for XML. Proceedings International Conference on Functional Programming (ICFP).
17. Huet, G. (1976) Résolution d'equations dans les langages d'ordre 1,2 ...,ω. Thèse de Doctorat d'Etat, Université de Paris 7 (France).
18. Jim, T. and Palsberg, J. (1999) Type inference in systems of recursive types with subtyping. Manuscript.
19. Kozen, D., Palsberg, J. and Schwartzbach, M.I. (1993) Efficient recursive subtyping. ACM Symposium on Principles of Programming Languages (POPL), pp. 419-428.
20. MacQueen, D., Plotkin, G. and Sethi, R. (1986) An ideal model for recursive polymorphic types. Information & Control, 71, 95-130.
21. Milner, R. (1980) A Calculus of Communicating Systems: Lecture Notes in Computer Science 92. Springer-Verlag.
22. Milner, R. and Tofte, M. (1991) Co-induction in relational semantics. Theor. Comput. Sci., 87, 209-220.
23. Mitchell, J.C. (1996) Foundations for Programming Languages. MIT Press.
24. Morris, J.H. (1968) Lambda calculus models of programming languages. Technical Report MIT-LCS//MIT/LCS/TR-57, MIT Laboratory for Computer Science.
25. Park, D. (1981) Concurrency and automata on infinite sequences. In: Deussen, P. (ed.), Proceedings 5th GI-Conference on Theoretical Computer Science: Lecture Notes in Computer Science 104, pp. 167-183. Springer-Verlag.
26. Tarski, A. (1955) A lattice-theoretical fixpoint theorem and its applications. Pacific J. Mathematics, 5, 285-309.
27. Winskel, G. (1993) The Formal Semantics of Programming Languages: An introduction. MIT Press.