Hello,
I'd need one example (or more) of a Prolog program written:
- using lists
and
- not using lists
The program could be, for example, in the domain of graphs, trees, or similar. My goal is to measure the execution speed of the two versions (with lists / without lists) of the program...
This site uses cookies to help personalise content, tailor your experience and to keep you logged in if you register.
By continuing to use this site, you are consenting to our use of cookies.