bound + recursion schemes
Open
- Dominant language
- Haskell
- Stars
- 130
- Forks
- 30
- PR merge metrics
- No merged PRs in 30d
Description
Is it possible to use `bound` with `recursion-schemes` library?
i.e. to define the names in an AST using `bound` and doing AST transformations (*optimisations, inlining, etc*) with `recursion-schemes`
Contributor guide
No contributing guide indexed for this repository
Assessment
This issue has not been assessed yet.