co-lambda 0.5.0.post1.dev0__tar.gz

co_lambda-0.5.0.post1.dev0/.gitignore

@@ -0,0 +1,247 @@
+# Byte-compiled / optimized / DLL files
+__pycache__/
+*.py[codz]
+*$py.class
+
+# C extensions
+*.so
+
+# Distribution / packaging
+.Python
+build/
+develop-eggs/
+dist/
+downloads/
+eggs/
+.eggs/
+lib/
+lib64/
+parts/
+sdist/
+var/
+wheels/
+share/python-wheels/
+*.egg-info/
+.installed.cfg
+*.egg
+MANIFEST
+
+# PyInstaller
+#  Usually these files are written by a python script from a template
+#  before PyInstaller builds the exe, so as to inject date/other infos into it.
+*.manifest
+*.spec
+
+# Installer logs
+pip-log.txt
+pip-delete-this-directory.txt
+
+# Unit test / coverage reports
+htmlcov/
+.tox/
+.nox/
+.coverage
+.coverage.*
+.cache
+nosetests.xml
+coverage.xml
+*.cover
+*.py.cover
+.hypothesis/
+.pytest_cache/
+cover/
+
+# Translations
+*.mo
+*.pot
+
+# Django stuff:
+*.log
+local_settings.py
+db.sqlite3
+db.sqlite3-journal
+
+# Flask stuff:
+instance/
+.webassets-cache
+
+# Scrapy stuff:
+.scrapy
+
+# Sphinx documentation
+**/docs/_build/
+**/docs/api/
+
+# PyBuilder
+.pybuilder/
+target/
+
+# Jupyter Notebook
+.ipynb_checkpoints
+.jupyter_ystore.db
+
+# IPython
+profile_default/
+ipython_config.py
+
+# pyenv
+#   For a library or package, you might want to ignore these files since the code is
+#   intended to run in multiple environments; otherwise, check them in:
+# .python-version
+
+# pipenv
+#   According to pypa/pipenv#598, it is recommended to include Pipfile.lock in version control.
+#   However, in case of collaboration, if having platform-specific dependencies or dependencies
+#   having no cross-platform support, pipenv may install dependencies that don't work, or not
+#   install all needed dependencies.
+#Pipfile.lock
+
+# UV
+#   Similar to Pipfile.lock, it is generally recommended to include uv.lock in version control.
+#   This is especially recommended for binary packages to ensure reproducibility, and is more
+#   commonly ignored for libraries.
+#uv.lock
+
+# poetry
+#   Similar to Pipfile.lock, it is generally recommended to include poetry.lock in version control.
+#   This is especially recommended for binary packages to ensure reproducibility, and is more
+#   commonly ignored for libraries.
+#   https://python-poetry.org/docs/basic-usage/#commit-your-poetrylock-file-to-version-control
+#poetry.lock
+#poetry.toml
+
+# pdm
+#   Similar to Pipfile.lock, it is generally recommended to include pdm.lock in version control.
+#   pdm recommends including project-wide configuration in pdm.toml, but excluding .pdm-python.
+#   https://pdm-project.org/en/latest/usage/project/#working-with-version-control
+#pdm.lock
+#pdm.toml
+.pdm-python
+.pdm-build/
+
+# pixi
+#   Similar to Pipfile.lock, it is generally recommended to include pixi.lock in version control.
+#pixi.lock
+#   Pixi creates a virtual environment in the .pixi directory, just like venv module creates one
+#   in the .venv directory. It is recommended not to include this directory in version control.
+.pixi
+
+# PEP 582; used by e.g. github.com/David-OConnor/pyflow and github.com/pdm-project/pdm
+__pypackages__/
+
+# Celery stuff
+celerybeat-schedule
+celerybeat.pid
+
+# SageMath parsed files
+*.sage.py
+
+# Environments
+.env
+.venv
+env/
+venv/
+ENV/
+env.bak/
+venv.bak/
+
+# Spyder project settings
+.spyderproject
+.spyproject
+
+# Rope project settings
+.ropeproject
+
+# mkdocs documentation
+/site
+
+# mypy
+.mypy_cache/
+.dmypy.json
+dmypy.json
+
+# Pyre type checker
+.pyre/
+
+# pytype static type analyzer
+.pytype/
+
+# Cython debug symbols
+cython_debug/
+
+# PyCharm
+#  JetBrains specific template is maintained in a separate JetBrains.gitignore that can
+#  be found at https://github.com/github/gitignore/blob/main/Global/JetBrains.gitignore
+#  and can be added to the global gitignore or merged into this file.  For a more nuclear
+#  option (not recommended) you can uncomment the following to ignore the entire idea folder.
+#.idea/
+
+# Abstra
+# Abstra is an AI-powered process automation framework.
+# Ignore directories containing user credentials, local state, and settings.
+# Learn more at https://abstra.io/docs
+.abstra/
+
+# Visual Studio Code
+#  Visual Studio Code specific template is maintained in a separate VisualStudioCode.gitignore 
+#  that can be found at https://github.com/github/gitignore/blob/main/Global/VisualStudioCode.gitignore
+#  and can be added to the global gitignore or merged into this file. However, if you prefer, 
+#  you could uncomment the following to ignore the entire vscode folder
+# .vscode/
+
+# Ruff stuff:
+.ruff_cache/
+
+# PyPI configuration file
+.pypirc
+
+# Cursor
+#  Cursor is an AI-powered code editor. `.cursorignore` specifies files/directories to
+#  exclude from AI features like autocomplete and code analysis. Recommended for sensitive data
+#  refer to https://docs.cursor.com/context/ignore-files
+.cursorignore
+.cursorindexingignore
+
+# Marimo
+marimo/_static/
+marimo/_lsp/
+__marimo__/
+
+.direnv/
+.devenv/
+result
+
+# devenv/nixago scaffolding regenerated by running `nix develop` in a paper subdirectory
+# (the canonical copies live at the repository root)
+/papers/co-lambda/.envrc
+/papers/co-lambda/.gitattributes
+/papers/co-lambda/.vscode/
+
+# LaTeX
+*.pdf
+*.aux
+*.fls
+*.fdb_latexmk
+*.synctex.gz
+*.bbl
+*.blg
+*.out
+*.dvi
+*.xcp
+
+# Local data
+data/
+trajectory/
+experiment_results.db
+
+.playwright-mcp/
+*.local.*
+.envrc.private
+.pre-commit-config.yaml
+
+# nixago: ignore-linked-files
+/.vscode/extensions.json
+
+arxiv-submission.tar.gz
+node_modules/
+comment.cut

