Conal Elliott and Frank Pfenning. eLP: A Common Lisp implementation of Prolog in the Ergo Support System. Available via ftp over the Internet, October 1989. Send mail to elp-request@cs.cmu.edu on the Internet for further information.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....as well as unification) when a unification algorithm for E is known. The methods in [NQ91] are complete when E satisfies certain (strong) constraints. Unification in the presence of type variables has applications in program transformation ( PE88] Ell90] and higher order logic programming ([EP89]) and would be useful in theorem proving in higher order logic (see [NPS ] for a more complete discussion) Other attempts to extend classical higher order unification to allow more flexible typing schemes include treatment of calculi with type variables in [Nip90] and [Hus ] and the ....

C. Elliott and F. Pfenning. eLP: A common Lisp implementation of -Prolog in the Ergo support system. Available by ftp from elp-request@cs.cmu.edu, 1989.

No context found.

Conal Elliott and Frank Pfenning. eLP: A Common Lisp implementation of Prolog in the Ergo Support System. Available via ftp over the Internet, October 1989. Send mail to elp-request@cs.cmu.edu on the Internet for further information.

....logic programming language is closely related to Prolog [25] though the type system supported by our implementation is more general, for example by allowing explicit abstraction over types. The implementation is closely modeled after eLP, an implementation of Prolog in the Ergo Support System [8, 20] and may be considered as a rational reconstruction and explanation of the eLP implementation. This is not a tutorial on Prolog (we present no Prolog programs at all) but for someone familiar with ML this should serve as a high level operational semantics of a variant of the Prolog language. ....

....after the first solution is found. fun onesolve goal prog = let exception Success in ( solve goal prog (fn ( raise Success) print no ) handle Success = print yes end It is also easy to add a query of the user that checks if more solutions are desired or not. The eLP implementation [8] plays even more tricks with the initial success continuation: it presents the first solution, but then works ahead without waiting for instructions as to whether additional solutions are required. If an externally visible side effect is just about to be executed, it suspends. This has the ....

[Article contains additional citation context not shown here]

Conal Elliott and Frank Pfenning. eLP: A Common Lisp implementation of Prolog in the Ergo Support System. Available via ftp over the Internet, October 1989. Send mail to elprequest @cs.cmu.edu on the Internet for further information.

....Thus Huet s algorithm and extended L unification as presented here are in some sense incomparable: each will Logic Programming in the LF Logical Framework 10 postpone some equations as constraints which could have been solved by the other algorithm. In the eLP implementation of Prolog [6] a combination of the two algorithms is used. The remaining transitions we consider have a left hand side of the form 9x : Piu 1 :A 1 . Piu n :A n :A : F [8y 1 :A 0 1 : G 1 [ 8y p :A 0 p : G p [x y OE(1) y OE(n) M ] for some partial permutation OE from n into p. ....

Conal Elliott and Frank Pfenning. eLP: A Common Lisp implementation of Prolog in the Ergo Support System. Available via ftp over the Internet, October 1989. Send mail to elprequest @cs.cmu.edu on the Internet for further information.

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