dagit / rust-prolog Goto Github PK

This is a place holder to remind me to learn how to write tests.

Currently [H|T] is sugar for cons(H,T), but this syntax should be more general and allow this form:

[H1, H2, ..., Hn | T]

Which translates to:

cons(H1, cons(H2, ..., cons(Hn, T)...)

The current implementation of search makes unnecessary copies. Can these be converted to moves? What other optimizations are possible? Find a way to benchmark the before and after effects.

It would be great to have this code licensed to more freely enable the use of some of this code in other projects (I'm particularly looking at the lexing/parsing code). The MIT License would be my personal suggestion

Welcome to miniprolog!
This prolog interpreter is based on the ML code at the PLZoo:
  http://andrej.com/plzoo/html/miniprolog.html

Input syntax: 
    ?- query.            Make a query.
    a(t1, ..., tn).      Assert an atomic proposition.
    A :- B1, ..., Bn.    Assert an inference rule.
    $quit                Exit interpreter.
    $use "filename"      Execute commands from a file.
Prolog> $use "prelude.pl"
Prolog> ?-append(X,Y,cons(a,cons(b,cons(c,cons(d,nil))))).
Y = cons(a, cons(b, cons(c, cons(d, nil))))
X = nil 

more? (y/n) [y] 
No
Prolog> 

This should give more answers, such as X = cons(a,nil), Y = cons(b, cons(c, cons(d, nil))).

It would be great to have this code licensed to more freely enable the use of some of this code in other projects (I'm particularly looking at the lexing/parsing code). The MIT License would be my personal suggestion