lambdageek / unbound-genericsLinks
Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)
☆56Updated last year
Alternatives and similar repositories for unbound-generics
Users that are interested in unbound-generics are comparing it to the libraries listed below
Sorting:
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 10 months ago
- Where my everyday research happens☆53Updated last week
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- being the materials for Summer 2013's course☆112Updated 2 years ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 5 years ago
- ☆45Updated 6 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆45Updated 2 years ago
- A library for doing generic programming in Agda☆31Updated 4 years ago
- Literature review of GHC's Core language, System FC☆67Updated 6 years ago
- Mirror of ghc repository. DO NOT SUBMIT PULL REQUESTS HERE☆24Updated 6 years ago
- Proof automation – for Agda, in Agda.☆44Updated 4 years ago
- The multimode presheaf proof-assistant☆36Updated 2 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆73Updated 3 years ago
- being bits and pieces I'm inclined to leave lying around☆50Updated 6 months ago
- This is the place where (more or less) stable releases of my RW library will be published.☆16Updated 5 years ago
- Agda formalisation of second-order abstract syntax☆55Updated 2 years ago
- Implementing grep in Agda☆33Updated 4 years ago
- NbE course @ Chalmers☆28Updated 8 months ago
- The theory of algebraic graphs formalised in Agda☆90Updated 6 years ago
- A self-contained repository for the paper Type and Scope Preserving Semantics☆23Updated 6 years ago
- experimenting with unlifted classes via backpack☆36Updated 2 years ago
- Library of categories, with categorical constructions on them☆56Updated last year
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆53Updated 8 years ago
- A small implementation of a proof refinement logic.☆50Updated 7 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 5 years ago
- Agda programming with holes☆27Updated 4 years ago
- Work on type class deriving with elaboration reflection☆32Updated 6 years ago
- Fine-grained lattice primitives for Haskell☆37Updated last month
- Generic functions for single-sorted first-order structural unification☆46Updated last month