Subtyping recursive games

Authors:
Juliusz Chroboczek
Affiliations:
Université de Paris VII, Paris, France
Venue:
TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
Year:
2001

Citing 6
Cited 1

The lazy lambda calculus

Research topics in functional programming
Subtyping recursive types

ACM Transactions on Programming Languages and Systems (TOPLAS)
Fully abstract semantics for observably sequential languages

Information and Computation
Full Abstraction for PCF

TACS '94 Proceedings of the International Conference on Theoretical Aspects of Computer Software
Believe it or not, AJM's games model is a model of classical linear logic

LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Game Semantics and Subtyping

LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science

Semantic types: a fresh look at the ideal model for types

Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages

Quantified Score

Hi-index	0.00

Visualization

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.