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
相关论文
共 50 条
  • [41] LOWER BOUNDS FOR DETERMINISTIC AND NONDETERMINISTIC BRANCHING PROGRAMS
    RAZBOROV, AA
    LECTURE NOTES IN COMPUTER SCIENCE, 1991, 529 : 47 - 60
  • [42] RELATIONAL ALGEBRAIC SEMANTICS OF DETERMINISTIC AND NONDETERMINISTIC PROGRAMS
    BERGHAMMER, R
    ZIERER, H
    THEORETICAL COMPUTER SCIENCE, 1986, 43 (2-3) : 123 - 147
  • [43] ON THE RELATIONSHIP BETWEEN COMPUTED FUNCTIONS AND FIXPOINTS OF NONDETERMINISTIC RECURSIVE DEFINITIONS
    CHEN, TY
    INFORMATION AND CONTROL, 1981, 50 (01): : 13 - 22
  • [44] RECURSIVE LINEAR PROGRAMS
    KENNEDY, PE
    DAY, RH
    KEIO ECONOMIC STUDIES, 1976, 13 (01): : 1 - 11
  • [45] On finitely recursive programs
    Baselice, Sabrina
    Bonatti, Piero A.
    Criscuolo, Giovanni
    THEORY AND PRACTICE OF LOGIC PROGRAMMING, 2009, 9 : 213 - 238
  • [46] CALCULATION OF RECURSIVE PROGRAMS
    RACHANSKI, V
    DOPOVIDI AKADEMII NAUK UKRAINSKOI RSR SERIYA A-FIZIKO-MATEMATICHNI TA TECHNICHNI NAUKI, 1979, (10): : 853 - 855
  • [47] On finitely recursive programs
    Baselice, S.
    Bonatti, P. A.
    Criscuolo, G.
    LOGIC PROGRAMMING, PROCEEDINGS, 2007, 4670 : 89 - +
  • [48] RECURSIVE-PROGRAMS
    FLEISCH, BD
    IEEE SPECTRUM, 1984, 21 (10) : 12 - 12
  • [49] TRANSFORMATION OF RECURSIVE PROGRAMS
    VEILLON, G
    REVUE FRANCAISE D AUTOMATIQUE INFORMATIQUE RECHERCHE OPERATIONNELLE, 1976, 10 (09): : 7 - 20
  • [50] Termination and Universal Termination Problems for Nondeterministic Quantum Programs
    Xu, Ming
    Fu, Jianling
    Jiang, Hui
    Deng, Yuxin
    Li, Zhi-bin
    ACM TRANSACTIONS ON SOFTWARE ENGINEERING AND METHODOLOGY, 2024, 33 (08)