co_lambda-0.5.0.post1.dev0/PKG-INFO

@@ -0,0 +1,84 @@
+Metadata-Version: 2.4
+Name: co-lambda
+Version: 0.5.0.post1.dev0
+Summary: A least-fixpoint first-order-shape-relation interpreter for the lambda-calculus
+Project-URL: Repository, https://github.com/Atry/MIXINv2
+Author-email: "Yang, Bo" <yang-bo@yang-bo.com>
+License-Expression: MIT
+Classifier: Development Status :: 3 - Alpha
+Classifier: License :: OSI Approved :: MIT License
+Classifier: Programming Language :: Python :: 3.13
+Classifier: Programming Language :: Python :: 3.14
+Requires-Python: >=3.11
+Requires-Dist: fixpoints
+Requires-Dist: typing-extensions>=4.1.0
+Description-Content-Type: text/markdown
+
+# co_lambda
+
+A first-order-shape-relation interpreter for the lambda-calculus, realizing the
+semantics of the paper `papers/co-lambda/first-order.tex`, depending on `fixpoints`.
+
+A lambda-term's tree is the readout of a single first-order weak-head **shape relation** `Sh`
+over term positions. The shape at a position is single-valued, so there is no set to aggregate.
+`readout(node)` resolves each position's head via its `Sh` and descends.
+
+Because positions are **interned** (structurally-equal positions are one object, identity is a
+pointer test), a cyclic structure has finitely many positions and the least-fixpoint reading
+folds it into a finite rational tree where head reduction would unfold forever. So the readout
+terminates on every rational tree, and decides an unproductive cycle as the meaningless leaf in
+finite time, where head reduction diverges. Interning is the *finest* instance of a pluggable
+**position congruence** (see below); a coarser sound congruence folds more.
+
+`readout` has two re-entry policies:
+
+- `fold_cycles=True` (default) is the least fixpoint `lfp`, the denotation: a guarded cycle
+  folds into a finite rational graph (`render` prints it with `#N` back-references); the only
+  leaves are variables and the meaningless `⊥`.
+- `fold_cycles=False` is the finite-budget first-iteration reading `T↑1`: a re-entered guarded
+  cycle is cut to the distinct guarded-cut leaf `∅` (the hole where the budget stopped on a
+  productive cycle), kept separate from the meaningless `⊥` (an unproductive cycle, a position
+  with no shape). `∅` never appears in the least fixpoint.
+
+The calculus is **pure** (`Var`/`Lam`/`App`): no recursion binder is needed. The `Y` combinator
+produces the structural repetition that interning folds, so:
+
+- `Y (cons 0)` (the cyclic stream `r = cons 0 r`) folds to a finite rational tree.
+- `Ω = (λx.xx)(λx.xx)` and `Y (λx.x)` (i.e. `letrec x = x`) are unproductive cycles: they read
+  out as `⊥` under both readings.
+
+The fold/cut is taken only at **closed** positions, so a folded back-reference never misreads a
+free de Bruijn variable.
+
+## Position congruence (a second parameter)
+
+*Which* positions count as "the same" when the readout folds is a parameter, a **position
+congruence** (`Definition def:congruence` in the paper). `readout(node, congruence=...)` keys the
+fold on `congruence.key(node)` instead of raw object identity. A congruence is **sound** when it
+is contained in tree equality (it never folds positions with different trees); stated over the
+full signature, soundness is the congruence law read coinductively, so a well-formed congruence
+folds without changing the denotation. `_congruence.py` provides four instances, from finest to
+coarser:
+
+- `IdentityCongruence` (the default): syntactic de Bruijn identity, `key = id(node)`, a pointer
+  test. The finest instance; reproduces the pure-interning readout exactly.
+- `EGraphCongruence`: a union-find with congruence closure over the *syntactic* constructors. The
+  caller asserts sound (tree-equal) merges with `merge(a, b)`; closure propagates them to
+  `App`/`Lam` parents, and the readout shares the merged positions. The inductive
+  (least-fixpoint) family: it folds whatever finitely many tree-equal pairs generate.
+- `PositionEGraphCongruence`: the faithful `def:congruence`, keyed on the *demanded descent* (the
+  shape tree) rather than the syntax. It auto-folds any two positions bisimilar under `Sh` with
+  no asserted merge (a redex and its reduct collapse on sight), folding exactly the rational
+  fragment. It cannot finitize an infinitely-presented shape graph, so the `Y F 0` witness below
+  still diverges: bisimulation alone does not rescue a dead-argument cycle.
+- `DeadSubtermCongruence(rules=...)`: equality up to dead subterms, the key being the syntax with
+  every dead-argument slot erased to a canonical placeholder (a tree-preserving map, not a
+  congruence closure). The dead slots are recognised by a **library of sound rules**; the caller
+  enables a subset. `RecursionArgumentRule` folds the paper's `Y F 0` witness, where a
+  constant-headed recursion carries an index it never inspects; `UnusedParameterRule` erases the
+  argument of a function that discards it. This is the one reading that folds the witness, which
+  neither e-graph can.
+
+No parser is provided. Build terms in Python with the HOAS DSL in `_dsl.py` (`lam`, `app`,
+`build`), which compiles to a first-order de Bruijn AST; `_prelude.py` collects example terms
+(combinators, Scott-encoded lists, Church numerals with Peano arithmetic).

