Continuation semantics in typed lambda-calculi: Summary

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 193 LNCS, Issue , 1985, Pages 219-224

  Meyer, Albert R ^a   Wand, Mitchell ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b BRANDEIS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BIOMINERALIZATION; CALCULATIONS; DIFFERENTIATION (CALCULUS); PATHOLOGY;

ATOMIC VALUES; CONTINUATION SEMANTICS; LAMBDA-CALCULI; TYPED LAMBDA CALCULUS;

SEMANTICS;

EID: 85035102569     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-15648-8_17     Document Type: Conference Paper

References (9)

1. Abelson, H., and Sussman, G.J. The Structure and Interpretation of Computer Programs, MIT Press, Cambridge, MA, 1985.
2. Hoare, C.A.R., “Proving Correctness of Data Representations,” Acta Informatica 1 (1972), 271-281.
3. Meyer, A.R. “What Is a Model of the Lambda Calculus?” Information and Control 52 (1982), 87-122.
4. Plotkin, G.D. “Call-by-Name, Call-by-Value and the é-Calculus,” Theoret. Comp. Sci. 1 (1975) 125-159.
5. Reynolds, J.C. “On the Relation between Direct and Continuation Semantics,” Proc. 2nd Colloq. on Automata, Languages, and Programming (Saarbrücken, 1974) Springer Lecture Notes in Computer Science, Vol. 14 (Berlin: Springer, 1974) 141-156.
6. Sethi, R. and Tang, A. “Constructing Call-by-value Continuation Semantics,” J. ACM 27 (1980), 580-597.
7. Stoy, J.E. “The Congruence of Two Programming Language Definitions,” Theoret. Comp. Sci. IS (1981), 151-174.
8. Strachey, C. and Wadsworth, C.P. “Continuations: A Mathematical Semantics for Handling Pull Jumps,” Oxford University Computing Laboratory Technical Monograph PRG-11 (January, 1974).
9. Wand, M. “A Types-as-Sets Semantics for Milner-style Polymorphism,” Conf. Rec. 11th ACM Symp. on Principles of Programming Languages (1984), 158-164.