ComputingComputer ScienceCompilersFormal MethodsProgramming LanguagesConstraint ProgrammingConstraint SatisfactionConstraint SolvingRule-based RepresentationSpecification LanguagesType SystemsAbstraction MechanismsConstraint Handling RulesConstraint Logic ProgrammingConstraint Modeling LanguagesConstraint RulesCurrying
This paper proposes an integration of Constraint Handling Rules (CHR), a rulebased language to specify application-oriented constraint solvers, into the declarative multiparadigm language Curry. This integration provides a convenient way to specify and use flexible constraint systems in applications implemented in Curry. We propose to represent CHR as data objects in Curry programs so that the advantages of Curry (static typing, functional notation) can also be exploited to define CHR. In order to write CHR in a compact way, we define a set of abstractions that hide the concrete CHR data objects. We sketch an implementation of this concept in the Prolog-based Curry implementation PAKCS that compiles CHR data objects into CHR Prolog programs.
7
Constructing Induction Rules for Deductive Synthesis Proofs
Alan Bundy, Lucas Dixon, Jeremy Gow et al. · Electronic Notes in Theoretical Computer Science · 2006 · 2.8K citations · Full text
Joxan Jaffar, J.-L. Lassez · 1987 · 1.6K citations
Haskell 98 — A Non−strict‚ Purely Functional Language
Ralf Hinze · 1999 · 210 citations