Results 1  10
of
556
Compiling with Nondeterministic Choice for Expressing Pending Optimization Decisions
"... Abstract. Optimizing compilers must make many decisions while translating programs or program fragments. However, the outcome (i.e., the effect on overall code quality) of these decisions is often not immediately apparent. It would be useful if one could defer decisions about specific program transf ..."
Abstract
 Add to MetaCart
. The result is a framework that not only can serve directly as the basis for an implementation but which also permits reasoning about its theoretical and practical properties. The extension—a nondeterministic choice operator—can be added to many kinds of intermediate languages of which this paper will show
Adaptive Protocols for Negotiating NonDeterministic Choice over Synchronous Channels
, 1997
"... In this paper, we propose several deadlockfree protocols for implementing the generalized alternative construct, where a process nondeterministically chooses between sending or receiving among various synchronous channels. We consider general manytomany channels and examine in detail the special ..."
Abstract
 Add to MetaCart
In this paper, we propose several deadlockfree protocols for implementing the generalized alternative construct, where a process nondeterministically chooses between sending or receiving among various synchronous channels. We consider general manytomany channels and examine in detail
Extending Answer Set Planning with Sequence, Conditional, Loop, NonDeterministic Choice, and Procedure Constructs
 in Proceedings of the AAAI Spring Symposium on Answer Set Programming: Towards Efficient and Scalable Knowledge Representation and Reasoning
, 2001
"... We extend answer set programming of dynamical systems with more expressive programming constructs such sequence, conditional, loop, nondeterministic choice of actions /arguments, and procedures. We discuss its relevance to the problem of answer set planning. We present an SMODELS encoding of t ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
We extend answer set programming of dynamical systems with more expressive programming constructs such sequence, conditional, loop, nondeterministic choice of actions /arguments, and procedures. We discuss its relevance to the problem of answer set planning. We present an SMODELS encoding
Creative Commons Attribution License. Strong Normalization for HA + EM1 by NonDeterministic Choice
"... We study the strong normalization of a new CurryHoward correspondence for HA+EM1, constructive Heyting Arithmetic with the excluded middle on Σ01formulas. The proofterm language of HA+ EM1 consists in the lambda calculus plus an operator ‖a which represents, from the viewpoint of programming, an ..."
Abstract
 Add to MetaCart
, an exception operator with a delimited scope, and from the viewpoint of logic, a restricted version of the excluded middle. We give a strong normalization proof for the system based on a technique of “nondeterministic immersion”. 1
A Deconstruction of Nondeterministic Classical Cut Elimination
 TLCA'01, LNCS 2044, 268282
"... This paper shows how a symmetric and nondeterministic cut elimination procedure for a classical sequent calculus can be faithfully simulated using a nondeterministic choice operator to combine different `doublenegation' translations of each cut. The resulting interpretation of classical ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
This paper shows how a symmetric and nondeterministic cut elimination procedure for a classical sequent calculus can be faithfully simulated using a nondeterministic choice operator to combine different `doublenegation' translations of each cut. The resulting interpretation of classical
Optimal NonDeterministic Functional Logic Computations
 In Proc. International Conference on Algebraic and Logic Programming (ALP’97
, 1298
"... Abstract. We show that nondeterminism simplifies coding certain problems into programs. We define a nonconfluent, but wellbehaved class of rewrite systems for supporting nondeterministic computations in functional logic programming. We show the benefits of using this class on a few examples. We ..."
Abstract

Cited by 64 (32 self)
 Add to MetaCart
define a narrowing strategy for this class of systems and prove that our strategy is sound, complete, and optimal, modulo nondeterministic choices, for appropriate definitions of these concepts. We compare our strategy with related work and show that our overall approach is fully compatible
Points of ∀Definedness of NonDeterministic Programs over an Arbitrary Data Type
"... We consider a kind of nondeterministic programs with counters and stacks over an arbitrary abstract data type, that along with the usual statements (assignment, loop, etc.) has also a nondeterministic choice statement xi:= arbitrary(A), where A is a subset of the basic set. After the execution of ..."
Abstract
 Add to MetaCart
We consider a kind of nondeterministic programs with counters and stacks over an arbitrary abstract data type, that along with the usual statements (assignment, loop, etc.) has also a nondeterministic choice statement xi:= arbitrary(A), where A is a subset of the basic set. After the execution of such
Adaptive Testing of NonDeterministic Communication Protocols
 IN PROTOCOL TEST SYSTEMS VI
, 1994
"... A new approach to testing protocols in which both the specification and the implementation exhibit nondeterminism is described. Test sequences are generated by an adaptive tester, which executes in parallel with the implementation under test (IUT). The adaptive tester attempts to determine a poster ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
posteriori which nondeterministic choice the IUT has made, and uses this information to decide how to proceed. To achieve this, the different alternatives at each nondeterministic state are characterized by Transition Distinguishing Sequence Sets (TDSS), which can be generated in a preprocessing phase.
... : Using Nondeterministic Choice as Part of a Deterministic Calculus
, 2000
"... Optimizing compilers for functional languages often use calculus to represent programs during optimization. We investigate the addition of a nondeterministic choice operator to such a language and demonstrate how a compiler can take advantage of it by encoding pending optimization decisions in ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Optimizing compilers for functional languages often use calculus to represent programs during optimization. We investigate the addition of a nondeterministic choice operator to such a language and demonstrate how a compiler can take advantage of it by encoding pending optimization decisions
Nondeterministic Lazy it λcalculus VS it πcalculus
 ECOLE NORMALE SUPERIEURE
, 1993
"... We pursue the study of the embedding of the λcalculus into the πcalculus. Various λ calculi with parallel and convergence testing facilities are examined and their expressiveness compared; λj a lazy calculus augmented with a nondeterministic choice operator and a convergence testing combinator, ..."
Abstract
 Add to MetaCart
We pursue the study of the embedding of the λcalculus into the πcalculus. Various λ calculi with parallel and convergence testing facilities are examined and their expressiveness compared; λj a lazy calculus augmented with a nondeterministic choice operator and a convergence testing combinator
Results 1  10
of
556