Lambda lifting: transforming programs to recursive equations
Proc. of a conference on Functional programming languages and computer architecture
Report on the programming language Haskell: a non-strict, purely functional language version 1.2
ACM SIGPLAN Notices - Haskell special issue
On the handling of disequations in CLP over linear rational arithmetic
Constraint logic programming
Semantics of constraint logic programs with optimization
ACM Letters on Programming Languages and Systems (LOPLAS)
Controlling search in functional logic programs
JICSLP'98 Proceedings of the 1998 joint international conference and symposium on Logic programming
Implementing Encapsulated Search for a Lazy Functional Logic Language
FLOPS '99 Proceedings of the 4th Fuji International Symposium on Functional and Logic Programming
Adding Linear Constraints over Real Numbers to Curry
FLOPS '01 Proceedings of the 5th International Symposium on Functional and Logic Programming
JELIA '96 Proceedings of the European Workshop on Logics in Artificial Intelligence
On the Semantics of Optimization Predicates in CLP Languages
Proceedings of the 13th Conference on Foundations of Software Technology and Theoretical Computer Science
Adding Linear Constraints over Real Numbers to Curry
FLOPS '01 Proceedings of the 5th International Symposium on Functional and Logic Programming
| Hi-index | 0.00 |
Constraint logic programming languages are an extension of logic programming languages where unification has been replaced by constraint solving. Constraint solving techniques allow to reduce the search space of a logic program dramatically and have been shown to be useful in a wide area of application domains. Functional-logic languages are a different branch in the group of declarative languages, which combine the reduction of expressions with unification. In contrast to purely functional languages, functional-logic languages allow for computations with partially known data and offer builtin search strategies, allowing for a more concise formulation of programs. Compared to purely logic languages, functional-logic languages provide functions and a declarative approach to I/O, thus avoiding the need for non-declarative language constructs (e.g. the ubiquitous cut in Prolog). In this paper we will consider the integration of constraint programming and functional-logic programming in the context of the language Curry. Curry is a multi-paradigm declarative language, which aims at unifying the different lines of research in functional-logic programming. In particular, we have chosen the domain of linear constraints over real numbers and will describe the semantic and operational issues of this integration.