Git Product home page Git Product logo

rust-prolog's Introduction

Overview

Rust implementation of prolog (originally) based on miniprolog: http://andrej.com/plzoo/html/miniprolog.html

I translated miniprolog from the above SML sources to Rust for two primary reasons:

  • Firstly, I wanted a project to explore programming in Rust
  • Secondly, prolog is interesting but I never felt like I properly learned it

Starting from an existing implementation was nice because it shortened the time to a working version. The current version in this repository is very much a work in progress and overly simplistic. I plan to improve it to better learn Rust and I plan to improve it as I learn Rust :)

In other words, this is really a playground for me to play with both Rust and prolog.

Installation

Tested on Linux (Fedora), OSX, and Windows.

Should be as simple as: cargo run

Example

$ cargo run
Welcome to rust-prolog!
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 "src/likes.pl"
Prolog> ?- likes(X,Y).
Y = mary
X = john 

more? (y/n) [y] 

Roadmap

I haven't figured out exactly which directions I want to take this in, but some ideas I've been kicking around include:

  • Add a type system
  • Add constraints and constraint checker.
  • Add a bottom-up search procedure (perhaps even replace the existing top-down search procedure entirely).
  • Add program transformations to generate more efficient queries (for instance, magic sets and entailment elimination).
  • Change the syntax to one that supports mixfix declarations.

Completed:

  • Change the search procedure to a complete search. This is now done. It uses iterative deepening with an admissable heuristic that does a lower bound estimate on the number of unifications required to solve the current goal. It also generates contrapositives (instead of using restarts).
  • Add more primitive types, lists, numbers, etc and make a small standard library.
  • Improve the garbage collection. Currently cycles are allowed but due to the hash consing, nothing is ever collected. A simple scheme that should allow some collection is to throw away terms generated by unification and terms that are part of a query after the query has terminated. This should lend itself to a simplistic form of regions.

Old goals that I may not pursue after all:

  • Compile to the Warren Abstract Machine. The reason I've reconsidered this one is because my search procedure is slowing moving towards a more general constraint logic search procedure. The WAM is still rather elegant and I may follow the development at some point and see if I can adapt it to fit the general CPL algorithm. Perhaps someone else has already done this work.

rust-prolog's People

Contributors

dagit avatar theotherphil avatar

Stargazers

 avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar

Watchers

 avatar  avatar  avatar  avatar  avatar  avatar

rust-prolog's Issues

Add a license

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

Add a license

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

improve list syntax sugar

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)...)

Reduce the amount of copying during search

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.

incomplete search results

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))).

Recommend Projects

  • React photo React

    A declarative, efficient, and flexible JavaScript library for building user interfaces.

  • Vue.js photo Vue.js

    ๐Ÿ–– Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.

  • Typescript photo Typescript

    TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

  • TensorFlow photo TensorFlow

    An Open Source Machine Learning Framework for Everyone

  • Django photo Django

    The Web framework for perfectionists with deadlines.

  • D3 photo D3

    Bring data to life with SVG, Canvas and HTML. ๐Ÿ“Š๐Ÿ“ˆ๐ŸŽ‰

Recommend Topics

  • javascript

    JavaScript (JS) is a lightweight interpreted programming language with first-class functions.

  • web

    Some thing interesting about web. New door for the world.

  • server

    A server is a program made to process requests and deliver data to clients.

  • Machine learning

    Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.

  • Game

    Some thing interesting about game, make everyone happy.

Recommend Org

  • Facebook photo Facebook

    We are working to build community through open source technology. NB: members must have two-factor auth.

  • Microsoft photo Microsoft

    Open source projects and samples from Microsoft.

  • Google photo Google

    Google โค๏ธ Open Source for everyone.

  • D3 photo D3

    Data-Driven Documents codes.