jonleivent / mindless-coding
Mindless, verified (erasably) coding using dependent types
☆104Updated 9 years ago
Alternatives and similar repositories for mindless-coding:
Users that are interested in mindless-coding are comparing it to the libraries listed below
- An proof refinement logic for computational type theory. Inspired by Nuprl. [For up-to-date development, see JonPRL's successor, RedPRL: …☆110Updated 6 years ago
- Type provider library for Idris☆94Updated 7 years ago
- Experimental Malfunction backend for Idris☆81Updated 6 years ago
- Slides and exercises for the Idris course taught at Galois☆50Updated 9 years ago
- A small implementation of a proof refinement logic.☆50Updated 7 years ago
- Automatically exported from code.google.com/p/trellys☆46Updated 5 years ago
- An experimental type checker for a modal dependent type theory.☆110Updated 4 years ago
- Distributed programming language that desugars to Morte☆92Updated 2 years ago
- Various data structures for use in the Idris Language.☆95Updated 4 years ago
- being some experiments, working towards some equipment I wish I had☆37Updated 9 years ago
- A hip inductive theorem prover!☆89Updated 3 years ago
- OCaml backend for Agda☆39Updated 6 years ago
- An implementation of Functional Reactive Programming☆40Updated 10 years ago
- being the materials for CS410 Advanced Functional Programming in the 2015/16 session☆40Updated 8 years ago
- Link to preprints for POPL'18 and colocated events☆87Updated 6 years ago
- being the beginnings of at least zero typecheckers☆33Updated 8 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- The Disco Discus Compiler☆174Updated 6 years ago
- ET (IPL) language interpreters and literature☆26Updated 6 years ago
- A pure Haskell implementation of Datalog☆105Updated 4 years ago
- higher order dependently typed logic programing☆170Updated 6 years ago
- A small Haskell implementation of Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism☆101Updated 7 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 8 months ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆54Updated 5 years ago
- Accepted papers for ICFP 2015☆45Updated 9 years ago
- A library for patches (diffs) on vectors: composable, mergeable and invertible☆55Updated 6 years ago
- ☆45Updated 5 years ago
- ☆84Updated 7 years ago
- Mindless, verified (erasably) coding using dependent types, phase 2☆20Updated 4 years ago
- A re-do of the SimpleFP repo using de Bruijn index ABTs instead of HOAS☆108Updated 7 years ago