ekmett / bound
Combinators for manipulating locally-nameless generalized de Bruijn terms
☆123Updated 5 months ago
Alternatives and similar repositories for bound:
Users that are interested in bound are comparing it to the libraries listed below
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 4 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated 10 months ago
- Where my everyday research happens☆52Updated last week
- Replib: generic programming & Unbound: generic treatment of binders☆44Updated 2 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆52Updated 7 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆70Updated 5 years ago
- Generic Programming using True Sums of Products☆161Updated 3 weeks ago
- Type-level sets for Haskell (with value-level counterparts and various operations)☆66Updated last year
- Literature review of GHC's Core language, System FC☆66Updated 6 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆71Updated 2 years ago
- Monad Transformers and Classes☆77Updated 5 years ago
- Recursion schemes for Idris☆64Updated 6 years ago
- being the materials for Summer 2013's course☆112Updated last year
- Generic functions for single-sorted first-order structural unification☆41Updated 3 weeks ago
- Interpreter for GHC Haskell☆22Updated 5 years ago
- Hypertypes - generic programming for heterogeneous recursive types☆119Updated 2 weeks ago
- ☆45Updated 5 years ago
- 🖼️ the compiling to closed categories compiler☆66Updated 6 years ago
- Mirror of ghc repository. DO NOT SUBMIT PULL REQUESTS HERE☆24Updated 6 years ago
- do-notation for Category and "Arrow without arr"☆63Updated 7 years ago
- Library of categories, with categorical constructions on them☆53Updated last year
- First-class type families☆87Updated 5 months ago
- Dual Traversable☆42Updated last year
- rewrite rules for type-level equalities☆62Updated 9 months ago
- being a thing I build on a Saturday☆28Updated 6 years ago
- Kan extensions, Kan lifts, the Yoneda lemma, and (co)monads generated by a functor☆79Updated 3 months ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- Fine-grained lattice primitives for Haskell☆35Updated 3 weeks ago
- Bit vectors: 8x less memory, up to 3500x faster than Vector Bool☆72Updated 3 weeks ago