Type Processing by Constraint Reasoning

DOI10.1007/11924661_1MaRDI QIDQ5385584zbMATH OpenOpenAlexFDO

Authors Peter J. Stuckey, Martin Sulzmann, Jeremy Wazny

Publication date 6 May 2008

Published in Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11924661_1

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Type inference using constraint handling rules
• HM(X) type inference is CLP(X) solving
• scientific article; zbMATH DE number 1487941
• Type Reconstruction for Type Classes
• scientific article; zbMATH DE number 1692901

Cited in

(13)

• Type 2 representation and reasoning for CWW
• scientific article; zbMATH DE number 1692901 (Why is no real title available?)
• Hindley-Milner elaboration in applicative style (functional pearl)
• Type inference using constraint handling rules
• scientific article; zbMATH DE number 1231454 (Why is no real title available?)
• scientific article; zbMATH DE number 1322825 (Why is no real title available?)
• Skalpel: a constraint-based type error slicer for standard ML
• Typing unmarshalling without marshalling types
• Type checking with open type functions
• An extension of HM(X) with bounded existential and universal data-types
• Type Preservation as a Confluence Problem
• scientific article; zbMATH DE number 6304248 (Why is no real title available?)
• On Computing Constraint Abduction Answers

This page was built for publication: Type Processing by Constraint Reasoning

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