co_lambda-0.5.0.post1.dev0/README.md

@@ -0,0 +1,68 @@
+# co_lambda
+
+A first-order-shape-relation interpreter for the lambda-calculus, realizing the
+semantics of the paper `papers/co-lambda/first-order.tex`, depending on `fixpoints`.
+
+A lambda-term's tree is the readout of a single first-order weak-head **shape relation** `Sh`
+over term positions. The shape at a position is single-valued, so there is no set to aggregate.
+`readout(node)` resolves each position's head via its `Sh` and descends.
+
+Because positions are **interned** (structurally-equal positions are one object, identity is a
+pointer test), a cyclic structure has finitely many positions and the least-fixpoint reading
+folds it into a finite rational tree where head reduction would unfold forever. So the readout
+terminates on every rational tree, and decides an unproductive cycle as the meaningless leaf in
+finite time, where head reduction diverges. Interning is the *finest* instance of a pluggable
+**position congruence** (see below); a coarser sound congruence folds more.
+
+`readout` has two re-entry policies:
+
+- `fold_cycles=True` (default) is the least fixpoint `lfp`, the denotation: a guarded cycle
+  folds into a finite rational graph (`render` prints it with `#N` back-references); the only
+  leaves are variables and the meaningless `⊥`.
+- `fold_cycles=False` is the finite-budget first-iteration reading `T↑1`: a re-entered guarded
+  cycle is cut to the distinct guarded-cut leaf `∅` (the hole where the budget stopped on a
+  productive cycle), kept separate from the meaningless `⊥` (an unproductive cycle, a position
+  with no shape). `∅` never appears in the least fixpoint.
+
+The calculus is **pure** (`Var`/`Lam`/`App`): no recursion binder is needed. The `Y` combinator
+produces the structural repetition that interning folds, so:
+
+- `Y (cons 0)` (the cyclic stream `r = cons 0 r`) folds to a finite rational tree.
+- `Ω = (λx.xx)(λx.xx)` and `Y (λx.x)` (i.e. `letrec x = x`) are unproductive cycles: they read
+  out as `⊥` under both readings.
+
+The fold/cut is taken only at **closed** positions, so a folded back-reference never misreads a
+free de Bruijn variable.
+
+## Position congruence (a second parameter)
+
+*Which* positions count as "the same" when the readout folds is a parameter, a **position
+congruence** (`Definition def:congruence` in the paper). `readout(node, congruence=...)` keys the
+fold on `congruence.key(node)` instead of raw object identity. A congruence is **sound** when it
+is contained in tree equality (it never folds positions with different trees); stated over the
+full signature, soundness is the congruence law read coinductively, so a well-formed congruence
+folds without changing the denotation. `_congruence.py` provides four instances, from finest to
+coarser:
+
+- `IdentityCongruence` (the default): syntactic de Bruijn identity, `key = id(node)`, a pointer
+  test. The finest instance; reproduces the pure-interning readout exactly.
+- `EGraphCongruence`: a union-find with congruence closure over the *syntactic* constructors. The
+  caller asserts sound (tree-equal) merges with `merge(a, b)`; closure propagates them to
+  `App`/`Lam` parents, and the readout shares the merged positions. The inductive
+  (least-fixpoint) family: it folds whatever finitely many tree-equal pairs generate.
+- `PositionEGraphCongruence`: the faithful `def:congruence`, keyed on the *demanded descent* (the
+  shape tree) rather than the syntax. It auto-folds any two positions bisimilar under `Sh` with
+  no asserted merge (a redex and its reduct collapse on sight), folding exactly the rational
+  fragment. It cannot finitize an infinitely-presented shape graph, so the `Y F 0` witness below
+  still diverges: bisimulation alone does not rescue a dead-argument cycle.
+- `DeadSubtermCongruence(rules=...)`: equality up to dead subterms, the key being the syntax with
+  every dead-argument slot erased to a canonical placeholder (a tree-preserving map, not a
+  congruence closure). The dead slots are recognised by a **library of sound rules**; the caller
+  enables a subset. `RecursionArgumentRule` folds the paper's `Y F 0` witness, where a
+  constant-headed recursion carries an index it never inspects; `UnusedParameterRule` erases the
+  argument of a function that discards it. This is the one reading that folds the witness, which
+  neither e-graph can.
+
+No parser is provided. Build terms in Python with the HOAS DSL in `_dsl.py` (`lam`, `app`,
+`build`), which compiles to a first-order de Bruijn AST; `_prelude.py` collects example terms
+(combinators, Scott-encoded lists, Church numerals with Peano arithmetic).

