ekmett / boundLinks
Combinators for manipulating locally-nameless generalized de Bruijn terms
☆123Updated 10 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
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- 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☆53Updated last week
- Replib: generic programming & Unbound: generic treatment of binders☆45Updated 2 years ago
- Bit vectors: 8x less memory, up to 3500x faster than Vector Bool☆72Updated last week
- Hypertypes - generic programming for heterogeneous recursive types☆125Updated 5 months ago
- Literature review of GHC's Core language, System FC☆67Updated 6 years ago
- 🖼️ the compiling to closed categories compiler☆66Updated 7 years ago
- Interpreter for GHC Haskell☆22Updated 5 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- Generic Programming using True Sums of Products☆163Updated 5 months ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆71Updated 6 years ago
- Monad Transformers and Classes☆76Updated 5 years ago
- ☆45Updated 6 years ago
- They see me rollin'. They're Heyting. -- Chamillionaire, 2005☆83Updated 4 years ago
- rewrite rules for type-level equalities☆62Updated last year
- Generic functions for single-sorted first-order structural unification☆46Updated last month
- Type-level sets for Haskell (with value-level counterparts and various operations)☆66Updated last year
- ⛏️ A refinement proof framework for haskell☆69Updated 2 years ago
- Proof automation – for Agda, in Agda.☆44Updated 4 years ago
- A library for doing generic programming in Agda☆31Updated 4 years ago
- Kan extensions, Kan lifts, the Yoneda lemma, and (co)monads generated by a functor☆79Updated this week
- Fine-grained lattice primitives for Haskell☆37Updated last month
- do-notation for Category and "Arrow without arr"☆63Updated 8 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆73Updated 3 years ago
- Bidirectional programming in Haskell with monadic profunctors☆46Updated 3 years ago
- JHC Haskell compiler split into reusable components☆58Updated 6 years ago
- Normalise GHC.TypeLits.Nat equations☆43Updated last month
- TParsec - Total Parser Combinators in Idris☆95Updated last year