M. Hanus. The integration of functions into logic programming: A survey. The Journal of Logic Programming, 19-20:583--628, 1994. Special issue: Ten Years of Logic Programming.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....are in Sect. 6. Due to lack of space, proofs have been limited to brief sketches. Detailed proofs will be given in a full version of the paper. 2 Preliminaries Functional Logic Programming (FLP for short) aims at the integration of the best features of current functional and logic languages; see [4] for a survey. This paper deals with declarative debugging for lazy FLP languages such as Curry or T OY [5, 6] In this section we recall the basic facts about syntax, type discipline and declarative semantics for lazy FLP programs. We follow the formalization given in [3] but we use the concrete ....

M. Hanus. The Integration of Functions into Logic Programming: A Survey. J. of Logic Programming 19-20. Special issue \Ten Years of Logic Programming", 583-628, 1994.

....PII: S0304 3975(99)00215 7 142 M.R.K. Krishna Rao Theoretical Computer Science 239 (2000) 141 164 normalization (SIN) property of TRSs is important in studying termination of logic programs by transforming them into TRSs [14] and implementation of functional logic programming languages [7]. A logic program terminates for a class of queries if the derived TRS innermost terminates (not necessarily terminate under all reduction strategies) 2] In the functional logic programming, innermost reduction strategy is used for both narrowing as well as rewrite steps. In this paper, we study ....

M. Hanus, The integration of functions into logic programming: a survey, J. Logic Prog. 19=20 (1994) 583 -- 628.

....results. The well developed theory of first order narrowing serves as a general method for R unification, where R is a theory given by a convergent term rewriting system. For an overview see [ 17 ] Narrowing also forms the underlying computation rule for functionallogic programming languages [ 26, 6 ] . For several of these there exist higher order extensions [ 2, 3, 10, 13, 27 ] but to our knowledge completeness results for the higher order case are still missing. Recently, Qian [ 25 ] lifted the completeness of firstorder narrowing strategies to higher order patterns for first order ....

M. Hanus. The integration of functions into logic programming: A survey. 1994. To appear in Journal of Logic Programming.

....some criteria for modularity of normalization follow from known results. Our main contribution is to extend these to the case where R 2 is not convergent. This extension allows for much wider applications, e.g. to functional programming or functional logic programming languages based on narrowing [11], where ground convergence and non termination are prevalent. Research supported by the DFG under grant Br 887 4 2, Deduktive Programmentwicklung and by ESPRIT WG 6028, CCL. Full Address: Fakultat fur Informatik, 80290 Munchen, Germany. Tel: 49 89 2105 2693, Fax: 49 89 2105 8183 ....

.... procedure looks as follows: FUNCTION solve(t,s) IF t and s unify, THEN success ELSE select any narrowing step t; R t 0 solve(t 0 ; s) Many optimizations have been developed to remove redundancies from the immense search space of this unrestricted notion of narrowing, for an overview see [11]. With modularity of normalization, we can prune narrowing derivations that do not yield an R 1 #R 2 # reduction. Thus we gain the following optimization for arbitrary narrowing strategies: Theorem22. Assume a TRS R with R# R 1 #R 2 #. Then the following is a complete (non deterministic) ....

[Article contains additional citation context not shown here]

M. Hanus. The integration of functions into logic programming: A survey. 1994. To appear in Journal of Logic Programming.

....Due to the variety of its applications and to the clarity of its conception, CLP (R) has had a great inAEuence in later CLP languages. Another important branch in the evolution of declarative languages has been the integration of the functional and logic programming (FLP) paradigms (see [11] for a survey) To link together these two independent branches of evolution of logic programming appears as a natural interesting task. In [20, 21] a general scheme CFLP (X ) for Constraint Functional Logic Programming (CFLP) was proposed, with the aim of extending lazy functional logic ....

Hanus M.: The Integration of Functions into Logic Programming: A Survey. Journal of Logic Programming 19-20. Special issue iTen Years of Logic Programmingj, 583628, 1994.

