ekmett / bound
Combinators for manipulating locally-nameless generalized de Bruijn terms
☆123Updated 9 months ago
Alternatives and similar repositories for bound
Users that are interested in bound are comparing it to the libraries listed below
Sorting:
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 5 years ago
- Where my everyday research happens☆52Updated last week
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- Literature review of GHC's Core language, System FC☆67Updated 6 years ago
- Hypertypes - generic programming for heterogeneous recursive types☆121Updated 4 months ago
- Interpreter for GHC Haskell☆22Updated 5 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆45Updated 2 years ago
- Monad Transformers and Classes☆77Updated 5 years ago
- ☆45Updated 5 years ago
- 🖼️ the compiling to closed categories compiler☆66Updated 7 years ago
- rewrite rules for type-level equalities☆62Updated last year
- ☆45Updated 3 years ago
- They see me rollin'. They're Heyting. -- Chamillionaire, 2005☆83Updated 4 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆72Updated 3 years ago
- Generic Programming using True Sums of Products☆163Updated 4 months ago
- Generic random generators☆81Updated 2 years ago
- First-class type families☆87Updated 2 weeks ago
- Type-level sets for Haskell (with value-level counterparts and various operations)☆66Updated last year
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆53Updated 8 years ago
- Mirror of ghc repository. DO NOT SUBMIT PULL REQUESTS HERE☆24Updated 6 years ago
- Normalise GHC.TypeLits.Nat equations☆43Updated 2 weeks ago
- The Software Foundations book, in GHC☆82Updated 4 months ago
- being the scrapings of my stackoverflow answers☆48Updated 5 years ago
- Fine-grained lattice primitives for Haskell☆37Updated last week
- Kan extensions, Kan lifts, the Yoneda lemma, and (co)monads generated by a functor☆79Updated 2 months ago
- Recursion schemes for Idris☆64Updated 6 years ago
- being the materials for Summer 2013's course☆112Updated 2 years ago
- Generic functions for single-sorted first-order structural unification☆46Updated last week
- do-notation for Category and "Arrow without arr"☆63Updated 8 years ago