Question

Quickly memoize anonymous recursive functions using lambdas and the "fix function"

score 105 · Answer 1 · 2024-03-24T02:00:23.203000

105

Views

Quickly memoize anonymous recursive functions using lambdas and the "fix function"

Published on 24 March 2024 at 02:00

score 31 · Answer 2 · 2024-03-16T05:18:01.353000

31

Views

How could this Y' same as this Y combinator itself?

Published on 16 March 2024 at 05:18

score 31 · Answer 3 · 2024-02-13T15:35:19.140000

31

Views

How does `const` turn multi-parameter functions iterable by the `fix` fixed-point combinator?

Published on 13 February 2024 at 15:35

score 205 · Answer 4 · 2023-07-31T02:12:56.977000

205

Views

What's the intuition behind fixpoints of monads NOT being the direct limit?

Published on 31 July 2023 at 02:12

score 168 · Answer 5 · 2023-06-10T15:07:28.837000

168

Views

Which kinds of lawfull `Functor`s are possible in Haskell?

Published on 10 June 2023 at 15:07

score 74 · Answer 6 · 2023-04-15T17:51:06.437000

74

Views

How to prevent a Nixpkgs overlay from being applied more than once?

Published on 15 April 2023 at 17:51

score 96 · Answer 7 · 2023-04-09T04:08:32.373000

96

Views

How to get an infinitely nested value?

Published on 09 April 2023 at 04:08

score 326 · Answer 8 · 2023-03-15T12:35:00.920000

326

Views

Fixed-point of a monadic and comonadic computation

Published on 15 March 2023 at 12:35

score 149 · Answer 9 · 2022-06-13T13:57:05.827000

149

Views

Compute type fixed point

Published on 13 June 2022 at 13:57

score 204 · Answer 10 · 2022-05-14T15:07:11.323000

204

Views

Need help understanding Fix type in Haskell

Published on 14 May 2022 at 15:07

score 176 · Answer 11 · 2022-01-16T20:17:29.547000

176

Views

higher order fix point in OCaml

Published on 16 January 2022 at 20:17

score 174 · Answer 12 · 2021-10-02T17:25:26.940000

174

Views

Why doesn't this fixed-point computation stop?

Published on 02 October 2021 at 17:25

score 222 · Answer 13 · 2021-08-29T18:00:24.783000

222

Views

Translating a fixed-point operator to Haskell language

Published on 29 August 2021 at 18:00

score 175 · Answer 14 · 2021-06-23T01:56:45.723000

175

Views

Proving two-list queue in coq

Published on 23 June 2021 at 01:56

score 325 · Answer 15 · 2020-12-03T10:15:36.683000

325

Views

How `fix f = let {x = f x} in x` is evaluated?

Published on 03 December 2020 at 10:15

score 124 · Answer 16 · 2020-11-03T16:13:42.003000

124

Views

How to prove that the Church encoding, forall r. (F r -> r) -> r, gives an initial algebra of the functor F?

Published on 03 November 2020 at 16:13

score 314 · Answer 17 · 2020-09-06T08:02:37.683000

314

Views

How does repmin place values in the tree in Haskell?

Published on 06 September 2020 at 08:02

score 237 · Answer 18 · 2020-07-25T20:53:00.407000

237

Views

Cases in which we shall not use monadic bind to write mfix down using loop

Published on 25 July 2020 at 20:53

score 104 · Answer 19 · 2020-07-06T09:12:37.293000

104

Views

Is it possible to write down a sharing fix point-free?

Published on 06 July 2020 at 09:12

score 182 · Answer 20 · 2020-07-03T12:23:15.613000

182

Views

Complexity of computing Fibonacci sequence as a fixpoint

Published on 03 July 2020 at 12:23

List Question

Quickly memoize anonymous recursive functions using lambdas and the "fix function"

How could this Y' same as this Y combinator itself?

How does `const` turn multi-parameter functions iterable by the `fix` fixed-point combinator?

What's the intuition behind fixpoints of monads NOT being the direct limit?

Which kinds of lawfull `Functor`s are possible in Haskell?

How to prevent a Nixpkgs overlay from being applied more than once?

How to get an infinitely nested value?

Fixed-point of a monadic and comonadic computation

Compute type fixed point

Need help understanding Fix type in Haskell

higher order fix point in OCaml

Why doesn't this fixed-point computation stop?

Translating a fixed-point operator to Haskell language

Proving two-list queue in coq

How `fix f = let {x = f x} in x` is evaluated?

How to prove that the Church encoding, forall r. (F r -> r) -> r, gives an initial algebra of the functor F?

How does repmin place values in the tree in Haskell?

Cases in which we shall not use monadic bind to write mfix down using loop

Is it possible to write down a sharing fix point-free?

Complexity of computing Fibonacci sequence as a fixpoint

Trending Questions

Popular # Hahtags

Popular Questions