News for hackers. Stuff that matters.

A comment on Thinking About Recursion. Parent comment

Re:Thinking About Recursion by dreamcompiler on Thursday March 09, 2017 @12:57AM (#13827319)
You're talking about continuation-passing style, which makes stacks superfluous. It's a mind-blowing idea. But it's also a royal pain to write code directly this way, so some compilers convert to continuations under the sheets.
[ Parent | on HN ]
Re:Thinking About Recursion by yazaddaruvala on Thursday March 09, 2017 @09:23PM (#13835818)
Its crazy that this idea was invented in 1975[0], and I haven't heard of it, even after:

- 4 years of self learned programming

- 4 years of university for computer engineering

- 5 years in the industry, as a software engineer

[0] https://en.wikipedia.org/wiki/Continuation-passing_style

[ Parent | on HN ]
Re:Thinking About Recursion by dreamcompiler on Tuesday March 14, 2017 @08:40PM (#13872906)
There are two very different (yet of course functionally equivalent) paradigms for general computation: Turing Machines and Lambda Calculus (Turing vs. Church). All schools teach TMs but not all teach LC. Which is a shame, because some wonderful insights like Functional Programming and Lisp and CPS come mostly from the LC paradigm.
[ Parent | on HN ]