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
- SC Mini is a "minimal" positive supercompiler☆46Updated 4 years ago
- ☆29Updated 9 years ago
- Idris, but it's C☆24Updated 7 years ago
- Experiments in formalizing refinement type systems in Coq☆18Updated 9 years ago
- Type level algebraic "proofs" using lens combinators☆19Updated 6 years ago
- Problem Sets for MIT 6.887 Formal Reasoning About Programs, Spring 2017☆20Updated 8 years ago
- Generation of abstract binding trees☆27Updated 10 months ago
- Dependently typed Algorithm M and friends☆25Updated 7 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆51Updated 7 years ago
- Compositional type checking for a Hindley-Milner type system☆11Updated 8 years ago
- The Spire Programming Language☆59Updated 10 years ago
- FunTAL: mixing a functional language with assembly.☆40Updated 8 years ago
- Simply-typed lambda calculus (plus several features) -> x86 executables for Linux and Windows☆25Updated 12 years ago
- A nano "theorem prover".☆62Updated 6 years ago
- A partial implementation of Protocol Buffers in Idris☆31Updated 8 years ago
- An intensely interactive, graphical theorem prover based on natural deduction☆29Updated 11 years ago
- An llvm pretty printer inspired by the haskell llvm binding☆30Updated 3 weeks ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- Luck -- A Language for Property-Based Generators☆35Updated 6 months ago
- A dependently typed type checker for a TT with intervals☆23Updated 5 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated 9 months ago
- A general yet easy-to-use formalization of Big O, Big Theta, and more based on seminormed vector spaces.☆35Updated 8 years ago
- Tentative write-up of a neat trick used in the Mezzo type-checker☆15Updated 9 years ago
- "Programs that explain their effects" talk material☆17Updated 7 years ago
- Resources for "One Monad to Prove Them All"☆29Updated 6 years ago
- Selective applicative functors laws and theorems☆14Updated 5 years ago
- ET (IPL) language interpreters and literature☆26Updated 6 years ago
- The Alms Programming Language☆44Updated 7 years ago