LightAndLight / parametricity-proofsLinks
Proofs of the number of inhabitants of polymorphic functions
☆23Updated 6 years ago
Alternatives and similar repositories for parametricity-proofs
Users that are interested in parametricity-proofs are comparing it to the libraries listed below
Sorting:
- Bring fusion to everyone☆13Updated 5 years ago
- Folds for recursive types with GHC Generics☆26Updated 5 years ago
- The Pico core language, and the Bake algorithm for elaborating Dependent Haskell into the former (WIP)☆15Updated 7 years ago
- Manage Nix Haskell override sets☆11Updated 6 years ago
- Dependently typed elimination functions using singletons☆28Updated 5 months ago
- An experimental build system based on the Haxl library☆8Updated 6 years ago
- being a programming language for sequential circuits☆20Updated 7 months ago
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- A terminal UI for inspecting steps taken by a rewriting process. Useful for the optimization phase of a compiler, or even evaluators of s…☆21Updated 5 years ago
- "Programs that explain their effects" talk material☆17Updated 7 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 3 years ago
- Staged Streams and other stuff☆18Updated 2 years ago
- ☆24Updated 5 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Updated 3 years ago
- System F implemented in Haskell☆24Updated 13 years ago
- being a thing I build on a Saturday☆28Updated 7 years ago
- ☆16Updated 3 years ago
- ScopeT and ScopeH☆13Updated 10 months ago
- Austin's supercompiler work☆21Updated 5 years ago
- A Haskell implementation of the code within Walid Taha's ``A Gentle Introduction to Multi-stage Programming''☆10Updated 6 years ago
- This a type-checker plugin to rule all type checker plugins involving type-equality reasoning using smt solvers.☆21Updated 3 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Updated 5 years ago
- being the programs and code for a paper about general recursion☆25Updated 10 years ago
- An implementation of the Haskell ByteString library using the Fiat system from MIT☆34Updated 3 years ago
- Code to go along with the blog post "Are Mutable References in Haskell Fast?"☆10Updated 8 years ago
- Haskell Type Level Example Programs☆29Updated 7 years ago
- Syntactic evaluation of STLC (incl. proof of normalization a la Software Foundations)☆13Updated 7 years ago
- Regular expressions of types☆16Updated 6 years ago
- Type-level assertion operators☆16Updated 7 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 3 years ago