ekmett / boundLinks
Combinators for manipulating locally-nameless generalized de Bruijn terms
☆128Updated 2 weeks 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)☆57Updated last year
- Where my everyday research happens☆56Updated this week
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 6 years ago
- Literature review of GHC's Core language, System FC☆67Updated 7 years ago
- They see me rollin'. They're Heyting. -- Chamillionaire, 2005☆84Updated 3 weeks ago
- Hypertypes - generic programming for heterogeneous recursive types☆125Updated last year
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆74Updated 6 years ago
- Prototype implementations of systems based on setoid type theory☆66Updated 5 years ago
- 🖼️ the compiling to closed categories compiler☆66Updated 7 years ago
- Kan extensions, Kan lifts, the Yoneda lemma, and (co)monads generated by a functor☆83Updated last month
- Interpreter for GHC Haskell☆22Updated 6 years ago
- Hopefully verifiable code generation in GHC☆94Updated 8 years ago
- Library of categories, with categorical constructions on them☆59Updated 2 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆55Updated 8 years ago
- do-notation for Category and "Arrow without arr"☆63Updated 8 years ago
- rewrite rules for type-level equalities☆62Updated 5 months ago
- Generic functions for single-sorted first-order structural unification☆45Updated 9 months ago
- Dependently-typed finite maps (partial dependent products)☆67Updated 3 months ago
- A collection of Notes on GHC☆71Updated 6 years ago
- A set of utilities for using indexed types including containers, equality, and comparison.☆60Updated last week
- ☆45Updated 6 years ago
- Implementing grep in Agda☆33Updated 5 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆46Updated 3 years ago
- Tactic Metaprogramming in Haskell☆56Updated 6 years ago
- A language based on homotopy type theory with an interval☆84Updated 10 years ago
- The theory of algebraic graphs formalised in Agda☆91Updated 7 years ago
- being the materials for Summer 2013's course☆113Updated 2 years ago
- The Software Foundations book, in GHC☆82Updated last month
- Generic Programming using True Sums of Products☆164Updated last month
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago