%
% GENERATED FROM https://www.coli.uni-saarland.de
%    by   : anonymous
%    IP   : coli2006.lst.uni-saarland.de
%    at   : Mon, 05 Feb 2024 15:43:22 +0100 GMT
%    
% Selection : Reference #1031
%




@TechReport{Niehren:1999,
      AUTHOR = {Niehren, Joachim},
      TITLE = {Uniform Confluence in Concurrent Computation},
      YEAR = {1999},
      ADDRESS = {Saarbrücken},
      TYPE = {Technical Report},
      INSTITUTION = {Universität des Saarlandes, Programming Systems Lab},
      URL = {http://www.ps.uni-sb.de/Papers/abstracts/Uniform:2000.html ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/Uniform-97.ps.gz},
      ABSTRACT = {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. We study uniform confluence in concurrent computation within the applicative core of the $pi$-calculus which is widely used in different models of concurrent programming (with interleaving semantics). In particular, the applicative core of the $pi$-calculus serves as a kernel in foundations of concurrent constraint programming with first-class procedures (as provided by the programming language Oz). We model eager functional programming in the $lambda$-calculus with weak call-by-value reduction and lazy functional programming in the call-by-need amming in the $lambda$-calculus with standard reduction. As a measure of time complexity, we count application steps. We encode the $lambda$-calculus with both above reduction strategies into the applicative core of the $pi$-calculus and show that time complexity is preserved. Our correctness proofs employs a new technique based on uniform confluence and simulations. The strength of our technique is illustrated by proving a folk theorem, namely that the call-by-need complexity of a functional program is smaller than its call-by-value complexity.},
      ANNOTE = {COLIURL : Niehren:1999:UCC.pdf Niehren:1999:UCC.ps}
}