tablambda 0.8.0.post3.dev0__tar.gz → 0.8.1__tar.gz

{tablambda-0.8.0.post3.dev0 → tablambda-0.8.1}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.5
 Name: tablambda
-Version: 0.8.0.post3.dev0
+Version: 0.8.1
 Summary: A pure lambda-calculus interpreter that applies tabling to weak-head reduction, folding self-referential terms into finite cyclic graphs
 Project-URL: Repository, https://github.com/Atry/tablambda
 Author-email: "Yang, Bo" <yang-bo@yang-bo.com>

{tablambda-0.8.0.post3.dev0 → tablambda-0.8.1}/src/tablambda/_shape.py

@@ -117,20 +117,7 @@ def compute_weak_head_normal_form(node: Node) -> Node | WeakHeadBottom:
             head = weak_head_normalize(function)
             match head:
                 case Var() | App():
-                    # FIXME: this exposes the real weak head normal form, and the fixpoint machinery
-                    # cannot yet carry it. `test_scott_ast_decodes_and_executes` raises
-                    # RecursionError from `fixpoints._core.fixpoint_cached_property` when it runs
-                    # against a cold cache, and passes when earlier tests have already normalized
-                    # the shared interned nodes; measured over `--randomly-seed` 1 to 6 on
-                    # `test_pyast.py`, seeds 1 and 3 fail and the other four pass.
-                    # The previous code returned `node`, the unreduced application, which hid this
-                    # bug behind a second one: the exposed layer was then a representative of the
-                    # weak head normal form rather than the normal form, and Lemma A.2 in the paper
-                    # was worded to match that. The same definition in SWI-Prolog, tabled and with
-                    # no interning, handles every term tried without recursion trouble, so the
-                    # defect is in this fixpoint machinery rather than in the definition. Fix the
-                    # recursion here; do not restore the representative.
-                    return make_app(head, argument)
+                    return node
                 case WeakHeadBottom.BOTTOM:
                     return BOTTOM
                 case _: