J.C.Gonz'alez-Moreno, T.Hortal'a-Gonz'alez, M.Rodr'iguez-Artalejo. A Higher Order Rewriting Logic for Functional Logic Programming, Procs.ICLP'97,The MIT Press, pp.153-167, 1997.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....P and an environment V (denoted by (P; V ) TRC ) In [2, 1] the soundness and completeness of TRC w.r.t. the model semantics and typed lazy narrowing was proved. In the sequel we restrict the presentation to a first order fragment of the language, but it can be extended to higher order as in [10]. TRC provides meaning to the following formulas : non strict equalities e t representing that the partial (i.e. possibly containing 3 ) term t approximates the value of e (i.e. e is lazily unified to the partial term t) strict equalities e = e 0 which will be derived by reducing e ....

J.C.Gonz'alez-Moreno, T.Hortal'a-Gonz'alez, M.Rodr'iguez-Artalejo. A Higher Order Rewriting Logic for Functional Logic Programming, Procs.ICLP'97,The MIT Press, pp.153-167, 1997.

.... I O rather than built ins with side e ects) The basic ideas in functional logic programming consist in lazy narrowing [49] as operational mechanism, following some class of narrowing strategy [7, 39, 42, 24] combined with some kind of constraints solving [40, 52] and higher order features [48, 33, 6, 22, 23, 36]. On the other hand, it is common knowledge the usefulness of type systems in a wide range of areas in computer science in order to increase the reliability of software systems: detecting programming errors, getting more readable and structured programs, optimizing run times, among many others. ....

....has already been studied in [1] in the line of type inference algorithms for functional [17, 53] and logic programming [55, 35, 12] showing how to add type conditions to program rules and goals and how to check and simplify them. Our framework has been developed in the context of the works [24, 23, 9, 22, 15] which have in uenced to the design of the functional logic languages BABLOG [8] and T OY[15, 41] The latter language additionally works with disequality constraints, constraints over real numbers and higher order functions. It is planned to extend the current implementation with algebraic types ....

[Article contains additional citation context not shown here]

J. C. Gonzalez-Moreno, M. T. Hortala-Gonzalez, and M. RodrguezArtalejo. A higher order rewriting logic for functional logic programming. In L. Naish, editor, Proceedings of the 14th International Conference on Logic Programming, pages 153-167. The MIT Press, 1997.

....by itself (not just mimicking LP or FP) to the task of writing parsers We stick in our work to a particular view of FLP whose core notion is that of non deterministic function. A framework for such approach was given in [GH 96] and later on extended to cope with higher order features [GHR97], and polymorphic algebraic types in [AR97] In the rest of the report we show the characteristics of functional logic parsers, FLP parsers) which amalgamate most of the benefits of the two paradigms showed above. In addition, the use of constraints and higher order patterns will provide new ....

J.C. Gonz'alez-Moreno, T. Hortal'a-Gonz'alez, M. Rodr'iguez-Artalejo. A Higher Order Rewriting Logic for Functional Logic Programming. Procs. of ICLP'97, The MIT Press, 153--167, 1997.

....an environment V (denoted by (P; V ) TRC ) In [AGG96, AG97] the soundness and completeness of TRC w.r.t. the model semantics and typed lazy narrowing was proved. In the sequel we restrict the presentation to a first order fragment of the language, but it can be extended to higher order as in [GHR97]. TRC provides meaning to the following kinds of formulas : non strict equalities e t representing that the partial (i.e. possibly containing 1 ) term t approximates the value of e (i.e. e is reduced or lazily unified to the partial term t) strict equalities l = r which will be ....

....step. However, if ff X collects every X : in advance, when e : ff X is solved the constraint ff X is checked in the representation of ff X . 7 Higher Order We have restricted our presentation to the fragment of first order of the language. However, we can extend it to higher order following [NMI95, GHR97] approaches. These works extend in a natural way first order to higher order by considering applicative expressions instead of first order expressions, higher order patterns instead of terms, and applicative rewriting rules instead of first order rewriting rules. Due to lack of space, here we only ....

J.C. Gonz' alez-Moreno, T. Hortal' a-Gonz' alez, M. Rodr' iguez-Artalejo. A Higher Order Rewriting Logic for Functional Logic Programming, Procs. ICLP'97, The MIT Press, pp. 153-167, 1997.

....CFLP [22, 4, 20] but, as far as we know, they have not fructified in the development of concrete, practical languages. In this paper we describe the language CFLP (R) which incorporates real arithmetic constraints to a higher order lazy nondeterministic functional logic language in the spirit of [7, 8]. The language incorporates also syntactic disequality constraints in the way of [2] The language has been implemented in the system TOY(R) http: mozart.mat.ucm.es incoming comprimidos toyr.tar.gz) which is an extension of the FLP system TOY (http: mozart.mat. ....

....r is a real number, c 2 CS m , n m, f 2 FS m , n m. One distinguished feature of our patterns is that partial application of c and f (which have functional type) are allowed within them, which are then called HO patterns. This corresponds to an intensional point of view of HO patterns (see [6, 8]) Observe that in this approach function symbols, when partially applied, behave as data constructors. Expressions e are of the form e : X j r j (e 1 ; e n ) j c e 1 : e n j f e 1 : e n j e e 1 : e n , where c 2 CS m , n m, f 2 FS m , n m. Of course expressions are ....

[Article contains additional citation context not shown here]

Gonz'alez-Moreno J.C., Hortal'a-Gonz'alez T., Rodr'iguez-Artalejo M.: A Higher Order Rewriting Logic for Functional Logic Programming. Procs. of ICLP'97, to appear, 1997.

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