Andrew Martin

ADT Decreasing Size with Lists Involved

4

Consider: ``` {-@ data List a = Cons a (List a) | Nil @-} data List a = Cons a (List a) | Nil {-@ autosize List @-} {-@ data...

Cannot create spec for Array#

7

With a module of: ``` {-# language MagicHash #-} module MySpec ( Array# , indexArray# ) where import GHC.Exts (Array#,indexArray#) ``` and a specification of: ``` module spec MySpec where...

Cannot be built, third_party directory is missing

1

There are no instructions on how to populate this directory.

cannot build tcp benchmarks

6

I can build `stdio`, but when I `cd` into `bench/tcp` and run: cabal new-build --constraint='primitive==0.6.4.0' -w /opt/ghc/8.6.3/bin/ghc I get the following error: ``` Linking /home/amartin/Development/stdio/bench/tcp/dist-newstyle/build/x86_64-linux/ghc-8.6.3/tcp-0.1.0.0/x/libuv/build/libuv/libuv ... /home/amartin/Development/stdio/bench/tcp/dist-newstyle/build/x86_64-linux/ghc-8.6.3/tcp-0.1.0.0/x/libuv/build/libuv/libuv-tmp/../../cbits/hs_uv_stream.o:hs_uv_stream.c:function hs_set_socket_reuse: error :...

The docs for `artifact` (also called Observable, not sure what the correct name is) describe `dataType` as: > `dataType` (enumeration) : type of the observable (read only) The allow values...

Replace Comments about BMI

3

The `syntax-in-functions` page includes a BMI example that may benefit from being rewritten. The two options I'm aware of would be: * Keeping using BMI as the example, but change...

Lower bound on transformers

5

Attoparsec uses `Data.Functor.Identity`. Consequently, it should require `transformers >= 0.4.1.0`.

Pattern synonym for empty bytestring

3

It would occasionally be useful have a pattern synonym for the empty bytestring: pattern Empty :: ByteString pattern Empty True) where Empty = ByteString.empty This makes it possible to rewrite...

Add foldlWithKeyM

4

The type would be: foldlWithKeyM :: Monad m => (a -> k -> b -> m a) -> a -> Map k b -> m a I'm happy to contribute...

Add strict foldlWithKeyM

10

Resolves https://github.com/haskell/containers/issues/793 This is just the implementation of a single monadic fold. @treeowl if you confirm that this implementation of this particular function looks good, I can add all of...