On Termination, Confluence and Consistent CHR-based Type Inference

DOI10.1017/S1471068414000246zbMath1309.68031arXiv1405.3393MaRDI QIDQ2931268

Gregory J. Duck, Martin Sulzmann, Rémy Haemmerlé

Publication date: 25 November 2014

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1405.3393

zbMATH Keywords

confluenceterminationtype classesconstraint handling rules

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Logic programming (68N17)

Uses Software

• Haskell
• GHC

Cites Work

• Confluence and semantics of constraint simplification rules
• On theories with a combinatorial definition of 'equivalence'
• As time goes by: Constraint Handling Rules
• Understanding functional dependencies via constraint handling rules
• Constraint Handling Rules
• The execution algorithm of mercury, an efficient purely declarative logic programming language