| Age | Commit message (Collapse) | Author | |
|---|---|---|---|
| 2021-07-20 | Add a bit of a hack to the parser so it can parse (a) op arg when a is an ↵ | Peter Mikkelsen | |
| operator | |||
| 2021-07-16 | Handle -d option in prolog | Peter Mikkelsen | |
| 2021-07-16 | Implement a bit more of prolog flag predicates set_prolog_flag/2 and ↵ | Peter Mikkelsen | |
| current_prolog_flag/2 | |||
| 2021-07-16 | Replace the C repl with one written in prolog :) | Peter Mikkelsen | |
| 2021-07-16 | Make operators local to each module, and implement some more correct ↵ | Peter Mikkelsen | |
| prettyprint code, used by write_term | |||
| 2021-07-09 | Add asserta/1, assertz/1, retract/1, abolish/1 (and retract_one/1, which is ↵ | Peter Mikkelsen | |
| retract/1 but doesn't backtrack) | |||
| 2021-07-08 | Add current_predicate/1 builtin | Peter Mikkelsen | |
| 2021-07-08 | Make the repl bindings and query global so the garbage collector can know ↵ | Peter Mikkelsen | |
| about them | |||
| 2021-07-08 | Add clause/2 predicate | Peter Mikkelsen | |
| 2021-07-07 | Add copy_term/2 | Peter Mikkelsen | |
| 2021-07-06 | Store the calling module in each goal, and fix a bug where unification could ↵ | Peter Mikkelsen | |
| leave behind some bindings even though the unification failed. | |||
| 2021-07-06 | Group clauses into predicates, and create all valid choicepoints at once. ↵ | Peter Mikkelsen | |
| This is wastefull if one branch loops forever, but it is much nicer otherwise, since we know the choicepoints only gets created as long as their head is unifiable with the goal. | |||
| 2021-07-05 | Turn integers and floats into seperate term types | Peter Mikkelsen | |
| 2021-07-05 | First step on modules. Still very very rough. | Peter Mikkelsen | |
| 2021-07-03 | Make the goalstack global just like the choicestack | Peter Mikkelsen | |
| 2021-07-03 | Add one global choicestack so we don't need to pass it around | Peter Mikkelsen | |
| 2021-07-02 | Remove strings, and add a (currently not changable) flag 'double_quotes' ↵ | Peter Mikkelsen | |
| which defines how double quoted strings are stored. | |||
| 2021-07-01 | Add exceptions :) implement catch/3 and throw/1 | Peter Mikkelsen | |
| 2021-06-30 | Add comparison predicates | Peter Mikkelsen | |
| 2021-06-30 | Add support for builtins, and implement true/0, fail/0, call/1, and !/0 builtins | Peter Mikkelsen | |
| 2021-06-30 | Add a basic repl | Peter Mikkelsen | |
| 2021-06-30 | Add backtracking to the evaluator. This means we have to keep track of ↵ | Peter Mikkelsen | |
| choicepoints which is implemented the easy but wasteful way for now. I have also added a number which is used to differentiate variables from different application of the clauses. | |||
| 2021-06-29 | Understand :-initialization(Goal) directive | Peter Mikkelsen | |
| 2021-06-29 | Add a term parser. | Peter Mikkelsen | |
| 2021-06-28 | Initial commit. Start working on a new prolog implementation for 9front, now ↵ | Peter Mikkelsen | |
| that I at least have a better understanding of what goes into a compiler :) | |||
| index : pprolog | ||
| A new prolog interpreter for Plan 9. Replaces the old pprolog project. |
| summaryrefslogtreecommitdiff |