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
- ☆29Updated 10 years ago
- The Spire Programming Language☆59Updated 11 years ago
- A nano "theorem prover".☆62Updated 6 years ago
- Problem Sets for MIT 6.887 Formal Reasoning About Programs, Spring 2017☆20Updated 8 years ago
- ET (IPL) language interpreters and literature☆26Updated 6 years ago
- Type level algebraic "proofs" using lens combinators☆19Updated 6 years ago
- Experiments in formalizing refinement type systems in Coq☆18Updated 9 years ago
- Interactive and object-oriented programming in Agda using coinductive types☆23Updated 5 months ago
- The Alms Programming Language☆44Updated 7 years ago
- Idris, but it's C☆24Updated 7 years ago
- SC Mini is a "minimal" positive supercompiler☆46Updated 4 years ago
- The language of the future!☆72Updated last year
- A series of implementations of a simple functional programming language.☆30Updated 9 years ago
- TiML: A Functional Programming Language with Time Complexity☆80Updated 8 years ago
- An higher-level LLVM binding for OCaml☆14Updated 8 years ago
- Dependently typed Algorithm M and friends☆25Updated 7 years ago
- Link to preprints for POPL'18 and colocated events☆86Updated 7 years ago
- ☆23Updated 7 years ago
- Tentative write-up of a neat trick used in the Mezzo type-checker☆15Updated 9 years ago
- An llvm pretty printer inspired by the haskell llvm binding☆30Updated this week
- A type theory based theorem proving library☆25Updated 14 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- A dependently typed type checker for a TT with intervals☆23Updated 5 years ago
- Simply-typed lambda calculus (plus several features) -> x86 executables for Linux and Windows☆25Updated 12 years ago
- A partial implementation of Protocol Buffers in Idris☆32Updated 8 years ago
- A lazy non-deterministic concatenative programming language☆55Updated 12 years ago
- A Dependently Typed Programming Language☆27Updated 5 years ago
- Reference type checker for the Lean theorem prover☆64Updated 8 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆51Updated 7 years ago