Vladimir Gapeyev, Michael Y. Levin, Benjamin C. Pierce  Home/Search
Context
Related
| upenn.edu/~milevin/rec4dum.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: upenn.edu/~milevin/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Algorithms for checking subtyping between recursive types lie at the core of many modern programming language implementations. But the fundamental theory of these algorithms and how they relate to simpler declarative specifications is not widely understood, due in part to the difficulty of the available introductions to the area. This tutorial paper offers an "end-to-end" introduction to recursive types and subtyping algorithms, from basic theory to efficient implementation, set in the elegant... (Update)
Similar documents (at the sentence level):
34.0%: Recursive Subtyping Revealed - Gapeyev, Levin, Pierce (2000) (Correct)
Active bibliography (related documents): More All
0.1: Efficient Type Matching - Jha, Palsberg, Zhao (2002) (Correct)
0.1: Efficient and Flexible Matching of Recursive Types - Palsberg, Zhao (2000) (Correct)
0.0: Coinductive Axiomatization of Recursive Type Equality and.. - Brandt, Henglein (1998) (Correct)
Similar documents based on text: More All
0.3: XML Goes Native: Run-time Representations for Xtatic - Gapeyev, Levin, Pierce.. (2004) (Correct)
0.3: Type-based Optimization for Regular Patterns - Levin, Pierce (2005) (Correct)
0.2: TinkerType: A Language for Playing with Formal Systems - Levin, Pierce (2000) (Correct)
BibTeX entry: (Update)
@misc{ gapeyev-recursive,
author = "Vladimir Gapeyev and Michael Y. Levin and Benjamin C. Pierce",
title = "Recursive Types",
url = "citeseer.ist.psu.edu/470426.html" }
Citations (may not include all citations):509 Introduction to Lattices and Order (context) - Davey, Priestley - 1990
258 A lattice-theoretical fixpoint theorem and its applications (context) - Tarski - 1955
129 ACM Transactions on Programming Languages and Systems (context) - Amadio, Cardelli et al.
118 Lambda calculus models of programming languages (context) - Morris - 1968
114 Fundamental properties of infinite trees (context) - Courcelle - 1983
97 An introduction to inductive definitions (context) - Aczel - 1977
62 Regular expression types for xml - Hosoya, Vouillon et al. - 2000
41 Type inference with recursive types: Syntax and semantics (context) - Cardone, Coppo - 1991
38 Coinductive axiomatization of recursive type equality and su.. - Brandt, Henglein
26 Efficient recursive subtyping - Kozen, Palsberg et al. - 1993
15 Type inference in systems of recursive types with subtyping - Jim, Palsberg - 1999
14 A tutorial on co-induction and functional programming - Gordon - 1994
Documents on the same site (http://www.cis.upenn.edu/~milevin/):
Efficient Annotation Inference for an Extended Static Checker - Flanagan, Leino, Levin (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC