russell@unturf.com
e2a74832ef
Minimal, monospace, readable. Works as a drop-in docroot for
any static server (nginx, caddy, python -m http.server, etc.).
Light/dark mode via prefers-color-scheme. No JS, no fonts, no
third-party anything.
Files:
www/index.html landing page (tagline, get-it, four-tier
table, portal summary, EML proof blurb,
license, whitepaper CTA)
www/style.css ~150 lines, CSS vars for theming
www/robots.txt allow everything
www/404.html referenced by servers that support custom
error pages
www/whitepaper.pdf -> ../whitepaper/lumbda-whitepaper.pdf
(symlink — one source of truth, rebuilds
via `make whitepaper` auto-propagate)
Smoke-tested with python3 -m http.server: 200 on /,
Content-Type: application/pdf for /whitepaper.pdf,
Content-Length matches the current 2.67 MB PDF,
/robots.txt serves, /nonexistent returns 404.
No new build step — docroot is pure static files the existing
whitepaper target already produces. A web server configured
with docroot=www/ and fallback 404.html has a working lumbda.com
today.
89 lines
4.4 KiB
HTML
89 lines
4.4 KiB
HTML
<!doctype html>
|
|
<html lang="en">
|
|
<head>
|
|
<meta charset="utf-8">
|
|
<meta name="viewport" content="width=device-width,initial-scale=1">
|
|
<title>Lumbda — feedback is the primitive</title>
|
|
<meta name="description" content="Lumbda is a Lisp/Scheme-derived language with four execution backends (Python, Python bytecode VM, C + x86_64 JIT, pure x86_64 assembly), full first-class continuations, portal-based state migration, and a formally verified universality proof.">
|
|
<link rel="stylesheet" href="style.css">
|
|
</head>
|
|
<body>
|
|
|
|
<header>
|
|
<h1>Lumbda</h1>
|
|
<p class="tagline">feedback is the primitive</p>
|
|
</header>
|
|
|
|
<main>
|
|
|
|
<section id="what">
|
|
<p class="lead">
|
|
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 <code>.lsp</code> source byte-identically, with full first-class continuations, exact rationals, records, and hygienic macros.
|
|
</p>
|
|
</section>
|
|
|
|
<section id="quick">
|
|
<h2>Get it</h2>
|
|
<pre><code>git clone https://git.unturf.com/engineering/unturf/lumbda.git
|
|
cd lumbda
|
|
make test-all</code></pre>
|
|
<p>Run a program in any tier:</p>
|
|
<pre><code>python3 lumbda.py --fast examples/fibonacci.lsp
|
|
./c/lumbda examples/fibonacci.lsp
|
|
./asm/lumbda < examples/fibonacci.lsp</code></pre>
|
|
</section>
|
|
|
|
<section id="tiers">
|
|
<h2>Four tiers, one language</h2>
|
|
<table>
|
|
<thead><tr><th>Tier</th><th>Lines</th><th>Binary</th><th>What it’s for</th></tr></thead>
|
|
<tbody>
|
|
<tr><td>Python interpreter + bytecode VM</td><td>3,743</td><td>—</td><td>REPL hackability, debugging, reference</td></tr>
|
|
<tr><td>C tree-walker + bytecode VM</td><td>9,164</td><td>~215 KB</td><td>deep recursion, production workloads</td></tr>
|
|
<tr><td>C + x86_64 JIT</td><td>+patches</td><td>~215 KB</td><td>7–10× faster than CPython on recursive workloads</td></tr>
|
|
<tr><td>Pure x86_64 assembly</td><td>6,645</td><td>~23 KB</td><td>zero-dependency boot, auditability, embedded</td></tr>
|
|
<tr><td>Assembly + naive mark-sweep GC + meta-GC arena</td><td>(same source, <code>GC_NAIVE=1</code>)</td><td>~27 KB</td><td>bounded memory without manual arena discipline</td></tr>
|
|
</tbody>
|
|
</table>
|
|
</section>
|
|
|
|
<section id="portal">
|
|
<h2>Portal: feedback across time</h2>
|
|
<p>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:</p>
|
|
<ul>
|
|
<li><strong>S-expression portal</strong> — Scheme source as the wire protocol. 16 of 16 producer×consumer cells green across Python, C, asm no-GC, and asm GC.</li>
|
|
<li><strong>JSON portal</strong> — graph-aware, preserves closures and live continuations (Python, C).</li>
|
|
<li><strong>Binary heap dump</strong> — asm only. 1.5 ms save+resume between two processes.</li>
|
|
</ul>
|
|
</section>
|
|
|
|
<section id="proof">
|
|
<h2>The EML universality proof</h2>
|
|
<p>A single operator <code>eml(x, y) = exp(x) − ln(y)</code> with the constant 1 generates all elementary functions: <code>exp</code>, <code>ln</code>, arithmetic, negation, complex-plane access, trigonometry. Verified numerically in Python, verified in Lumbda’s own bytecode, proven formally in Lean 4 with zero <code>sorry</code>. 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.</p>
|
|
</section>
|
|
|
|
<section id="doc">
|
|
<h2>Read the whitepaper</h2>
|
|
<p>Full language reference, tier-by-tier architecture, benchmarks, the meta-GC design, and the universality proof.</p>
|
|
<p><a class="cta" href="whitepaper.pdf">Lumbda whitepaper (PDF, ~2.7 MB)</a></p>
|
|
</section>
|
|
|
|
<section id="license">
|
|
<h2>License</h2>
|
|
<p>AGPL-3.0-only. Public domain for whitepapers, proofs, and disclosures through <a href="https://undefect.com">undefect.com</a>. Companion to <a href="https://unturf.com">unturf.com</a>’s permacomputer project.</p>
|
|
</section>
|
|
|
|
</main>
|
|
|
|
<footer>
|
|
<p>
|
|
<a href="https://git.unturf.com/engineering/unturf/lumbda">source</a>
|
|
·
|
|
<a href="whitepaper.pdf">whitepaper</a>
|
|
·
|
|
<a href="https://unturf.com">unturf.com</a>
|
|
</p>
|
|
</footer>
|
|
|
|
</body>
|
|
</html>
|