StackOverflow Questions for Tag: recursion-schemes

Yash Ingle

Reputation: 9

How to solve this indirect recursion error?

recursiondata-structuresmutual-recursionrecursion-schemes

Score: -1

Answers: 1

Javran

Reputation: 3434

Significant overhead implementing Catalan numbers with histomorphism

haskellrecursion-schemes

Score: 8

Answers: 0

nicolas

Reputation: 9805

`refold :: Functor s => (a -> s a, a) -> (s b -> b) -> b` as a morphism between universal types

haskellfunctional-programmingfoldcategory-theoryrecursion-schemes

Score: 6

Answers: 2

maplike

Reputation: 31

How is this hylo solution to the "coin-change" problem designed?

haskellrecursionfunctional-programmingdynamic-programmingrecursion-schemes

Score: 3

Answers: 1

twitu

Reputation: 625

Using recursion schemes in Haskell for solving change making problem

haskellrecursiondynamic-programmingrecursion-schemes

Score: 4

Answers: 3

Linh Duong

Reputation: 1

Non-tail recursive function that returns the last element in list without using reverse?

functional-programmingschemelispracketrecursion-schemes

Score: -2

Answers: 2

P Varga

Reputation: 20229

Morphism where the algebra receives the item's position

recursion-schemescatamorphism

Score: 1

Answers: 1

winitzki

Reputation: 3347

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

functional-programmingtype-theoryrecursion-schemeschurch-encodingfixpoint-combinators

Score: 2

Answers: 0

Matei

Reputation: 152

Haskell monadic parser with anamorphisms

parsinghaskellmonadsrecursion-schemesanamorphism

Score: 5

Answers: 1

Luciano

Reputation: 2418

Composing non-distributive monads in recursion-schemes

haskellrecursion-schemes

Score: 4

Answers: 0

vytaute

Reputation: 1480

How to convert recursive algorithm to dynamic programming?

c#recursiondynamic-programmingrecursion-schemes

Score: -5

Answers: 1

Joseph Sible-Reinstate Monica

Reputation: 48572

Catamorphism that allows looking at part of the final result

haskelllazy-evaluationrecursion-schemescatamorphism

Score: 5

Answers: 3

trpnd

Reputation: 474

Recursion scheme allowing dependencies between recursive calls (an ordered catamorphism?)

haskellfunctional-programmingfoldcategory-theoryrecursion-schemes

Score: 2

Answers: 2

Luciano

Reputation: 2418

Is it possible to create efficient recombining trees using (co)recursion?

haskellrecursionbinary-treerecursion-schemes

Score: 2

Answers: 1

nnnmmm

Reputation: 8754

How do I write a CV-Coalgebra in Idris2?

idrisrecursion-schemes

Score: 1

Answers: 1

kthompson

Reputation: 892

Recursion schemes with mutually recursive types in Scala

scalarecursion-schemes

Score: 1

Answers: 1

Nastya Koroleva

Reputation: 73

Recursion scheme for tree-like structure

haskellfunctional-programmingrecursion-schemescatamorphism

Score: 5

Answers: 0

marcosh

Reputation: 9008

Fix and Mu isomorphic

haskellrecursion-schemesfixpoint-combinators

Score: 9

Answers: 1

string_loginUsername

Reputation: 427

Using recursive types vs parameterized types with recursion schemes in practice in Haskell

haskellrecursion-schemes

Score: 2

Answers: 0

Aman_X

Reputation: 87

Generate lexicographic series efficiently in Python

pythoncombinationssubset-sumlexicographicrecursion-schemes

Score: 1

Answers: 4

PreviousPage 2Next

StackOverflow Questions for Tag: recursion-schemes

How to solve this indirect recursion error?

Significant overhead implementing Catalan numbers with histomorphism

`refold :: Functor s =&gt; (a -&gt; s a, a) -&gt; (s b -&gt; b) -&gt; b` as a morphism between universal types

How is this hylo solution to the &quot;coin-change&quot; problem designed?

Using recursion schemes in Haskell for solving change making problem

Non-tail recursive function that returns the last element in list without using reverse?

Morphism where the algebra receives the item&#39;s position

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

Haskell monadic parser with anamorphisms

Composing non-distributive monads in recursion-schemes

How to convert recursive algorithm to dynamic programming?

Catamorphism that allows looking at part of the final result

Recursion scheme allowing dependencies between recursive calls (an ordered catamorphism?)

Is it possible to create efficient recombining trees using (co)recursion?

How do I write a CV-Coalgebra in Idris2?

Recursion schemes with mutually recursive types in Scala

Recursion scheme for tree-like structure

Fix and Mu isomorphic

Using recursive types vs parameterized types with recursion schemes in practice in Haskell

Generate lexicographic series efficiently in Python

`refold :: Functor s => (a -> s a, a) -> (s b -> b) -> b` as a morphism between universal types

How is this hylo solution to the "coin-change" problem designed?

Morphism where the algebra receives the item's position

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