Type inference with recursive types: syntax and semantics
Information and Computation
Co-induction in relational semantics
Theoretical Computer Science
ACM Transactions on Programming Languages and Systems (TOPLAS)
POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Vicious circles: on the mathematics of non-wellfounded phenomena
Vicious circles: on the mathematics of non-wellfounded phenomena
Coinductive axiomatization of recursive type equality and subtyping
Fundamenta Informaticae - Special issue: typed lambda-calculi and applications, selected papers
Proceedings of the ACM SIGPLAN 1999 conference on Programming language design and implementation
Regular expression types for XML
ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Recursive Types Are not Conservative over F
TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Regular expression types for XML
ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
Regular expression pattern matching for XML
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Typed compilation of recursive datatypes
Proceedings of the 2003 ACM SIGPLAN international workshop on Types in languages design and implementation
Type Inference with Recursive Type Equations
FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
Regular expression pattern matching for XML
Journal of Functional Programming
TinkerType: a language for playing with formal systems
Journal of Functional Programming
Regular expression types for XML
ACM Transactions on Programming Languages and Systems (TOPLAS)
Subtyping, recursion, and parametric polymorphism in kernel fun
Information and Computation
Mutatis Mutandis: Safe and predictable dynamic software updating
ACM Transactions on Programming Languages and Systems (TOPLAS)
A static simulation of dynamic delimited control
Higher-Order and Symbolic Computation
Subtyping recursion and parametric polymorphism in kernel fun
Information and Computation
Subtyping first-class polymorphic components
ESOP'05 Proceedings of the 14th European conference on Programming Languages and Systems
Hi-index | 0.00 |
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.