Haskell - Libraries

This forum is an archive for the mailing list libraries@haskell.org (more options) Messages posted here will be sent to this mailing list.
Discussion about libraries for Haskell
12345 ... 82
Topics (2863)
Replies Last Post Views
Proposal: add Bounded instances for Maybe and Either by David Feuer
7
by Ivan Lazar Miljenovi...
Taking over `data-default-*` by Marco Zocca
0
by Marco Zocca
Proposal: add a foldable law by Gershom Bazerman
25
by David Feuer
Monoid over reciprocal of reciprocal sum by 박신환
2
by Henning Thielemann
Monoid over XOR or XNOR, and Monoid lifted by Applicative. by 박신환
4
by Edward Kmett-2
Monoid for ZipList by 박신환
4
by 박신환
Instance of `Semigroup (Either a b)` needs to be eventually changed. by 박신환
0
by 박신환
Remove WrappedMonad by Ryan Scott
0
by Ryan Scott
(no subject) by Ryan Scott
0
by Ryan Scott
Remove WrappedMonad by Andrew Martin
7
by David Feuer
Name for unary unboxed one-tuple by Haskell - Libraries ...
5
by Andrew Martin
primitive library by Haskell - Libraries ...
3
by Haskell - Libraries ...
Proposal: Export (#.) and (.#) from Data.Coerce by Daniel Cartwright
6
by Edward Kmett-2
Deprecate First and Last in Data.Monoid by Andrew Martin
7
by Edward Kmett-2
Re: Proposal: Add a wrapped applicative type to Data.Monoid by Ryan Scott
3
by Ryan Scott
Remove mtimesDefault or move it to Data.Monoid by Haskell - Libraries ...
1
by Haskell - Libraries ...
Proposal: Add inductively-defined Nat to base by Daniel Cartwright
14
by Donnacha Oisín Kidne...
Proposal for Data.Graph : Improve graph creation complexity when nodes have "consecutive" keys by Olivier S.
10
by Olivier S.
Proposal: function from Maybe to Alternative by Li-yao Xia-2
0
by Li-yao Xia-2
Proposal : Data.Graph performance improvements (graph creation and lookups when nodes keys are consecutive) by Olivier S.
0
by Olivier S.
Proposal: Add a wrapped applicative type to Data.Monoid by Daniel Cartwright
6
by Theodore Lief Gannon
Proposal: Formalise rules for how names are chosen for approved proposals by Daniel Cartwright
5
by Francesco Ariis
Add a createT analogue for arrays by David Feuer
3
by David Feuer
ST with Efficient (simple nice semantics exceptions) was Re: Proposal: Remove the bogus MonadFail instance for ST by Carter Schonwald
0
by Carter Schonwald
Proposal: Remove the bogus MonadFail instance for ST by David Feuer
27
by Gershom Bazerman
What are the laws for Eq1, Eq2, Ord1, and Ord2? by David Feuer
6
by David Feuer
Proposal: offer a way to augment call stacks by David Feuer
2
by Bardur Arantsson-2
Proposal: Add more exports to public array modules by David Feuer
1
by Ryan Scott
opt out of accursedUnutterablePerformIO by Ben Franksen
18
by John Wiegley-2
Clarification on the codes of the errors thrown by listDirectory? by sonne
1
by Gershom Bazerman
Re: Dropping containers support for old GHC versions by Henning Thielemann
7
by Adam Bergmark-2
Is it safe to index a little bit out of bounds by Andrew Martin
5
by Andrew Martin
Storable laws by David Feuer
17
by Niklas Hambüchen
What stops Data.Foldable from having foldl1'? by sonne
2
by Tony Morris-4
Proposal: Add Eq1 and Ord1 instances in GHC.Generics, and synchronize with Data.Functor.* types by Li-yao Xia-2
1
by Ryan Scott
12345 ... 82