Results 1 
6 of
6
The Oz Programming Model
 COMPUTER SCIENCE TODAY, LECTURE NOTES IN COMPUTER SCIENCE
, 1995
"... The Oz Programming Model (OPM) is a concurrent programming model subsuming higherorder functional and objectoriented programming as facets of a general model. This is particularly interesting for concurrent objectoriented programming, for which no comprehensive formal model existed until now. ..."
Abstract

Cited by 294 (10 self)
 Add to MetaCart
The Oz Programming Model (OPM) is a concurrent programming model subsuming higherorder functional and objectoriented programming as facets of a general model. This is particularly interesting for concurrent objectoriented programming, for which no comprehensive formal model existed until now. The model
Temporal Concurrent Constraint Programming: Denotation, Logic and Applications
, 2002
"... The tcc model is a formalism for reactive concurrent constraint programming. We present a model of temporal concurrent constraint programming which adds to tcc the capability of modeling asynchronous and nondeterministic timed behavior. We call this tcc extension the ntcc calculus. We also give a d ..."
Abstract

Cited by 68 (24 self)
 Add to MetaCart
The tcc model is a formalism for reactive concurrent constraint programming. We present a model of temporal concurrent constraint programming which adds to tcc the capability of modeling asynchronous and nondeterministic timed behavior. We call this tcc extension the ntcc calculus. We also give a denotational semantics for the strongestpostcondition of ntcc processes and, based on this semantics, we develop a proof system for lineartemporal properties of these processes. The expressiveness of ntcc is illustrated by modeling cells, timed systems such as RCX controllers, multiagent systems such as the Predator /Prey game, and musical applications such as generation of rhythms patterns and controlled improvisation. 1
Constraints for Free in Concurrent Computation
 IN PROCEEDINGS OF THE ASIAN COMPUTER SCIENCE CONFERENCE, LNCS 1023
, 1995
"... We investigate concurrency as unifying computational paradigm which integrates functional, constraint, and objectoriented programming. We propose the aecalculus as a uniform foundation of concurrent computation and formally relate it to other models: The ae calculus with equational constraint ..."
Abstract

Cited by 21 (6 self)
 Add to MetaCart
We investigate concurrency as unifying computational paradigm which integrates functional, constraint, and objectoriented programming. We propose the aecalculus as a uniform foundation of concurrent computation and formally relate it to other models: The ae calculus with equational constraints provides for logic variables and is bisimilar to the flcalculus. The aecalculus without constraints is a proper subset of the calculus. We prove its Turing completeness by embedding the eager calculus in continuation passing style. The aecalculus over an arbitrary constraint system is an extension of the standard ccmodel with procedural abstraction.
Functional Computation as Concurrent Computation
, 1995
"... We investigate functional computation as a special form of concurrent computation. ..."
Abstract

Cited by 13 (3 self)
 Add to MetaCart
We investigate functional computation as a special form of concurrent computation.
A Confluent Calculus for Concurrent Constraint Programming with Guarded Choice
 Principles and Practice of Constraint Programming, Proceedings First International Conference, CP'95
, 1995
"... . Confluence is an important and desirable property as it allows the program to be understood by considering any desired scheduling rule, rather than having to consider all possible schedulings. Unfortunately, the usual operational semantics for concurrent constraint programs is not confluent as dif ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
. Confluence is an important and desirable property as it allows the program to be understood by considering any desired scheduling rule, rather than having to consider all possible schedulings. Unfortunately, the usual operational semantics for concurrent constraint programs is not confluent as different process schedulings give rise to different sets of possible outcomes. We show that it is possible to give a natural confluent calculus for concurrent constraint programs, if the syntactic domain is extended by a blind choice operator and a special constant standing for a discarded branch. This has application to program analysis. 1 Introduction Concurrent constraint programming (ccp) [16, 15] is a recent programmingparadigm which elegantly combines logical concepts and concurrency mechanisms. The computational model of ccp is based on the notion of a constraint system, which consists of a set of constraints and an entailment relation. Processes interact through a common store. Commun...
Uniform Confluence in Concurrent Computation
, 1999
"... Indeterminism is typical for concurrent computation. If several concurrent actors compete for the same resource then at most one of them may succeed, whereby the choice of the successful actor is indeterministic. As a consequence, the execution of a concurrent program may be nonconfluent. Even worse ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Indeterminism is typical for concurrent computation. If several concurrent actors compete for the same resource then at most one of them may succeed, whereby the choice of the successful actor is indeterministic. As a consequence, the execution of a concurrent program may be nonconfluent. Even worse, most observables (termination, computational result, and time complexity) typically depend on the scheduling of actors created during program execution. This property contrast concurrent programs from purely functional programs. A functional program is uniformly confluent in the sense that all its possible executions coincide modulo reordering of execution steps. In this paper, we investigate concurrent programs that are uniformly confluent and their relation to eager and lazy functional programs.