Alternatives and similar repositories for rust-redex

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

• ISANobody / sill
  ☆29Updated 9 years ago
• hubris-lang / hubris
  A dependently typed programming language, and verification tool
  ☆26Updated 9 years ago
• robsimmons / abbot
  Generation of abstract binding trees
  ☆28Updated 9 months ago
• jozefg / miniprl
  A small implementation of a proof refinement logic.
  ☆50Updated 8 years ago
• ammkrn / nanoda
  A type checker for the Lean theorem prover
  ☆41Updated 4 years ago
• david-christiansen / tt-playground
  A playground for type theory implementations in Racket
  ☆20Updated 9 years ago
• zydeco-lang / fiddle
  A dynamically-typed CBPV language embedded in Racket
  ☆39Updated last year
• brendanzab / rust-nbe-for-mltt
  Normalization by evaluation for Martin-Löf Type Theory with dependent records
  ☆98Updated 3 years ago
• mit-frap / spring17
  Problem Sets for MIT 6.887 Formal Reasoning About Programs, Spring 2017
  ☆20Updated 8 years ago
• joom / WangsAlgorithm
  A classical propositional theorem prover in Haskell, using Wang's Algorithm.
  ☆36Updated 6 years ago
• rowandavies / sml-cidre
  SML Checker for Intersection and Datasort Refinements (pronounced "cider")
  ☆20Updated 12 years ago
• dorchard / effects-as-sessions
  Formalised embedding of an imperative language with effect system into session-typed pi calculus.
  ☆29Updated 8 months ago
• willcrichton / rabbot
  Abstract binding tree code generator
  ☆37Updated 8 years ago
• plum-umd / cgc
  Constructive Galois connections
  ☆34Updated 7 years ago
• cmcl / franklyfrank
  A prototype implementation of the Frank programming language
  ☆17Updated 9 years ago
• AndyShiue / pts
  implementation of Pure Type Systems (PTS) in Rust.
  ☆52Updated 8 years ago
• tov / alms
  The Alms Programming Language
  ☆44Updated 6 years ago
• pleiad / Refinements
  Experiments in formalizing refinement type systems in Coq
  ☆18Updated 9 years ago
• neel-krishnaswami / linearml
  A simple implementation of linear type theory
  ☆38Updated 8 years ago
• pa-ba / calc-comp
  Coq proofs for the paper "Calculating Correct Compilers"
  ☆30Updated last year
• protz / mezzo
  The language of the future!
  ☆72Updated last year
• habit-lang / alb
  ☆39Updated last year
• idris-hackers / idris-posix
  System POSIX bindings for Idris.
  ☆36Updated 6 years ago
• wilbowma / dissertation
  The source for "Compiling with Dependent Types" (my dissertation)
  ☆30Updated 3 years ago
• JohnReppy / compiling-pattern-guards
  Prototype code that accompanies the paper "Compiling Successor ML Pattern Guards"
  ☆25Updated 3 years ago
• neel-krishnaswami / adjs
  Higher-order FRP compiler
  ☆15Updated 3 years ago
• RobertHarper / TILT-Compiler
  Standard ML compiler based on typed intermediate languages.
  ☆48Updated 10 years ago
• wilbowma / cic-redex
  A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.
  ☆34Updated 8 years ago
• heades / System-F-Coq
  System F in coq.
  ☆19Updated 10 years ago
• rocq-community / dblib
  Coq library for working with de Bruijn indices [maintainer=@KevOrr]
  ☆30Updated 3 years ago