lambdageek unbound-generics issues - Githubissues

lambdageek / unbound-generics

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

https://hackage.haskell.org/package/unbound-generics/

BSD 3-Clause "New" or "Revised" License

56 stars 18 forks source link

issues

Newest

Newest Most commented Recently updated Oldest Least commented Least recently updated

Add a Gitter chat badge to README.md

#15 gitter-badger closed 9 years ago
0
Add `Hashable` instances for names and binder combinators

#14 lambdageek opened 9 years ago
0
unbound-generics-0.1.2 won't compile with GHC 7.10.x

#13 peti closed 9 years ago
0
Variant of `makeClosedAlpha` that works for type constructors.

#12 lambdageek opened 9 years ago
0
Add 'acompare' - an alpha-respecting total order on terms including binders

#11 christiaanb closed 9 years ago
1
Expose GAlpha methods

#10 christiaanb closed 9 years ago
3
Unconditionally add ExceptT instances using transformers-compat

#9 bergmark closed 9 years ago
0
Some kind of local scope in pattern bindings

#8 lambdageek opened 9 years ago
0
Measure performance of locally nameless representation.

#7 lambdageek opened 10 years ago
0
Variable capture when substituting in `Rebind` patterns

#6 lambdageek opened 10 years ago
1
Implement a nominal version of the library.

#5 lambdageek opened 10 years ago
0
ported LC example from unbound

#4 lambdageek closed 10 years ago
2
Copy tickets from Unbound's Google Code bug tracker.

#3 lambdageek opened 10 years ago
1
SetBind, SetPlusBind...

#2 lambdageek opened 10 years ago
0
Making Alpha instances for Opaque types is harder than with Unbound/RepLib

#1 lambdageek closed 9 years ago
0

Previous