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☆21Updated 3 years ago
- Dependently typed elimination functions using singletons☆28Updated last month
- Proofs of the number of inhabitants of polymorphic functions☆23Updated 7 years ago
- A formal verification of Linear Temporal Logic in Coq☆23Updated 2 months ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- Agda suffices: software written from A to Z in Agda☆16Updated 6 years ago
- Self-contained repository for the eponymous paper☆30Updated 7 years ago
- ☆17Updated 7 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 4 years ago
- A usable type system for call by push-value☆33Updated 6 years ago
- Agda-style equational reasoning in Haskell☆54Updated 3 weeks ago
- Hack idiom-brackets using GHC Source Plugin (8.6+)☆25Updated 7 years ago
- Bring fusion to everyone☆14Updated 6 years ago
- Small implementation of OutsideIn(X) type checking algorithm☆31Updated 10 years ago
- A terminal UI for inspecting steps taken by a rewriting process. Useful for the optimization phase of a compiler, or even evaluators of s…☆21Updated 6 years ago
- An attempt to formalize unix cat in fiat☆11Updated 8 years ago
- Syntactic evaluation of STLC (incl. proof of normalization a la Software Foundations)☆13Updated 8 years ago
- A small NuPRL style proof assistant☆31Updated 7 years ago
- being an experiment with potato power☆23Updated 6 years ago
- being the emperor of Mongo, but also a verb☆15Updated 7 years ago
- System F implemented in Haskell☆24Updated 13 years ago
- ☆23Updated 8 years ago
- Interpreter for functional pure type systems.☆21Updated 8 years ago
- An Agda library for reasoning about asynchronous iterative algorithms and network routing problems☆28Updated 2 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Updated 6 years ago
- Library implementation of "Generic description of well-scoped, well-typed syntaxes"☆12Updated 7 years ago
- A tiny implementation of dependent types.☆11Updated 8 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated last year
- ☆23Updated 2 years ago
- TODO☆23Updated 10 years ago