suzanne.soy/cur
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity
Powerful meta-programming for powerful types.
60 Commits 29 Branches 0 Tags 790 KiB
Racket 100%
027f031b20
Go to file
William J. Bowman 027f031b20 Added some pointers about what to look at
2015-02-05 02:32:50 -05:00
stdlib Fixed various typos/bug, added latex generation 2015-02-05 01:40:58 -05:00
example.rkt Renamed more curnels 2015-01-29 22:46:53 -05:00
oll.rkt Fixed various typos/bug, added latex generation 2015-02-05 01:40:58 -05:00
proofs-for-free.rkt Reorganized stdlib; fixed some tests 2015-02-04 18:47:15 -05:00
README.md Added some pointers about what to look at 2015-02-05 02:32:50 -05:00
redex-curnel.rkt Added support for generating theorems,proofs,defs 2015-02-04 20:30:24 -05:00
stlc.rkt Fixed various typos/bug, added latex generation 2015-02-05 01:40:58 -05: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

Don't actually try to run anything. The type-checker may be exponential, 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, inference rule relation 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.