A calculus with recursive types, record concatenation and subtyping
From MaRDI portal
Publication:6176573
DOI10.1007/978-3-031-21037-2_9zbMath1524.68107OpenAlexW4312991422MaRDI QIDQ6176573
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
Functional programming and lambda calculus (68N18) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Formalization of mathematics in connection with theorem provers (68V20)
Cites Work
- Bounded quantification is undecidable
- Comparing object encodings.
- Type inference for record concatenation and subtyping
- Elaborating intersection and union types
- Intersection types and computational effects
- Disjoint intersection types
- Disjoint Polymorphism
- The Essence of Dependent Object Types
- A filter lambda model and the completeness of type assignment
- Operations on records
- Semantic subtyping
- Automata, Languages and Programming
- Distributive disjoint polymorphism for compositional programming
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A calculus with recursive types, record concatenation and subtyping