Histories of discoveries of continuations: Belles-lettres with equivocal tenses (1997) [2 citations — 0 self]
Abstract:
The early sixties saw conventional labels "got rid of", and then reintroduced in a nuclear variant that was hoped to be so awesome that they would never be used again except for exceptions. But guilt-free remote control of dangerous instruments was already undermining the entente. This note is a very personal view of, and from, the first half of that decade, with very close horizons. But there is a lesson to be drawn. In the phrase "the meaning of rest of the program", there has been the same snare that sometimes traps people into not recognizing when, and when not, it's safe to confuse a node of a DAG with its reachable sub-DAG.
Citations
| 249 | Recursive functions of symbolic expressions and their computation by machine, part i – McCarthy - 1960 |
| 100 | A Correspondence Between ALGOL 60 and Church’s Lambda Notation – Landin - 1965 |
| 98 | Recursive Programming Techniques – Burge - 1975 |
| 86 | The discoveries of continuations – Reynolds - 1993 |
| 21 | A generalization of jumps and labels – Landin - 1998 |
| 11 | Towards a formal semantics – Strachey - 1966 |
| 11 | Adriaan . Recursive definition of syntax and semantics – Wijngaarden - 1964 |
| 4 | Getting rid of labels – Landin - 1965 |
| 3 | A formal description of ALGOL 60 – Landin - 1964 |
| 2 | The design of the GIER – Naur - 1963 |
| 1 | et al. The main features of CPL – Barron - 1963 |
| 1 | The applicative basis of side-effects. Unpublished handwritten manuscript – Landin - 1962 |
| 1 | Programming without imperatives – Landin - 1965 |

