Powerful meta-programming for powerful types.

Go to file

William J. Bowman a0803eb8b1 Fixed Coq generator to use eliminators Not sure the resulting Coq code will actually type check, due to differences in the types of Cur eliminators and Coq eliminators.		2015-04-14 18:58:54 -04:00
stdlib	Merge branch 'names' into actual-inductives	2015-04-14 18:42:01 -04:00
example.rkt	Renamed more curnels	2015-01-29 22:46:53 -05:00
oll.rkt	Fixed Coq generator to use eliminators	2015-04-14 18:58:54 -04:00
proofs-for-free.rkt	Dynamic semantics for elim	2015-03-27 21:16:20 -04:00
README.md	Redex 1.6 enables caching of judgment forms!	2015-02-20 18:22:04 -05:00
redex-curnel.rkt	Merge branch 'names' into actual-inductives	2015-04-14 18:42:01 -04:00
stlc.rkt	Merge branch 'names' into actual-inductives	2015-04-14 18:42:01 -04:00

README.md

cur

CIC under Racket. A language with static dependent-types and dynamic types, type annotations and parentheses, theorem proving and meta-programming.

Noun
cur (plural curs)

1. (archaic) A mongrel.
2. (archaic) A detestable person.

Getting started

Requires redex-lib version 1.6 if you want answer in a reasonable amount of time. Otherwise, the type-checker may require exponential time or worse.

Open up stlc.rkt to see an example of what advanced meta-programming can let you do.

Open up oll.rkt to see the implementation of the meta-programs used to enable stlc.rkt, including the parsers for BNF syntax and inference rule syntax, and Coq and LaTeX generators.

Open up proofs-for-free.rkt to see an implementation of the translation defined in Proofs for Free as a meta-program.

Open up anything in stdlib/ to see some standard dependent-type formalisms.

Open up redex-curnel.rkt to see the entire "trusted" core.