https://github.com/philzook58/egglog0
Datalog + Egg = Good
https://github.com/philzook58/egglog0
prolog rust theorem-prover
Last synced: 6 months ago
JSON representation
Datalog + Egg = Good
- Host: GitHub
- URL: https://github.com/philzook58/egglog0
- Owner: philzook58
- Created: 2021-07-21T18:52:07.000Z (about 4 years ago)
- Default Branch: main
- Last Pushed: 2023-05-31T19:09:56.000Z (over 2 years ago)
- Last Synced: 2025-04-04T11:36:53.658Z (7 months ago)
- Topics: prolog, rust, theorem-prover
- Language: Rust
- Homepage: http://www.philipzucker.com/egglog0/
- Size: 481 KB
- Stars: 66
- Watchers: 4
- Forks: 3
- Open Issues: 1
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
Defunct repo: Please see https://github.com/egraphs-good/egglog
# egglog0
Using the [egg](https://egraphs-good.github.io/) library with a file format and semantics similar to datalog.
Short talk proposal paper for EGRAPHS 2022
Explanatory blog posts:
-
-
## Try It Online!!!
## Building
To run on a file locally:
`cargo run --release tests/examples.pl`
To build the wasm library:
`wasm-pack build --target web`
Note: I started modifying egg a bit. I exposed the Subst datatypes field.
## Ideas
- [x] MultiApplier could be useful / efficient
- [ ] Using Conditional Equals could be useful if all variables known
- [ ] But really getting patterns to compile with substituion pieces considered known subsumes this optimization I think in modern egg with yihong's optimization.
- [ ] Sanity checks that needed variables exist would be good. when it does crash it names rules, so that's something.
- [ ] May want to run Runner multiple times since it may not get restarted. Currently I have that vec![0] hack
- [ ] _ for dummy variables
- [ ] The ability to check to see if something is in the egraph.
- [ ] graphviz dumping the egraph. graphviz wasm?
- [ ] harrop formula
- [ ] merge_subst that doesn't copy?
- [ ] Give rules names. Keep a hash table of them?
- [x] Queries with variables
- [x] Queries should be conjunctions
- [X] a REPL would be sweet. especially if we have higher order rules, we could watch the database, add queries
- [ ] termination based on the query condition
- [ ] side effectful searchers and appliers (printing mostly), functions.
- [ ] Astsize with weighting? Does that get me anywhere?
- [ ] infix operators
- [ ] better printers
- [ ] rewrite/proof files that allow intermediate queriess. set of support?
- [x] cli
- [ ] smtlib subset (forall (a b ) (= (f a) (g c)) ) ! :pattern) or horn cluase style.
- [ ] vaguely ML/coq style synax
- [ ] tptp syntax?
- [ ] push pop directives instead of clear.
- [ ] only allow stuff that compresses the egraph? Appliers that do not add terms to the egraph or only add a couple? Or keeps counts.
- [ ] directives to changes egraph params. or flags?
- [ ] Macros/simplification stage?
- [ ] typed symbollang - would this even be an optimization?
- [ ] defunctionalization of lambdas. lambda-egglog
- [ ] backchain until stumped? depth limitted backchain?
- [ ] hashlog - experiment with same thing but on hashcons instead of egraph. Easier to understand semi naive?
- [ ] epeg extraction
- [ ] faster multipattern via compilation
- [ ] integerate analysis?
- [ ] gensym
- [ ] serialize the egraph
- [ ] negation checks. nonlogical
- [ ] cli options to the runner
### Tests
`cram tests/cram/*.t -i`