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