Adding Linear Constraints over Real Numbers to Curry

Lux, Wolfgang

doi:10.1007/3-540-44716-4_12

Cited by 10 publications

(8 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Thus, typical applications of constraint logic programming can be covered and combined with features of lazy higherorder programming [10,19,30,31,67,70,77]. As an example demonstrating the compactness obtained by combining constraint programming with higher-order features, consider a solver for SuDoku puzzles 6 with finite domain constraints.…”

Section: Constraintsmentioning

confidence: 99%

Multi-paradigm Declarative Languages

Hanus¹

Logic Programming

View full text Add to dashboard Cite

Abstract. Declarative programming languages advocate a programming style expressing the properties of problems and their solutions rather than how to compute individual solutions. Depending on the underlying formalism to express such properties, one can distinguish different classes of declarative languages, like functional, logic, or constraint programming languages. This paper surveys approaches to combine these different classes into a single programming language.

show abstract

Section: Constraintsmentioning

confidence: 99%

Multi-paradigm Declarative Languages

Hanus¹

Logic Programming

View full text Add to dashboard Cite

show abstract

“…Since logic programming is a subset of functional logic programming, there exist various attempts to extend functional logic languages with constraint solving facilities (see [24] for a survey). For instance, Lux [21] describes an implementation of a solver for real arithmetic constraints for Curry, and the inclusion of finite domain constraints in the functional logic language TOY [20] is described in [9].…”

Section: Motivationmentioning

confidence: 99%

CHR(Curry): Interpretation and Compilation of Constraint Handling Rules in Curry

Hanus

2015

Practical Aspects of Declarative Languages

View full text Add to dashboard Cite

Abstract. Constraint Handling Rules (CHR) is a rule-based language to specify application-oriented constraint solvers. CHR requires a host language that provides the basic constraints used in a CHR program. In this paper, we argue that an integrated functional logic language like Curry is an appropriate host language for CHR since it supports a natural formulation of constraint handling rules and a seamless integration into a typed environment. As a proof of concept, we describe CHR(Curry), an integration of CHR into Curry, together with two implementations. The first is an interpreter of CHR's refined operational semantics implemented in Curry, and the second compiles CHR rules into Prolog which can be directly used in Prolog-based Curry implementations, such as PAKCS. MotivationFunctional logic languages [4,15] integrate the most important features of functional and logic languages in order to provide a variety of programming concepts. They support functional concepts like higher-order functions and lazy evaluation as well as logic programming concepts like non-deterministic search and computing with partial information. This combination allows better abstractions for application programming and has also led to new design patterns [1,5] as well as better abstractions in application programs such as implementing graphical user interfaces [12] or web frameworks [17]. The declarative multi-paradigm language Curry [11,18] is a modern functional logic language with advanced concepts for application programming [2,3].An important application area of declarative, and in particular, logic programming languages is constraint programming [19,22]. Since logic programming is a subset of functional logic programming, there exist various attempts to extend functional logic languages with constraint solving facilities (see [24] for a survey). For instance, Lux [21] describes an implementation of a solver for real arithmetic constraints for Curry, and the inclusion of finite domain constraints in the functional logic language TOY [20] is described in [9].An alternative to using a fixed set of constraint solvers are Constraint Handling Rules (CHR) [10]. CHR is a declarative language for specifying applicationoriented constraint systems. They are useful for applications that require specific

show abstract

“…The lazy functional logic languages toy(R) and toy(F D) are the respective implementations. Lux (2001) integrates linear constraints over real numbers into the functional logic language curry in a similar way.…”

Section: Conclusion and Related Workmentioning

confidence: 99%

“…While our approach pursues the idea to integrate languages into a system of cooperating solvers the approaches (López-Fraguas 1992;Hortalá-González et al 1997;Fernández et al 2003;Kobayashi et al 2003;Lux 2001) come from the opposite point of view and extend the functional logic program evaluation by constraint evaluation.…”

Section: Conclusion and Related Workmentioning

confidence: 99%

Integration of declarative and constraint programming

Hofstedt¹,

Pepper²

2007

Theory and Practice of Logic Programming

View full text Add to dashboard Cite

Combining a set of existing constraint solvers into an integrated system of cooperating solvers is a useful and economic principle to solve hybrid constraint problems. In this paper we show that this approach can also be used to integrate different language paradigms into a unified framework. Furthermore, we study the syntactic, semantic and operational impacts of this idea for the amalgamation of declarative and constraint programming.

show abstract

Adding Linear Constraints over Real Numbers to Curry

Cited by 10 publications

References 7 publications

Multi-paradigm Declarative Languages

Multi-paradigm Declarative Languages

CHR(Curry): Interpretation and Compilation of Constraint Handling Rules in Curry

Integration of declarative and constraint programming

Contact Info

Product

Resources

About