# Zisp: 21st-century Scheme-inspired language

Zisp is my experimental toy language inspired by Scheme.  The idea is
that it's a modern "re-imagining" of what Scheme may have been had it
been invented today, and had it been designed with pragmatic use as a
primary concern in its design.

This language doesn't actually exist yet.  You are merely reading the
ramblings of a madman.  A little bit of code is here already though:

[Source code](https://git.tkammer.de/zisp/)

Some of the following articles are quite insightful.  Others are VERY
rambly; you've been warned.

Some are outdated with regards to the actual implementation of Zisp,
because writing the code often gives you yet another perspective.

* [Compilation is execution](notes/250210-compile.html)
* [Everything can be serialized](notes/250210-serialize.html)
* [Symbols are strings](notes/250210-symbols.html)
* [Stop the "cons" madness!](notes/250210-cons.html)
* [Syntax sugar](notes/250210-sugar.html)
* [More immutability](notes/250210-immutable.html)
* [No shadowing, and fewer `let` forms](notes/250210-let.html)
* [Return zero values](notes/250210-zero-values.html)
* [Can't ignore returned values](notes/250210-strict-mode.html)
* [Only Booleans have truthiness](notes/250210-booleans.html)
* [Record types](notes/250210-records.html)
* [Equality and equivalence semantics](notes/250210-equal.html)
* [NaN-packing](notes/250210-nan.html)
* [Reader? Decoder? I barely know 'er!](notes/250219-reader.html)
* [Does the decoder implement macros?](notes/250228-macros.html)
* [Better syntax-rules?](notes/250228-sr.html)
* [Cons cell optimization?](notes/250317-fastcons.html)
* [Numeric tower](notes/250329-numbers.html)
* [Bootstrapping](notes/250329-boot.html)
* [Using libgccjit?](notes/250920-libgccjit.html)
* [Goals](notes/250920-goals.html)