Sciweavers

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

11

JFP
2002

favoriteEmaildiscussreport

116views more JFP 2002»

Recursive subtyping revealed

13 years 4 months ago

Recursive subtyping revealed

Download www.dsi.unive.it

Algorithms for checking subtyping between recursive types lie at the core of many programming language implementations. But the fundamental theory of these algorithms and how they relate to simpler declarative speci cations is not widely understood, due in part to

Vladimir Gapeyev, Michael Y. Levin, Benjamin C. Pi

Real-time Traffic

JFP 2002 | Programming Language Implementations | Recursive Types | Simpler Declarative Speci |

claim paper

Related Content

» Subtyping Recursive Games

» 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

» Application of Kernel Method to Reveal Subtypes of TF Binding Motifs

» A Semantic Basis for Quest

» Subtyping Recursive Types

» Logical Equivalence for Subtyping Object and Recursive Types

Post Info
More Details (n/a)

Added	22 Dec 2010
Updated	22 Dec 2010
Type	Journal
Year	2002
Where	JFP
Authors	Vladimir Gapeyev, Michael Y. Levin, Benjamin C. Pierce

Comments (0)