M. Hanus. The Integration of Functions into Logic Programming: A Survey. The Journal of Logic Programming (Special issue "Ten Years of Logic Programming "), 19-20:583--628, 1994.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....sound and complete w.r.t. the notion of model in [2] Thus, all theoretical results described there are also preserved in this framework. 1 Introduction The combination of different declarative paradigms (specially functional and logic) has been widely investigated during the last decade (see [14] for a survey) As a consequence of such research, several well known functional logic languages such as BABEL or K LEAF arose, combining lazy evaluation with unification and using lazy narrowing as goal solving mechanism. Another interesting line of research has been (and currently is) the ....

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

....with the do notation [Lau93, HM97] gives a very appealing structure to the parsers built up. 1.4 The Functional Logic Programming approach. Many efforts have been done in the last decade in order to integrate LP and FP into a single paradigm, functional logic programming (FLP in short, see [Han94] for a survey) As any other paradigm, FLP should develop its own programming techniques and methodologies, but little has been done from this point of view. We address here the problem of developing FLP parsers in a systematic way, trying to answer affirmatively to the question: can FLP ....

....part is omitted if k = 0. For intance, the infix operator takes two lists and appends the elements of the second list at the end of the first list: infixr 50 ( Y = Y ( XjXs] Y = XjXs Y] The symbol = stands for strict equality, which is the suitable notion (see e.g. [Han94]) for equality when non strict partial functions are considered. With this notion a condition e = e 0 can be read as: e and e 0 can be reduced to the same pattern. When used in the condition of a rule, is better understood as a constraint (if it is not satisfiable, the computation fails) ....

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.

.... Semantics for CRWL programs 12 5 A Lazy Narrowing Calculus 20 6 Soundness and Completeness 25 7 Conclusions and Final Example 35 1 Introduction The interest in combining different declarative programming paradigms, especially functional and logic programming, has grown over the last decade; see [11] for a recent survey. The operational semantics of many functional logic languages is based on term rewriting and narrowing. In some cases, constructor based term rewriting systems (CTRSs) have been adopted, in order to allow for a model theoretic semantics that can reflect the behaviour of ....

M. Hanus. The Integration of Functions into Logic Programming: A Survey. JLP (19&20). Special issue "Ten Years of Logic Programming", pp.583-628, 1994.

....Dpto. Sistemas Inform aticos y Programaci on Fac. Matem aticas, Univ. Complutense, Madrid, Spain email:jesusmal eucmos.sim.ucm.es 1 Introduction The combination of different declarative (specially functional and logic) paradigms has been widely investigated during the last decade (see [Han94] for a survey) As a consequence of such research, several well known functional logic languages such as BABEL [MoRo92] or K LEAF [GLMP91] arose, using lazy narrowing as goal solving mechanism. More recently, there has been an increasing interest in the scientific community in order to amalgamate ....

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

No context found.

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

....the general debugging scheme we are going to define will be applied to a functional logic language. The functional logic programming (FLP for short) paradigm tries to bridge the gap between the two main streams in declarative programming: functional programming (FP) and logic programming (LP) see [5] for a survey) For the purposes of this paper, we have chosen to work with a simple variant of the FLP language studied in [4, 3] and implemented in the T OY system (see [9] This choice give us the possibility, adventageous from the point of view of declarative debugging, of exploiting the ....

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.

....[Bei95] or operational semantics based on typed unification for logic programming (cfr. Smo89] Han91] HiTo92] TEL is a language which combines both kinds of polymorphism in a logic language. The integration of logic and functional programming has been studied in the last years (see [Han94a] for a survey) Operational semantics based on lazy narrowing has been presented in [GHLR96] This combination is adequated to include lazy evaluation allowing partial non strict functions and infinite values. Parametric type systems for functional logic programming have been studied in [Han90] ....

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

....Moreover, we present type inference and checking compile time tools for the language showing its usefulness for improving computations. 1 Introduction The combination of different declarative (specially functional and logic) paradigms has been widely investigated during the last decade (see [13] for a survey) and as a consequence, several well known functional logic languages arose, using lazy narrowing as goal solving mechanism. More recently, the language CURRY [11, 14] integrates the most important features from functional, logic and concurrent programming, providing a common ....

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

....logic programming, non deterministic functions, higher order rewriting logic, lazy narrowing. 1 Introduction The interest in multiparadigm declarative programming has grown over the last two decades, giving rise to different approaches to the integration of functions into logic programming ([9]) In particular, some lazy functional logic languages such as K LEAF [5] and BABEL [17] have been designed to combine lazy evaluation and unification. This is achieved by presenting programs as rewriting systems and using lazy narrowing (a notion introduced in [21] as a goal solving mechanism. ....

M.Hanus. The Integration of Functions into Logic Programming: A Survey. JLP (19&20). Special issue "Ten Years of Logic Programming", pp. 583-628, 1994.

....in every program rule (cfr. Smo89] HiTo92] and [Bei95] For these type systems, the problem of inference of the most general type has been treated for functional programming in [FuMi90] and [Smi94] The integration of logic and functional programming has been studied in the last years (see [Han94] for a survey) considering the lazy narrowing as a sound and complete operational semantics [GHLR96] This combination is adequate in order to include lazy evaluation allowing partial non strict functions and infinite data. Parametric type systems for functional logic languages has been studied in ....

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

....elimination. Keywords: Declarative programming, non deterministic functions, constructor based rewriting logic, lazy narrowing. 1 Introduction The interest in combining different declarative programming paradigms, especially functional and logic programming, has grown over the last decade; see [10] for a recent survey. The operational semantics of many functional logic languages is based on term rewriting and narrowing. In some cases, constructorbased term rewriting systems (CTRSs) have been adopted, in order to allow for a model theoretic semantics that can reflect the behaviour of partial ....

M. Hanus. The Integration of Functions into Logic Programming: A Survey. JLP (19&20). Special issue "Ten Years of Logic Programming", pp. 583-628, 1994.

....Due to the variety of its applications and to the clarity of its conception, CLP (R) has had a great influence 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 [8] for This research has been partially supported by the U.C.M precompetitivo 95 5525 and the Spanish National Project TIC95 0433 C03 09 CPD . a survey) To link together these two independent branches of evolution of logic programming appears as a natural interesting task. In [16, 17] a ....

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

.... 24] but nevertheless it seems that those issues are still better supported in functional programming (FP) This is one of the main reasons advocated for the the inte gration of the FP and LP paradigms, which constitutes another important branch in the evolution of declarative languages (see [10] for a survey) With functional logic programming (FLP) a problem arises: while FP smoothly support domain dependent computations in a declarative way, this property is lost in the usual approach to FLP, which is based in some Herbrand like representation of data. In particular the problem of ....

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

....theory. Research supported by the national project TIC 92 0793 C02 01 PDR and the ESPRIT BR Working Group N. 6028 CCL 1 Introduction The interest in combining different declarative programming paradigms, especially functional and logic programming, has grown over the last decade; see [Han94] for a recent survey. The operational semantics of many functional logic languages is based on term rewriting and narrowing. In some cases, constructor based term rewriting systems (CTRSs) have been adopted, in order to allow for a model theoretic semantics that can reflect the behaviour of ....

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

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