(lookup returned VAL_FALSE. Try the home page or read the whitepaper.)
diff --git a/www/404.html b/www/404.html new file mode 100644 index 0000000..10e25d1 --- /dev/null +++ b/www/404.html @@ -0,0 +1,21 @@ + + +
+ + +that path resolved to nil
+(lookup returned VAL_FALSE. Try the home page or read the whitepaper.)
feedback is the primitive
+
+Lumbda is a Lisp/Scheme-derived language with four independently implemented execution backends sharing one surface syntax and one test suite. A Python tree-walker with an optional bytecode VM, a C implementation that adds an x86_64 JIT, and a pure x86_64 assembly interpreter (~6,600 lines of GNU assembler, ~23 KB stripped, zero external dependencies). Every backend runs the same .lsp source byte-identically, with full first-class continuations, exact rationals, records, and hygienic macros.
+
git clone https://git.unturf.com/engineering/unturf/lumbda.git
+cd lumbda
+make test-all
+Run a program in any tier:
+python3 lumbda.py --fast examples/fibonacci.lsp
+./c/lumbda examples/fibonacci.lsp
+./asm/lumbda < examples/fibonacci.lsp
+| Tier | Lines | Binary | What it’s for |
|---|---|---|---|
| Python interpreter + bytecode VM | 3,743 | — | REPL hackability, debugging, reference |
| C tree-walker + bytecode VM | 9,164 | ~215 KB | deep recursion, production workloads |
| C + x86_64 JIT | +patches | ~215 KB | 7–10× faster than CPython on recursive workloads |
| Pure x86_64 assembly | 6,645 | ~23 KB | zero-dependency boot, auditability, embedded |
| Assembly + naive mark-sweep GC + meta-GC arena | (same source, GC_NAIVE=1) | ~27 KB | bounded memory without manual arena discipline |
A continuation is feedback within a process. A portal is feedback across processes. Same primitive, different scope: capture machine state, serialize it, reload it elsewhere, resume. Lumbda ships three portal formats with different trade-offs:
+A single operator eml(x, y) = exp(x) − ln(y) with the constant 1 generates all elementary functions: exp, ln, arithmetic, negation, complex-plane access, trigonometry. Verified numerically in Python, verified in Lumbda’s own bytecode, proven formally in Lean 4 with zero sorry. Lumbda’s native symbolic-rewrite checker runs the five theorems in 46 ms cold or 7 ms cached — roughly 16× faster than Lean’s cold rebuild on the same hardware.
Full language reference, tier-by-tier architecture, benchmarks, the meta-GC design, and the universality proof.
+ +AGPL-3.0-only. Public domain for whitepapers, proofs, and disclosures through undefect.com. Companion to unturf.com’s permacomputer project.
+