Functional computation as concurrent computation

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Functional computation as concurrent computation

Full text

Pdf (1.10 MB)

Source

Annual Symposium on Principles of Programming Languages archive
Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages table of contents

St. Petersburg Beach, Florida, United States

Pages: 333 - 343

Year of Publication: 1996

ISBN:0-89791-769-3

Author

Joachim Niehren

German Research Center for Artificial Intelligence (DFKI), Stuhlsatzenhausweg 3, 66123 Saarbrücken, Germany

Sponsors

SIGPLAN: ACM Special Interest Group on Programming Languages
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 3, Downloads (12 Months): 23, Citation Count: 5

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/237721.237801 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	ACCL91	Mart#n Abadi, Luca Cardelli, P.-L. Cunen, and Jean-Jaques L6vy. Explicit substitutions. Journal of Functzonal Prograrnmzng, 1(4)375-416, 1991.
	AFMOW95	Zena M. Ariola , John Maraist , Martin Odersky , Matthias Felleisen , Philip Wadler, A call-by-need lambda calculus, Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.233-246, January 23-25, 1995, San Francisco, California, United States [doi>10.1145/199448.199507]
	ANP89	Arvind , Rishiyur S. Nikhil , Keshav K. Pingali, I-structures: data structures for parallel computing, ACM Transactions on Programming Languages and Systems (TOPLAS), v.11 n.4, p.598-632, Oct. 1989 [doi>10.1145/69558.69562]
	Bar84	Henk P. Barendregt. The Lambda Calculus. Its Syntax and Semantzcs, volume 103 of Studzes zn Logic and the Foundatzons of Mathematzcs Elsevier, 1984.
	BNA91	Paul S. Barth , Rishiyur S. Nikhil , Arvind Nikhil, M-structures: extending a parallel, non-strict, functional language with state, Proceedings of the 5th ACM conference on Functional programming languages and computer architecture, p.538-568, June 1991, Cambridge, Massachusetts, United States
	BO95	Simon Brock , Gerald Ostheimer, Process Semantics of Graph Reduction, Proceedings of the 6th International Conference on Concurrency Theory, p.471-485, August 21-24, 1995
	Bou89	Gérard Boudol, Towards a Lambda-Calculus for Concurrent and Communicating Systems, Proceedings of the International Joint Conference on Theory and Practice of Software Development, Volume 1: Advanced Seminar on Foundations of Innovative Software Development I and Colloquium on Trees in Algebra and Programming, p.149-161, March 13-17, 1989
	Bou92	G#rard Boudol Asynchrony and the 7r-calculus (note). Rapport de Recherche 1702, INRIA, Sophia Antipolis, France, 1992
	HSW95	Martin Henz, Gert Smolka, and Jbrg Wurtz. Object-oriented concurrent constraint programming m Oz In V Saraswat and P. Van Hentenryck, editors, Pmnc#ples and Practzce of Constraint Prograrnrr#r#9, chapter 2, p#ge5 27-45 The MIT Press, 1995.
	HT91	Kohei Honda , Mario Tokoro, An Object Calculus for Asynchronous Communication, Proceedings of the European Conference on Object-Oriented Programming, p.133-147, July 15-19, 1991
	Hue80	Gérard Huet, Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems: Abstract Properties and Applications to Term Rewriting Systems, Journal of the ACM (JACM), v.27 n.4, p.797-821, Oct. 1980 [doi>10.1145/322217.322230]
	Iba95	Kai Ibach. OzFun: Eine funktlonale Spache fiir gemischte Eager- und Lazy-Programmierung, Universlt~t des Saarlandes, Fachbereich Intbrmatik October 1995.
	Jef94	Alan Jeffrey. A fully abstract semantics for concurrent graph reduction. In Proceedings of the Log,#,c #n Computer Science Conference, pages 82-91, 1994.
	JH91	Sverker Janson and Self Handi. Programming paradigms of the Andorra Kernel Language. In Proceedings of the Internatwnal Symposium on Logic Programmm9, pages 167-186, 1991.
	Klo87	Jan Willem Klop. Term rewriting systems: A tutorial. Bulletin of the European Association of Theoretical Computer Szence., 32:143-182, 1987.
	KPT96	Naoki Kobayashi , Benjamin C. Pierce , David N. Turner, Linearity and the pi-calculus, Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.358-371, January 21-24, 1996, St. Petersburg Beach, Florida, United States [doi>10.1145/237721.237804]
	Lau93	John Launchbury, A natural semantics for lazy evaluation, Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.144-154, March 1993, Charleston, South Carolina, United States [doi>10.1145/158511.158618]
	Mah87	Michael J. Maher. Logic semantics for a class of committed-choice programs. In Logzc Programmm9, Proceedings of the Fourth Internatzonal Conference, pages 858-876. 1987.
	Mil91	Robin Milner. The potyadic re-calculus' A tutorial. ECS-LFCS Report Series 91-180, Laboratorv for Foundations of Computer Science, University of Edinburgh, 1991.
	Mil92	Robin Milner. Functions as processes. Journal of Mathematical Structures #,n Computer Sc#.ence, 2(2):119-141, 1992.
	MPW92	Robin Milner , Joachim Parrow , David Walker, A calculus of mobile processes, I, Information and Computation, v.100 n.1, p.1-40, Sept. 1992 [doi>10.1016/0890-5401(92)90008-4]
	Mül95	Martin Mfiller. Polymorphic types for concurrent constraints. DFKI Saarbr/icken, Germany, http://ps-www.dfki.uni-sb.de/, 1996, submltted.
	Nie94	Joachim Niehren. Funkt#onale Berechnung #n einem unzform nebenliiufigen Kallciil m#t log#schen Vamablen. Doctoral Dissertation. Umversit/it des Saarlandes, Technische Fakult/it, Saarbriicken, Germany, December 1994.
	NM95	Joachim Niehren , Martin Müller, Constraints for Free in Concurrent Computation, Proceedings of the 1995 Asian Computing Science Conference on Algorithms, Concurrency and Knowledge, p.171-186, December 11-13, 1995
	NS94	Joachim Niehren , Gert Smolka, A Confluent Relational Calculus for Higher-Order Programming with Constraints, Proceedings of the First International Conference on Constraints in Computational Logics, p.89-104, September 07-09, 1994
	Pin87	Keshav Pingali, Lazy Evaluation and the Logic Variable, Cornell University, Ithaca, NY, 1987
	Plo75	Gordon D Plotkm. Call-by-name, call-by-value and the ,k-calculus Journal of Theoretical Computer Sczence, 1:125-159, 1975.
	PS92	S. Purushothaman , Jill Seaman, An adequate operational semantics of sharing in lazy evaluation, Symposium proceedings on 4th European symposium on programming, p.435-450, January 1992, Rennes, France
	PT95a	Benjamin C. Pierce, Concurrent Objects in a Process Calculus, Proceedings of the International Workshop on Theory and Practice of Parallel Programming, p.187-215, November 07-09, 1994
	PT95b	Benjamin C. Pierce and David N. Turner Pict: A programming language based on the picalculus Techmcal report in preparation; avmlable electronically, 1996
	San95	D. Sands. A Naive Tnne Analysis and its Theory of Cost Equivalence. The Journal of Logic and Computation, page 48 pages, 1995+.
	Smo94	Gert Smolka, A Foundation for Higher-order Concurrent Constraint Programming, Proceedings of the First International Conference on Constraints in Computational Logics, p.50-72, September 07-09, 1994
	Smo95a	Gert Smolka. An Oz primer. Oz documentation series, DFKI Saarbrficken, Germany, i995.
	Smo95b	Gert Smolka. The Oz programming model In Jan van Leeuwen, editor, Current Trends #n Computer Sczence, LNCS, vol. 1000. 1995
	SRP91	Vijay A. Saraswat , Martin Rinard , Prakash Panangaden, The semantic foundations of concurrent constraint programming, Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.333-352, January 21-23, 1991, Orlando, Florida, United States [doi>10.1145/99583.99627]
	SSW94	Christian Schulte , Gert Smolka , Jörg Würtz, Encapsulated Search and Constraint Programming in Oz, Proceedings of the Second International Workshop on Principles and Practice of Constraint Programming, p.134-150, May 02-04, 1994
	Vas94	Vasco Thudichum Vasconcelos, Typed Concurrent Objects, Proceedings of the 8th European Conference on Object-Oriented Programming, p.100-117, July 04-08, 1994
	Wal95	David Walker, Objects in the &pgr;-calculus, Information and Computation, v.116 n.2, p.253-271, Feb. 1, 1995 [doi>10.1006/inco.1995.1018]
	Yos93	Nobuko Yoshida, Optimal reduction in weak-&lgr;-calculus with shared environments, Proceedings of the conference on Functional programming languages and computer architecture, p.243-252, June 09-11, 1993, Copenhagen, Denmark [doi>10.1145/165180.165217]

CITED BY 5

	Naoki Kobayashi , Benjamin C. Pierce , David N. Turner, Linearity and the pi-calculus, ACM Transactions on Programming Languages and Systems (TOPLAS), v.21 n.5, p.914-947, Sept. 1999
	Naoki Kobayashi , Benjamin C. Pierce , David N. Turner, Linearity and the pi-calculus, Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.358-371, January 21-24, 1996, St. Petersburg Beach, Florida, United States
	Andrew Moran , David Sands, Improvement in a lazy context: an operational theory for call-by-need, Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.43-56, January 20-22, 1999, San Antonio, Texas, United States
	Davide Sangiorgi, From λ to π; or, Rediscovering continuations, Mathematical Structures in Computer Science, v.9 n.4, p.367-401, August 1999
	Joachim Niehren, Uniform confluence in concurrent computation, Journal of Functional Programming, v.10 n.5, p.453-499, September 2000