Results 1 
6 of
6
Le Fun: Logic, equations, and Functions
 In Proc. 4th IEEE Internat. Symposium on Logic Programming
, 1987
"... Abstract † We introduce a new paradigm for the integration of functional and logic programming. Unlike most current research, our approach is not based on extending unification to generalpurpose equation solving. Rather, we propose a computation delaying mechanism called residuation. This allows a ..."
Abstract

Cited by 44 (1 self)
 Add to MetaCart
Abstract † We introduce a new paradigm for the integration of functional and logic programming. Unlike most current research, our approach is not based on extending unification to generalpurpose equation solving. Rather, we propose a computation delaying mechanism called residuation. This allows a clear distinction between functional evaluation and logical deduction. The former is based on the λcalculus, and the latter on Horn clause resolution. In clear contrast with equationsolving approaches, our model supports higherorder function evaluation and efficient compilation of both functional and logic programming expressions, without being plagued by nondeterministic termrewriting. In addition, residuation lends itself naturally to process synchronization and constrained search. Besides unification (equations), other residuations may be any grounddecidable goal, such as mutual exclusion (inequations), and comparisons (inequalities). We describe an implementation of the residuation paradigm as a prototype language called Le Fun—Logic, equations, and Functions.
Inductive Metalogic Programming
, 1994
"... We propose a metalogic programming method for efficient induction of a fairly large class of listhandling logic programs delineated through restrictions on the hypothesis language. These restrictions take the form of predefined program recursion schemes (higher order "clichés") from which ..."
Abstract

Cited by 16 (6 self)
 Add to MetaCart
We propose a metalogic programming method for efficient induction of a fairly large class of listhandling logic programs delineated through restrictions on the hypothesis language. These restrictions take the form of predefined program recursion schemes (higher order "clichés") from which the hypotheses programs in the induction process are derived by plugging in either simple, nonrecursive clause programs or invented predicates. Metalogic programming is applied for handling clauses as first class data objects in connection with program schemes, and moreover for obtaining a flexible control scheme during the induction, avoiding a blindfold generateandtest against the given program examples. A metalogic program induction testbed has been constructed and has successfully been applied to some induction problems discussed in the literature.
Integration of Declarative and Constraint Programming
, 2005
"... 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. Furthe ..."
Abstract
 Add to MetaCart
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.
Under consideration for publication in Theory and Practice of Logic Programming 1 Integration of Declarative and Constraint Programming
, 2006
"... 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. Furthe ..."
Abstract
 Add to MetaCart
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.
Translating functional programs to GCLA *
"... Abstract This paper presents an attempt to do lazy evaluation in GCLA by translating functional programs into GCLA definitions and evaluating these using a proper procedural part. The resulting GCLA programs are described with some detail to illuminate different aspects of GCLA programming. 1 ..."
Abstract
 Add to MetaCart
Abstract This paper presents an attempt to do lazy evaluation in GCLA by translating functional programs into GCLA definitions and evaluating these using a proper procedural part. The resulting GCLA programs are described with some detail to illuminate different aspects of GCLA programming. 1
Expressivity of Functionallogic Languages and their Implementation
, 1994
"... Machine for functional languages). A graphbased implementation for functional logic languages can be found in the BAM [KLMR90, KLMR92] to implement BABEL. It is worth to mention that current implementations are highly competitive with Prolog implementations. Moreover, the efficiency of functional ..."
Abstract
 Add to MetaCart
Machine for functional languages). A graphbased implementation for functional logic languages can be found in the BAM [KLMR90, KLMR92] to implement BABEL. It is worth to mention that current implementations are highly competitive with Prolog implementations. Moreover, the efficiency of functional logic programs is often better than their Prolog equivalents taking advantage of the functional structure of the program (what it is not possible in PROLOG). In particular, one possible optimization is the detection of deterministic computations. Following the fact that functions are nonambiguous, the implementation can detect that a function call can only return a single result. In such this situation backtracking is not needed and no more rules are tried after a success in case of failure. In other words, an implicit cut is inserted before the code for the left hand side of the rule. Some speedups of this technique are reported in [KLMR92, Lo91]. 4 Higher Order Higher order functions ca...