Continuation semantics in typed lambda-calculi
- 1 January 1985
- book chapter
- Published by Springer Nature
- p. 219-224
- https://doi.org/10.1007/3-540-15648-8_17
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- A types-as-sets semantics for milner-style polymorphismPublished by Association for Computing Machinery (ACM) ,1984
- What is a model of the lambda calculus?Information and Control, 1982
- The congruence of two programming language definitionsTheoretical Computer Science, 1981
- Constructing Call-by-Value Continuation SemanticsJournal of the ACM, 1980
- Call-by-name, call-by-value and the λ-calculusTheoretical Computer Science, 1975
- On the Relation between Direct and Continuation SemanticsPublished by Springer Nature ,1974
- Proof of correctness of data representationsActa Informatica, 1972