A calculus with recursive types, record concatenation and subtyping
DOI10.1007/978-3-031-21037-2_9zbMATH Open1524.68107OpenAlexW4312991422MaRDI QIDQ6176573FDOQ6176573
Authors: Yaoda Zhou, Bruno C. d. S. Oliveira, Andong Fan 
Publication date: 25 July 2023
Published in: Programming Languages and Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-21037-2_9
Recommendations
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Functional programming and lambda calculus (68N18) Formalization of mathematics in connection with theorem provers (68V20)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A filter lambda model and the completeness of type assignment
- Comparing object encodings.
- Title not available (Why is that?)
- Operations on records
- Title not available (Why is that?)
- Intersection types and computational effects
- Bounded quantification is undecidable
- Semantic subtyping, dealing set-theoretically with function, union, intersection, and negation types
- Automata, Languages and Programming
- Disjoint polymorphism
- Title not available (Why is that?)
- Elaborating intersection and union types
- Title not available (Why is that?)
- Type inference for record concatenation and subtyping
- Title not available (Why is that?)
- Distributive disjoint polymorphism for compositional programming
- Disjoint intersection types
- The essence of dependent object types
Cited In (4)
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)
