knube 0.2.0

Simple expressions defined recursively.
Documentation 
1
2
3
4
5
6
7
8
9
10

//! # knube
//!
//! This crate contains an implementation of the Knuth-Bendix completion algorithm applied to
//! simple terms composed of constants, variables, and applications.
//!
//! Expressions are described in a very functional way, which is how we study them in class.

pub mod exp;

pub use exp::*;