Question

Implementing try (look-ahead) and untilStop with parser combinators

score 727 · Answer 1 · 2017-01-01 13:45:01

727

Views

Implementing try (look-ahead) and untilStop with parser combinators

Published on 01 January 2017 at 13:45

score 728 · Answer 2 · 2018-11-27 03:01:02

728

Views

Haskell: Parsing an object that could be multiple types into one single type

Published on 27 November 2018 at 03:01

score 1.6k · Answer 3 · 2013-08-13 13:42:03

1.6k

Views

instance Alternative ZipList in Haskell?

Published on 13 August 2013 at 13:42

score 13k · Answer 4 · 2013-08-07 16:23:03

13k

Views

What are Alternative's "some" and "many" useful for?

Published on 07 August 2013 at 16:23

score 1.2k · Answer 5 · 2012-10-29 13:22:53

1.2k

Views

What’s an example of a Monad which is an Alternative but not a MonadPlus?

Published on 29 October 2012 at 13:22

score 10.4k · Answer 6 · 2012-10-26 04:11:14

10.4k

Views

Confused by the meaning of the 'Alternative' type class and its relationship to other type classes

Published on 26 October 2012 at 04:11

score 222 · Answer 7 · 2012-10-30 20:18:38

222

Views

How to convert a failed computation to a successful one and vice versa

Published on 30 October 2012 at 20:18

score 860 · Answer 8 · 2016-02-26 20:24:36

860

Views

Purely Applicative Parser using Alternative

Published on 26 February 2016 at 20:24

score 589 · Answer 9 · 2017-11-28 05:33:11

589

Views

Can the continuation monad transformer be given an Alternative instance with some and many?

Published on 28 November 2017 at 05:33

score 129 · Answer 10 · 2022-11-20 13:14:36

129

Views

For what Alt in Monoid instance needed?

Published on 20 November 2022 at 13:14

score 307 · Answer 11 · 2017-05-24 11:19:28

307

Views

Could it be that (Alternative f, Foldable f) => Monad f?

Published on 24 May 2017 at 11:19

score 2.6k · Answer 12 · 2011-04-30 11:44:50

2.6k

Views

Haskell: some and many

Published on 30 April 2011 at 11:44

score 644 · Answer 13 · 2015-05-27 11:25:35

644

Views

Why does the Alternative typeclass need to be a sub-class of Control.Applicative

Published on 27 May 2015 at 11:25

score 121 · Answer 14 · 2019-10-26 21:15:00

121

Views

How to use the function `some`?

Published on 26 October 2019 at 21:15

score 382 · Answer 15 · 2019-10-30 12:24:52

382

Views

Applicative parser stuck in infinite loop

Published on 30 October 2019 at 12:24

score 214 · Answer 16 · 2021-10-08 02:47:33

214

Views

Examples of "undoable" applicative functors?

Published on 08 October 2021 at 02:47

score 1.1k · Answer 17 · 2013-01-07 12:32:05

1.1k

Views

Why is Alternative concatenating lists instead of choosing the first non-empty one?

Published on 07 January 2013 at 12:32

score 137 · Answer 18 · 2021-08-23 12:00:39

137

Views

Is it possible to write an Alternative instance for Identity a if there's a Monoid for a?

Published on 23 August 2021 at 12:00

score 1.3k · Answer 19 · 2018-12-13 22:35:22

1.3k

Views

Haskell - some, many implementation

Published on 13 December 2018 at 22:35

score 120 · Answer 20 · 2017-02-02 14:20:51

120

Views

Haskell function which acts differently depending on the monad type

Published on 02 February 2017 at 14:20

List Question

Implementing try (look-ahead) and untilStop with parser combinators

Haskell: Parsing an object that could be multiple types into one single type

instance Alternative ZipList in Haskell?

What are Alternative's "some" and "many" useful for?

What’s an example of a Monad which is an Alternative but not a MonadPlus?

Confused by the meaning of the 'Alternative' type class and its relationship to other type classes

How to convert a failed computation to a successful one and vice versa

Purely Applicative Parser using Alternative

Can the continuation monad transformer be given an Alternative instance with some and many?

For what Alt in Monoid instance needed?

Could it be that (Alternative f, Foldable f) => Monad f?

Haskell: some and many

Why does the Alternative typeclass need to be a sub-class of Control.Applicative

How to use the function `some`?

Applicative parser stuck in infinite loop

Examples of "undoable" applicative functors?

Why is Alternative concatenating lists instead of choosing the first non-empty one?

Is it possible to write an Alternative instance for Identity a if there's a Monoid for a?

Haskell - some, many implementation

Haskell function which acts differently depending on the monad type

Trending Questions

Popular # Hahtags

Popular Questions