....logic part of the system. Almost all symbolic computation systems are based on imperative languages or on LISP. Most of them are symbolic interpreters. The computer algebra system AXIOM provides a compiler, but it is not based on term rewriting. Compared to other functional logic languages [9], our language possesses more sophisticated pattern and algebraic manipulation capabilities but it does not yet provide full support of constraint functional logic programming. The paper is organized as follows: In the next section we briefly give an informal overview of our language with some ....

....conditional rewrite rules, named patterns, associative, commutative and identity matching, etc. Higher order functions and pure functions are supported along with term rewriting to give full functional programming support. The user is free from some restrictions of various narrowing languages [9], functional languages [15, 19] or equational languages [16] such as left linearity, strong sequentiality or non ambiguity restrictions and has the possibility to choose between eager or lazy evaluation. As we have already mentioned in the introduction, AlgBench s language inherited from ....

[Article contains additional citation context not shown here]

M. Hanus. The Integration of Functions into Logic Programming: A Survey. To appear in Journal of Logic Programming.

....has been shown to be successful and it is a novel approach. However, the use of logic and functional programming, either side by side, or in an integrated fashion, is by no means a novel idea. A large amount of work has been done on the integration of functional and logic languages. See Hanus [11] for a recent comprehensive survey from the point of view of admitting a general notion of equality in logic programming. An early survey of the dual approach (integrating logic variables into a functional framework) is presented by Belli and Levi [6] Our approach of using a functional language ....

M. Hanus. The integration of functions into logic programming: A survey. J. logic programming, 19:583--628, May 1994.

....to ensure the completeness of narrowing strategies, to solve equations and disequations, in the presence of conditional term rewrite systems. 1 Introduction During the last few years, many languages have been proposed to combine functional and logic programming paradigms, see for instance [13] for a recent survey. lpg (for Langage de Programmation G en erique) 2] is one of these proposals. The lpg language has been designed and implemented in 1985 86 at the IMAG Institute. It is a generic, logic and functional programming language intended to experiment new concepts in the field of ....

Michael Hanus. The integration of functions into logic programming : A survey. Technical Report MPI-I-94-201, Max-Planck-Institut fur Informatik, 1994.

....providing more expressiveness. Parametric polymorphism parametrizes types by means of type variables which represent any type. Inclusion polymorphism allows subtype relations between types. The integration of logic and functional programming has been deeply investigated in the last decade (see [Han94] for a recent survey) This combination is adequate for including lazy evaluation allowing partial non strict functions and infinite data. It considers lazy narrowing as a sound and complete operational semantics [GHLR96] Denotational semantics based on Scott domains is the usual semantics for ....

M. Hanus. The Integration of Functions into Logic Programming: A Survey, J. of Logic Programming 19/20, 583-628, 1994.

....learned in building and using tools for parallel functional programming will be of benefit to parallel programming in Prolog and vice versa. We should like to point out that the present proposal is not an attempt to integrate functional and logic programming in the classical sense (see Hanus [Han94] Rather the project should be viewed as using methods and techniques from one paradigm to build better programs using the other paradigm. Stimulating the interaction between different programming paradigms gives the possibility to develop methods that are so general that they could be employed ....

M. Hanus. The integration of functions into logic programming: A survey. J. logic programming, 19:583--628, May 1994.

....of a logic language. An imperative language can be seen as a subset of a functional language. Logic languages are often used to describe properties or specifications. Imperative languages are often used to described models or implementations and functional languages are somewhat in between. See [8], 11] for more in this view on languages. Viewing both the power of current functional languages as well as the, potential, efficiency of their implementation made us choose a modern typed functional language as the starting point. The single most important benefit of the approach is the use of ....

Michael Hanus. The integration of functions into logic programming: A survey. Max-Plank-Institut fur Informatic. MPI-I-94-201.

No context found.

M. Hanus. The integration of functions into logic programming: A survey. The Journal of Logic Programming, 19-20:583--628, 1994. Special issue: Ten Years of Logic Programming.

No context found.

M. Hanus. The integration of functions into logic programming: A survey. 1994. To appear in Journal of Logic Programming.

No context found.

M. Hanus. The integration of functions into logic programming: A survey. 1994. To appear in Journal of Logic Programming.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC