Coinductive axiomatization of recursive type equality and subtyping

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1210, Issue , 1997, Pages 63-81

  Brandt, Michael ^a   Henglein, Fritz ^a  

^a UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BIOMINERALIZATION;

AXIOMATIZATION; BISIMULATIONS; FORMAL DERIVATION; INFERENCE SYSTEMS; OPERATIONAL INTERPRETATION; RECURSIVE TYPES; SOUND AND COMPLETE; TYPE EQUALITY;

PATHOLOGY;

EID: 84958972841     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-62688-3_29     Document Type: Conference Paper

References (29)

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 A CM 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. Martín Abadi and Marcelo P. Fiore. Syntactic considerations on recursive types. In Proc. 1996 IEEE 11th Annual Syrup. on Logic in Computer Science (LICS), New Brunswick, New Jersey. IEEE Computer Society Press, June 1996.
6. Zena M. Ariola and Jan Willem Klop. Equational term graph rewriting. Technical report, University of Oregon, 1995. To appear in Acta Informatica.
7. V. Breazu-Tarmen, T. Coquand, C. Gunter, and A. Scedrov. Inheritance as implicit coercion. Information and Computation, 93(1):172-221, July 1991. Presented at LICS '89.
8. Ch. Ben-Yelles. Type assignment in the lambda-calculus: Syntax and semantics. Technical report, Department of Pure Mathematics, University College of Swansea, September 1979. Author's current address: Univérsite des Sciences et dé la Teclmologie Houari Boumediene, Institut D'Informatique, El-Alia B.P. No. 32, Alger, Algeria.
9. Luca Cardelli. Algorithm for subtyping recursive types (in Modula-3). http://www.research.digital.com/SRC/personal/Luca_Cardel/Notes/RecSub.txt, 1993. Originally implemented in Quest and released in 1990.
10. F. Cardone and M. Coppo. Type inference with recursive types: Syntax and semantics. Information and Computation, 92(1):48-80, May 1991.
11. P. Curien and G. Ghelli. Coherence of subsumption. In A. Arnold, editor, Proc. 15th Coll. on Trees in Algebra and Programming, Copenhagen, Denmark, pages 132-146. Springer, May 1990.
12. Thierry Coquand. Infinite objects in type theory. In Proc. Int'l Workshop on Types for Proofs and Programs, Lecture Notes in Computer Science (LNCS), pages 62-78. Springer-Verlag, 1993.
13. B. Courcelle. Fundamental properties of infinite trees. Theoretical Computer Science, 25:95-169, 1983.
14. 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.
15. Fritz Henglein. Dynamic typing: Syntax and proof theory. Science of Computer Programming (SCP), 22(3):197-230, 1994
16. R. Hindley. The principal type-scheme of an object in combinatory logic. Trans. Amer. Math. Soc., 146:29-60, December 1969.
17. Furio Honsell and Marina Lenisa. Final semantics for untyped lambdacalculus. In 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.
18. Jesper Jørgensen. A Calculus for Boxing Analysis of Polymorphically Typed Languages. PhD thesis, DIKU, University of Copenhagen, October 1995.
19. Dexter Kozen, Jens Palsberg, and Michael Schwartzbach. Efficient recursive subtyping. In Proc. 20th Annual ACM SIGPLAN-SIGACT Symp. On Principles of Programming Languages, pages 419-428. ACM, ACM Press, January 1993.
20. Dexter Kozen, Jens Palsberg, and Michael Schwartzbach. Efficient recursive subtyping. Mathematical Structures in Computer Science (MSCS), 5(1), 1995.
21. 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.
22. Robin Milner. Fully abstract models of typed lambda-calculi. Theoretical Computer Science (TCS), 4(1):1-22, February 1977.
23. Robin Milner. A complete inference system for a class of regular behaviours. Journal of Computer and System Sciences (JCSS), 28:439-466, 1984.
24. J. Morris. Lambda-Calculus Models of Programming Languages. PhD thesis, MIT, 1968.
25. Robin Milner and Mads Torte. Co-induction in relational semantics. Theoretical Computer Science, 87(1):209-220, 1991. Note.
26. Andrew M. Pitts. A co-inducion principle for recursively defined domains. Theoretical Computer Science (TCS), 124:195-219, 1994.
27. Andrew M. Pitts. Relational properties of domains. Information and Computation, 127(2):66-90, June 1996.
28. J. Rehof. Polymorphic dynamic typing -- aspects of proof theory and inference. Master's thesis, DIKU, University of Copenhagen, March 1995.
29. 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.