#graph #equivalence #rewriting #logic

nightly bin+lib logic-lang

structural logic based on equivalence graphs

2 releases

0.0.2 Feb 21, 2023
0.0.1 Feb 10, 2023

#1910 in Math

MIT license

14KB
225 lines

logic

Example

structural logic based on equivalence graphs

License Crate Docs Build


Logic is a modern structural logic library based on equivalence graphs. It allows defining a (term-based) language as an abstract syntax tree (AST) associated with rewriting rules expressing equivalence relations. Applying rules using equality saturation is performed by a three-stages process based on different "intermediate representations (IRs)".


Note: this is an exploratory project.

Current state

  • The public API is constantly evolving and substantial changes are expected prior to stable releases (x.0.0).
  • Feel free to suggest problems that could help to improve the library and provide realistic use cases.
  • Help is welcomed.

Getting started

An extensive tutorial is currently under construction, but you can still read the documentation for the latest version or browse the sources.

It is recommanded to use nightly Rust but Logic should build just fine on stable (MSRV 1.69). The standard cargo fmt, clippy, test and bench workflow is available.

Try the web demo running on WebAssembly.

Dependencies

~23KB