Language Tour

Lispex programs are S-expressions with lexical closures, exact arithmetic, immutable quoted data, derived control forms, and explicit multiple values.

At a glance

LISPEX
(call-with-values (lambda () (values 6 7)) *)

Result

OUTPUT
42

Current guarantees

  • Only #f is false; empty lists, zero, and empty strings are true.
  • Bindings are mutable cells, so closures share updates made with set!.
  • Derived forms normalize hygienically to a small fixed core.

Boundaries

  • There is no user macro system in the current profile.
  • Ports, files, networking, time, and randomness are outside pure core evaluation.