PARAMETER PASSING IN NONDETERMINISTIC RECURSIVE PROGRAMS

被引：7
作者：
BENSON, DB
机构：
[1] Computer Science Department, Washington State University, Pullman
来源：
JOURNAL OF COMPUTER AND SYSTEM SCIENCES | 1979年 / 19卷 / 01期
基金：
美国国家科学基金会;
关键词：
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 条
  • [31] STRONG SEMANTICAL CHARACTERIZATION FOR NONDETERMINISTIC PROGRAMS
    CSIRMAZ, L
    ZEITSCHRIFT FUR MATHEMATISCHE LOGIK UND GRUNDLAGEN DER MATHEMATIK, 1987, 33 (05): : 407 - 416
  • [32] Relational semantics for locally nondeterministic programs
    Xu, LW
    Takeichi, M
    Iwasaki, H
    NEW GENERATION COMPUTING, 1997, 15 (03) : 339 - 361
  • [33] A Nondeterministic Extension over Finitely Recursive Process Model
    Supratik Bose
    Siddhartha Mukhopadhyay
    Amit Patra
    Discrete Event Dynamic Systems, 1997, 7 : 243 - 274
  • [34] FUNCTIONAL-BEHAVIOR OF NONDETERMINISTIC AND CONCURRENT PROGRAMS
    MAIN, MG
    BENSON, DB
    INFORMATION AND CONTROL, 1984, 62 (2-3): : 144 - 189
  • [35] Workload Characterization of Nondeterministic Programs Parallelized by STATS
    Deiana, Enrico A.
    Campanoni, Simone
    2019 IEEE INTERNATIONAL SYMPOSIUM ON PERFORMANCE ANALYSIS OF SYSTEMS AND SOFTWARE (ISPASS), 2019, : 190 - 201
  • [36] A PROCESS LOGIC FOR NONDETERMINISTIC WHILE-PROGRAMS
    ZILLI, MV
    JOURNAL OF SYMBOLIC LOGIC, 1987, 52 (01) : 346 - 346
  • [37] On the hierarchy of nondeterministic branching k-programs
    Okol'nishnikova, EA
    FUNDAMENTALS OF COMPUTATION THEORY, PROCEEDINGS, 1997, 1279 : 376 - 387
  • [38] Good enough testing of nondeterministic parallel programs
    Kranzlmüller, D
    Messner, J
    Schaubschläger, C
    INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOLS I-V, PROCEEDINGS, 1999, : 641 - 645
  • [39] MODAL LOGIC OF CONCURRENT NONDETERMINISTIC PROGRAMS.
    Abrahamson, Karl
    Instrument Maintenance Management, 1979, 70 : 21 - 33
  • [40] Encoding nondeterministic fuzzy tree automata into recursive neural networks
    Gori, M
    Petrosino, A
    IEEE TRANSACTIONS ON NEURAL NETWORKS, 2004, 15 (06): : 1435 - 1449
12345