PARAMETER PASSING IN NONDETERMINISTIC RECURSIVE PROGRAMS

被引:7
作者
BENSON, DB
机构
[1] Computer Science Department, Washington State University, Pullman
基金
美国国家科学基金会;
关键词
D O I
10.1016/0022-0000(79)90013-8
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Call by value and call by name have some subtleties when used in a nondeterministic programming language. A common formalism is used to establish the denotational semantics of recursive programs called by name and called by value. Ashcroft and Hennessy introduced the idea of differentiating between selecting arguments from a set of arguments at the point of invocation and selecting arguments during the run of the procedure. This distinction is shown to be independent of the evaluation according to value or name, giving rise to four possible parameter passing methods, all of which have a suitable least fixed point semantics. © 1979.
引用
收藏
页码:50 / 62
页数:13
相关论文
共 14 条
[1]  
DEROEVER WP, 1975, LECTURE NOTES COMPUT, P451
[2]  
Dijkstra E., 1976, DISCIPLINE PROGRAMMI
[3]   MATRICIAL THEORIES [J].
ELGOT, CC .
JOURNAL OF ALGEBRA, 1976, 42 (02) :391-421
[4]  
ELGOT CC, 1975, 1973 P LOG C BRIST
[5]  
HENNESSY M, CS7713 U WAT TECH RE
[6]  
HENNESSY M, 1976, 3RD INT C AUT LANG P
[7]  
HENNESSY MCB, 1977, 9TH P ACM S THEOR CO, P306
[9]  
LEHMANN DJ, 1976, 17TH S F COMP SCI HO, P122
[10]  
MANNA Z, 1974, MATH THEORY COMPUTAT