curryparty 0.1.1__tar.gz → 0.2.0__tar.gz

{curryparty-0.1.1 → curryparty-0.2.0}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.3
 Name: curryparty
-Version: 0.1.1
+Version: 0.2.0
 Summary: Python playground to learn lambda calculus
 Author: Antonin P
 Author-email: Antonin P <antonin.peronnet@telecom-paris.fr>
@@ -62,6 +62,12 @@ If you use a notebook such as jupyternotebook or marimo, you will see something
 
 You can also use `term.show_reduction` to get an animated version.
 
+# Tutorial
+
+`lambda.py` shows a tutorial in marimo format. Click on the button to try it out:
+
+[![Open with marimo](https://marimo.io/shield.svg)](https://marimo.app/github.com/rambip/curryparty/blob/main/lambda.py)
+
 # How it works
 
 Under the wood, all the terms are converted into a list of nodes, that can either be a `lambda`, an `application` (with 2 arguments) or a `variable` (with 0 arguments).

{curryparty-0.1.1 → curryparty-0.2.0}/README.md

@@ -52,6 +52,12 @@ If you use a notebook such as jupyternotebook or marimo, you will see something
 
 You can also use `term.show_reduction` to get an animated version.
 
+# Tutorial
+
+`lambda.py` shows a tutorial in marimo format. Click on the button to try it out:
+
+[![Open with marimo](https://marimo.io/shield.svg)](https://marimo.app/github.com/rambip/curryparty/blob/main/lambda.py)
+
 # How it works
 
 Under the wood, all the terms are converted into a list of nodes, that can either be a `lambda`, an `application` (with 2 arguments) or a `variable` (with 0 arguments).

{curryparty-0.1.1 → curryparty-0.2.0}/pyproject.toml

@@ -1,6 +1,6 @@
 [project]
 name = "curryparty"
-version = "0.1.1"
+version = "0.2.0"
 description = "Python playground to learn lambda calculus"
 readme = "README.md"
 authors = [

{curryparty-0.1.1 → curryparty-0.2.0}/src/curryparty/__init__.py

@@ -41,6 +41,12 @@ class Term:
         reduced = beta_reduce(self.nodes, lamb, b)
         return Term(reduced)
 
+    def reduce(self):
+        last_non_reduced = self
+        for term in self.reduction_chain():
+            last_non_reduced = term
+        return last_non_reduced
+
     def reduction_chain(self) -> Iterable["Term"]:
         term = self
         while True:
@@ -49,7 +55,7 @@ class Term:
             if term is None:
                 break
 
-    def show_reduction(self):
+    def show_beta(self):
         candidates = find_redexes(self.nodes)
         if len(candidates) == 0:
             return None