Advertisement

Subtyping Recursive Games

  • Juliusz Chroboczek
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2044)

Abstract

Using methods drawn from Game Semantics, we build a sound and computationally adequate model of a simple calculus that includes both subtyping and recursive types. Our model solves recursive type equations up to equality, and is shown to validate a subtyping rule for recursive types proposed by Amadio and Cardelli.

Keywords

Operational Semantic Initial Component Ultrametric Space Denotational Semantic Closed Term 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    S. Abramsky. The lazy Lambda calculus. In D. Turner, editor, Research Topics in Functional Programming. Addison Wesley, 1990.Google Scholar
  2. 2.
    S. Abramsky. Semantics of interaction. In P. Dybjer and A. M. Pitts, editors, Semantics and Logics of Computation. Cambridge University Press, 1997.Google Scholar
  3. 3.
    S. Abramsky, R. Jagadeesan, and P. Malacaria. Full abstraction for PCF (extended abstract). In Proc. TACS’94, volume 789 of Lecture Notes in Computer Science, pages 1–15. Springer-Verlag, 1994.Google Scholar
  4. 4.
    R. M. Amadio and L. Cardelli. Subtyping recursive types. ACM Transactions on Programming Languages and Systems, 15(4):575–631, 1993.CrossRefGoogle Scholar
  5. 5.
    P. Baillot, V. Danos, T. Ehrhard, and L. Regnier. Believe it or not, AJM’s games model is a model of classical linear logic. In Proceedings of the Twelfth International Symposium on Logic in Computer Science. IEEE Computer Society Press, 1997.Google Scholar
  6. 6.
    R. Cartwright, P.-L. Curien, and M. Felleisen. Fully abstract models of observably sequential languages. Information and Computation, 111(2):297–401, 1994.zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    J. Chroboczek. Game Semantics and Subtyping In Proceedings of the Fifteenth Annual IEEE Symposium on Logic in Computer Science, Santa Barbara, California, June 2000.Google Scholar
  8. 8.
    J. Chroboczek. Game Semantics and Subtyping. Forthcoming PhD thesis, University of Edinburgh, 2000.Google Scholar
  9. 9.
    R. Harmer. Games and Full Abstraction for Nondeterministic Languages. PhD thesis, Imperial College, University of London, 1999.Google Scholar
  10. 10.
    J. M. E. Hyland and C.-H. L. Ong. On full abstraction for PCF: I, II and III. 1994.Google Scholar
  11. 11.
    G. McCusker. Games and Full Abstraction for a Functional Metalanguage with Recursive Types. PhD thesis, Imperial College, University of London, 1996.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Juliusz Chroboczek
    • 1
  1. 1.Université de Paris VIIParisFrance

Personalised recommendations