Efficient recursive subtyping
From MaRDI portal
Recommendations
Cited in
(21)- Type inference with non-structural subtyping
- Types for access control
- Satisfying subtype inequalities in polynomial space
- Type soundness for path polymorphism
- Subtyping recursion and parametric polymorphism in kernel Fun
- Efficient and flexible matching of recursive types
- Non-structural subtype entailment in automata theory
- Typed path polymorphism
- Logic of subtyping
- Subtyping for F-bounded quantifiers and equirecursive types
- Recursive subtyping revealed (functional pearl)
- scientific article; zbMATH DE number 1808198 (Why is no real title available?)
- Efficient type checking for path polymorphism
- Assertions and recursions
- Recursive subtyping revealed
- scientific article; zbMATH DE number 2087431 (Why is no real title available?)
- Type reconstruction with recursive types and atomic subtyping
- Subtyping arithmetical types
- Practical coinduction
- Realization of coinductive types
- A Sound Algorithm for Asynchronous Session Subtyping
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)