TYPE INFERENCE FOR FIRST-CLASS MESSAGES WITH FEATURE CONSTRAINTS

DOI10.1142/S0129054100000041zbMath1319.68058OpenAlexW2758923635MaRDI QIDQ5249029

No author found.

Publication date: 29 April 2015

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054100000041

zbMATH Keywords

complexityobject-oriented programmingconstraint-based type inferencefeature constraintsfirst-class messages

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• Type inference for record concatenation and multiple inheritance
• A theory of type polymorphism in programming
• A complete axiomatization of a theory with feature and arity constraints
• Records for logic programming
• An analysis of ML typability
• Dynamic Perfect Hashing: Upper and Lower Bounds
• Towards a meaning of life

This page was built for publication: TYPE INFERENCE FOR FIRST-CLASS MESSAGES WITH FEATURE CONSTRAINTS