Recursive subtyping revealed
From MaRDI portal
Publication:4709841
DOI10.1017/S0956796802004318zbMath1025.68017OpenAlexW2131770667MaRDI QIDQ4709841
Michael Y. Levin, Vladimir Gapeyev, 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
Related Items (11)
Orchestrated session compliance ⋮ Adding recursion to Dpi ⋮ The different shades of infinite session types ⋮ A Light Modality for Recursion ⋮ A static simulation of dynamic delimited control ⋮ Coinductive big-step operational semantics ⋮ Non-well-founded deduction for induction and coinduction ⋮ A type system for Discretionary Access Control ⋮ Types and Deadlock Freedom in a Calculus of Services, Sessions and Pipelines ⋮ Integrating induction and coinduction via closure operators and proof cycles ⋮ Session typing and asynchronous subtyping for the higher-order \(\pi\)-calculus
This page was built for publication: Recursive subtyping revealed
