rishi/scryer-prolog
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

update README

Browse Source
This commit is contained in:
Mark Thom
2017-12-22 12:39:35 -07:00
parent efa8756177
commit f8555682d0
1 changed files with 18 additions and 11 deletions
Download Patch File Download Diff File Expand all files Collapse all files

29
README.md
View File

@@ -2,14 +2,14 @@
## Phase 1 ## Phase 1
An implementation of the Warren Abstract Machine in Rust, done Produce an implementation of the Warren Abstract Machine in Rust, done
according to the progression of languages in [Warren's Abstract according to the progression of languages in [Warren's Abstract
Machine: A Tutorial Machine: A Tutorial
Reconstruction](http://wambook.sourceforge.net/wambook.pdf). Reconstruction](http://wambook.sourceforge.net/wambook.pdf).
Phase 1 has been completed, in that rusty-wam implements in some form Phase 1 has been completed in that rusty-wam implements in some form
all of the WAM book, including lists, cuts, Debray allocation, first all of the WAM book, including lists, cuts, Debray allocation, first
argument indexing, and conjunctive queries. argument indexing, last call optimization and conjunctive queries.
## Phase 2 ## Phase 2
@@ -48,18 +48,25 @@ There are no current plans to implement any of these, but they might be
nice to have in the future. They'd make a good project for anyone wanting nice to have in the future. They'd make a good project for anyone wanting
to contribute code to rusty-wam. to contribute code to rusty-wam.
1. Add the global analysis techniques of Peter van Roy's thesis, "Can 1. Implement the global analysis techniques described in Peter van
Logic Programming Execute as Fast as Imperative Programming?" Roy's thesis, "Can Logic Programming Execute as Fast as Imperative
Programming?"
2. Add unum representation and arithmetic, as described in Gustafson's 2. Add unum representation and arithmetic, using either an existing
book "The End of Error." unum implementation or an ad hoc one. Unums are described in
Gustafson's book "The End of Error."
3. Add support for shift/reset delimited continuations, see "Delimited Continuations 3. Add support for shift/reset delimited continuations, see "Delimited
for Prolog." Continuations for Prolog."
4. Add an incremental compacting garbage collector the heap. 4. Add an incremental compacting garbage collector for the heap.
5. Add a concurrent atom table. 5. Add concurrent tables to manage shared references to atoms and
strings.
6. Add optional SLG resolution for fast memoization of predicates.
7. Add some form of JIT predicate indexing.
## Built-in predicates ## Built-in predicates