Strong normalization with non-structural subtyping

DOI10.1017/S0960129500000815zbMATH Open0840.03006DBLPjournals/mscs/WandOP95WikidataQ61660783 ScholiaQ61660783MaRDI QIDQ4862765FDOQ4862765

Authors: Mitchell Wand, Patrick O'Keefe, Jens Palsberg 

Publication date: 1 July 1996

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Recommendations

• Strong normalization for non-structural subtyping via saturated sets
• scientific article; zbMATH DE number 1301737
• scientific article; zbMATH DE number 125886
• scientific article; zbMATH DE number 1670475
• scientific article; zbMATH DE number 2163051

zbMATH Keywords

\(\lambda\)-calculusstrong normalizationPartial Types with Bottomuntypable terms

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Cites Work

• Efficient inference of partial types
• Type inference with simple subtypes
• Type inference for record concatenation and multiple inheritance
• Safety analysis versus type inference for partial types

Cited In (4)

• Strong normalization for typed terms with surjective pairing
• Strong normalization for non-structural subtyping via saturated sets
• Polymorphic rewriting conserves algebraic strong normalization
• Type inference with non-structural subtyping

This page was built for publication: Strong normalization with non-structural subtyping

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