Subtyping Recursive Games
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.
KeywordsOperational Semantic Initial Component Ultrametric Space Denotational Semantic Closed Term
Unable to display preview. Download preview PDF.
- 1.S. Abramsky. The lazy Lambda calculus. In D. Turner, editor, Research Topics in Functional Programming. Addison Wesley, 1990.Google Scholar
- 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.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
- 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
- 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.J. Chroboczek. Game Semantics and Subtyping. Forthcoming PhD thesis, University of Edinburgh, 2000.Google Scholar
- 9.R. Harmer. Games and Full Abstraction for Nondeterministic Languages. PhD thesis, Imperial College, University of London, 1999.Google Scholar
- 10.J. M. E. Hyland and C.-H. L. Ong. On full abstraction for PCF: I, II and III. 1994.Google Scholar
- 11.G. McCusker. Games and Full Abstraction for a Functional Metalanguage with Recursive Types. PhD thesis, Imperial College, University of London, 1996.Google Scholar