Try to implement a STLC REPL in Coq & Haskell. Formalized in Coq, Run in Haskell.
- Formally verify some feature of this implementation in Coq
- De bruijn Index
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Latest commit | ||||
❄️ Simply typed lambda calculus formalized in Coq, REPL in Haskell.