Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

16

TLCA
2001
Springer

favoriteEmaildiscussreport

122views Theoretical Computer Science» more TLCA 2001»

Subtyping Recursive Games

13 years 9 months ago

Subtyping Recursive Games

Download www.pps.jussieu.fr

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.

Juliusz Chroboczek

Real-time Traffic

Recursive Type Equations | Recursive Types | Subtyping | Theoretical Computer Science | TLCA 2001 |

claim paper

Related Content

» Subtyping Recursive Types in Kernel Fun

» Constraint Automata and the Complexity of Recursive Subtype Entailment

» Entailment of Nonstructural Subtype Constraints

» Subtyping Recursive Types Modulo Associative Commutative Products

» A Semantic Basis for Quest

» Game Semantics and Subtyping

» Subtyping Recursive Types

» Logical Equivalence for Subtyping Object and Recursive Types

» Recursive subtyping revealed

Post Info
More Details (n/a)

Added	30 Jul 2010
Updated	30 Jul 2010
Type	Conference
Year	2001
Where	TLCA
Authors	Juliusz Chroboczek

Comments (0)