Type inference for record concatenation and subtyping

DOI10.1016/J.IC.2003.10.001zbMATH Open1082.68013OpenAlexW2077116540MaRDI QIDQ1887147FDOQ1887147

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

Recommendations

• Publication:3204026
• Type inference for record concatenation and multiple inheritance
• scientific article; zbMATH DE number 814797
• Publication:4490755
• scientific article

zbMATH Keywords

ComplexityTypesObjects

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Fundamental properties of infinite trees
• Title not available (Why is that?)
• Title not available (Why is that?)
• A syntactic approach to type soundness
• Efficient inference of object types
• Title not available (Why is that?)
• Title not available (Why is that?)
• Efficient inference of partial types
• Title not available (Why is that?)
• Type inference for record concatenation and multiple inheritance
• Type inference with non-structural subtyping
• Title not available (Why is that?)
• Simplifying subtyping constraints
• Type-indexed rows

Cited In (6)

• Title not available (Why is that?)
• Taming the Merge Operator
• A calculus with recursive types, record concatenation and subtyping
• Object type constructors
• Title not available (Why is that?)
• A computational complexity analysis of tunable type inference for Generic Universe Types

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

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