GitHub - skrah/minicaml: Compiler for a very restricted subset of OCaml

skrah / minicaml Public

Notifications You must be signed in to change notification settings
Fork 3
Star 25

Compiler for a very restricted subset of OCaml

Notifications

Name		Name	Last commit message	Last commit date
Latest commit History 4 Commits
test		test
Ast.ml		Ast.ml
Ast.mli		Ast.mli
Closureconv.ml		Closureconv.ml
Closureconv.mli		Closureconv.mli
Env.ml		Env.ml
Env.mli		Env.mli
LICENSE		LICENSE
LexState.ml		LexState.ml
LexState.mli		LexState.mli
Lexer.mli		Lexer.mli
Lexer.mll		Lexer.mll
Lib.ml		Lib.ml
Lib.mli		Lib.mli
Location.ml		Location.ml
Location.mli		Location.mli
ModuleState.ml		ModuleState.ml
ModuleState.mli		ModuleState.mli
ParseTree.ml		ParseTree.ml
ParseTree.mli		ParseTree.mli
Parser.mly		Parser.mly
README.txt		README.txt
Scc.ml		Scc.ml
Scc.mli		Scc.mli
Shared.ml		Shared.ml
Shared.mli		Shared.mli
Symbol.ml		Symbol.ml
Symbol.mli		Symbol.mli
SymbolGenerator.ml		SymbolGenerator.ml
SymbolGenerator.mli		SymbolGenerator.mli
Symtable.ml		Symtable.ml
Symtable.mli		Symtable.mli
Translate.ml		Translate.ml
Translate.mli		Translate.mli
Typecheck.ml		Typecheck.ml
Typecheck.mli		Typecheck.mli
Typedtree.ml		Typedtree.ml
Typedtree.mli		Typedtree.mli
Types.ml		Types.ml
Types.mli		Types.mli
Unify.ml		Unify.ml
Unify.mli		Unify.mli
Util.ml		Util.ml
Util.mli		Util.mli
Visualize.ml		Visualize.ml
Visualize.mli		Visualize.mli
_tags		_tags
build.sh		build.sh
builtins.ml		builtins.ml
camlc.ml		camlc.ml
camlc.sh		camlc.sh
cl_camldefs.ml		cl_camldefs.ml
clean.sh		clean.sh
compile_cconv.sh		compile_cconv.sh
dump_cconv.sh		dump_cconv.sh
dump_parsetree.sh		dump_parsetree.sh
dump_symtable.sh		dump_symtable.sh
dump_typedtree.sh		dump_typedtree.sh
runtime.c		runtime.c

Repository files navigation

MiniCaml is a compiler for a very restricted subset of Caml with an LLVM
backend. The feature set is very similar to Appel's Tiger language. Obviously
this compiler is educational in nature.

Highlights:
===========

   o Typed closure conversion (see e.g. "Typed Closure Conversion" by Minamide,
     Morrisett, Harper). Optionally the output of the conversion can be dumped
     and compiled as valid OCaml (using objects as closures).

   o LLVM backend. The closure conversion uses static links and should
     be grossly inefficient. The Boehm garbage collector is used.
     All values are boxed using a struct of two pointers.  Despite all
     this LLVM cleans up pretty well.


Drawbacks:
==========

   o No variant types: The compiler still needs nil.

   o No documentation (read the shell scripts to start with).

   o No real error messages in the type-checking phase.

   o This is really an alpha version. Expect breakage.


License:
========

   o Q-Public License. Modifications must be distributed in the form of patches.


Author:
=======

   Stefan Krah <stefan@bytereef.org>