61bdf8f5d4
These fixes are merged because properly testing the latter requires having the former, while properly implementing the former is made simpler by having the latter. Fixed handling of names/substitution === * Added capture-avoiding substitution. Closes #7 * Added equivalence during typing checking, including α-equivalence and limited β-equivalence. Closes #8 * Exposed better typing-check reflection features to allow typing checking modulo equivalence. * Tweaked QED macro to use new type-checking reflection feature. Fixed inductive families === The implementation of inductive families is now based on the theoretical models of inductive families, rather than an ad-hoc non-dependent pattern matcher. * Removed case and fix from Cur and Curnel. They are replaced by elim, the generic eliminator for inductive families. Closes #5. Since fix is no more, also closes #2. * Elimination of false works! Closes #4. * Changed uses of case to elim in Curnel * Changed uses of case* in Cur to use eliminators. Breaks case* API. * Fixed Coq generator to use eliminators * Fixed Latex generator |
||
|---|---|---|
| stdlib | ||
| example.rkt | ||
| oll.rkt | ||
| proofs-for-free.rkt | ||
| README.md | ||
| redex-curnel.rkt | ||
| stlc.rkt | ||
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.