co_lambda-0.5.0.post1.dev0/pyproject.toml

@@ -0,0 +1,43 @@
+[build-system]
+requires = ["hatchling", "uv-dynamic-versioning>=0.7.0", "editables"]
+build-backend = "hatchling.build"
+
+[tool.hatch.version]
+source = "uv-dynamic-versioning"
+
+[tool.uv-dynamic-versioning]
+vcs = "git"
+style = "pep440"
+bump = false
+fallback-version = "0.0.0.dev0"
+metadata = false
+
+[project]
+name = "co-lambda"
+dynamic = ["version"]
+description = "A least-fixpoint first-order-shape-relation interpreter for the lambda-calculus"
+readme = "README.md"
+license = "MIT"
+requires-python = ">=3.11"
+authors = [{ name = "Yang, Bo", email = "yang-bo@yang-bo.com" }]
+classifiers = [
+    "Development Status :: 3 - Alpha",
+    "License :: OSI Approved :: MIT License",
+    "Programming Language :: Python :: 3.13",
+    "Programming Language :: Python :: 3.14",
+]
+dependencies = ["fixpoints", "typing-extensions>=4.1.0"]
+
+[project.scripts]
+co-lambda-regen-compiler = "co_lambda._compiler_artifact:main"
+
+[tool.uv]
+sources = { fixpoints = { workspace = true } }
+
+[tool.hatch.build.targets.wheel]
+packages = ["src/co_lambda"]
+only-include = ["src/co_lambda"]
+sources = {"src" = ""}
+
+[project.urls]
+Repository = "https://github.com/Atry/MIXINv2"

