lisphs - Lisp half-compiler written in Haskell

	Commit message (Collapse)	Author	Age
*	Follow caller-save convention using stack, not full state restore	tomsmeding	2019-12-13
\|
*	Remove stdlib.lisp dep in mutual-recursion.lisp	tomsmeding	2019-11-28
\|
*	Make use of multi-argument concat builtin	tomsmeding	2019-11-26
\|
*	Parse lispparser.lisp with lispparser.lisp	tomsmeding	2019-11-26
\|
*	Fix bugs in lispparser.lisp	tomsmeding	2019-11-26
\|
*	Lisp parser in lisp can parse stdlib	tomsmeding	2019-11-26
\|
*	Working (basic) lisp parser in lisp	tomsmeding	2019-11-26
\|
*	stdlib: const, ., reverse	tomsmeding	2019-11-26
\|
*	declare defines for top-level mutual recursion	tomsmeding	2019-11-26
\|
*	Full tokeniser in lispparser.lisp (also strings now)	tomsmeding	2019-11-22
\|
*	Clean up take-while in stdlib	tomsmeding	2019-11-22
\|
*	lispparser: working tokeniser	tomsmeding	2019-11-22
\|
*	WIP lisp parser in lisp	Tom Smeding	2019-11-21
\|
*	take-while, drop-while	Tom Smeding	2019-11-21
\|
*	Rotate arguments to substr and allow negative length	Tom Smeding	2019-11-21
\|
*	Use sys-put-string in filetest.lisp	Tom Smeding	2019-11-21
\|
*	Some rewriting in in stdlib.lisp	Tom Smeding	2019-11-21
\|
*	Better string and IO support	Tom Smeding	2019-11-21
\|
*	lambdarec for singly-recursive lambda's	Tom Smeding	2019-11-20
\|
*	Notes/ideas and example tests for recursive functions	tomsmeding	2019-11-18
\|
*	Automatic testing of examples	tomsmeding	2019-11-18