Type inference for variant object types

DOI10.1006/inco.2002.3091zbMath1012.68046OpenAlexW2060688653MaRDI QIDQ1854549

Michele Bugliesi, Santiago M. Pericás-Geertsen

Publication date: 14 January 2003

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

Full work available at URL: https://hdl.handle.net/2144/1813

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Logic in computer science (03B70)

Uses Software

• ML
• GHC
• Forsythe

Cites Work

• Type inference with recursive types: Syntax and semantics
• A theory of type polymorphism in programming
• Efficient inference of object types
• Subtyping constrained types
• Type reconstruction with recursive types and atomic subtyping
• The Principal Type-Scheme of an Object in Combinatory Logic
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item