R. McPhee. Compositional Logic Programming. PhD thesis, Oxford University Computing Laboratory, 2000. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Embedding PROLOG in HASKELL - Spivey, Seres (1999) (3 citations) (Correct)
....strategy would share the computation effort more evenly between the two parts. Similarly, our implementation of results in a left to right selection of the literals of a clause. A fair selection rule would allow one to chose the literals in a different order. One possible solution (inspired by [11]) is to interleave the streams of answers, taking one answer from each stream in turn. A function twiddle that interleaves two lists can be defined as: twiddle : a] Gamma [a] Gamma [a] twiddle [ ys = ys twiddle (x : xs) ys = x : twiddle ys xs) The operators k and can be redefined ....
R. McPhee and O. de Moor. Compositional logic programming. In Proceedings of the JICSLP'96 post-conference workshop: Multi-paradigm logic programming, Report 96-28. Technische Universitat Berlin, 1996.
Embedding PROLOG in HASKELL - Seres, Spivey (1999) (3 citations) (Correct)
....would share the computation effort more evenly between the two parts. Similarly, our implementation of results in a left to right selection of the literals of a clause. A fair selection rule would allow one to chose the literals in a different order. 9 One possible solution (inspired by [10]) is to interleave the streams of answers, taking one answer from each stream in turn. A function twiddle that interleaves two lists can be defined as: twiddle : a] Gamma [a] Gamma [a] twiddle [ ys = ys twiddle (x : xs) ys = x : twiddle ys xs) The operators k and can be redefined ....
R. McPhee and O. de Moor. Compositional logic programming. In Proceedings of the JICSLP'96 post-conference workshop: Multi-paradigm logic programming, Report 96-28. Technische Universitat Berlin, 1996.
Shallow Embedding of Prolog Programs - Seres (1999) (Correct)
....selection strategy would compute one answer for each of the literals before considering the first literal for the second time. One possible solution is to use the laziness of Gofer to interleave the streams of answers, taking one answer from each stream in turn. A function twiddle (inspired by [McP98]) that interleaves two lists can be defined in Gofer as: twiddle : a] a] a] twiddle [ ys = ys twiddle (x:xs) ys = x: twiddle ys xs) The operators and can be defined in terms of twiddle (note that concat = foldr ( 44 (p q) x = twiddle (p x) q x) p ....
....nature of Prolog. The decision whether the fair selection or computations should be used is a trade off between efficiency of the query and its termination. The analysis of the termination of Prolog queries, depending on the mode of the parameters in the query, can be automated, as for example in [McP98]. This approach attempts to solve queries with optimal efficiency and optimal termination. An interesting side issue here is how much the typing system of Gofer facilitates the termination analysis for the predicates in the shallow embedding. Note that the fair use of does not give ....
R. McPhee. Compositional Logic Programming. PhD thesis, Oxford University Computing Laboratory, (to be submitted) December 1998.
An Exercise in Polytypic Program Derivation: repmin - de Moor (1996) Self-citation (De moor) (Correct)
....specification. 9.2 Prolog Whereas the correspondence between categorical combinators and Haskell is fairly obvious, a little more work is needed for a translation into a logic language like Prolog. The reason is that logic languages tend to lack all forms of compositionality (see, however, [10] for a logic language that overcomes this problem) The formal correspondence between Prolog and Rel is therefore even more dubious then the correspondence between Haskell and Fun. Recall the definition of eval and curry in Rel : a eval ( a 0 ; c 0 ) c) j a = a 0 c = c 0 and (a; ....
R. M. McPhee and O. De Moor. Compositional logic programming. Submitted for publication, 1996.
Characterisations of Termination in Logic Programming - Pedreschi, Ruggieri, Smaus (Correct)
No context found.
R. McPhee. Compositional Logic Programming. PhD thesis, Oxford University Computing Laboratory, 2000.
Some Notes on Logic Programming with a Relational Machine.. - Lipton, Chapman (1998) (3 citations) (Correct)
No context found.
R. McPhee and O. de Moor, "Compositional Logic Programming", in Proceedings of the JICSLP'96 postconference workshop: Multi-paradigm logic programming , M. Chakravarty and Y. Guo and T. Ida, eds., Technische Universitat Berlin, also PRG Report 96-28, Oxford, 1996.
Shallow Embedding of Prolog Programs - Seres (1999) (Correct)
No context found.
R. McPhee and O. de Moor. Compositional logic programming. In Proceedings of the JICSLP'96 post-conference workshop: Multi-paradigm logic programming, Report 96-28. Technische Universitat Berlin, 1996.
Some Notes on Logic Programming with a Relational Machine.. - Lipton, Chapman (1998) (3 citations) (Correct)
No context found.
R. McPhee and O. de Moor, "Compositional Logic Programming", in Proceedings of the JICSLP'96 post-conference workshop: Multi-paradigm logic programming , M. Chakravarty and Y. Guo and T. Ida, eds., Technische Universitat Berlin, also PRG Report 96-28, Oxford, 1996.
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