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
- Proofs of the number of inhabitants of polymorphic functions☆23Updated 7 years ago
- Dependently typed elimination functions using singletons☆28Updated 8 months ago
- A formal verification of Linear Temporal Logic in Coq☆22Updated this week
- Hack idiom-brackets using GHC Source Plugin (8.6+)☆25Updated 7 years ago
- Agda-style equational reasoning in Haskell☆54Updated 4 months ago
- Funny little Haskell impl☆18Updated 4 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- ☆17Updated 6 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- SML implementation of System T from PFPL.☆11Updated 8 years ago
- Bring fusion to everyone☆13Updated 5 years ago
- System F implemented in Haskell☆24Updated 13 years ago
- TODO☆23Updated 9 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 3 years ago
- A partial binary associative operator (appendMaybe :: a → a → Maybe a)☆13Updated 10 months ago
- A usable type system for call by push-value☆33Updated 5 years ago
- Agda suffices: software written from A to Z in Agda☆16Updated 6 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- First class patterns and pattern matching, using type families☆17Updated 4 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22Updated 9 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 5 years ago
- An attempt to formalize unix cat in fiat☆12Updated 8 years ago
- Interpreter for functional pure type systems.☆21Updated 8 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated last month
- Experimental normalisation via scheme☆12Updated 4 years ago
- Hakyll support for Agda literate files☆19Updated 4 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated 9 months ago
- Zippers for cofree types☆13Updated 3 years ago
- Combinators for manipulating dependently-typed predicates.☆14Updated last year