An extension of HM(X) with bounded existential and universal data-types

DOI10.1145/944705.944710MaRDI QIDQ5261265zbMATH OpenOpenAlexFDO

Authors Vincent Simonet

Publication date 2 July 2015

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

Full work available at URL http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.158.3089

zbMATH Keywords

constraint-based type inferencestructural subtypingexistential and universal data-types

Mathematics Subject Classification ID

Theory of programming languages (68N15) Logic programming (68N17)

Recommendations

• scientific article; zbMATH DE number 1692901
• HM(X) type inference is CLP(X) solving
• HMF: simple type inference for first-class polymorphism
• Type Processing by Constraint Reasoning
• A type inference system based on saturation of subtyping constraints

Cited in

(2)

• HM(X) type inference is CLP(X) solving
• A Framework for Extended Algebraic Data Types

This page was built for publication: An extension of HM(X) with bounded existential and universal data-types

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