Unifying Structured Recursion Schemes [pdf] (2013) | Hacker News Reader

Unifying Structured Recursion Schemes [pdf] (2013)

cs.ox.ac.uk

40 pointsadamnemecek7 comments

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.

I have been pining for a first-class language support for recursion schemes after learning and using them. Supplanting naive recursion with structured recursion would be an interesting move for a language. Does it have as much potential as structured programming?

Headline from 2031:

    When the 'functional for-loop' along with 
    'mutable but immutable variables' were created, 
    pure functional programming was finally made  
    available for the masses.

Adjoint functors are mind blowing.

I had the feeling they should be more prevalent (gbazerman made a splendid talk long ago, amongst many other people).

The fact that so few people were mentioning it made me feel wrong.

Do you use them regularly ?

I wrote up this thing https://github.com/adamnemecek/adjoint/

Interesting summary. When is your book due ? :p

Reply on news.ycombinator.com