Alternatives and similar repositories for CoqCheatSheet

Users that are interested in CoqCheatSheet are comparing it to the libraries listed below

• wilbowma / dissertation
  The source for "Compiling with Dependent Types" (my dissertation)
  ☆30Updated 3 years ago
• zydeco-lang / fiddle
  A dynamically-typed CBPV language embedded in Racket
  ☆39Updated last year
• TOTBWF / muprl
  A small NuPRL style proof assistant
  ☆31Updated 6 years ago
• jfdm / velo-lang
  Velo is a tiny language (STLC + Hutton's Razor with Bools) to showcase & explore efficient verified implementations in Idris2.
  ☆16Updated 2 years ago
• melted / idris-chez
  An idris backend compiling to chez scheme
  ☆48Updated 7 years ago
• jpt4 / skio
  Pure relational SKI combinator calculus interpreter.
  ☆11Updated 8 years ago
• gbaz / mess
  Martin-Löf Extensible Specification and Simulator
  ☆29Updated 10 years ago
• mit-plv / rupicola
  Gallina to Bedrock2 compilation toolkit
  ☆59Updated this week
• haskell-implementations / hugs
  Haskell User's Gofer System
  ☆25Updated 9 years ago
• langston-barrett / write-yourself-a-scheme-in-agda
  Like "Write Yourself a Scheme in 48 Hours", but in Agda
  ☆51Updated 7 years ago
• webyrd / tree-automata
  Tree-automata-based run-time type constraints for miniKanren
  ☆14Updated 2 years ago
• webyrd / curnelo
  Cur dependently-typed language in miniKanren.
  ☆17Updated 7 years ago
• LPCIC / matita
  Matita (proof assistant) with embedded elpi
  ☆13Updated 7 years ago
• dboulytchev / miniKanren-coq
  A certified semantics for relational programming workout.
  ☆26Updated 4 years ago
• philnguyen / soft-contract
  A prototype of soft contract verification for an untyped functional language
  ☆35Updated 4 years ago
• gallais / agdarky
  Agda suffices: software written from A to Z in Agda
  ☆16Updated 6 years ago
• rowandavies / sml-cidre
  SML Checker for Intersection and Datasort Refinements (pronounced "cider")
  ☆20Updated 12 years ago
• JacquesCarette / TheoriesAndDataStructures
  Showing how some simple mathematical theories naturally give rise to some common data-structures
  ☆39Updated last year
• david-christiansen / idris-interaction.rkt
  A Racket library for interacting with Idris over the IDE protocol
  ☆31Updated 7 years ago
• david-christiansen / pudding-old
  A language-integrated proof assistant, for and in Racket
  ☆39Updated 9 years ago
• LightAndLight / idris-but-its-c
  Idris, but it's C
  ☆24Updated 7 years ago
• WhatisRT / meta-cedille
  Minimalistic dependent type theory with syntactic metaprogramming
  ☆57Updated last year
• philnguyen / z3-rkt
  Racket bindings for Z3
  ☆24Updated 6 years ago
• michaelballantyne / meta-minikanren
  A miniKanren interpreter... in miniKanren. Relationally run your relations relationally!
  ☆22Updated 9 years ago
• alhassy / next-700-module-systems
  PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.
  ☆82Updated 3 years ago
• mietek / epigram2
  Mirror of Epigram 2, by Conor McBride, et al.
  ☆48Updated 5 years ago
• plum-umd / abstracting-definitional-interpreters
  Abstracting Definitional Interpreters
  ☆69Updated 7 years ago
• david-christiansen / dan-scheme
  A very little language
  ☆16Updated 2 years ago
• Saizan / miller
  Miller/pattern unification in Agda
  ☆65Updated 11 years ago
• JoeyEremondi / GDTL-artifact
  A Gradual Dependently-typed Language
  ☆14Updated 6 years ago