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.
Type de document :
Communication dans un congrès
23th ACM Symposium on Principles of Programming Languages, 1996, St. Petersburg Beach, Florida, United States. ACM Press, pp.333--343, 1996
Liste complète des métadonnées

Littérature citée [38 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/inria-00536819
Contributeur : Joachim Niehren <>
Soumis le : mardi 16 novembre 2010 - 23:10:49
Dernière modification le : mardi 31 octobre 2017 - 14:22:18
Document(s) archivé(s) le : jeudi 17 février 2011 - 03:16:24

Fichiers

POPL96.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • 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. ACM Press, pp.333--343, 1996. 〈inria-00536819〉

Partager

Métriques

Consultations de la notice

63

Téléchargements de fichiers

131