Powerful meta-programming for powerful types.

Go to file

William J. Bowman 5fec16125d Updated LICENSE to BSD 2-clause		2015-09-15 16:12:15 -04:00
stdlib	Cleaned up tactic base system	2015-09-15 16:02:53 -04:00
example.rkt	Renamed more curnels	2015-01-29 22:46:53 -05:00
LICENSE	Updated LICENSE to BSD 2-clause	2015-09-15 16:12:15 -04:00
oll.rkt	Proper names and inductive families	2015-04-14 19:16:47 -04:00
proofs-for-free.rkt	Proper names and inductive families	2015-04-14 19:16:47 -04:00
README.md	Removed CIC from README	2015-09-09 18:53:35 -04:00
redex-curnel.rkt	Introduced Sartactics!	2015-09-11 17:20:53 -04:00
stlc.rkt	Proper names and inductive families	2015-04-14 19:16:47 -04:00

README.md

cur

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 answers 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.