confluin does confluence checks for Tamarin input files
-
Updated
May 23, 2018 - Python
confluin does confluence checks for Tamarin input files
Pure node server + JaxMaTe client
Rust simulations using input/output examples to learn typed first-order term rewriting systems that perform list routines.
A comprehensive analyzer for term rewriting systems.
Writing SMT-LIB Standard programs with Haskell.
A public flat live persistent globally distributed functional symbolic artifact computation engine based on term rewriting
incremental tree transformers
The overall aim of this project is to create a term rewriting system that could be useful in everyday programming, and to represent data in a way that roughly correspond to the definition of a term in formal logic. Terms should be familiar to any programmer because they are basically constants, variables, and function symbols.
A experimental prover written in Common Lisp, based on clause resolution and Knuth-Bendix completion algorithm.
A simple e-graph implementation for educational purposes
Tools for permutations of associative elliptic curve operations using term rewriting
rewriting ELBO: variational inference using symbolic rewriting techniques
A library for first-order term-rewriting
Fully in-browser IDE and rule engine for L4 (a DSL for the law), along with various language binding libraries
クヌース・ベンディックス完備化アルゴリズムの OCaml 実装
MIRROR of https://codeberg.org/catseye/Arboretuum : A forest-rewriting language; precursor to Treacle.
Add a description, image, and links to the term-rewriting topic page so that developers can more easily learn about it.
To associate your repository with the term-rewriting topic, visit your repo's landing page and select "manage topics."