Alternatives and similar repositories for howtoprovefullabstraction:

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

• LightAndLight / idris-but-its-c
  Idris, but it's C
  ☆24Updated 6 years ago
• jonsterling / tt
  secret project
  ☆17Updated 7 years ago
• pleiad / Refinements
  Experiments in formalizing refinement type systems in Coq
  ☆17Updated 9 years ago
• tov / alms
  The Alms Programming Language
  ☆44Updated 6 years ago
• protz / mezzo
  The language of the future!
  ☆72Updated last year
• ISANobody / sill
  ☆29Updated 9 years ago
• dvanhorn / oaam
  Optimizing Abstract Abstract Machines
  ☆31Updated 8 years ago
• plum-umd / cgc
  Constructive Galois connections
  ☆32Updated 7 years ago
• spire / spire
  The Spire Programming Language
  ☆59Updated 10 years ago
• VictorTaelin / ESCoC
  A nano "theorem prover".
  ☆62Updated 6 years ago
• gfngfn / toy-macro-ml
  An implementation of MacroML [Ganz, Sabry & Taha 2001]
  ☆32Updated 6 years ago
• UCSD-PL / nano-smt
  "Toy" SMT Solver for Educational Purposes
  ☆20Updated 12 years ago
• effectfully / Cubes
  A dependently typed type checker for a TT with intervals
  ☆22Updated 5 years ago
• maximedenes / coq-amd64
  ☆22Updated 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
• aspiwack / peppermint-prover
  Experimental proof assistant (and architecture) for dependent linear logic
  ☆47Updated 2 years ago
• dbp / funtal
  FunTAL: mixing a functional language with assembly.
  ☆40Updated 7 years ago
• google / idris-protobuf
  A partial implementation of Protocol Buffers in Idris
  ☆31Updated 7 years ago
• ucsd-progsys / mist
  A tiny language for teaching and experimenting with Refinement Types
  ☆47Updated 3 years ago
• gasche / popl2018-papers
  Link to preprints for POPL'18 and colocated events
  ☆87Updated 6 years ago
• nojb / mlpolyr
  MLpolyR
  ☆7Updated 8 years ago
• effectfully / STLC
  Dependently typed Algorithm M and friends
  ☆25Updated 6 years ago
• JoeyEremondi / GDTL-artifact
  A Gradual Dependently-typed Language
  ☆14Updated 5 years ago
• ilya-klyuchnikov / sc-mini
  SC Mini is a "minimal" positive supercompiler
  ☆47Updated 4 years ago
• andrejbauer / miniLCF
  A bare-bones LCF-style proof assistant
  ☆22Updated 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
• agda / ooAgda
  Interactive and object-oriented programming in Agda using coinductive types
  ☆23Updated 4 months ago
• kthielen / stlcc
  Simply-typed lambda calculus (plus several features) -> x86 executables for Linux and Windows
  ☆25Updated 12 years ago
• tuura / selective-theory-coq
  Selective applicative functors laws and theorems
  ☆14Updated 5 years ago
• mcimini / Gradualizer
  Supporting tool for Gradual Typing
  ☆16Updated 4 years ago