Join the discussion
Write your take first — we'll ask for email only when you're ready to publish.
- Hacker News
- TFA contains a great number of links to downloadable interesting research papers.by adrian_b
- Author here. This is work-in-progress, not linked from top level. I'll keep working.by pmcjones
- Thanks for the extensive collection. Valuable work. I’ve included a reference to the link collection on https://github.com/function-level/function-level.github.ioby metazip
- Remembering John Backus:
> [...] At that time, John was interested in pure functional programming, with no side-effects on storage or the external world. I advocated extending the language to allow writing complete interactive applications. John conceded the importance of this, and came up with a scheme in which one would write a function to express the complete transformation of an application on the global state. I struggled with John’s variable free style, and suggested we allow lambda variables when defining a new functional form (higher-order function), but he stuck to his guns.
(In my project) I’ve reduced extensibility to the meta-composition rule, and I’m using an IO monad for interaction because I believe all functions should remain as simple as possible.
by metazip - I've always wondered if there's more to FP than (more or less) point-free style with an associated algebra. TFA seems to stop just when it might get interesting. Did Backus ever develop (or aim for) a notion of semantic completeness, e.g. Cartesian closure or whatever works [0] for Hughes's Arrows? The last has the interesting property of being foundationally point-free but also supporting a syntax with variables (with non-standard scoping rules). Which perhaps refutes Backus's original concerns.