A theory of overloading

DOI10.1145/581478.581495MaRDI QIDQ2949203zbMATH OpenOpenAlexFDO

Authors Peter J. Stuckey, Martin Sulzmann

Publication date 7 October 2015

Published in Proceedings of the seventh ACM SIGPLAN international conference on Functional programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/581478.581495

zbMATH Keywords

constraintsoverloadingtype classestype inference

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Recommendations

• Polymorphic type inference with overloading and subtyping
• Principal type schemes for functional programs with overloading and subtyping
• Functional logic overloading
• Lower bounds on type checking overloading
• scientific article; zbMATH DE number 1696585

Cited in

(7)

• Principal type schemes for functional programs with overloading and subtyping
• Kinded type inference for parametric overloading
• scientific article; zbMATH DE number 1696585 (Why is no real title available?)
• Checking Conservativity of Overloaded Definitions in Higher-Order Logic
• Modular inference of linear types for multiplicity-annotated arrows
• Functional logic overloading
• Correct Hardware Design and Verification Methods

This page was built for publication: A theory of overloading

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