Alternatives and similar repositories for stop2015-redex:

Users that are interested in stop2015-redex are comparing it to the libraries listed below

• david-christiansen / idris-interaction.rkt
  A Racket library for interacting with Idris over the IDE protocol
  ☆31Updated 7 years ago
• wilbowma / cic-redex
  A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.
  ☆33Updated 7 years ago
• msp-strath / ZEUG
  being the beginnings of at least zero typecheckers
  ☆32Updated 7 years ago
• gallais / generic-syntax
  A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs
  ☆71Updated 2 years ago
• david-christiansen / pudding-old
  A language-integrated proof assistant, for and in Racket
  ☆39Updated 8 years ago
• jaycech3n / Isabelle-HoTT
  An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle
  ☆34Updated 2 years ago
• ericfinster / opetopes-in-agda
  Formalization of Opetopes and Opetopic Sets in Agda
  ☆18Updated 8 years ago
• pnwamk / datatype
  (Somewhat) Algebraic Data Types for Racket
  ☆34Updated 2 years ago
• maxsnew / modal-scheme
  A Scheme-like CBPV language with Racket Interoperability
  ☆39Updated 10 months ago
• mmirman / caledon
  higher order dependently typed logic programing
  ☆170Updated 6 years ago
• gallais / agda-sizedIO
  IO using sized types and copatterns
  ☆33Updated 3 years ago
• jyp / prettiest
  The Prettiest Printer
  ☆35Updated 11 months ago
• gbaz / mess
  Martin-Löf Extensible Specification and Simulator
  ☆29Updated 9 years ago
• melted / idris-chez
  An idris backend compiling to chez scheme
  ☆47Updated 7 years ago
• philnguyen / z3-rkt
  Racket bindings for Z3
  ☆24Updated 5 years ago
• scmu / foundations-harper
  Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.
  ☆54Updated 5 years ago
• heades / System-F-Coq
  System F in coq.
  ☆19Updated 10 years ago
• jozefg / miniprl
  A small implementation of a proof refinement logic.
  ☆50Updated 7 years ago
• pigworker / Bi71
  being a bidirectional reformulation of Martin-Löf's 1971 type theory
  ☆25Updated 7 years ago
• pa-ba / calc-comp
  Coq proofs for the paper "Calculating Correct Compilers"
  ☆30Updated last year
• mietek / epigram2
  Mirror of Epigram 2, by Conor McBride, et al.
  ☆48Updated 4 years ago
• jyp / nano-Agda
  Tiny type-checker with dependent types
  ☆76Updated 11 years ago
• agda-attic / agda-system-io
  Bindings to Haskell's IO monad which respect Agda's semantics
  ☆24Updated 6 years ago
• david-christiansen / epigram1
  A version of Epigram 1 that can run with newer GHCs
  ☆52Updated 7 years ago
• vmchale / recursion_schemes
  Recursion schemes for Idris
  ☆64Updated 6 years ago
• sweirich / corespec
  A Specification for Dependent Types in Haskell (Core)
  ☆64Updated 2 years ago
• Saizan / miller
  Miller/pattern unification in Agda
  ☆63Updated 10 years ago
• ucsd-progsys / mist
  A tiny language for teaching and experimenting with Refinement Types
  ☆47Updated 3 years ago
• clayrat / sequent-calc
  Experiments with sequent calculi
  ☆26Updated 3 years ago
• david-christiansen / racket-zippers
  A zipper library for Racket
  ☆19Updated 8 years ago