Documentation

The terms of our logical language.

The abstract type of variables. As a consumer you should never feel the urge to manipulate these directly.

Equating two terms will attempt to unify them and backtrack if this is impossible.

The opposite of unification. If any future unification would cause these two terms to become equal we'll backtrack.

Generate a fresh (not rigid) term to use for our program.

Conjunction. This will return solutions that satsify both the first and second predicate.

Disjunction. This will return solutions that satisfy either the first predicate or the second.

The Eeyore of predicates, always fails. This is mostly useful as a way of pruning out various conditions, as in conj (a === b) failure. This is also an identity for disconj.

The Tigger of predicates! always passes. This isn't very useful on it's own, but is helpful when building up new combinators. This is also an identity for conj.

The goal that this logic program is trying to create. This is occasionally useful when we're doing generating programs.

Run a program and find all solutions for the parametrized term.