v0.1.0

Recursor 0.1.0

A universal natural-number DSL for program synthesis and evolution, with
lambda compilation and Lean-checked formal semantics.

• Evaluate programs directly or compile them to closed lambda terms.
• Combine bounded recursion, history access and unbounded iteration.
• Parse, inspect, generate, mutate and cross over programs with lexical scope.
• Run evolutionary searches and visualize program structure and ancestry.
• Translate counter machines and mathlib partial-recursive codes into the DSL.
• Check the packaged operational proofs and denotational universality theorem
  with Lean, including axiom auditing and kernel replay.

Includes 61 documentation pages, computational tutorials and a runnable
walkthrough. Requires Wolfram Language 15.0 or later. Released under the MIT
license.

The formal theorems concern their specified models. Equivalence of the Wolfram
interpreter and lambda compiler to those models remains a separate proof
obligation. Execution budgets do not establish nontermination.

The release contains the paclet, SHA-256 checksums, build provenance and the
PacletPage documentation build. Publication reuses the archive verified by CI.