News for hackers. Stuff that matters.

A comment on Loop Exits and Structured Programming: Reopening the Debate (1995) [pdf]. Parent comment

Re:Loop Exits and Structured Programming: Reopening the Deba... by eru on Tuesday June 13, 2017 @10:17AM (#14544828)
You don't need ifs nor conditional jumps. Functional calls are truly enough. I can show you how it's done, if you want to see it.

Thus you can implement 'if' as a user defined function in eg Haskell.

(But I'd advise against the totally if-less style. Pattern matching is just too convenient. (And ifs are just a special case of pattern matching on booleans.))

Pure lambda calculus doesn't I have ifs. If you want to go truly crazy, check out SKI calculus. It doesn't even have lambda abstraction.

[ Parent | on HN ]
Re:Loop Exits and Structured Programming: Reopening the Deba... by GrumpyNl on Wednesday June 14, 2017 @05:35AM (#14551575)
The basics still stands, doesnt matter how you call it or do it different.
[ Parent | on HN ]
Re:Loop Exits and Structured Programming: Reopening the Deba... by eru on Wednesday June 14, 2017 @10:52AM (#14553151)
Sorry, what do you mean?

If I may guess: you want to make gotos central? That only holds for compiling to von-Neumann machines. Some other computational structures might not even have instruction pointers to move around.

[ Parent | on HN ]