suzanne.soy/cur
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity
Powerful meta-programming for powerful types.
67 Commits 29 Branches 0 Tags 790 KiB
Racket 100%
b3388c5413
Go to file
William J. Bowman b3388c5413 Changed Type to Unv 0 
* Type should be not be in the core language. Converted all uses of Type
  to Unv 0, potentially fixing a universe bug in the process.
* Added macro Type to Curnel that enables existing code to work more or
  less as before.
2015-02-20 18:20:55 -05:00
stdlib Bug fixes 2015-02-15 21:25:39 -05:00
example.rkt Renamed more curnels 2015-01-29 22:46:53 -05:00
oll.rkt Changed Type to Unv 0 2015-02-20 18:20:55 -05:00
proofs-for-free.rkt Bug fixes 2015-02-15 21:25:39 -05:00
README.md Typo fixes 2015-02-05 02:39:25 -05:00
redex-curnel.rkt Changed Type to Unv 0 2015-02-20 18:20:55 -05:00
stlc.rkt Note about the core, various fixes 2015-02-05 02:34:15 -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 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.