Project

Namespaces

Public Vars

tree-calculus.utilities

Helper definitions, mostly for testing and readability, but not fundamental.

Bit->bit

Given a tree calculus Bit, returns a Clojure/Java bit.

See also bit->Bit.

view source

bit->Bit

Given a Clojure/Java bit, returns a tree calculus Bit.

See also Bit->bit.

view source

Bite->Byte

(Bite->Byte B)

Given a tree calculus Bite B, returns a Clojure/Java Byte integer.

See also Byte->Bite.

view source

Byte->Bite

(Byte->Bite B)

Given a Clojure/Java Byte B, returns a tree calculus Bite.

See also Bite->Byte.

view source

Empty?

(Empty? L)

Returns true if tree calculus list L is empty.

view source

List->seq

(List->seq L)(List->seq L acc)

Given tree calculus List L, returns a Clojure sequence of elements.

view source

nat->tree

(nat->tree n)(nat->tree n t)

Given natural number n, returns a tree representation.

See also tree->nat.

view source

str->String

(str->String s)

Given Clojure/Java string s, returns a tree calculus String.

See also String->str.

view source

String->str

(String->str S)

Given tree calculus String S, returns a Clojure/Java string.

See also str->String.

view source

tree->nat

(tree->nat t)(tree->nat t n)

Given unlabelled binary tree t, returns equivalent natural number.

See also nat->tree.

view source

ΔΔ

Stem resulting from evaluating (Δ Δ).

view source

ΔΔΔ

Fork resulting from evaluating (Δ Δ Δ).

view source