joom / direct-reflection-for-freeLinks
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:
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 3 years ago
- Linear map categories in Agda☆5Updated 2 years ago
- Funny little Haskell impl☆18Updated 4 years ago
- Convert data to and from a natural number representation☆14Updated 4 years ago
- Dependently typed elimination functions using singletons☆28Updated 5 months ago
- Hack idiom-brackets using GHC Source Plugin (8.6+)☆25Updated 6 years ago
- ☆17Updated 6 years ago
- Proofs of the number of inhabitants of polymorphic functions☆23Updated 6 years ago
- Hakyll support for Agda literate files☆19Updated 3 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 6 months ago
- Regular expressions of types☆16Updated 6 years ago
- Agda-style equational reasoning in Haskell☆53Updated 2 months ago
- Agda suffices: software written from A to Z in Agda☆16Updated 6 years ago
- First class patterns and pattern matching, using type families☆17Updated 4 years ago
- ☆12Updated 5 years ago
- Mtac in Agda☆28Updated 4 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- A usable type system for call by push-value☆33Updated 5 years ago
- Library and tool to render the snippets in literate Agda files to hyperlinked HTML, leaving the rest of the text untouched.☆11Updated 7 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Updated 3 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Updated 5 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated last week
- Experimentation project☆16Updated 11 years ago
- ☆23Updated 7 years ago
- Haskell bindings to Chez Scheme☆10Updated last year
- Small implementation of OutsideIn(X) type checking algorithm☆31Updated 10 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- Bring fusion to everyone☆13Updated 5 years ago
- Folds for recursive types with GHC Generics☆26Updated 5 years ago
- A type system for ML-style modules, solving the avoidance problem by focusing [Crary 2020]☆10Updated 4 years ago