8ba4ed17d9
elim was not checking that the arguments to be used for the parameters of the inductive matched the actual parameters expected, resulting in incorrect and non-deterministic unification, and thus incorrect reduction when the parameters were unified incorrectly. |
||
|---|---|---|
| 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 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.