gallais / aGdaREP
Implementing grep in Agda
☆32Updated 4 years ago
Alternatives and similar repositories for aGdaREP:
Users that are interested in aGdaREP are comparing it to the libraries listed below
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated 11 months ago
- A library for doing generic programming in Agda☆31Updated 4 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated last month
- ☆23Updated 8 months ago
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- Mtac in Agda☆28Updated 3 years ago
- Proof automation – for Agda, in Agda.☆44Updated 4 years ago
- wherein I implement several substructural logics in Agda☆24Updated 6 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Updated 3 years ago
- Where my everyday research happens☆52Updated this week
- The multimode presheaf proof-assistant☆36Updated last year
- Observational Type Theory as an Agda library☆52Updated 7 years ago
- Session Types with Priority in Linear Haskell☆25Updated 8 months ago
- what I did on my holidays☆12Updated 6 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆44Updated 2 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- being bits and pieces I'm inclined to leave lying around☆49Updated 2 months ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- Haskell implementation of the Edinburgh Logical Framework☆27Updated 4 months ago
- Compiler backend for generating Scheme code☆27Updated last year
- ☆30Updated 10 years ago
- This a type-checker plugin to rule all type checker plugins involving type-equality reasoning using smt solvers.☆21Updated 3 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 3 months ago
- Demonstration for how to build "traverse" using GHC.Generics efficiently☆22Updated 6 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 7 months ago
- Deciding Presburger arithmetic in agda☆31Updated last year
- ☆23Updated last year
- System F in coq.☆19Updated 10 years ago