Haskell › Haskell - Libraries

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
New Topic
People
123456 ... 83
Topics (2903)
Replies Last Post Views
Remove Semigroup and Monoid instances for Either by Andrew Martin
2
by Andrew Martin
Strictness of Semigroup instance for Maybe by Donnacha Oisín Kidne...
8
by Andrew Martin
Bits typeclass law for LSB by Andrew Martin
0
by Andrew Martin
Resolve name collsion of `first` and `second` by Control.Arrow and Data.Bifunctor by 박신환
8
by Henning Thielemann
Package take over: OneTuple by Oleg Grenrus
5
by Oleg Grenrus
Proposal: Continue the displayException program by David Feuer
2
by Michael Snoyman
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 chessai .
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 chessai .
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 chessai .
6
by Theodore Lief Gannon
Proposal: Formalise rules for how names are chosen for approved proposals by chessai .
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
123456 ... 83
Free forum by Nabble Edit this page