bound issues

Docfix: Bound instances are right monad modules

5

`(>>>= id)` gives a natural transformation `t m . m ⇒ t m,` i.e. m acts on the right.

bound + recursion schemes

4

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`

csabahruska

The example use of `Bound.Name` is needed.

The problem is, GHC can't figure out how to `fmap` the first `a` out of `Scope (Name a ()) Program a`. The `>>>=` operator will leave the `Name a ()`...

Heimdell

makeBound chokes on types containing tuples of constants

1

The following `makeBound` invocation chokes: ```haskell {-# LANGUAGE DeriveFunctor, TemplateHaskell #-} import Bound import Bound.Name import Data.Text type Named b = Name Text b data Term v = EVar v...

dfoxfranke

Errorenous documentation of `mapMBound`

It states that it maps over both free and bound variables although it only modifies the bound ones.

ThreeFx

ListT instance smells funny

2

`ListT` from `transformers` isn't really a monad transformer, so it seems most unlikely to be a valid `Bound` instance with the default definition.

treeowl

Remove or explain mention of "ideal monad" from package introduction.

2

The first thing the user reads after clicking on this library is > We represent the target language itself as an ideal monad supplied by the user I find this...

danidiaz