Understanding functional dependencies via constraint handling rules

DOI10.1017/S0956796806006137zbMath1107.68031OpenAlexW2009179353MaRDI QIDQ3419813

Gregory J. Duck, Peter J. Stuckey, Martin Sulzmann, Simon L. 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)

Related Items

On Termination, Confluence and Consistent CHR-based Type Inference, Constraint handling rules with binders, patterns and generic quantification, Flexible dynamic information flow control in the presence of exceptions, The New Normal: We Cannot Eliminate Cuts in Coinductive Calculi, But We Can Explore Them, Graph-based communication in Eden, <scp>OutsideIn(X)</scp>Modular type inference with local assumptions, Proof Relevant Corecursive Resolution, Generic programming with C++ concepts and Haskell type classes—a comparison, COCHIS: Stable and coherent implicits, As time goes by: Constraint Handling Rules