Recursive subtyping revealed

Loading...
Thumbnail Image
Penn collection
Departmental Papers (CIS)
Degree type
Discipline
Subject
Funder
Grant number
License
Copyright date
Distributor
Related resources
Author
Gapeyev, Vladimir
Levin, Michael Y
Contributor
Abstract

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 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 unifying mathematical framework of coinduction.

Advisor
Date Range for Data Collection (Start Date)
Date Range for Data Collection (End Date)
Digital Object Identifier
Series name and number
Publication date
2002-11-01
Journal title
Volume number
Issue number
Publisher
Publisher DOI
Journal Issue
Comments
Copyright Cambridge University Press. Reprinted from Journal of Functional Programming, Volume 12, Issue 6, November 2002, pages 511-548. This article also appears as chapter 21 of Types and Programming Languages by Benjamin C. Pierce [MIT Press, 2002].
Copyright Cambridge University Press. Reprinted from Journal of Functional Programming, Volume 12, November 2002, pages 511-548.
Recommended citation
Collection