Alternatives and similar repositories for plrg

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

• tlaplus / tlapm_alternative_parser_experiment
  The rewrite of TLAPM, the TLAPS proof manager
  ☆1Updated 5 years ago
• RobertHarper / nsml
  SML The Living Language
  ☆11Updated 11 years ago
• nineties / Choco
  MinCaml Compiler implementation by Haskell
  ☆11Updated 13 years ago
• statebox / bcfwm
  Blockchain Technology for the Working Mathematician
  ☆24Updated 7 years ago
• favonia / homotopy
  My old Agda code for Homotopy Type Theory. (Halted. See HoTT/HoTT-Agda for the new one.)
  ☆26Updated 10 years ago
• cmeiklejohn / distributed-data-structures
  Distributed Data Structures in Coq
  ☆49Updated 11 years ago
• mit-frap / spring21
  Problem Sets for MIT 6.822 Formal Reasoning About Programs, Spring 2021
  ☆18Updated 4 years ago
• ISANobody / sill
  ☆29Updated 9 years ago
• mit-frap / spring17
  Problem Sets for MIT 6.887 Formal Reasoning About Programs, Spring 2017
  ☆20Updated 8 years ago
• kthielen / stlcc
  Simply-typed lambda calculus (plus several features) -> x86 executables for Linux and Windows
  ☆25Updated 12 years ago
• JUrban / MPTP2
  ☆19Updated 8 years ago
• DistributedComponents / verdi-chord
  An implementation of the Chord lookup protocol verified in Coq using the Verdi framework
  ☆10Updated 6 years ago
• rocq-community / bits
  A formalization of bitset operations in Coq and the corresponding axiomatization and extraction to OCaml native integers [maintainer=@ant…
  ☆23Updated last month
• DianaPajon / tiger
  A Haskell implementation of the tiger compiler
  ☆10Updated 5 years ago
• davidlazar / llvm-semantics
  Formal semantics of LLVM IR in K
  ☆44Updated 9 years ago
• cuplv / iodyn-lang.rust
  IODyn: A functional language for implicitly-incremental programs with dynamic input and output collections
  ☆15Updated 7 years ago
• lindig / lipsum
  A Literate Programming Tool inspired by NoWeb, implemented in OCaml
  ☆35Updated 6 years ago
• Deducteam / SizeChangeTool
  A termination checker for higher-order rewriting with dependent types
  ☆10Updated 5 years ago
• kmicinski / program-analysis-examples
  Notes for CIS 700 (Fall '19) at Syracuse U.
  ☆13Updated 5 years ago
• snu-sf / promising-coq
  The Coq development of A Promising Semantics for Relaxed-Memory Concurrency
  ☆37Updated 7 months ago
• janestreet / async_parallel
  Distributed computing library
  ☆35Updated 6 years ago
• edwinb / Ivor
  A type theory based theorem proving library
  ☆25Updated 13 years ago
• runtimeverification / llvm-backend
  KORE to llvm translation
  ☆38Updated last week
• CoqHott / coq-forcing
  A plugin for Coq that implements the call-by-name forcing translation
  ☆12Updated 4 years ago
• logic-tools / sml-handbook
  SML code for Handbook of Practical Logic and Automated Reasoning - For Isabelle too
  ☆36Updated 8 years ago
• uwplse / arvo
  A proof assistant.
  ☆12Updated 9 years ago
• GeorgOfenbeck / SpaceTime
  This github repository hosts the code used within my thesis work and my last publication.
  ☆12Updated 7 years ago
• webyrd / slpKanren
  Stochastic Logic Programs (SLP) style probabilistic logic programming in miniKanren
  ☆34Updated 12 years ago
• uwplse / potpie
  Proof Object Transformation, Preserving Imp Embeddings: the first proof compiler to be formally proven correct
  ☆16Updated 9 months ago
• jamesbornholt / ocelot
  A synthesis-enabled solver for relational logic
  ☆27Updated 7 years ago