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
• tov / alms
  The Alms Programming Language
  ☆44Updated 6 years ago
• spire / spire
  The Spire Programming Language
  ☆59Updated 10 years ago
• UCSD-PL / nano-smt
  "Toy" SMT Solver for Educational Purposes
  ☆20Updated 11 years ago
• ilya-klyuchnikov / sc-mini
  SC Mini is a "minimal" positive supercompiler
  ☆46Updated 4 years ago
• ucsd-progsys / mist
  A tiny language for teaching and experimenting with Refinement Types
  ☆47Updated 3 years ago
• jonsterling / tt
  secret project
  ☆17Updated 6 years ago
• effectfully / STLC
  Dependently typed Algorithm M and friends
  ☆25Updated 6 years ago
• pleiad / Refinements
  Experiments in formalizing refinement type systems in Coq
  ☆17Updated 8 years ago
• themattchan / haskell-tiger
  Modern compiler implementation in ML, in Haskell
  ☆16Updated 6 years ago
• pigworker / Totality
  being the programs and code for a paper about general recursion
  ☆24Updated 9 years ago
• VictorTaelin / ESCoC
  A nano "theorem prover".
  ☆61Updated 5 years ago
• ISANobody / sill
  ☆29Updated 9 years ago
• nomeata / haskell-for-readers
  Lecture notes for teaching Haskell to those who want to read it
  ☆55Updated 2 years ago
• langston-barrett / write-yourself-a-scheme-in-agda
  Like "Write Yourself a Scheme in 48 Hours", but in Agda
  ☆52Updated 6 years ago
• rowandavies / sml-cidre
  SML Checker for Intersection and Datasort Refinements (pronounced "cider")
  ☆20Updated 11 years ago
• aspiwack / peppermint-prover
  Experimental proof assistant (and architecture) for dependent linear logic
  ☆47Updated 2 years ago
• LightAndLight / lambdapi
  Educational implementation of dependent types
  ☆19Updated 6 years ago
• mietek / epigram2
  Mirror of Epigram 2, by Conor McBride, et al.
  ☆48Updated 4 years ago
• kthielen / stlcc
  Simply-typed lambda calculus (plus several features) -> x86 executables for Linux and Windows
  ☆25Updated 11 years ago
• clarus / coq-blog
  A blog about Coq
  ☆10Updated 3 years ago
• dorchard / effects-as-sessions
  Formalised embedding of an imperative language with effect system into session-typed pi calculus.
  ☆28Updated last month
• 8l / asif
  A Self-Interpreter for F-omega
  ☆16Updated 9 years ago
• renzyq19 / pi-calculus
  ☆26Updated 10 years ago
• ioanluca / real-world-idris
  Malfunction backend for Idris with a FFI to OCaml
  ☆28Updated 5 years ago
• agda / ooAgda
  Interactive and object-oriented programming in Agda using coinductive types
  ☆23Updated last month
• gergoerdi / generic-syntax
  Library implementation of "Generic description of well-scoped, well-typed syntaxes"
  ☆12Updated 6 years ago
• vellvm / ollvm
  An higher-level LLVM binding for OCaml
  ☆14Updated 7 years ago
• liamoc / hilbert
  An intensely interactive, graphical theorem prover based on natural deduction
  ☆29Updated 10 years ago