Typed equivalence, type assignment, and type containment

DOI10.1007/3-540-54317-1_105MaRDI QIDQ5881295zbMATH OpenOpenAlexFDO

Authors Roberto M. Amadio

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

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Functional programming and lambda calculus (68N18) Abstract data types; algebraic specification (68Q65)

Recommendations

• scientific article; zbMATH DE number 3930968
• scientific article; zbMATH DE number 814801
• Polymorphic type inference and containment
• Type inference in polymorphic type discipline
• scientific article; zbMATH DE number 814794

Cites work

• A semantics of multiple inheritance
• A small complete category
• Characterizing specification languages which admit initial semantics
• Combinatory logic. Vol. II
• Completeness in the theory of types
• Data Types as Lattices
• scientific article; zbMATH DE number 3485174 (Why is no real title available?)
• scientific article; zbMATH DE number 3993540 (Why is no real title available?)
• scientific article; zbMATH DE number 3349775 (Why is no real title available?)
• Polymorphic type inference and containment
• The completeness theorem for typing lambda-terms

Cited in

(3)

• A type-assignment of linear erasure and duplication
• scientific article; zbMATH DE number 6007795 (Why is no real title available?)
• Restricted weak type versus weak type

Describes a project that uses

Uses Software

• Automath

This page was built for publication: Typed equivalence, type assignment, and type containment

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5881295)