M.H.M.Cheng, M.H.van Emden, B.E.Richards: On Warren's Method for Functional Programming in Logic. Procs. 7th Int. Conf. on Logic Programming, MIT Press, 1990, pp. 546-560.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....topic has received much attention in the last years [6, 2, 7] most of the existing research refers to F.O. languages. The semantic foundation of H.O. logic functional languages does still need further investigation. Existing approaches propose either to translate H.O. syntax into F.O. syntax [3, 4] or to use H.O. logics with a F.O. semantics [13, 5] In our previous work [10] we used conditional narrowing for a resticted kind of H.O. rewriting systems as a computational paradigm for H.O. functional logic programming, and we stablished soundness and completeness results w.r.t. a F.O. ....

M.H.M.Cheng, M.H.van Emden, B.E.Richards: On Warren's Method for Functional Programming in Logic. Procs. 7th Int. Conf. on Logic Programming, MIT Press, 1990, pp. 546-560.

....purpose recursion schemes from which programs are actualized by specialization. In this way the program is imposed a discipline concerning choice of recursion structures. Similar recursion structures are proposed in a related but independent work for pure higher order logic programming in prolog [1]. Other proposals for recursion templates are found in [2, 3, 21, 22] Use of higher order functions for composition and structuring of programs is a wellestablished part of functional programming methodology, cf. e.g. 5, 6] In analogy to functional programming recursion schemes (recursion ....

....form of the program also honouring the termination obligation. Acknowledgements The second author gratefully acknowledges a grant from Uppsala University. Thanks are also due to the anonymous referees for detailed comments, further references and suggestions for future research. References [1] Gegg Harrison, T.S. Representing Logic Program Schemata in Prolog, in Proceedings of the Twelfth International Conference on Logic Programming 1995, Sterling, L. ed. MIT Press, London, pp. 467 481, 1995. 2] Marakakis, E. and Gallagher, J. P. Schema Based Top Down Design of Logic ....

M.H.M. Cheng, M.H. van Emden, & B. E. Richards: On Warren's Method for Functional Programming in Logic, Procs. of the 7th International Conference on Logic Programming, D.H.D Warren & P. Szeredi (eds.), The MIT Press, 1990. pp. 546-560.

....(HO) programming constructs into Prolog, that can be viewed as a kind of higher order into first order (FO) translation. This method has been used in different settings as a tool for the combination of functional and logic programming [3, 2, 1] or even for the reduction of the former to the later [4]. The present paper was motivated by our feeling that the semantic correctness of Warren s translation is not yet sufficiently well understood. We give a formulation of the method in the framework of the HO functional logic language SFL [6, 7] which uses conditional narrowing as operational ....

....2 translation is used to define a semantics for the HO functional logic language IDEAL by means of the well defined semantics of the FO functional logic language K LEAF [11, 12] In fact, the meaning of any IDEAL program is defined as the meaning of its translation into K LEAF. More recently [4], recovering the original purpose of Warren, uses the translation to reduce functional programming to logic programming, investigating its correctness w.r.t. the axioms of equality and those of the calculus, and giving some results intended to show that this method evaluates expressions involving ....

M.H.M.Cheng, M.H.van Emden, B.E.Richards: On Warren's Method for Functional Programming in Logic. In Procs. 7th Int. Conf. on Logic Programming, MIT Press, 1990, pp. 546-560.

....(HO) programming constructs into Prolog, that can be viewed as a kind of higher order into first order (FO) translation. This method has been used in different settings as a tool for the combination of functional and logic programming [3, 2, 1] or even for the reduction of the former to the later [4]. The present paper was motivated by our feeling that the semantic correctness of Warren s translation is not yet sufficiently well understood. We give a formulation of the method in the framework of the HO functional logic language SFL [6, 7] which uses conditional narrowing as operational ....

....2] the translation is used to define a semantics for the HO functional logic language IDEAL by means of the well defined semantics of the FO functional logic language K LEAF [10, 11] In fact, the meaning of any IDEAL program is defined as the meaning of its translation into K LEAF. More recently [4], recovering the original purpose of Warren, uses the translation to reduce functional programming to logic programming, investigating its correctness w.r.t. the axioms of equality and those of the calculus, and giving some results intended to show that this method evaluates expressions ....

M.H.M.Cheng, M.H.van Emden, B.E.Richards: On Warren's Method for Functional Programming in Logic. In Procs. 7th Int. Conf. on Logic Programming, MIT Press, 1990, pp. 546-560.

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