Skip to Main content Skip to Navigation
Conference papers

Functional Computation as Concurrent Computation

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 incorporats mutual recursion and can be extended to cyclic data structures by means of constraints.
Document type :
Conference papers
Complete list of metadata

Cited literature [38 references]  Display  Hide  Download

https://hal.inria.fr/inria-00536819
Contributor : Joachim Niehren Connect in order to contact the contributor
Submitted on : Tuesday, November 16, 2010 - 11:10:49 PM
Last modification on : Tuesday, October 31, 2017 - 2:22:18 PM
Long-term archiving on: : Thursday, February 17, 2011 - 3:16:24 AM

Files

POPL96.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00536819, version 1

Citation

Joachim Niehren. Functional Computation as Concurrent Computation. 23th ACM Symposium on Principles of Programming Languages, 1996, St. Petersburg Beach, Florida, United States. pp.333--343. ⟨inria-00536819⟩

Share

Metrics

Record views

117

Files downloads

393