Recursive subtyping revealed (functional pearl)

DOI10.1145/351240.351261MaRDI QIDQ2943374zbMATH OpenOpenAlexFDO

Authors Vladimir Gapeyev, Michael Y. Levin, Benjamin C. Pierce

Publication date 11 September 2015

Published in Proceedings of the fifth ACM SIGPLAN international conference on Functional programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/351240.351261

zbMATH Keywords

tutorial paper

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Functional programming and lambda calculus (68N18)

Recommendations

• Recursive subtyping revealed
• Efficient recursive subtyping
• Efficient and flexible matching of recursive types
• Subtyping recursion and parametric polymorphism in kernel Fun
• Assertions and recursions

Cited in

(11)

• Type reconstruction with recursive types and atomic subtyping
• Typed Lambda Calculi and Applications
• Subtyping recursion and parametric polymorphism in kernel Fun
• Efficient and flexible matching of recursive types
• Java generics are Turing complete
• Recursive subtyping revealed
• Polarized subtyping
• Assertions and recursions
• Efficient recursive subtyping
• Functional PearlDeduction for functional programmers
• System \(F^\mu_\omega\) with context-free session types

This page was built for publication: Recursive subtyping revealed (functional pearl)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2943374)