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




@InProceedings{Niehren:1996,
      AUTHOR = {Niehren, Joachim},
      TITLE = {Functional Computation as Concurrent Computation},
      YEAR = {1996},
      BOOKTITLE = {23rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL '96), January 21-24},
      PAGES = {333-343},
      ADDRESS = {St. Petersburg Beach, Florida, USA},
      PUBLISHER = {ACM Press},
      URL = {ftp://ftp.ps.uni-sb.de/pub/papers/ProgrammingSysLab/POPL96.ps.gz},
      ABSTRACT = {We investigate functional computation as a special form of concurrent computation. As formal basis, we use a uniformly confluent core of the pi-calculus, which is also contained in models of higher-order concurrent constraint programming. We embed the call-by-need and the call-by-value lambda-calculus into the pi-calculus. We prove that call-by-need complexity is dominated by call-by-value complexity. In contrast to the recently proposed call-by-need lambda-calculus, our concurrent call-by-need model incorporates mutual recursion and can be extended to cyclic data structures by means of constraints.},
      NOTE = {longer version appeared as DFKI Research Report RR-95-14},
      ANNOTE = {COLIURL : Niehren:1996:FCC.pdf Niehren:1996:FCC.ps}
}