Type inference with non-structural subtyping

DOI10.1007/BF01212524zbMath0868.68074OpenAlexW2156211387WikidataQ61660786 ScholiaQ61660786MaRDI QIDQ1355750

Jens Palsberg, Patrick O'Keefe, Mitchell Wand

Publication date: 3 August 1997

Published in: Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01212524

zbMATH Keywords

inference algorithm

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Parallel algorithms in computer science (68W10) Grammars and rewriting systems (68Q42)

Related Items (3)

Type inference for record concatenation and subtyping ⋮ Non-structural subtype entailment in automata theory ⋮ Strong normalization for non-structural subtyping via saturated sets

Cites Work

• Type inference for record concatenation and multiple inheritance
• Safety analysis versus type inference for partial types
• Efficient inference of partial types
• Efficient recursive subtyping
• Strong normalization with non-structural subtyping
• Type inference with simple subtypes
• Unnamed Item

This page was built for publication: Type inference with non-structural subtyping