Merge branch 'master' of https://github.com/rm-dr/lamb

README.md

@@ -1,11 +1,8 @@
 # 🐑 Lamb: A Lambda Calculus Engine
 
- - [Primary Repo](https://git.betalupi.com/Mark/lamb)
+![Lamb Demo](https://github.com/rm-dr/lamb/assets/96270320/d518e344-e7c8-47ed-89c4-7ce273bf4e2d)
- - [Github Mirror](https://github.com/rm-dr/lamb)
 
 
-![Lamb demo](https://betalupi.com/static/git/lambdemo.gif)
-
 
 ## :brain: What is lambda calculus?
 
@@ -15,7 +12,7 @@
 
  - [blog](https://www.driverlesscrocodile.com/technology/lambda-calculus-for-people-a-step-behind-me-1): Another introduction. Moves slower than the two videos above and doesn't assume CS knowledge. Four-part series.
 
- - [handout](https://nc.betalupi.com/s/ormc-handouts/download?path=%2FAdvanced&files=Lambda%20Calculus.pdf): A handout I've written on lambda calculus. Solutions are available somewhere on `git.betalupi.com`. You'll have to find them yourself if you want them.
+ - [handout](https://static.betalupi.com/ormc/Advanced/Lambda%20Calculus.pdf): A handout I've written on lambda calculus.
 
 ## :package: Installation
 
@@ -116,9 +113,7 @@ The lines in a file look exactly the same as regular entries in the prompt, but
  - Cleanup warnings
  - Truncate long expressions in warnings
  - Loop detection
- - α-equivalence check
  - Unchurch command: make church numerals human-readable
  - Better syntax highlighting
  - Tab-complete file names and commands
  - Load default macros without manually downloading `macros.lamb` (via `requests`, maybe?)
- - Tests

lamb_engine/nodes/nodes.py

@@ -77,8 +77,8 @@ class Node:
 		self.parent_side: Direction = None # type: ignore
 
 		# Left and right nodes, None if empty
-		self._left: Node | None = None
+		self._left = None
-		self._right: Node | None = None
+		self._right = None
 
 		# The runner this node is attached to.
 		# Set by Node.set_runner()
@@ -341,7 +341,7 @@ class Bound(EndNode):
 		# The name of the macro this bound came from.
 		# Always equal to self.name, unless the macro
 		# this came from had a subscript.
-		self.macro_name: str | None = macro_name
+		self.macro_name = macro_name
 
 		if forced_id is None:
 			self.identifier = bound_counter
@@ -381,9 +381,9 @@ class Func(Node):
 				Func.from_parse(result)
 			)
 
-	def __init__(self, input: Macro | Bound, output: Node, *, runner = None) -> None:
+	def __init__(self, input, output: Node, *, runner = None) -> None:
 		super().__init__()
-		self.input: Macro | Bound = input
+		self.input = input
 		self.left: Node = output
 		self.right: None = None
 		self.runner = runner # type: ignore

lamb_engine/runner/commands.py

@@ -14,7 +14,7 @@ help_texts = {}
 
 def lamb_command(
 		*,
-		command_name: str | None = None,
+		command_name = None,
 		help_text: str
 	):
 	"""

lamb_engine/runner/runner.py

@@ -46,7 +46,7 @@ class Runner:
 		# Maximum amount of reductions.
 		# If None, no maximum is enforced.
 		# Must be at least 1.
-		self.reduction_limit: int | None = 1_000_000
+		self.reduction_limit = 1_000_000
 
 		# Ensure bound variables are unique.
 		# This is automatically incremented whenever we make
@@ -74,7 +74,7 @@ class Runner:
 			message = self.prompt_message
 		)
 
-	def parse(self, line) -> tuple[lamb_engine.nodes.Root | MacroDef | Command, list]:
+	def parse(self, line): # -> tuple[lamb_engine.nodes.Root | MacroDef | Command, list]
 		e = self.parser.parse_line(line)
 
 		w = []

pyproject.toml

@@ -15,7 +15,7 @@ lamb = "lamb_engine:main"
 [project]
 name = "lamb_engine"
 description = "A lambda calculus engine"
-version = "1.1.8"
+version = "1.1.9"
 dependencies = [
 	"prompt-toolkit==3.0.31",
 	"pyparsing==3.0.9"