Alternatives and similar repositories for howtoprovefullabstraction

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

• ISANobody / sill
  ☆29Updated 10 years ago
• jonsterling / tt
  secret project
  ☆17Updated 7 years ago
• mit-frap / spring17
  Problem Sets for MIT 6.887 Formal Reasoning About Programs, Spring 2017
  ☆20Updated 8 years ago
• pleiad / Refinements
  Experiments in formalizing refinement type systems in Coq
  ☆18Updated 9 years ago
• philzook58 / lens-algebra
  Type level algebraic "proofs" using lens combinators
  ☆19Updated 6 years ago
• yallop / icfp2014-papers
  Accepted papers for ICFP 2014
  ☆119Updated 9 years ago
• gasche / popl2018-papers
  Link to preprints for POPL'18 and colocated events
  ☆86Updated 7 years ago
• LightAndLight / idris-but-its-c
  Idris, but it's C
  ☆24Updated 7 years ago
• edwinb / EpiVM
  Epic - a Supercombinator Compiler
  ☆64Updated 10 years ago
• spire / spire
  The Spire Programming Language
  ☆59Updated 10 years ago
• VictorTaelin / ESCoC
  A nano "theorem prover".
  ☆62Updated 6 years ago
• effectfully / STLC
  Dependently typed Algorithm M and friends
  ☆25Updated 7 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
• liamoc / hilbert
  An intensely interactive, graphical theorem prover based on natural deduction
  ☆29Updated 11 years ago
• deech / LeftPad
  ☆23Updated 7 years ago
• sigurdschneider / lvc
  LVC verified compiler
  ☆58Updated 6 years ago
• effectfully / Cubes
  A dependently typed type checker for a TT with intervals
  ☆23Updated 5 years ago
• dbp / funtal
  FunTAL: mixing a functional language with assembly.
  ☆40Updated 8 years ago
• mietek / et-lang
  ET (IPL) language interpreters and literature
  ☆26Updated 6 years ago
• maximedenes / coq-amd64
  ☆22Updated 9 years ago
• tuura / selective-theory-coq
  Selective applicative functors laws and theorems
  ☆14Updated 5 years ago
• ichistmeinname / free-proving
  Resources for "One Monad to Prove Them All"
  ☆29Updated 6 years ago
• mit-plv / timl
  TiML: A Functional Programming Language with Time Complexity
  ☆80Updated 8 years ago
• logic-tools / sml-handbook
  SML code for Handbook of Practical Logic and Automated Reasoning - For Isabelle too
  ☆36Updated 8 years ago
• kthielen / stlcc
  Simply-typed lambda calculus (plus several features) -> x86 executables for Linux and Windows
  ☆25Updated 12 years ago
• typesanitizer / edit
  Edit is a monad for rewriting things.
  ☆23Updated 5 years ago
• google / idris-protobuf
  A partial implementation of Protocol Buffers in Idris
  ☆32Updated 8 years ago
• QuickChick / Luck
  Luck -- A Language for Property-Based Generators
  ☆35Updated 7 months ago
• robsimmons / abbot
  Generation of abstract binding trees
  ☆27Updated 2 weeks ago
• vellvm / ollvm
  An higher-level LLVM binding for OCaml
  ☆14Updated 8 years ago