bts / deferred-substitutionLinks
An implementation of Ben Lippmeier's "Don't Substitute Into Abstractions"
☆15Updated 6 years ago
Alternatives and similar repositories for deferred-substitution
Users that are interested in deferred-substitution are comparing it to the libraries listed below
Sorting:
- System F implemented in Haskell☆24Updated 13 years ago
- Austin's supercompiler work☆21Updated 5 years ago
- "Programs that explain their effects" talk material☆17Updated 7 years ago
- Interpreter for functional pure type systems.☆21Updated 7 years ago
- Bring fusion to everyone☆13Updated 5 years ago
- Proofs of the number of inhabitants of polymorphic functions☆23Updated 6 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 6 months ago
- Resin: high performance variable binder and ast manipulation lib☆13Updated 6 years ago
- Unpinned byte arrays in GHC haskell☆22Updated 6 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22Updated 9 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Updated 5 years ago
- Diploma work (if this is still here contact me if you need details)☆13Updated 8 years ago
- Experiments in abstracting definitional interpreters☆16Updated 7 years ago
- Experiments with effect systems☆12Updated 9 years ago
- The Pico core language, and the Bake algorithm for elaborating Dependent Haskell into the former (WIP)☆15Updated 7 years ago
- ☆16Updated 4 months ago
- A tiny implementation of dependent types.☆11Updated 7 years ago
- A dependently typed type checker for a TT with intervals☆23Updated 5 years ago
- ☆23Updated 7 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 3 years ago
- Dependently typed elimination functions using singletons☆28Updated 5 months ago
- van Laarhoven lenses for Idris☆20Updated 7 years ago
- An append only list in a compact region☆25Updated 6 years ago
- being an experiment with potato power☆23Updated 5 years ago
- Authenticated Data Structures☆16Updated 9 years ago
- A tiny dependent typechecker in Haskell, translated from @andrejbauer's OCaml☆38Updated 5 years ago
- A usable type system for call by push-value☆33Updated 5 years ago
- Folds for recursive types with GHC Generics☆26Updated 5 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 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