From dded1f13d17c6e6be6a4db54f635ef7baa56f350 Mon Sep 17 00:00:00 2001
From: Case Duckworth
Date: Wed, 21 Feb 2024 22:32:24 -0600
Subject: Update readme

---
 readme.txt | 46 +++++++++++++++++++++++++++++++++++++++++++---
 1 file changed, 43 insertions(+), 3 deletions(-)

diff --git a/readme.txt b/readme.txt
index 76f571f..169c948 100644
--- a/readme.txt
+++ b/readme.txt
@@ -1,8 +1,48 @@
-lam --- a lisp in lua
+lam(n.) -- where you go when a scheme goes bad
 by C. Duckworth
 
-lam(n.) -- where you go when a scheme goes bad
+about lam
+---------
+
+lam is my little toy lisp evaluator.  written in lua!
+(no, it isn't fennel.)
+
+this is /very much/ a work in progress.
+lam uses lua 5.1 or luajit.
+it might work elsewhere, but i've not tested it on those.
+
+using lam
+---------
+
+you can set up a repl of lam to test it out:
+
+> make repl
+
+all of lua's math.* functions are available, as well as
+
+- +
+- *		(more math functions to come!)
+- null?
+- number?
+- symbol?
+- apply
+- begin
+- map
+- car
+- cdr
+- list
+
+and special forms
+
+- quote
+- define
+- lambda
+
+lam limitations
+---------------
 
-this is /very much/ a work in progress
+- lam just has numbers and operations on them
+- uh, and symbols. and lists. and lambdas and environments.
 
+---------------------------
 contributions/help WELCOME!
-- 
cgit 1.4.1-21-gabe81