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 4 years ago
Related projects ⓘ
Alternatives and complementary repositories for direct-reflection-for-free
- Dependently typed elimination functions using singletons☆28Updated 3 weeks ago
- Proofs of the number of inhabitants of polymorphic functions☆23Updated 6 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 2 years ago
- Hack idiom-brackets using GHC Source Plugin (8.6+)☆25Updated 6 years ago
- Linear map categories in Agda☆5Updated last year
- Funny little Haskell impl☆18Updated 4 years ago
- Convert data to and from a natural number representation☆13Updated 3 years ago
- A partial binary associative operator (appendMaybe :: a → a → Maybe a)☆14Updated last month
- A very simple interface for incremental computation using STM in Haskell.☆13Updated last year
- being an experiment with potato power☆23Updated 4 years ago
- being my notes and exercises for the Types Summer School in Ohrid, (FYRO) Macedonia, July 2017☆9Updated 7 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 9 years ago
- Hakyll support for Agda literate files☆19Updated 3 years ago
- Bring fusion to everyone☆13Updated 4 years ago
- ☆23Updated 7 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆28Updated 3 years ago
- Type Theory with Indexed Equality☆23Updated 7 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 2 years ago
- Small implementation of OutsideIn(X) type checking algorithm☆31Updated 9 years ago
- Interpreter for functional pure type systems.☆21Updated 7 years ago
- ☆17Updated 6 years ago
- Agda suffices: software written from A to Z in Agda☆15Updated 5 years ago
- The Pico core language, and the Bake algorithm for elaborating Dependent Haskell into the former (WIP)☆15Updated 6 years ago
- A tiny implementation of dependent types.☆11Updated 7 years ago
- classical sequent calculus, embedded in Haskell☆19Updated 2 years ago
- I/O utilities and datasets for algebraic-graphs☆14Updated 2 years ago
- A monadic interface for DAG construction.☆24Updated 3 years ago
- Simple Haskell package for efficiently indexable finite and infinite enumerations.☆11Updated 3 years ago