Recursive subtyping revealed

DOI10.1017/S0956796802004318MaRDI QIDQ4709841zbMATH OpenOpenAlexFDO

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

Publication date 23 June 2003

Published in Journal of Functional Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0956796802004318

zbMATH Keywords

subtyping

Mathematics Subject Classification ID

Logic programming (68N17) Nonnumerical algorithms (68W05)

Recommendations

• Recursive subtyping revealed (functional pearl)
• Efficient recursive subtyping
• An algebraic view on recursive types
• Subtyping recursion and parametric polymorphism in kernel Fun
• Assertions and recursions

Cited in

(21)

• Coinductive big-step operational semantics
• Subtyping recursion and parametric polymorphism in kernel Fun
• Non-well-founded deduction for induction and coinduction
• Integrating induction and coinduction via closure operators and proof cycles
• Session typing and asynchronous subtyping for the higher-order \(\pi\)-calculus
• A static simulation of dynamic delimited control
• Recursive subtyping revealed (functional pearl)
• scientific article; zbMATH DE number 1808198 (Why is no real title available?)
• A type system for Discretionary Access Control
• Orchestrated session compliance
• scientific article; zbMATH DE number 1746461 (Why is no real title available?)
• Assertions and recursions
• Efficient recursive subtyping
• Java generics are Turing complete
• Theoretical Computer Science
• Types and Deadlock Freedom in a Calculus of Services, Sessions and Pipelines
• Typed Lambda Calculi and Applications
• The different shades of infinite session types
• Checking equivalence of corecursive streams: an inductive procedure
• Recursive subtyping for all
• Adding recursion to Dpi

This page was built for publication: Recursive subtyping revealed

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