dbp / howtoprovefullabstractionLinks
Writeup that goes along with this:
☆15Updated 7 years ago
Alternatives and similar repositories for howtoprovefullabstraction
Users that are interested in howtoprovefullabstraction are comparing it to the libraries listed below
Sorting:
- secret project☆17Updated 7 years ago
- An higher-level LLVM binding for OCaml☆14Updated 8 years ago
- Problem Sets for MIT 6.887 Formal Reasoning About Programs, Spring 2017☆20Updated 8 years ago
- ☆29Updated 10 years ago
- Experiments in formalizing refinement type systems in Coq☆18Updated 9 years ago
- An intensely interactive, graphical theorem prover based on natural deduction☆29Updated 11 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆51Updated 7 years ago
- Type level algebraic "proofs" using lens combinators☆19Updated 6 years ago
- Selective applicative functors laws and theorems☆15Updated 5 years ago
- The Spire Programming Language☆59Updated 11 years ago
- SC Mini is a "minimal" positive supercompiler☆48Updated 5 years ago
- A nano "theorem prover".☆62Updated 6 years ago
- Idris, but it's C☆24Updated 7 years ago
- ☆21Updated 9 years ago
- The Alms Programming Language☆44Updated 7 years ago
- A partial implementation of Protocol Buffers in Idris☆32Updated 8 years ago
- A small NuPRL style proof assistant☆31Updated 6 years ago
- mechanization paired with https://github.com/hazelgrove/hazelnut-dynamics☆21Updated last year
- ET (IPL) language interpreters and literature☆26Updated 6 years ago
- SML code for Handbook of Practical Logic and Automated Reasoning - For Isabelle too☆36Updated 9 years ago
- A dependently typed type checker for a TT with intervals☆24Updated 5 years ago
- FunTAL: mixing a functional language with assembly.☆41Updated 8 years ago
- A tiny statically typed programming language☆18Updated 11 years ago
- A tiny language for teaching and experimenting with Refinement Types☆49Updated 4 years ago
- An llvm pretty printer inspired by the haskell llvm binding☆30Updated 2 weeks ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated last year
- Dependently typed Algorithm M and friends☆26Updated 7 years ago
- xmonad in Coq☆46Updated 13 years ago
- Lecture notes for teaching Haskell to those who want to read it☆55Updated 3 years ago