Efficient recursive subtyping

DOI10.1017/S0960129500000657zbMATH Open0840.03007MaRDI QIDQ4847313FDOQ4847313

Authors: Dexter Kozen, Jens Palsberg, Michael I. Schwartzbach 

Publication date: 25 October 1995

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Recommendations

• Recursive subtyping revealed (functional pearl)
• Efficient and flexible matching of recursive types
• Recursive subtyping revealed
• Type reconstruction with recursive types and atomic subtyping
• Subtyping recursion and parametric polymorphism in kernel Fun

zbMATH Keywords

algorithmfinite automata\(\lambda\)-calculusemptiness problemorderings based on contravariancesubtyping in the presence of recursive types

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25) Combinatory logic and lambda calculus (03B40)

Cites Work

• Title not available (Why is that?)

Cited In (17)

• Realization of Coinductive Types
• Satisfying subtype inequalities in polynomial space
• Type soundness for path polymorphism
• Subtyping recursion and parametric polymorphism in kernel Fun
• A Sound Algorithm for Asynchronous Session Subtyping
• Efficient and flexible matching of recursive types
• Non-structural subtype entailment in automata theory
• Recursive subtyping revealed
• Title not available (Why is that?)
• Logic of subtyping
• Typed path polymorphism
• Practical coinduction
• Type inference with non-structural subtyping
• Types for access control
• Subtyping for F-bounded quantifiers and equirecursive types
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: Efficient recursive subtyping

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