List Prolog Interpreter is a version of Prolog that can be used to write algorithms with CAWMP  because the List Prolog algorithms are in list format.

For example:

        [       [[n,head],[[v,l],[v,h]]],
],[[[v,l], [3, 2, 1]]]).


Definite Clause Grammars in List Prolog are like base cases, e.g.


and a "bottom case" in case it is not at the end of the string, e.g.:


given the clause:


Functional List Prolog (FLP)Edit

Predicate names and variables may be substituted for variable names, e.g. in [[n,function],[[[n,function2],[2]],1,1,[v,c]]] function2 is passed as a variable.

Strong Type StatementsEdit

FLP may optionally use strong type statements, e.g.

,[[[[v,a], 1],[[v,b], "a"],[[v,c], [n,a]]]]).

Further Reading Edit

See also Text to Breasoning (formerly part of the List Prolog Interpreter Repository).

Community content is available under CC-BY-SA unless otherwise noted.