lambdageek / unbound-genericsLinks
Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)
☆57Updated 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☆125Updated last year
- Where my everyday research happens☆55Updated 2 weeks ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- being the materials for a paper I have in mind to write about the bidirectional discipline☆52Updated 3 months ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆73Updated 6 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- Literature review of GHC's Core language, System FC☆67Updated 7 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆46Updated 3 years ago
- A library for doing generic programming in Agda☆34Updated 4 years ago
- Implementing grep in Agda☆33Updated 4 years ago
- ⛏️ A refinement proof framework for haskell☆70Updated 2 years ago
- The theory of algebraic graphs formalised in Agda☆91Updated 7 years ago
- A self-contained repository for the paper Type and Scope Preserving Semantics☆23Updated 6 years ago
- ☆31Updated 11 years ago
- Proof automation – for Agda, in Agda.☆44Updated 5 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- Bidirectional programming in Haskell with monadic profunctors☆47Updated 3 years ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 5 years ago
- being the materials for Summer 2013's course☆113Updated 2 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Updated 4 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆53Updated 8 years ago
- An experimental intermediate language for GHC☆36Updated 8 years ago
- NbE course @ Chalmers☆28Updated last year
- being bits and pieces I'm inclined to leave lying around☆54Updated 3 months ago
- What I wish I knew when learning HoTT☆53Updated 6 years ago
- Agda bindings to SMT-LIB2 compatible solvers.☆102Updated 2 months ago
- They see me rollin'. They're Heyting. -- Chamillionaire, 2005☆83Updated 4 years ago
- Session Types with Priority in Linear Haskell☆27Updated last year
- wherein I implement several substructural logics in Agda☆24Updated 7 years ago
- Generic functions for single-sorted first-order structural unification☆46Updated 5 months ago