joom / direct-reflection-for-free
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
Alternatives and similar repositories for direct-reflection-for-free
Users that are interested in direct-reflection-for-free are comparing it to the libraries listed below
Sorting:
- Dependently typed elimination functions using singletons☆28Updated 4 months ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 2 years ago
- Linear map categories in Agda☆5Updated 2 years ago
- Funny little Haskell impl☆18Updated 4 years ago
- Hakyll support for Agda literate files☆19Updated 3 years ago
- ☆17Updated 6 years ago
- Hack idiom-brackets using GHC Source Plugin (8.6+)☆25Updated 6 years ago
- System F implemented in Haskell☆24Updated 13 years ago
- being an experiment with potato power☆23Updated 5 years ago
- ☆16Updated 2 months ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Updated 5 years ago
- being my notes and exercises for the Types Summer School in Ohrid, (FYRO) Macedonia, July 2017☆9Updated 7 years ago
- A monadic interface for DAG construction.☆24Updated 4 years ago
- Proofs of the number of inhabitants of polymorphic functions☆23Updated 6 years ago
- A tiny implementation of dependent types.☆11Updated 7 years ago
- An attempt to formalize unix cat in fiat☆12Updated 7 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 5 months ago
- being the programs and code for a paper about general recursion☆25Updated 10 years ago
- classical sequent calculus, embedded in Haskell☆20Updated 3 years ago
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- The Pico core language, and the Bake algorithm for elaborating Dependent Haskell into the former (WIP)☆14Updated 7 years ago
- Folds for recursive types with GHC Generics☆26Updated 5 years ago
- A formalization of finite, constructive log analysis using linear temporal logic☆21Updated 2 weeks ago
- Code to go along with the blog post "Are Mutable References in Haskell Fast?"☆10Updated 7 years ago
- ☆18Updated 3 years ago
- Experiments in abstracting definitional interpreters☆16Updated 7 years ago
- A partial binary associative operator (appendMaybe :: a → a → Maybe a)☆13Updated 7 months ago
- Convert data to and from a natural number representation☆13Updated 4 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- A very simple interface for incremental computation using STM in Haskell.☆13Updated 2 years ago