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. © Springer-Verlag Berlin Heidelberg 2001.
Cite
CITATION STYLE
APA
Chroboczek, J. (2001). Subtyping recursive games. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2044 LNCS, pp. 61–75). Springer Verlag. https://doi.org/10.1007/3-540-45413-6_9
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free