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☆126Updated last year
- Where my everyday research happens☆55Updated 2 weeks ago
- Prototype implementations of systems based on setoid type theory☆65Updated 5 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆74Updated 6 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 a paper I have in mind to write about the bidirectional discipline☆52Updated 4 months ago
- Implementing grep in Agda☆33Updated 4 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Updated 4 years ago
- A self-contained repository for the paper Type and Scope Preserving Semantics☆23Updated 6 years ago
- Literature review of GHC's Core language, System FC☆67Updated 7 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆46Updated 3 years ago
- ☆45Updated 6 years ago
- NbE course @ Chalmers☆28Updated last year
- Tactic Metaprogramming in Haskell☆56Updated 6 years ago
- rewrite rules for type-level equalities☆62Updated 3 months ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 3 years ago
- experimenting with unlifted classes via backpack☆36Updated 3 years ago
- Normalise GHC.TypeLits.Nat equations☆43Updated this week
- Generic functions for single-sorted first-order structural unification☆45Updated 7 months ago
- A library for doing generic programming in Agda☆34Updated 4 years ago
- ⛏️ A refinement proof framework for haskell☆70Updated 2 years ago
- An implementation of the Haskell ByteString library using the Fiat system from MIT☆34Updated 3 years ago
- 15-819 (Homotopy Type Theory) Lecture Notes☆14Updated 7 years ago
- Demonstration for how to build "traverse" using GHC.Generics efficiently☆22Updated 7 years ago
- Proof automation – for Agda, in Agda.☆44Updated 5 years ago
- What I wish I knew when learning HoTT☆53Updated 6 years ago
- being bits and pieces I'm inclined to leave lying around☆54Updated 5 months ago
- Fine-grained lattice primitives for Haskell☆37Updated 5 months ago
- wherein I implement several substructural logics in Agda☆24Updated 7 years ago