An interpreted, lazy lisp.

Scott Olsen d917dc8de3 types: initial typechecker implementation Adds an initial implementation of the type checker, which is a separate compiler pass from evaluation. We use the lambda calculus again, but this time we run it over a context full of typings for each form, where the literal program s-expressions are codified into representations of their types. There is no inference. Users can annotate types using (type <name> <type form>) where type form performs special conversions from type names like int to their representations. I've had to make the lambda calculus into an interface to permit us to use it to operate on a typing context. In general this will be our approach to implementing various compiler passes.		2 weeks ago
Rose	types: initial typechecker implementation	2 weeks ago
.gitignore	repl: make it possible to read programs	3 weeks ago
LICENSE	meta: add license	7 months ago
Makefile	meta: store ibc files in a subdir	7 months ago
README.md	First commit	2 years ago
rose.ipkg	types: initial typechecker implementation	2 weeks ago

Rose

A statically typed, theorem-proving lisp.