Skip to main content Accessibility help
×
Home

Recursive subtyping revealed

  • VLADIMIR GAPEYEV (a1), MICHAEL Y. LEVIN (a1) and BENJAMIN C. PIERCE (a1)

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.

Copyright

Footnotes

Hide All
This article also appears as chapter 21 of Types and Programming Languages by Benjamin C. Pierce (MIT Press, 2002).

Footnotes

Recursive subtyping revealed

  • VLADIMIR GAPEYEV (a1), MICHAEL Y. LEVIN (a1) and BENJAMIN C. PIERCE (a1)

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed

Recursive subtyping revealed

  • VLADIMIR GAPEYEV (a1), MICHAEL Y. LEVIN (a1) and BENJAMIN C. PIERCE (a1)
Submit a response

Discussions

No Discussions have been published for this article.

×

Reply to: Submit a response


Your details


Conflicting interests

Do you have any conflicting interests? *