trlisp version 0
Released under the MIT License
A Lisp-y implementation of B. Jay's unlabelled binary tree calculus.
Installation
To install, add the following dependency to your project or build file:
[com.sagevisuals/trlisp "version 0"]
Namespaces
tree-calculus.definers
Utilities to define values and functions with out-of-band docstrings.
Public variables and functions:
tree-calculus.definitions
Exploring Tree Calculus discovered by Professor Barry Jay.
Public variables and functions:
- And
- Append
- Apply
- B
- BF
- Bite
- C
- D
- d
- Divide
- Equal?
- Equal?-Variant
- error
- Extension
- Extension-2
- False
- First
- Fold-Left
- Fold-Right
- Fork?
- Fork?-2
- Get-Tag
- I
- Iff
- Implies
- K
- Leaf?
- List
- Map
- Minus
- Mult-Apply
- Not
- Or
- Pair
- Plus
- Predecessor
- Quote
- RB
- Reverse
- RF
- Root
- S
- Second
- Self-Apply
- Size
- Size-Variant
- Stem?
- Stem?-2
- Successor
- Swap
- T-Cons
- T-Head
- T-Nil
- T-Tail
- Tag
- Times
- Triage
- True
- Type-Check
- Typed-App
- Un-Tag
- W
- Y
- Y-t
- Zero?
- Δ
tree-calculus.utilities
Helper definitions, mostly for testing and readability, but not fundamental.
Public variables and functions: