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:
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 6 years ago
- Austin's supercompiler work☆21Updated 6 years ago
- Bring fusion to everyone☆14Updated 5 years ago
- "Programs that explain their effects" talk material☆17Updated 7 years ago
- Type Theory with Indexed Equality☆26Updated 8 years ago
- Dependently typed elimination functions using singletons☆28Updated last year
- Proofs of the number of inhabitants of polymorphic functions☆23Updated 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
- System F implemented in Haskell☆24Updated 13 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated last year
- being the emperor of Mongo, but also a verb☆15Updated 7 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆21Updated 3 years ago
- The Pico core language, and the Bake algorithm for elaborating Dependent Haskell into the former (WIP)☆15Updated 7 years ago
- Experiments with effect systems☆12Updated 9 years ago
- Resin: high performance variable binder and ast manipulation lib☆13Updated 7 years ago
- An Agda library for reasoning about asynchronous iterative algorithms and network routing problems☆28Updated 2 years ago
- Syntactic evaluation of STLC (incl. proof of normalization a la Software Foundations)☆13Updated 8 years ago
- Decision procedures for Presburger arithmetic in Haskell☆30Updated 9 months ago
- Authenticated Data Structures☆16Updated 10 years ago
- Interpreter for functional pure type systems.☆21Updated 8 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Updated 5 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- ☆17Updated 7 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22Updated 9 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 6 years ago
- Small implementation of OutsideIn(X) type checking algorithm☆31Updated 10 years ago
- Deep embedding of imperative programs with code generation☆23Updated 3 years ago
- A tiny implementation of dependent types.☆11Updated 8 years ago
- used to be something more ambitious, cut scope to just a simple compiler for thesis project☆17Updated 6 years ago
- A usable type system for call by push-value☆33Updated 6 years ago