Type inference for record concatenation and subtyping

DOI10.1016/j.ic.2003.10.001zbMath1082.68013OpenAlexW2077116540MaRDI QIDQ1887147

Jens Palsberg, Tian Zhao

Publication date: 23 November 2004

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2003.10.001

zbMATH Keywords

ComplexityTypesObjects

Mathematics Subject Classification ID

Theory of programming languages (68N15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (3)

A calculus with recursive types, record concatenation and subtyping ⋮ A computational complexity analysis of tunable type inference for Generic Universe Types ⋮ Taming the Merge Operator

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Type inference for record concatenation and multiple inheritance
• Fundamental properties of infinite trees
• Efficient inference of partial types
• A syntactic approach to type soundness
• Type inference with non-structural subtyping
• Efficient inference of object types
• Simplifying subtyping constraints
• Type-indexed rows

This page was built for publication: Type inference for record concatenation and subtyping