[HN Gopher] Unifying Structured Recursion Schemes [pdf] (2013)
___________________________________________________________________
 
Unifying Structured Recursion Schemes [pdf] (2013)
 
Author : adamnemecek
Score  : 24 points
Date   : 2021-06-12 19:01 UTC (3 hours ago)
 

web link (www.cs.ox.ac.uk)

w3m dump (www.cs.ox.ac.uk)

 
| ampdepolymerase wrote:
| A transform or heuristic must be developed so that naive
| recursion can be trivially unrolled into a loop (or state machine
| in cases of trees and graphs). Tail recursion is simply too
| tricky to reason through for complex logic unless you enjoy doing
| induction proofs.
 
| adamnemecek wrote:
| Adjoint functors are mind blowing.
 
___________________________________________________________________
(page generated 2021-06-12 23:00 UTC)