MIRROR of https://codeberg.org/catseye/Treacle : A compiler-definition language based on "context rewriting"
-
Updated
Aug 19, 2014 - Scheme
MIRROR of https://codeberg.org/catseye/Treacle : A compiler-definition language based on "context rewriting"
MIRROR of https://codeberg.org/catseye/Arboretuum : A forest-rewriting language; precursor to Treacle.
A tool for the transformation of an irreversible Term Rewriting System into a reversible one
A toy language based on rewriting using code from Baader and Nipkow.
Tools for permutations of associative elliptic curve operations using term rewriting
Neural-Network Guided Expression Transformation
confluin does confluence checks for Tamarin input files
A library for first-order term-rewriting
Rust simulations using 2AFC triads to learn formal systems as typed first-order term rewriting systems
Algebraic simplification in Julia
Writing SMT-LIB Standard programs with Haskell.
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.
Tools for rapid prototyping of DSL compilers
a Rust implementation of first-order term rewriting systems (TRS)
an implementation of mlatu in C++ with a goal towards performance
rewriting ELBO: variational inference using symbolic rewriting techniques
Rust simulations using input/output examples to learn typed first-order term rewriting systems that perform list routines.
A experimental prover written in Common Lisp, based on clause resolution and Knuth-Bendix completion algorithm.
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."