about summary refs log tree commit diff stats
path: root/readme.txt
blob: 169c9480da7b6e54e460a9b38bbe80c5be167cfd (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
lam(n.) -- where you go when a scheme goes bad
by C. Duckworth

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
---------------

- lam just has numbers and operations on them
- uh, and symbols. and lists. and lambdas and environments.

---------------------------
contributions/help WELCOME!