alhassy / multistage-programming-tahaLinks
A Haskell implementation of the code within Walid Taha's ``A Gentle Introduction to Multi-stage Programming''
☆10Updated 6 years ago
Alternatives and similar repositories for multistage-programming-taha
Users that are interested in multistage-programming-taha are comparing it to the libraries listed below
Sorting:
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 3 years ago
- Proofs of the number of inhabitants of polymorphic functions☆23Updated 6 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- Bring fusion to everyone☆13Updated 5 years ago
- Dependently typed elimination functions using singletons☆28Updated 5 months ago
- ☆17Updated 6 years ago
- The Pico core language, and the Bake algorithm for elaborating Dependent Haskell into the former (WIP)☆15Updated 7 years ago
- Regular expressions of types☆16Updated 6 years ago
- Experimentation project☆16Updated 11 years ago
- using Data and Typeable to get a direct reflection system for free, when we're implementing a toy language in Haskell☆15Updated 5 years ago
- A typechecker for WebAssembly, written in Agda (WIP)☆17Updated 7 years ago
- Agda suffices: software written from A to Z in Agda☆16Updated 6 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
- van Laarhoven lenses for Idris☆20Updated 7 years ago
- Library implementation of "Generic description of well-scoped, well-typed syntaxes"☆12Updated 7 years ago
- Experiments with linear types☆14Updated 7 years ago
- Linear map categories in Agda☆5Updated 2 years ago
- A formalization of finite, constructive log analysis using linear temporal logic☆22Updated last week
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- Small implementation of OutsideIn(X) type checking algorithm☆31Updated 10 years ago
- Experiments in abstracting definitional interpreters☆16Updated 7 years ago
- A usable type system for call by push-value☆33Updated 5 years ago
- Type Theory with Indexed Equality☆25Updated 8 years ago
- Austin's supercompiler work☆21Updated 5 years ago
- ☆23Updated 7 years ago
- Syntactic evaluation of STLC (incl. proof of normalization a la Software Foundations)☆13Updated 7 years ago
- being an experiment with potato power☆23Updated 5 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 6 months ago
- Simple Haskell package for efficiently indexable finite and infinite enumerations.☆12Updated 2 months ago