lambdageek/unbound-generics

Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)

Haskellhaskell-libraryunboundsubstitutionghc-genericsvariable-bindingbound
This is stars and forks stats for /lambdageek/unbound-generics repository. As of 11 May, 2024 this repository has 54 stars and 17 forks.

unbound-generics Support for programming with names and binders using GHC Generics. Summary Specify the binding structure of your data type with an expressive set of type combinators, and unbound-generics handles the rest! Automatically derives alpha-equivalence, free variable calculation, capture-avoiding substitution, and more. See Unbound.Generics.LocallyNameless to get started. This is a reimplementation of (parts of) unbound but using GHC generics instead of RepLib. Examples Some examples are...
Read on GithubGithub Stats Page
repotechsstarsweeklyforksweekly
sweirich/pi-forallHaskellMakefile5130870
xdanx/le-cyclingHaskellShell0000
sifive/KamiCoqHaskellOther1890120
Gabriella439/defaultable-mapHaskell15010
sifive/RiscvSpecFormalHaskellShellC++72070
AidanDelaney/MiraHaskell4030
digital-asset/ghcHaskellCMakefile9040
github/deliHaskellOther166090
nabilhassein/scheme-interpreterHaskell1000
ProjectDimlight/RuCalculusHaskell61030