A Lambda Calculus implementation in Clojure.
It provides a λ macro for
writing lambda terms directly, along with capture-avoiding β-reduction, and
a library of terms built on top of it: Church booleans, numerals, pairs,
and lists, arbitrary-precision-style integers and rationals, classic
combinators (Y, Θ, S, K, I, B, C, W, T, M, V), and conversions between
these terms and native Clojure values.
Can you improve this documentation? These fine people already did:
VsSekorin & Vseslav SekorinEdit on GitHub
cljdoc builds & hosts documentation for Clojure/Script libraries
| Ctrl+k | Jump to recent docs |
| ← | Move to previous article |
| → | Move to next article |
| Ctrl+/ | Jump to the search field |