Understanding functional dependencies via constraint handling rules

DOI10.1017/S0956796806006137MaRDI QIDQ3419813zbMATH OpenOpenAlexFDO

Authors Martin Sulzmann, Gregory Duck, Peter J. Stuckey, Simon Peyton-Jones

Publication date 7 February 2007

Published in Journal of Functional Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0956796806006137

zbMATH Keywords

Haskell style type classes

Mathematics Subject Classification ID

Theory of programming languages (68N15) Functional programming and lambda calculus (68N18)

Recommendations

• Programming Languages and Systems
• Constrained dependencies
• Type inference using constraint handling rules
• On termination, confluence and consistent CHR-based type inference
• Haskell type constraints unleashed

Cited in

(13)

• Functional dependency restricted insertion propagation
• Proof relevant corecursive resolution
• On termination, confluence and consistent CHR-based type inference
• Generic programming with C++ concepts and Haskell type classes—a comparison
• As time goes by: constraint handling rules
• Constraint handling rules with binders, patterns and generic quantification
• \textsc{OutsideIn(X)}: modular type inference with local assumptions
• COCHIS: stable and coherent implicits
• The new normal: we cannot eliminate cuts in coinductive calculi, but we can explore them
• Graph-based communication in Eden
• Programming Languages and Systems
• Flexible dynamic information flow control in the presence of exceptions
• Logics in Artificial Intelligence

This page was built for publication: Understanding functional dependencies via constraint handling rules

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