co_lambda-0.5.0.post1.dev0/src/co_lambda/__init__.py

@@ -0,0 +1 @@
+"""A least-fixpoint first-order-shape-relation interpreter for the lambda-calculus."""

co_lambda-0.5.0.post1.dev0/src/co_lambda/_analysis.py

@@ -0,0 +1,92 @@
+"""Specialization analysis written in the lambda-calculus itself.
+
+The analysis that decides which sub-terms to specialize is a pure lambda term, run by the
+interpreter on the quoted program, so the calculus analyzes its own programs: a demonstration that
+tabling-based reduction expresses program analysis, not only evaluation. This module holds the
+closedness and depth measures; richer certificates (typability, fuel-bounded normalization) live in
+``_typecheck`` and ``_reduce`` in the same style.
+
+This module is pure lambda calculus: every top-level binding is a ``Builder`` (a ``@curry``-decorated
+``def`` IS a Builder). The Python-side verdict readers live at the boundary (``_specialize``).
+
+``LOOSE_BOUND`` is a DEPTH-FREE closedness measure, so the interpreter's interning shares it across
+every position: ``LOOSE_BOUND quoted`` takes no binder depth, so ``app(LOOSE_BOUND, sub)`` is the
+SAME node for an interned sub-term and is tabled once; a whole-tree scan is then linear. It returns
+the number of enclosing binders the sub-term needs (the de Bruijn ``loose_bound``): a variable needs
+index+1, an abstraction discharges one (floored at zero by ``PRED``), an application needs the larger
+of the two. A sub-term is closed exactly when it needs none (``IS_CLOSED``).
+"""
+
+from __future__ import annotations
+
+from co_lambda._dsl import Builder, app, curry, lam
+from co_lambda._prelude import IS_ZERO, PLUS, PRED, SUCC, Y
+from co_lambda._sugar import ap
+
+# Church arithmetic for the measures (truncated subtraction gives the comparisons).
+_SUBTRACT: Builder = lam(lambda a: lam(lambda b: app(app(b, PRED), a)))  # a - b, floored at zero
+_AT_MOST: Builder = lam(lambda a: lam(lambda b: app(IS_ZERO, ap(_SUBTRACT, a, b))))  # a <= b
+_MAX: Builder = lam(lambda a: lam(lambda b: ap(_AT_MOST, a, b, b, a)))  # a <= b ? b : a
+
+LOOSE_BOUND: Builder = app(Y, lam(lambda self_recursion: lam(lambda quoted: ap(
+    quoted,
+    lam(lambda index: app(SUCC, index)),  # QVar index: needs index+1 enclosing binders
+    lam(lambda body: app(PRED, app(self_recursion, body))),  # QLam body: discharges one binder
+    lam(lambda function: lam(lambda argument: ap(
+        _MAX, app(self_recursion, function), app(self_recursion, argument),
+    ))),  # QApp f a: the larger of the two
+))))
+
+IS_CLOSED: Builder = lam(lambda quoted: app(IS_ZERO, app(LOOSE_BOUND, quoted)))  # closed iff needs none
+
+
+# DEPTH: the nesting depth of a quoted term (a Church numeral), a cheap path-free measure the interner
+# shares per distinct sub-term. It bounds the simple-typability check: running algorithm-W on a large
+# (deep) closed combinator is expensive and the no-GC interner retains every reduction, so a specializer
+# only certifies an island when the sub-term is shallow enough (``depth_at_most``), leaving a deep closed
+# region reconstructed as an interpreted graph rather than flattened to a strict island. The bound only
+# ever makes the certificate MORE conservative (fewer islands), never unsound.
+DEPTH: Builder = app(Y, lam(lambda self_recursion: lam(lambda quoted: ap(
+    quoted,
+    lam(lambda index: lam(lambda s: lam(lambda z: z))),  # QVar: a leaf (depth zero)
+    lam(lambda body: app(SUCC, app(self_recursion, body))),  # QLam: one deeper
+    lam(lambda function: lam(lambda argument: app(SUCC, ap(
+        _MAX, app(self_recursion, function), app(self_recursion, argument),
+    )))),  # QApp: one past the deeper side
+))))
+
+
+@curry
+def depth_at_most(bound: Builder, quoted: Builder) -> Builder:
+    """``DEPTH quoted <= bound`` (a Church boolean): the shallow-enough certificate."""
+    return ap(_AT_MOST, app(DEPTH, quoted), bound)
+
+
+# NODE_COUNT: the number of Var/Lam/App nodes in a quoted term (a Church numeral), a path-free
+# catamorphism the interner shares per distinct sub-term -- same shape as DEPTH but summing (PLUS) the
+# children instead of taking their MAX. It bounds how big a region may be de-tabled (host-compiled to
+# call-by-need): a small region (<= a bound) loses cross-location tabling at most a constant factor, never
+# exponentially, so the local-call-by-need optimization stays bounded and measurable.
+_ZERO: Builder = lam(lambda s: lam(lambda z: z))  # church 0, the leaf base for the count
+
+NODE_COUNT: Builder = app(Y, lam(lambda self_recursion: lam(lambda quoted: ap(
+    quoted,
+    lam(lambda index: app(SUCC, _ZERO)),  # QVar: one node
+    lam(lambda body: app(SUCC, app(self_recursion, body))),  # QLam: one + body
+    lam(lambda function: lam(lambda argument: app(SUCC, ap(
+        PLUS, app(self_recursion, function), app(self_recursion, argument),
+    )))),  # QApp: one + function + argument
+))))
+
+
+@curry
+def node_count_at_most(bound: Builder, quoted: Builder) -> Builder:
+    """``NODE_COUNT quoted <= bound`` (a Church boolean): the small-enough-to-de-table certificate."""
+    return ap(_AT_MOST, app(NODE_COUNT, quoted), bound)
+
+
+@curry
+def loose_bound_at_most(bound: Builder, quoted: Builder) -> Builder:
+    """``LOOSE_BOUND quoted <= bound`` (a Church boolean): the few-free-variables certificate (an open
+    region with at most ``bound`` free de Bruijn variables, so its host island is an arity-``bound`` native)."""
+    return ap(_AT_MOST, app(LOOSE_BOUND, quoted), bound)