Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory
Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory
A Theory of Programming Language Semantics
A Theory of Programming Language Semantics
Proceedings of the 6th Colloquium, on Automata, Languages and Programming
Proceedings of the 7th Colloquium on Automata, Languages and Programming
Denotational Semantics of Parallelism
Proceedings of the International Sympoisum on Semantics of Concurrent Computation
Parameter-passing mechanisms and nondeterminism
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
POPL '76 Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages
FUNCTIONAL DOMAINS OF APPLICATIVE LANGUAGES
FUNCTIONAL DOMAINS OF APPLICATIVE LANGUAGES
Foundations of Actor Semantics
Foundations of Actor Semantics
FPCA '95 Proceedings of the seventh international conference on Functional programming languages and computer architecture
Algebraic approaches to nondeterminism—an overview
ACM Computing Surveys (CSUR)
Erratic fudgets: a semantic theory for an embedded coordination language
Science of Computer Programming - Special issue on coordination languages and architectures
Erratic Fudgets: A Semantic Theory for an Embedded Coordination Language
COORDINATION '99 Proceedings of the Third International Conference on Coordination Languages and Models
ACM Transactions on Programming Languages and Systems (TOPLAS)
Non-deterministic lisp with dependency-directed backtracking
AAAI'87 Proceedings of the sixth National conference on Artificial intelligence - Volume 1
Non-deterministic lisp with dependency-directed backtracking
AAAI'87 Proceedings of the sixth National conference on Artificial intelligence - Volume 1
Hi-index | 0.00 |
This paper offers a definition of nondeterministic call by need and gives two alternative call by need power domain semantics for a language with McCarthy's ambiguous operator amb. amb is one of the earliest and most interesting nondeterministic programming language constructs [9]. The value of (amb E1 E2) is ambiguously the value of E1 or the value of E2, with one important qualification: if the value of E1 is undefined then the value of (amb E1 E2) is the value of E2, and vice versa. For example the parallel or of E1 and E2 can be written as (amb (if E1 true E2) (if E2 true E1)), showing the usefulness of amb even for writing deterministic expressions.