Efficient recursive subtyping
From MaRDI portal
Publication:4847313
DOI10.1017/S0960129500000657zbMath0840.03007MaRDI QIDQ4847313
Dexter Kozen, Jens Palsberg, Michael I. Schwartzbach
Publication date: 25 October 1995
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
algorithmfinite automata\(\lambda\)-calculusemptiness problemorderings based on contravariancesubtyping in the presence of recursive types
Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25) Combinatory logic and lambda calculus (03B40)
Related Items (13)
Non-structural subtype entailment in automata theory ⋮ Type inference with non-structural subtyping ⋮ Typed path polymorphism ⋮ Practical coinduction ⋮ A Sound Algorithm for Asynchronous Session Subtyping ⋮ Type soundness for path polymorphism ⋮ Realization of Coinductive Types ⋮ Logic of subtyping ⋮ Subtyping recursion and parametric polymorphism in kernel Fun ⋮ Unnamed Item ⋮ Types for access control ⋮ Efficient and flexible matching of recursive types ⋮ Satisfying subtype inequalities in polynomial space
Cites Work
This page was built for publication: Efficient recursive subtyping
