StackOverflow Questions for Tag: recursion-schemes

Sergey Sviridov

Reputation: 107

Chronomorphisms in Scala

scalafunctional-programmingrecursion-schemes

Score: 4

Answers: 2

Aman maurya

Reputation: 11

What is the difference between head and tail recursion when reversing a linked list?

recursionlinked-listtail-recursionrecursion-schemes

Score: -1

Answers: 1

Taig

Reputation: 7288

Converting an ADT to use recursion schemes

scalafunctional-programmingrecursion-schemes

Score: 2

Answers: 1

cocorudeboy

Reputation: 139

Writing foldLeft equivalent for recursion schemes

haskelltypesalgebraic-data-typesrecursion-schemesfoldleft

Score: 2

Answers: 1

amalloy

Reputation: 91897

How to use recursion-schemes to `cata` two mutually-recursive types?

haskellrecursion-schemes

Score: 10

Answers: 1

xal

Reputation: 137

Forgetting Cofree annotations using a catamorphism

haskellfunctional-programmingcategory-theoryrecursion-schemescatamorphism

Score: 4

Answers: 1

Annihilus

Reputation: 13

Modeling a dependent computation task?

typescripthaskellrecursion-schemescatamorphism

Score: 1

Answers: 1

いとうかつとし

Reputation: 95

Is this some kind of morphism in the recursion-schemes?

haskellrecursion-schemeseuclidean-algorithm

Score: 4

Answers: 3

missingfaktor

Reputation: 92046

What does "coalgebra" mean in the context of programming?

scalahaskellfunctional-programmingcategory-theoryrecursion-schemes

Score: 357

Answers: 4

cocorudeboy

Reputation: 139

Memoizing a recursion scheme

haskelltypesrecursion-schemescatamorphismanamorphism

Score: 5

Answers: 1

cocorudeboy

Reputation: 139

Using a paramorphism inside of an apomorphism

haskellrecursion-schemes

Score: 1

Answers: 1

cocorudeboy

Reputation: 139

How to implement an anamorphism such that it can be build upon any value of the the return type (rather than just the base case)

haskellrecursion-schemes

Score: 3

Answers: 1

cocorudeboy

Reputation: 139

Lattice paths algorithm using recursion schemes

haskellrecursion-schemes

Score: 1

Answers: 1

Charles Josephs

Reputation: 1535

What do the generic type constraints ":<:" and ":+:" mean in this Scala example?

scalascalazscala-catshigher-kinded-typesrecursion-schemes

Score: 2

Answers: 1

Conor Quinn

Reputation: 529

Selectively recurse into left or right subtree of a binary tree using a catamorphism (or any recursion scheme)

haskelltime-complexitybinary-treerecursion-schemes

Score: 2

Answers: 1

Ace shinigami

Reputation: 1484

removing explicit recursion by replacing catamorphism

haskellrecursionfunctional-programmingrecursion-schemescomonad

Score: 3

Answers: 2

haroldcarr

Reputation: 1575

Histomorphisms, Zygomorphisms and Futumorphisms specialised to lists

haskellrecursionrecursion-schemes

Score: 43

Answers: 3

user1441998

Reputation: 459

How can I avoid explicit recursion in this case?

haskellrecursiontype-inferencerecursion-schemesfoldable

Score: 1

Answers: 1

Ace shinigami

Reputation: 1484

Alpha Beta Pruning with Recursion Schemes

haskellrecursionfunctional-programmingrecursion-schemescomonad

Score: 8

Answers: 1

xgrommx

Reputation: 1

An example for chronomorphism

haskellrecursion-schemes

Score: 1

Answers: 1

PreviousPage 1Next

StackOverflow Questions for Tag: recursion-schemes

Chronomorphisms in Scala

What is the difference between head and tail recursion when reversing a linked list?

Converting an ADT to use recursion schemes

Writing foldLeft equivalent for recursion schemes

How to use recursion-schemes to `cata` two mutually-recursive types?

Forgetting Cofree annotations using a catamorphism

Modeling a dependent computation task?

Is this some kind of morphism in the recursion-schemes?

What does &quot;coalgebra&quot; mean in the context of programming?

Memoizing a recursion scheme

Using a paramorphism inside of an apomorphism

How to implement an anamorphism such that it can be build upon any value of the the return type (rather than just the base case)

Lattice paths algorithm using recursion schemes

What do the generic type constraints &quot;:&lt;:&quot; and &quot;:+:&quot; mean in this Scala example?

Selectively recurse into left or right subtree of a binary tree using a catamorphism (or any recursion scheme)

removing explicit recursion by replacing catamorphism

Histomorphisms, Zygomorphisms and Futumorphisms specialised to lists

How can I avoid explicit recursion in this case?

Alpha Beta Pruning with Recursion Schemes

An example for chronomorphism

What does "coalgebra" mean in the context of programming?

What do the generic type constraints ":<:" and ":+:" mean in this Scala example?