The Semantics of Call-By-Value and Call-By-Name in a Nondeterministic Environment
- 1 February 1980
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 9 (1) , 67-84
- https://doi.org/10.1137/0209005
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- A mathematical semantics for a nondeterministic typed λ-calculusTheoretical Computer Science, 1980
- LCF considered as a programming languageTheoretical Computer Science, 1977
- Least fixed points revisitedTheoretical Computer Science, 1976
- The Relation between Computational and Denotational Properties for Scott’s ${\text{D}}_\infty $-Models of the Lambda-CalculusSIAM Journal on Computing, 1976
- A Powerdomain ConstructionSIAM Journal on Computing, 1976
- First-order reduction of call-by-name to call-by-valuePublished by Springer Nature ,1975
- Correct and optimal implementations of recursion in a simple programming languageJournal of Computer and System Sciences, 1974
- Fixpoint approach to the theory of computationCommunications of the ACM, 1972
- The correctness of nondeterministic programsArtificial Intelligence, 1970