bts / deferred-substitutionLinks
An implementation of Ben Lippmeier's "Don't Substitute Into Abstractions"
☆15Updated 7 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:
- Austin's supercompiler work☆21Updated 6 years ago
- Deep embedding of imperative programs with code generation☆23Updated 3 years ago
- "Programs that explain their effects" talk material☆17Updated 7 years ago
- The Pico core language, and the Bake algorithm for elaborating Dependent Haskell into the former (WIP)☆15Updated 7 years ago
- Resin: high performance variable binder and ast manipulation lib☆13Updated 7 years ago
- Bring fusion to everyone☆14Updated 5 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated last year
- Authenticated Data Structures☆16Updated 10 years ago
- Dependently typed elimination functions using singletons☆28Updated 2 weeks ago
- Roundtrip allows the definition of bidirectional (de-)serialization specifications☆16Updated last year
- A usable type system for call by push-value☆33Updated 6 years ago
- A typechecker for WebAssembly, written in Agda (WIP)☆17Updated 7 years ago
- Decision procedures for Presburger arithmetic in Haskell☆30Updated 9 months ago
- System F implemented in Haskell☆24Updated 13 years ago
- Experiments with effect systems☆12Updated 9 years ago
- being an experiment with potato power☆23Updated 6 years ago
- A tiny dependent typechecker in Haskell, translated from @andrejbauer's OCaml☆38Updated 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 6 years ago
- Proofs of the number of inhabitants of polymorphic functions☆23Updated 7 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆21Updated 3 years ago
- Type Theory with Indexed Equality☆26Updated 8 years ago
- Interpreter for functional pure type systems.☆21Updated 8 years ago
- used to be something more ambitious, cut scope to just a simple compiler for thesis project☆17Updated 7 years ago
- Unpinned byte arrays in GHC haskell☆22Updated 7 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 6 years ago
- Build Status A Haskell implementation of the ZKBoo protocol for non-interactive zero-knowledge arguments of boolean circuits.☆18Updated 7 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Updated 6 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- van Laarhoven lenses for Idris☆20Updated 8 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 4 years ago