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
- A typechecker for WebAssembly, written in Agda (WIP)☆17Updated 7 years ago
- Type level algebraic "proofs" using lens combinators☆19Updated 5 years ago
- Regular expressions of types☆16Updated 6 years ago
- ☆17Updated 6 years ago
- Dependently typed elimination functions using singletons☆28Updated 6 months ago
- Proofs of the number of inhabitants of polymorphic functions☆23Updated 6 years ago
- Experimentation project☆16Updated 11 years ago
- Experiments in abstracting definitional interpreters☆16Updated 7 years ago
- A formalization of finite, constructive log analysis using linear temporal logic☆22Updated 3 weeks ago
- An Agda library for reasoning about asynchronous iterative algorithms and network routing problems☆27Updated last year
- Small implementation of OutsideIn(X) type checking algorithm☆31Updated 10 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- A small NuPRL style proof assistant☆31Updated 6 years ago
- van Laarhoven lenses for Idris☆20Updated 7 years ago
- classical sequent calculus, embedded in Haskell☆20Updated 3 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- Agda suffices: software written from A to Z in Agda☆16Updated 6 years ago
- Mathematical stories☆13Updated 4 years ago
- being an experiment with potato power☆23Updated 5 years ago
- A tiny implementation of dependent types.☆11Updated 7 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- Linear map categories in Agda☆5Updated 2 years ago
- Proof combinators used in Liquid Haskell for theorem proving☆12Updated 7 years ago
- A tiny dependent typechecker in Haskell, translated from @andrejbauer's OCaml☆38Updated 5 years ago
- ☆16Updated 4 months ago
- An attempt to formalize unix cat in fiat☆12Updated 8 years ago
- A usable type system for call by push-value☆33Updated 5 years ago
- Haskell port of the Tensor Algebra COmpiler☆16Updated 5 years ago
- Mirror of Conor McBride’s 2011 Agda course materials☆12Updated 6 years ago