russell@unturf.com
718f878f7d
CLAUDE.md rewritten to avoid the verb "to be" and to prefer "a"/"our"
over "the" when a thing counts as one of many or as shared. Same rule
applied to www/index.html (tagline now "feedback as a primitive", body
prose cleaned of is/are/be, table header now "What a tier buys",
section heads trimmed of definite articles). Monospace body stays,
ChunkFive titles stay.
Whitepaper now ships in two formats:
* Makefile target `make whitepaper-html` runs rst2html5 with
embedded minimal.css + responsive.css (docutils bundled), then
injects the same uncloseai.js module script that the homepage
carries, and stamps a meaningful <title>. 180 KB self-contained.
* PDF build target renamed to `make whitepaper-pdf`;
`make whitepaper` now builds both.
www/lumbda-whitepaper.html symlinks to the generated HTML (same
pattern as the PDF symlink). .gitlab-ci.yml resolves both symlinks to
real files before rsync so the proxy gets byte-identical copies.
Homepage now exposes both formats side-by-side via two .cta buttons
and the footer lists HTML + PDF.
95 lines
4.6 KiB
HTML
95 lines
4.6 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 as a primitive</title>
|
|
<meta name="description" content="Lumbda — a Lisp/Scheme-derived language with four execution backends (Python, Python bytecode VM, C + x86_64 JIT, pure x86_64 GNU asm), full first-class continuations, portal-based state migration, and a formally verified universality proof.">
|
|
<link rel="stylesheet" href="style.css">
|
|
<script src="https://uncloseai.com/uncloseai.js" type="module"></script>
|
|
</head>
|
|
<body>
|
|
|
|
<header>
|
|
<h1>Lumbda</h1>
|
|
<p class="tagline">feedback as a primitive</p>
|
|
</header>
|
|
|
|
<main>
|
|
|
|
<section id="what">
|
|
<p class="lead">
|
|
Lumbda names a Lisp/Scheme-derived language carrying four independently implemented execution backends — one surface syntax, 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 GNU asm interpreter (~6,600 lines, ~23 KB stripped, zero external dependencies). Every backend runs a shared <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 a tier buys</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 GNU asm</td><td>6,645</td><td>~23 KB</td><td>zero-dependency boot, auditability, embedded</td></tr>
|
|
<tr><td>GNU asm + 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 carries feedback within a process. A portal carries feedback across processes. Same primitive, different scope: capture machine state, serialize, reload elsewhere, resume. Lumbda ships three portal formats with distinct trade-offs:</p>
|
|
<ul>
|
|
<li><strong>S-expression portal</strong> — Scheme source as a 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>EML universality proof</h2>
|
|
<p>A single operator <code>eml(x, y) = exp(x) − ln(y)</code> with a 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 five theorems in 46 ms cold or 7 ms cached — roughly 16× faster than Lean's cold rebuild on identical hardware.</p>
|
|
</section>
|
|
|
|
<section id="doc">
|
|
<h2>Whitepaper</h2>
|
|
<p>Full language reference, tier-by-tier architecture, benchmarks, meta-GC design, universality proof.</p>
|
|
<p>
|
|
<a class="cta" href="lumbda-whitepaper.html">Read in browser (HTML)</a>
|
|
<a class="cta" href="lumbda-whitepaper.pdf">Download 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="lumbda-whitepaper.html">whitepaper (HTML)</a>
|
|
·
|
|
<a href="lumbda-whitepaper.pdf">whitepaper (PDF)</a>
|
|
·
|
|
<a href="https://unturf.com">unturf.com</a>
|
|
</p>
|
|
</footer>
|
|
|
|
</body>
|
|
</html>
|