Type inference for record concatenation and subtyping
From MaRDI portal
Publication:1887147
DOI10.1016/j.ic.2003.10.001zbMath1082.68013MaRDI QIDQ1887147
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
68N15: Theory of programming languages
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Related Items
Taming the Merge Operator, A computational complexity analysis of tunable type inference for Generic Universe Types
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