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
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- Where my everyday research happens☆53Updated last month
- ☆45Updated 5 years ago
- being the materials for a paper I have in mind to write about the bidirectional discipline☆52Updated 10 months 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
- Proof automation – for Agda, in Agda.☆44Updated 4 years ago
- experimenting with unlifted classes via backpack☆36Updated 2 years ago
- Implementing grep in Agda☆33Updated 4 years ago
- 🖼️ the compiling to closed categories compiler☆66Updated 7 years ago
- Bidirectional programming in Haskell with monadic profunctors☆46Updated 3 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆45Updated 2 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆73Updated 3 years ago
- A library for doing generic programming in Agda☆31Updated 4 years ago
- The theory of algebraic graphs formalised in Agda☆90Updated 6 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆71Updated 6 years ago
- 15-819 (Homotopy Type Theory) Lecture Notes☆14Updated 7 years ago
- Literature review of GHC's Core language, System FC☆67Updated 6 years ago
- do-notation for Category and "Arrow without arr"☆63Updated 8 years ago
- being bits and pieces I'm inclined to leave lying around☆50Updated 5 months ago
- NbE course @ Chalmers☆28Updated 8 months ago
- ☆31Updated 10 years ago
- Fine-grained lattice primitives for Haskell☆37Updated 3 weeks ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆53Updated 8 years ago
- Work on type class deriving with elaboration reflection☆32Updated 6 years ago
- A set of utilities for using indexed types including containers, equality, and comparison.☆60Updated last month
- The Evolution of a Typechecker☆54Updated 6 years ago
- Summer school on programming in Agda☆68Updated last year
- ☆84Updated 7 years ago