suzanne.soy/cur
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity
Powerful meta-programming for powerful types.
83 Commits 29 Branches 0 Tags 790 KiB
Racket 100%
3304ed8531
Go to file
William J. Bowman 3304ed8531 First attempt at typing elim 
elim now has a typing rule that works for some uses of elim, like on
"nat". However, eliminating things inductives such as "and" does not yet
work due to issue in typing methods.
2015-03-25 20:19:43 -04:00
stdlib Fixed several bugs, found several more 2015-02-20 19:12:06 -05:00
example.rkt Renamed more curnels 2015-01-29 22:46:53 -05:00
oll.rkt Redex 1.6 enables caching of judgment forms! 2015-02-20 18:22:04 -05:00
proofs-for-free.rkt Fixed several bugs, found several more 2015-02-20 19:12:06 -05:00
README.md Redex 1.6 enables caching of judgment forms! 2015-02-20 18:22:04 -05:00
redex-curnel.rkt First attempt at typing elim 2015-03-25 20:19:43 -04:00
stlc.rkt Redex 1.6 enables caching of judgment forms! 2015-02-20 18:22:04 -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

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.