alhassy / CoqCheatSheet
Reference sheet for the Coq language.
☆15Updated 4 years ago
Alternatives and similar repositories for CoqCheatSheet:
Users that are interested in CoqCheatSheet are comparing it to the libraries listed below
- software archaeology of reflective towers of interpreters☆16Updated 6 months ago
- Matita (proof assistant) with embedded elpi☆12Updated 7 years ago
- A certified semantics for relational programming workout.☆26Updated 4 years ago
- A Haskell implementation of the code within Walid Taha's ``A Gentle Introduction to Multi-stage Programming''☆10Updated 6 years ago
- Gallina to Bedrock2 compilation toolkit☆53Updated last week
- A Gradual Dependently-typed Language☆14Updated 5 years ago
- Pure relational SKI combinator calculus interpreter.☆11Updated 7 years ago
- miniKanren with a first-order representation of the search space☆16Updated 9 months ago
- Invertible parsing for S-expressions☆34Updated 2 weeks ago
- A prototype of soft contract verification for an untyped functional language☆34Updated 4 years ago
- A Scheme-like CBPV language with Racket Interoperability☆39Updated last year
- An idris backend compiling to chez scheme☆46Updated 7 years ago
- Literate coq blog posts☆17Updated 9 years ago
- The source for "Compiling with Dependent Types" (my dissertation)☆30Updated 2 years ago
- ☆22Updated 9 years ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 11 years ago
- A meta-language for adding Clojure-style shorthand function literals to arbitrary Racket languages.☆17Updated 8 years ago
- ☆55Updated 2 weeks ago
- Racket bindings for Z3☆24Updated 5 years ago
- A categorical semantics library in Agda.☆17Updated 5 years ago
- A small NuPRL style proof assistant☆31Updated 6 years ago
- A bare-bones LCF-style proof assistant☆22Updated 5 years ago
- The (very) small kernel of the LaTTe proof assistant☆12Updated last month
- Inline, type safe X86-64 assembly programming in Agda☆68Updated 6 years ago
- Formal topology (and some probability) in Coq☆32Updated 6 years ago
- A miniKanren interpreter... in miniKanren. Relationally run your relations relationally!☆22Updated 8 years ago
- Generic implementation of different CFA families based on monadic decomposition☆21Updated 12 years ago
- Tree-automata-based run-time type constraints for miniKanren☆14Updated last year
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 7 years ago
- A discouraging story.☆15Updated 6 years ago