Coinductive Axiomatization of Recursive Type Equality and Subtyping

Fundamenta Informaticae

Volumn 33, Issue 4, 1998, Pages 309-338

  Brandt, Michael ^a   Henglein, Fritz ^b  

^a Prolog Development Center   (Denmark)

^b UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

Axiomatization; Coercion; Coinduction; Fixpoint; Inference rule; Inference system; Operational interpretation; Recursive type; Subtyping; Type equality

Indexed keywords

EID: 0000704141     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: 10.3233/fi-1998-33401     Document Type: Article

References (42)

1. Martín Abadi. Personal communication, September 1996. ACM State of the Art Summer School on Functional and Object-Oriented Programming in Sobotka, Poland, September 8-14, 1996.
2. Samson Abramsky. The lazy lambda calculus. In D. Turner, editor, Research Topics in Functional Programming, pages 65-117. Addison-Wesley, 1990. Also available by anonymous ftp from theory.doc.ic.ac.uk.
3. R. Amadio and L. Cardelli. Subtyping recursive types. In Proc. 18th Annual ACM Symposium on Principles of Programming Languages (POPL), Orlando, Florida, pages 104-118. ACM Press, January 1991.
4. Roberto M. Amadio and Luca Cardelli. Subtyping recursive types. ACM Transactions on Programming Languages and Systems (TOPLAS), 15(4):575-631, September 1993.
5. Peter Aczel. An Introduction to Inductive Definitions, chapter C.7. North-Holland, 1977.
6. Martín Abadi and Marcelo P. Fiore. Syntactic considerations on recursive types. In Proc. 1996 IEEE 11th Annual Symp. on Logic in Computer Science (LICS), New Brunswick, New Jersey. IEEE Computer Society Press, June 1996.
7. Zena M. Ariola and Jan Willem Klop. Equational term graph rewriting. Technical Report CIS-TR-95-16, University of Oregon, 1995. To appear in Acta Informatica.
8. A. Aho, R. Sethi, and J. Ullman. Compilers: Principles, Techniques, and Tools. Addison Wesley, 1986.
9. Michael Brandt. Recursive subtyping: Axiomatizations and computational interpretations. Master's thesis, DIKU, University of Copenhagen, Universitetsparken 1, DK-2100 Copenhagen, Denmark, April 1997. TOPPS Technical Report D-352; http://www.diku.dk/research-groups/topps/Bibliography.html.
10. V. Breazu-Tannen, T. Coquand, C. Gunter, and A. Scedrov. Inheritance as implicit coercion. Information and Computation, 93(1):172-221, July 1991. Presented at LICS '89.
11. Ch. Ben-Yelles. Type Assignment in the Lambda-Calculus: Syntax and Semantics. PhD thesis, Department of Pure Mathematics, University College of Swansea, September 1979. Author's current address: Informatique, I.U.T. Valence, B.P. 29, 26901 Valence, cedex 9, France.
12. Luca Cardelli. Algorithm for subtyping recursive types (in Modula-3). URL: http://research.microsoft.com/research/cambridge/luca/Notes/RecSub.txt, 1993. Originally implemented in Quest and released in 1990.
13. F. Cardone and M. Coppo. Type inference with recursive types: Syntax and semantics. Information and Computation, 92(1):48-80, May 1991.
14. P. Curien and G. Ghelli. Coherence of subsumption. In A. Arnold, editor, Proc. 15th Coll. on Trees in Algebra and Programming (CAAP), Copenhagen, Denmark, volume 431 of Lecture Notes in Computer Science (LNCS), pages 132-146. Springer, May 1990.
15. Thierry Coquand. Infinite objects in type theory. In Henk Barendregt and Tobias Nipkow, editors, Proc. Int'l Workshop on Types for Proofs and Programs (TYPES), volume 806 of Lecture Notes in Computer Science (LNCS), pages 62-78. Springer-Verlag, May 1993.
16. B. Courcelle. Fundamental properties of infinite trees. Theoretical Computer Science, 25:95-169, 1983.
17. Marcelo P. Fiore. A coinduction principle for recursive data types based on bisimulation. Information and Computation, 127:186-198, 1996. Conference version: Proc. 8th Annual IEEE Symp. on Logic in Computer Science (LICS), 1993, pp. 110-119.
18. Marcelo P. Fiore. A coinduction principle for recursive data types based on bisimulation. Information and Computation, 127:186-198, 1996. Conference version: Proc. 8th Annual IEEE Symp. on Logic in Computer Science (LICS), 1993, pp. 110-119.
19. M.J. Fischer and L.E. Ladner. Propositional modal logic of programs. In Proc. 9th Symp. on Theory of Computing (STOC), pages 286-294. ACM, ACM Press, 1977.
20. Andrew Gordon. Bisimilarity as a theory of functional programming. In Proceedings of the Eleventh Conference on the Mathematical Foundations of Programming Semantics (MFPS), New Orleans, March 29 to April 1, 1995, Elsevier Electronic Notes in Theoretical Computer Science, volume 1, 1995.
21. Carl A. Gunter. Semantics of programming languages: structures and techniques. Foundations of Computing. The MIT Press, 1992. ISBN 0-262-07143-6.
22. Fritz Henglein. Dynamic typing: Syntax and proof theory. Science of Computer Programming (SCP), 22(3): 197-230, 1994.
23. R. Hindley. The principal type-scheme of an object in combinatory logic. Trans. Amer. Math. Soc., 146:29-60, December 1969.
24. J. Hopcroft and R. Karp. An algorithm for testing the equivalence of finite automata. Technical Report TR-71-114, Dept. of Computer Science, Cornell U., 1971.
25. Furio Honsell and Marina Lenisa. Final semantics for untyped lambda-calculus. In Mariangiola Dezani-Ciancaglini and Gordon Plotkin, editors, Proc. Int'l Conf. on Typed Lambda Calculi and Applications (TLCA), volume 902 of Lecture Notes in Computer Science (LNCS), pages 249-265. Springer-Verlag, 1995.
26. C.A.R. Hoare. Procedures and parameters: An axiomatic approach. In Erwin Engeler, editor, Symposium on Semantics of Algorithmic Languages, volume 188 of Lecture Notes in Mathematics (LNM), pages 102-116. Springer-Verlag, October 1970.
27. G. Huet. Résolution d'equations dans des langages d'ordre 1, 2, . . . , omega (thèse de Doctorat d'Etat). PhD thesis, Univ. Paris VII, September 1976.
28. Gérard Huet. Regular böhm trees. Draft, November 1996.
29. Jesper Jørgensen. A Calculus for Boxing Analysis of Polymorphically Typed Languages. PhD thesis, DIKU, University of Copenhagen, October 1995. DIKU Technical Report 96/28 and TOPPS Technical Report D-318; URL: http://www.diku.dk/research-groups/topps/Bibliography.html.
30. Dexter Kozen. Results on the propositional μ-calculus. In Mogens Nielsen and Erik Meineke Schmidt, editors, Proc. 9th Int'l Coll. on Automata, Languages and Programming (ICALP), Aarhus, Denmark, volume 140 of Lecture Notes in Computer Science (LNCS), pages 348-359. Springer-Verlag, July 1982.
31. Dexter Kozen. A completeness theorem for Kleene algebras and the algebra of regular events. Information and Computation, 110(2):366-390, May 1994.
32. Dexter Kozen, Jens Palsberg, and Michael Schwartzbach. Efficient recursive subtyping. Mathematical Structures in Computer Science (MSCS), 5(1), 1995. Conference version presented at the 20th Annual ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages (POPL), 1993.
33. Dexter Kozen, Jens Palsberg, and Michael Schwartzbach. Efficient recursive subtyping. Mathematical Structures in Computer Science (MSCS), 5(1), 1995. Conference version presented at the 20th Annual ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages (POPL), 1993.
34. Marina Lenisa. Final semantics for a higher order concurrent language. In H. Kirchner, editor, Proc. Coll. on Trees in Algebra and Programming (CAAP), volume 1059 of Lecture Notes in Computer Science (LNCS), pages 102-118. Springer-Verlag, 1996.
35. Robin Milner. Fully abstract models of typed λ-calculi. Theoretical Computer Science (TCS), 4(1):1-22, February 1977.
36. Robin Milner. A complete inference system for a class of regular behaviours. Journal of Computer and System Sciences (JCSS), 28:439-466, 1984.
37. J. Morris. Lambda-Calculus Models of Programming Languages. PhD thesis, MIT, 1968.
38. Robin Milner and Mads Tofte. Co-induction in relational semantics. Theoretical Computer Science, 87(1):209-220, 1991. Note.
39. Hanne Riis Nielson. A Hoare-like proof system for total correctness of nested recursive procedures. In M. Arató, I. Kátai, and L. Varga, editors, Proc. 4th Hungarian Computer Science Conference, pages 227-239, 1985.
40. J. Rehof. Polymorphic dynamic typing - aspects of proof theory and inference. Master's thesis, DIKU, University of Copenhagen, March 1995.
41. A. Salomaa. Two complete axiom systems for the algebra of regular events. Journal of the Association for Computing Machinery (JACM), 13(1):158-169, 1966.
42. Stefan Sokolowski. Total correctness for procedures. In J. Gruska, editor, Proc. 6th Symp. on Mathematical Foundations of Computer Science (MFCS), Tatranska Lomnica, Poland, volume 53 of Lecture Notes in Computer Science (LNCS), pages 475-483. Springer-Verlag, September 1977.