A calculus with recursive types, record concatenation and subtyping
From MaRDI portal
Publication:6176573
Recommendations
Cites work
- A 3-part type inference engine
- A filter lambda model and the completeness of type assignment
- Automata, Languages and Programming
- Bounded quantification is undecidable
- Comparing object encodings.
- Disjoint intersection types
- Disjoint polymorphism
- Distributive disjoint polymorphism for compositional programming
- Elaborating intersection and union types
- Family polymorphism
- scientific article; zbMATH DE number 3864476 (Why is no real title available?)
- scientific article; zbMATH DE number 954811 (Why is no real title available?)
- scientific article; zbMATH DE number 944097 (Why is no real title available?)
- scientific article; zbMATH DE number 814798 (Why is no real title available?)
- scientific article; zbMATH DE number 814801 (Why is no real title available?)
- Intersection types and computational effects
- Operations on records
- Semantic subtyping, dealing set-theoretically with function, union, intersection, and negation types
- Subtyping with union types, intersection types and recursive types
- The essence of dependent object types
- Type inference for record concatenation and subtyping
Cited in
(5)
This page was built for publication: A calculus with recursive types, record concatenation and subtyping
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6176573)