Question

Haskell - How to transform map sum (map (x:) xss) to map (x+) (map sum xss)

score 354 · Answer 1 · 2014-11-20 19:52:09

354

Views

Haskell - How to transform map sum (map (x:) xss) to map (x+) (map sum xss)

Published on 20 November 2014 at 19:52

score 358 · Answer 2 · 2014-12-02 23:21:37

358

Views

Haskell - How to transform maximum (xs ++ map (x+) xs) to max (maximum xs) (x + maximum xs)

Published on 02 December 2014 at 23:21

score 328 · Answer 3 · 2015-08-11 00:45:29

328

Views

Is it possible to use church encodings without breaking equational reasoning?

Published on 11 August 2015 at 00:45

score 158 · Answer 4 · 2016-01-25 13:38:13

158

Views

To prove equality of two function definitions inductively

Published on 25 January 2016 at 13:38

score 3.8k · Answer 5 · 2016-01-25 23:24:16

3.8k

Views

If return a = return b then does a=b?

Published on 25 January 2016 at 23:24

score 1.5k · Answer 6 · 2015-05-22 23:25:24

1.5k

Views

Proof by induction with multiple lists

Published on 22 May 2015 at 23:25

score 109 · Answer 7 · 2017-10-03 19:04:48

109

Views

Keeping track of "state" when writing equality proofs that are long chains of transitively linked steps

Published on 03 October 2017 at 19:04

score 92 · Answer 8 · 2021-02-14 17:08:13

92

Views

(sequence .) . flip fmap === forM?

Published on 14 February 2021 at 17:08

score 276 · Answer 9 · 2017-01-15 19:18:49

276

Views

Problems with equational proofs and interface resolution in Idris

Published on 15 January 2017 at 19:18

score 329 · Answer 10 · 2016-08-14 07:32:21

329

Views

Prove Transitivity in Haskell semantics

Published on 14 August 2016 at 07:32

score 336 · Answer 11 · 2016-08-29 01:26:09

336

Views

Mapping a strict vs. a lazy function

Published on 29 August 2016 at 01:26

score 327 · Answer 12 · 2016-08-27 10:24:53

327

Views

Induction on lists - Proving Stronger Property (Haskell)

Published on 27 August 2016 at 10:24

score 1.1k · Answer 13 · 2010-12-10 00:52:04

1.1k

Views

Haskell: Equation Expander 1+(1+(1+(1+(…))))=∞

Published on 10 December 2010 at 00:52

score 116 · Answer 14 · 2022-02-04 14:42:04

116

Views

Why is chain of equational reasoning failing to meet trivially solvable constraints?

Published on 04 February 2022 at 14:42

score 130 · Answer 15 · 2014-04-22 23:38:01

130

Views

How does Haskell evaluate this function which undoes list intercalation?

Published on 22 April 2014 at 23:38

score 434 · Answer 16 · 2014-04-21 02:03:57

434

Views

Understanding different foldr statments

Published on 21 April 2014 at 02:03

score 154 · Answer 17 · 2014-04-25 17:39:01

154

Views

How does Haskell evaluate this function defined with partial application?

Published on 25 April 2014 at 17:39

score 123 · Answer 18 · 2014-04-25 21:20:56

123

Views

Function evaluation result

Published on 25 April 2014 at 21:20

score 121 · Answer 19 · 2015-02-20 09:08:57

121

Views

reduce(x+y, xs) and sum(xs) are not equivalent in python?

Published on 20 February 2015 at 09:08

score 341 · Answer 20 · 2016-05-31 14:23:28

341

Views

How to prove this Haskell code using equational reasoning

Published on 31 May 2016 at 14:23

List Question

Haskell - How to transform map sum (map (x:) xss) to map (x+) (map sum xss)

Haskell - How to transform maximum (xs ++ map (x+) xs) to max (maximum xs) (x + maximum xs)

Is it possible to use church encodings without breaking equational reasoning?

To prove equality of two function definitions inductively

If return a = return b then does a=b?

Proof by induction with multiple lists

Keeping track of "state" when writing equality proofs that are long chains of transitively linked steps

(sequence .) . flip fmap === forM?

Problems with equational proofs and interface resolution in Idris

Prove Transitivity in Haskell semantics

Mapping a strict vs. a lazy function

Induction on lists - Proving Stronger Property (Haskell)

Haskell: Equation Expander 1+(1+(1+(1+(…))))=∞

Why is chain of equational reasoning failing to meet trivially solvable constraints?

How does Haskell evaluate this function which undoes list intercalation?

Understanding different foldr statments

How does Haskell evaluate this function defined with partial application?

Function evaluation result

reduce(x+y, xs) and sum(xs) are not equivalent in python?

How to prove this Haskell code using equational reasoning

Trending Questions

Popular # Hahtags

Popular Questions