Annotations to Control Parallelism and Reduction Order in the Distributed Evaluation of Functional Programs

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Annotations to Control Parallelism and Reduction Order in the Distributed Evaluation of Functional Programs

Full text

Pdf (1.02 MB)

Source

ACM Transactions on Programming Languages and Systems (TOPLAS) archive
Volume 6 , Issue 2 (April 1984) table of contents

Pages: 159 - 174

Year of Publication: 1984

ISSN:0164-0925

Author

F. Warren Burton

Department of Electrical Engineering and Computer Science, University of Colorado at Denver, Denver, CO

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 1, Downloads (12 Months): 44, Citation Count: 12

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/2993.357241 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.

	1	AIELLO, L. An efficient interpreter for the lambda-calculus. J. Comput. Syst. Sci. 23 (1981), 383-424.
	2	John Backus, Can programming be liberated from the von Neumann style?: a functional style and its algebra of programs, Communications of the ACM, v.21 n.8, p.613-641, Aug. 1978 [doi>10.1145/359576.359579]
	3	BURGE, W.H. Recursive Programming Techniques. Addison-Wesley, Reading, Mass., 1975.
	4	BURSTALL, R.M., MACQUEEN, D.B., ANO SANNELLA, D.T. HOPE: An experimental applicative language. Rep. CSR-62-80, Dept. of Computer Science, Univ. of Edinburgh, Edinburgh, Scotland, May, 1980.
	5	BURTON, F.W. A linear space translation of functional programs to Turner combinators. Inf. Process. Lett. 14, 5 (July 23, 1982), 201-204.
	6	F. W. Burton, Storage Management in Virtual Tree Machines, IEEE Transactions on Computers, v.37 n.3, p.321-328, March 1988 [doi>10.1109/12.2169]
	7	T. J.W. Clarke , P. J.S. Gladstone , C. D. MacLean , A. C. Norman, SKIM - The S, K, I reduction machine, Proceedings of the 1980 ACM conference on LISP and functional programming, p.128-135, August 25-27, 1980, Stanford University, California, United States [doi>10.1145/800087.802798]
	8	Computer 15, 2 (Feb. 1982) entire issue.
	9	DENNIS, J.B. Data flow supercomputers. Computer 13, 11 (Nov. 1980), 48-56.
	10	Martin S. Feather, A System for Assisting Program Transformation, ACM Transactions on Programming Languages and Systems (TOPLAS), v.4 n.1, p.1-20, Jan. 1982 [doi>10.1145/357153.357154]
	11	FREEDMAN, D.P., AND WISE, D.S. Cons should not evaluate its arguments. In Automata, Languages and Programming, S. Michaelson and R. Milner, Eds. Edinburgh University Press, Edinburgh, Scotland, 1976, pp. 257-284.
	12	GOSTELOW, K.P., AND THOMAS, R.E. Preformance of a simulated datafiow computer. IEEE Trans. Comput. C-29, 10 (Oct. 1980), 905-919.
	13	Peter Henderson, Functional Programming, Prentice Hall PTR, Upper Saddle River, NJ, 1980
	14	Peter Henderson , James H. Morris, Jr., A lazy evaluator, Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages, p.95-103, January 19-21, 1976, Atlanta, Georgia [doi>10.1145/800168.811543]
	15	HOROWlTZ, E., AND SAHNI, S. Fundamentals o{ Computer Algorithms. Computer Science Press, Potomac, Md., 1978.
	16	KAHN, G., AND MACQUEEN, D. Coroutined and Networks of parallel processes. Pep. 202, IRIA, Le Chesnay, France, Nov. 1976.
	17	LANDIN, P.J. The mechanical evaluation of expressions. Comput. J. 6, 4 (Nov. 1963), 308-320.
	18	James R. McGraw, The VAL Language: Description and Analysis, ACM Transactions on Programming Languages and Systems (TOPLAS), v.4 n.1, p.44-82, Jan. 1982 [doi>10.1145/357153.357157]
	19	R. L. Page , M. G. Conant , D. H. Grit, If-then-else as a concurrency inhibitor in eager beaver evaluation of recursive programs, Proceedings of the 1981 conference on Functional programming languages and computer architecture, p.179-186, October 18-22, 1981, Portsmouth, New Hampshire, United States [doi>10.1145/800223.806777]
	20	SCHWARZ, J. Using annotations to make recursive equations behave. IEEE Trans. So{tw. Eng. SE-8, 1 (Jan. 1982), 21-33.
	21	Joseph E. Stoy, Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory, MIT Press, Cambridge, MA, 1977
	22	TURNER, D.A. A new implementation technique for applicative languages. So{tw. Pract. Exper. 9 (1979), 31-49.
	23	TURNER, D.A. Another algorithm for bracket abstraction. J. Symbolic Logic 44, 3 (Dec. 1978), 67-70.
	24	WADSWOI~TH, C.P. Semantics and Pragmatics o{ the Lambda-Calculus. Ph.D. dissertation, Programming Research Group, Oxford Univ., 1971.

CITED BY 12

	Rajiv Mirani , Paul Hudak, First-class schedules and virtual maps, Proceedings of the seventh international conference on Functional programming languages and computer architecture, p.78-85, June 26-28, 1995, La Jolla, California, United States
	Henri E. Bal , Jennifer G. Steiner , Andrew S. Tanenbaum, Programming languages for distributed computing systems, ACM Computing Surveys (CSUR), v.21 n.3, p.261-322, Sep. 1989
	Lawrence A. Crowl , Thomas J. LeBlanc, Parallel programming with control abstraction, ACM Transactions on Programming Languages and Systems (TOPLAS), v.16 n.3, p.524-576, May 1994
	Paul Hudak, Exploring Parafunctional Programming: Separating the What from the How, IEEE Software, v.5 n.1, p.54-61, January 1988
	Paul Hudak, Conception, evolution, and application of functional programming languages, ACM Computing Surveys (CSUR), v.21 n.3, p.359-411, Sep. 1989
	Paul Hudak , Lauren Smith, Para-functional programming: a paradigm for programming multiprocessor systems, Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.243-254, January 01, 1986, St. Petersburg Beach, Florida
	James W. Stamos , David K. Gifford, Implementing Remote Evaluation, IEEE Transactions on Software Engineering, v.16 n.7, p.710-722, July 1990
	Rajiv Mirani , Paul Hudak, First-class monadic schedules, ACM Transactions on Programming Languages and Systems (TOPLAS), v.26 n.4, p.609-651, July 2004
	F. Warren Burton , John (Yannis) G. Kollias, Functional Programming with Quadtrees, IEEE Software, v.6 n.1, p.90-97, January 1989
	James W. Stamos , David K. Gifford, Remote evaluation, ACM Transactions on Programming Languages and Systems (TOPLAS), v.12 n.4, p.537-564, Oct. 1990
	M. Lemaître , M. Castan , M.-H. Durand , G. Durrieu , B. Lecussan, Mechanisms for efficient multiprocessor combinator reduction, Proceedings of the 1986 ACM conference on LISP and functional programming, p.113-121, August 1986, Cambridge, Massachusetts, United States
	P. W. Trinder , K. Hammond , H.-W. Loidl , S. L. Peyton Jones, Algorithm + strategy = parallelism, Journal of Functional Programming, v.8 n.1, p.23-60, January 1998