foliage-rs/src/lib.rs

mod ast;
pub mod format;
#[cfg(feature = "parse")]
pub mod parse;

pub use ast::*;
Initial commit This provides an abstract syntax tree for first-order logic with integer arithmetics. Initially, the following types of formulas are supported: - Booleans values (true and false) - predicates - negated formulas - comparisons of terms (<, ≤, >, ≥, =, ≠) - implications and biconditionals - conjunctions and disjunctions of formulas - existentially and universally quantified formulas In addition, these types of terms are provided: - Boolean values (true and false) - integers - strings - special integers (infimum and supremum) - symbolic functions - variables - binary operations (addition, subtraction, multiplication, division, modulo, exponentiation) - unary operations (absolute value, numeric negation) 2020-02-05 03:17:28 +01:00			`mod ast;`
			`pub mod format;`
Start reimplementing parser 2020-02-25 15:36:34 +01:00			`#[cfg(feature = "parse")]`
			`pub mod parse;`
Initial commit This provides an abstract syntax tree for first-order logic with integer arithmetics. Initially, the following types of formulas are supported: - Booleans values (true and false) - predicates - negated formulas - comparisons of terms (<, ≤, >, ≥, =, ≠) - implications and biconditionals - conjunctions and disjunctions of formulas - existentially and universally quantified formulas In addition, these types of terms are provided: - Boolean values (true and false) - integers - strings - special integers (infimum and supremum) - symbolic functions - variables - binary operations (addition, subtraction, multiplication, division, modulo, exponentiation) - unary operations (absolute value, numeric negation) 2020-02-05 03:17:28 +01:00
			`pub use ast::*;`