LightAndLight / parametricity-proofsLinks
Proofs of the number of inhabitants of polymorphic functions
☆23Updated 7 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☆14Updated 5 years ago
- Dependently typed elimination functions using singletons☆28Updated 9 months ago
- An implementation of the Haskell ByteString library using the Fiat system from MIT☆34Updated 3 years ago
- Manage Nix Haskell override sets☆11Updated 7 years ago
- Syntactic evaluation of STLC (incl. proof of normalization a la Software Foundations)☆13Updated 7 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 6 years ago
- A monadic interface for DAG construction.☆24Updated 4 years ago
- The Pico core language, and the Bake algorithm for elaborating Dependent Haskell into the former (WIP)☆15Updated 7 years ago
- Folds for recursive types with GHC Generics☆28Updated 2 months ago
- System F implemented in Haskell☆24Updated 13 years ago
- Deriving Storable instances using GHC.Generics☆16Updated 3 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Updated 4 years ago
- Hack idiom-brackets using GHC Source Plugin (8.6+)☆25Updated 7 years ago
- A formal verification of Linear Temporal Logic in Coq☆23Updated last week
- being a programming language for sequential circuits☆20Updated last week
- A tiny implementation of dependent types.☆11Updated 8 years ago
- Compiling to STLC to categories in Haskell and Coq, using Conal Elliot's work☆19Updated 7 years ago
- Type-level assertion operators☆16Updated 7 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 3 years ago
- Deep embedding of imperative programs with code generation☆23Updated 3 years ago
- A usable type system for call by push-value☆33Updated 5 years ago
- ScopeT and ScopeH☆13Updated last year
- An Agda library for reasoning about asynchronous iterative algorithms and network routing problems☆28Updated last year
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22Updated 9 years ago
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Updated 5 years ago
- A package re-exporting the verified subset of containers☆20Updated 7 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 3 months ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 3 years ago
- Code to go along with the blog post "Are Mutable References in Haskell Fast?"☆10Updated 8 years ago