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:
- The Alms Programming Language☆44Updated 7 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆51Updated 7 years ago
- ☆29Updated 10 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
- A nano "theorem prover".☆62Updated 6 years ago
- ET (IPL) language interpreters and literature☆26Updated 6 years ago
- Idris, but it's C☆24Updated 7 years ago
- SC Mini is a "minimal" positive supercompiler☆48Updated 5 years ago
- xmonad in Coq☆46Updated 13 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- An llvm pretty printer inspired by the haskell llvm binding☆30Updated last week
- Dependently typed Algorithm M and friends☆25Updated 7 years ago
- mechanization paired with https://github.com/hazelgrove/hazelnut-dynamics☆21Updated last year
- The Spire Programming Language☆59Updated 11 years ago
- Problem Sets for MIT 6.887 Formal Reasoning About Programs, Spring 2017☆20Updated 8 years ago
- Edit is a monad for rewriting things.☆23Updated 5 years ago
- A tiny language for teaching and experimenting with Refinement Types☆49Updated 4 years ago
- Interactive and object-oriented programming in Agda using coinductive types☆23Updated 3 weeks ago
- A series of implementations of a simple functional programming language.☆30Updated 9 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- A universe of scope- and type-safe syntaxes (syntices?). Includes generic implementation of type-preserving renaming/substitution with al…☆16Updated 8 years ago
- secret project☆17Updated 7 years ago
- A Dependently Typed Programming Language☆27Updated 5 years ago
- A dependently typed type checker for a TT with intervals☆23Updated 5 years ago
- Selective applicative functors laws and theorems☆14Updated 5 years ago
- A partial implementation of Protocol Buffers in Idris☆32Updated 8 years ago
- A general purpose programming language with linear types☆43Updated 8 years ago
- An higher-level LLVM binding for OCaml☆14Updated 8 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆51Updated 3 years ago