Alternatives and similar repositories for claims

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

• gasche / popl2018-papers
  Link to preprints for POPL'18 and colocated events
  ☆86Updated 7 years ago
• gasche / popl2017-papers
  Link to preprints for POPL'17 and co-located events
  ☆100Updated 8 years ago
• clf / celf
  ☆62Updated 6 years ago
• ISANobody / sill
  ☆29Updated 10 years ago
• aa755 / ROSCoq
  Robots powered by Constructive Reals
  ☆34Updated 7 years ago
• QuickChick / Luck
  Luck -- A Language for Property-Based Generators
  ☆35Updated 8 months ago
• bmsherman / topology
  Formal topology (and some probability) in Coq
  ☆32Updated 6 years ago
• mit-frap / spring17
  Problem Sets for MIT 6.887 Formal Reasoning About Programs, Spring 2017
  ☆20Updated 8 years ago
• plum-umd / abstracting-definitional-interpreters
  Abstracting Definitional Interpreters
  ☆72Updated 7 years ago
• logic-tools / sml-handbook
  SML code for Handbook of Practical Logic and Automated Reasoning - For Isabelle too
  ☆36Updated 8 years ago
• wouter-swierstra / xmonad
  xmonad in Coq
  ☆46Updated 13 years ago
• plum-umd / cgc
  Constructive Galois connections
  ☆36Updated 7 years ago
• iu-parfunc / lvars
  The LVish Haskell library
  ☆80Updated 3 years ago
• danr / hipspec
  A hip inductive theorem prover!
  ☆90Updated 3 years ago
• UCSD-PL / nano-smt
  "Toy" SMT Solver for Educational Purposes
  ☆20Updated 12 years ago
• SkySkimmer / HoTTClasses
  HoTT proofs using experimental induction-induction (mostly about real numbers) (used to contain the HoTT.Classes proofs)
  ☆15Updated 4 years ago
• sweirich / tal
  An implementation of Typed Assembly Language (Morrisett, Walker, Crary, Glew)
  ☆149Updated 4 years ago
• mit-plv / fiat
  Mostly Automated Synthesis of Correct-by-Construction Programs
  ☆154Updated last month
• TheoWinterhalter / formal-type-theory
  Formalising Type Theory in a modular way for translations between type theories
  ☆95Updated 7 years ago
• ynot-harvard / ynot
  The Ynot Project source code.
  ☆22Updated 11 years ago
• sweirich / trellys
  Automatically exported from code.google.com/p/trellys
  ☆47Updated 6 years ago
• jozefg / miniprl
  A small implementation of a proof refinement logic.
  ☆50Updated 8 years ago
• DeepSpec / dsss18
  Lecture material for DeepSpec Summer School 2018
  ☆67Updated 6 years ago
• pa-ba / calc-comp
  Coq proofs for the paper "Calculating Correct Compilers"
  ☆31Updated last year
• OPLSS / oplss-notes-2017
  handouts and notes from the 2017 edition of the summer school
  ☆39Updated 8 years ago
• dvanhorn / redex-aam-tutorial
  An Introduction to Redex with Abstracting Abstract Machines
  ☆103Updated last year
• philnguyen / z3-rkt
  Racket bindings for Z3
  ☆24Updated 6 years ago
• mietek / research
  Work in progress
  ☆38Updated 4 months ago
• ilyasergey / monadic-cfa
  Generic implementation of different CFA families based on monadic decomposition
  ☆21Updated 12 years ago
• dbp / funtal
  FunTAL: mixing a functional language with assembly.
  ☆40Updated 8 years ago