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
- Self-contained repository for the eponymous paper☆30Updated 7 years ago
- Proofs of the number of inhabitants of polymorphic functions☆23Updated 7 years ago
- Dependently typed elimination functions using singletons☆28Updated last week
- A formal verification of Linear Temporal Logic in Coq☆23Updated 2 months ago
- ☆17Updated 7 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- Hakyll support for Agda literate files☆19Updated 4 years ago
- System F implemented in Haskell☆24Updated 13 years ago
- Agda-style equational reasoning in Haskell☆54Updated this week
- Hack idiom-brackets using GHC Source Plugin (8.6+)☆25Updated 7 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated last year
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 4 years ago
- ☆23Updated 8 years ago
- (NOTE: REPOSITORY MOVED TO NEW OWNER: https://github.com/lexi-lambda/monad-validate) A Haskell monad transformer library for data validat…☆33Updated 3 years ago
- Small implementation of OutsideIn(X) type checking algorithm☆31Updated 10 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- Agda suffices: software written from A to Z in Agda☆16Updated 6 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 6 months ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Updated 4 years ago
- 🌋 Idris implementation of patricia tree☆23Updated 5 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated 2 months ago
- Experimental normalisation via scheme☆12Updated 4 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 8 years ago
- A typechecker for WebAssembly, written in Agda (WIP)☆17Updated 7 years ago
- An efficient finite map from (byte)strings to values.☆20Updated 8 months ago
- Compiler backend for generating Scheme code☆28Updated last month
- SML implementation of System T from PFPL.☆11Updated 8 years ago
- Functional Pearl: Certified Binary Search in a Read-Only Array☆29Updated 4 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated last week