Alternatives and similar repositories for bound:

Users that are interested in bound are comparing it to the libraries listed below

• lambdageek / unbound-generics
  Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)
  ☆56Updated 11 months ago
• AndrasKovacs / setoidtt
  Prototype implementations of systems based on setoid type theory
  ☆65Updated 4 years ago
• bjpop / ministg
  Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.
  ☆72Updated 5 years ago
• gallais / potpourri
  Where my everyday research happens
  ☆52Updated this week
• sweirich / replib
  Replib: generic programming & Unbound: generic treatment of binders
  ☆44Updated 2 years ago
• lamdu / hypertypes
  Hypertypes - generic programming for heterogeneous recursive types
  ☆121Updated last month
• xnning / GHC-Core-Literature-Review
  Literature review of GHC's Core language, System FC
  ☆66Updated 6 years ago
• Saizan / cubical-demo
  ☆45Updated 5 years ago
• steshaw / lennart-lambda
  λλλλ Lennart Augustsson's λ-calculus cooked four ways
  ☆52Updated 7 years ago
• well-typed / generics-sop
  Generic Programming using True Sums of Products
  ☆161Updated last month
• pigworker / MetaprogAgda
  being the materials for Summer 2013's course
  ☆112Updated last year
• ekmett / kan-extensions
  Kan extensions, Kan lifts, the Yoneda lemma, and (co)monads generated by a functor
  ☆79Updated 4 months ago
• isovector / cccc
  🖼️ the compiling to closed categories compiler
  ☆66Updated 6 years ago
• Lysxia / first-class-families
  First-class type families
  ☆87Updated 6 months ago
• sstucki / system-f-agda
  A formalization of the polymorphic lambda calculus extended with iso-recursive types
  ☆70Updated 5 years ago
• TOTBWF / refinery
  ⛏️ A refinement proof framework for haskell
  ☆69Updated last year
• TOTBWF / tactic-haskell
  Tactic Metaprogramming in Haskell
  ☆56Updated 5 years ago
• matt-noonan / justified-containers
  Standard containers, with keys that carry type-level proofs of their own presence.
  ☆80Updated 5 years ago
• gelisam / typelevel-rewrite-rules
  rewrite rules for type-level equalities
  ☆62Updated 10 months ago
• haskellari / lattices
  Fine-grained lattice primitives for Haskell
  ☆36Updated 3 weeks ago
• goldfirere / ghc
  Mirror of ghc repository. DO NOT SUBMIT PULL REQUESTS HERE
  ☆24Updated 6 years ago
• dorchard / type-level-sets
  Type-level sets for Haskell (with value-level counterparts and various operations)
  ☆66Updated last year
• pedagand / typechecker-evolution
  The Evolution of a Typechecker
  ☆54Updated 6 years ago
• jyp / nano-Agda
  Tiny type-checker with dependent types
  ☆76Updated 11 years ago
• Lysxia / generic-random
  Generic random generators
  ☆81Updated last year
• Bodigrim / bitvec
  Bit vectors: 8x less memory, up to 3500x faster than Vector Bool
  ☆72Updated last month
• ekmett / linear-logic
  They see me rollin'. They're Heyting. -- Chamillionaire, 2005
  ☆83Updated 3 years ago
• vmchale / recursion_schemes
  Recursion schemes for Idris
  ☆64Updated 6 years ago
• effectfully / Generic
  A library for doing generic programming in Agda
  ☆31Updated 4 years ago
• int-index / ether
  Monad Transformers and Classes
  ☆77Updated 5 years ago