Initial code, from Andrej Bauer "How to implement a dependent type theory III" http://math.andrej.com/2012/11/29/how-to-implement-dependent-type-theory-iii/
simplifying the build system
renaming tt to total
adding inductive types (No eliminators yet)
type and constructor names have to be unique
added constructors and splitter signatures and local contexts (I’m afraid that this will prove to be a bad idea, but, we’ll see).
typo
added some examples
added comments
fixed comment lexer
Changed parameter to axiom
added stupid logo (procrastinating to start working on adding eliminators)
Added type annotations
added dashes to the names (a better lexer will be needed eventually)
added better Inductive declarations with some well formedness conditions
added flag to print de bruijn indices
synthesizing the eliminators (so far only the target part is done)
added option types to avoid generating names anywhere but in pretty printing
added support for hints in variable names in the name generator
renaming a constructor