Typed equivalence, type assignment, and type containment
From MaRDI portal
Publication:5881295
DOI10.1007/3-540-54317-1_105OpenAlexW1533549344MaRDI QIDQ5881295
Publication date: 9 March 2023
Published in: Conditional and Typed Rewriting Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-54317-1_105
Functional programming and lambda calculus (68N18) Abstract data types; algebraic specification (68Q65) Combinatory logic and lambda calculus (03B40)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Characterizing specification languages which admit initial semantics
- A semantics of multiple inheritance
- Polymorphic type inference and containment
- A small complete category
- The completeness theorem for typing lambda-terms
- Combinatory logic. Vol. II
- Data Types as Lattices
- Completeness in the theory of types
