CodaFi / Agda-MetaprogrammingLinks
Dependently Typed Metaprogramming Exercises
☆22Updated 7 years ago
Alternatives and similar repositories for Agda-Metaprogramming
Users that are interested in Agda-Metaprogramming are comparing it to the libraries listed below
Sorting:
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆75Updated 3 years ago
- Adding linear types to Haskell in the style of Linear/Non-Linear (LNL) logic☆35Updated 7 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- Work in progress☆38Updated 2 months ago
- MPRI-2.4 Dependently-typed Functional Programming☆32Updated 4 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- Observational Type Theory as an Agda library☆54Updated 8 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- being the beginnings of at least zero typecheckers☆34Updated 8 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 5 years ago
- NbE course @ Chalmers☆28Updated 11 months ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- Automatically exported from code.google.com/p/trellys☆47Updated 6 years ago
- An experimental type checker for a modal dependent type theory.☆114Updated 5 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 months ago
- Where my everyday research happens☆55Updated 2 months ago
- being bits and pieces I'm inclined to leave lying around☆53Updated 2 months ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆53Updated 6 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated 2 months ago
- A version of Epigram 1 that can run with newer GHCs☆53Updated 8 years ago
- The multimode presheaf proof-assistant☆36Updated 2 years ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14Updated 8 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆72Updated 6 years ago
- A formalized proof of a version of the initiality conjecture☆43Updated 4 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 3 months ago
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 7 years ago
- Formalizing nbe in agda☆31Updated 12 years ago