Continuations revisited

Higher-Order and Symbolic Computation

Volumn 13, Issue 1, 2000, Pages 131-133

  Wadsworth, Christopher P ^a  

^a Pagoda   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; FORMAL LANGUAGES;

CONTINUATIONS; LANGUAGE DESIGN;

HIGH LEVEL LANGUAGES;

EID: 0033724576     PISSN: 13883690     EISSN: None     Source Type: Journal    
DOI: 10.1023/a:1010074329461     Document Type: Article

References (9)

1. Dijkstra, E.W. Go to statement considered harmful. Communications of the ACM 11(3) (1968) 147-148.
2. Mazurkiewicz, A.W. Proving algorithms by tail functions. Information and Control 18 (1971) 220-226. Working paper for IFIP WG2.2 dated February 1970.
3. Reynolds, J.C. The discoveries of continuations. Lisp and Symbolic Computation 6(3/4) (1993) 233-247.
4. Scott, D.S. Outline of a mathematical theory of computation. In Proceedings of the Fourth Annual Princeton Conference on Information Sciences and Systems, 1970, pp. 169-176.
5. Scott, D.S. and Strachey, C. Towards a mathematical semantics for computer languages. In Proceedings of the Symposium on Computers and Automata, Polytechnic Institute of Brooklyn, 1971.
6. Strachey, C. A mathematical semantics which can deal with full jumps. In Theorie des Algorithmes, des Langages et de la Programmation, IRIA (INRIA), Rocquencourt, France, 1973, pp. 175-191.
7. Strachey, C. and Wadsworth, C.P. Continuations: A mathematical semantics for handling full jumps. Technical Monograph PRO-11, Oxford University Computing Laboratory, Programming Research Group, Oxford, England, 1974.
8. Wadsworth, C.P. Another approach to jumps-continuations. Unpublished note, Oxford, England, November 1970.
9. Wadsworth, C.P. Notes on continuations. Unpublished note, Oxford, England, July 1972.