Mechanisms for efficient multiprocessor combinator reduction

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Mechanisms for efficient multiprocessor combinator reduction

Full text

Pdf (854 KB)

Source

Conference on LISP and Functional Programming archive
Proceedings of the 1986 ACM conference on LISP and functional programming table of contents

Cambridge, Massachusetts, United States

Pages: 113 - 121

Year of Publication: 1986

ISBN:0-89791-200-4

Authors

M. Lemaître	Département d'Etudes et de Recherches en Informatique, ONERA-CERT, 2, Avenue Edouard Belin, BP 4025, 31055 Toulouse cedex, France
M. Castan	Département d'Etudes et de Recherches en Informatique, ONERA-CERT, 2, Avenue Edouard Belin, BP 4025, 31055 Toulouse cedex, France
M.-H. Durand	Département d'Etudes et de Recherches en Informatique, ONERA-CERT, 2, Avenue Edouard Belin, BP 4025, 31055 Toulouse cedex, France
G. Durrieu	Département d'Etudes et de Recherches en Informatique, ONERA-CERT, 2, Avenue Edouard Belin, BP 4025, 31055 Toulouse cedex, France
B. Lecussan	Département d'Etudes et de Recherches en Informatique, ONERA-CERT, 2, Avenue Edouard Belin, BP 4025, 31055 Toulouse cedex, France

Sponsor

SIGPLAN: ACM Special Interest Group on Programming Languages

Publisher

ACM New York, NY, USA

Bibliometrics

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

Additional Information:

references cited by 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/319838.319855 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	[1] S. K. Abdali, "An abstraction algorithm for combinatory logic", The Journal of Symbolic Logic 41 (1), March 1976, pp 222-224.
	2	Manfred Broy , Friedrich L. Bauer, A systematic approach to language constructs for concurrent programs, Science of Computer Programming, v.4 n.2, p.103-139, August 1984 [doi>10.1016/0167-6423(84)90016-9]
	3	D. R. Brownbridge, Cyclic reference counting for combinator machines, Proc. of a conference on Functional programming languages and computer architecture, p.273-288, January 1985, Nancy, France
	4	F. Warren Burton, Annotations to Control Parallelism and Reduction Order in the Distributed Evaluation of Functional Programs, ACM Transactions on Programming Languages and Systems (TOPLAS), v.6 n.2, p.159-174, April 1984 [doi>10.1145/2993.357241]
	5	M. Castan , M.-H. Durand , M. Lemaître, A set of combinators for abstraction in linear space, Information Processing Letters, v.24 n.3, p.183-188, February 1987 [doi>10.1016/0020-0190(87)90183-9]
	6	[6] M. Castan, M.-H. Durand, G. Durrieu, B. Lecussan, M. Lemaître, "MaRS : a Multiprocessor Machine for Parallel Graph Reduction", Proc. of the 9th Annual Hawaii Int. Conf. on System Sciences, January 1986, Vol 1, pp 152-159.
	7	Chris Clack , Simon L. Peyton Jones, Strictness analysis—a practical approach, Proc. of a conference on Functional programming languages and computer architecture, p.35-49, January 1985, Nancy, France
	8	[8] H. B. Curry, R. Feys, W. Craig, Combinatory Logic, Vol 1, North Holland, 1958, Snd printing 1968.
	9	Cordelia V. Hall , John T. O'Donnell, Debugging in a side effect free programming environment, Proceedings of the ACM SIGPLAN 85 symposium on Language issues in programming environments, p.60-68, June 25-28, 1985, Seattle, Washington, United States
	10	Robert H. Halstead, Jr., MULTILISP: a language for concurrent symbolic computation, ACM Transactions on Programming Languages and Systems (TOPLAS), v.7 n.4, p.501-538, Oct. 1985 [doi>10.1145/4472.4478]
	11	C. L. Hankin , P. E. Osmon , M. J. Shute, COBWEB—a combinator reduction architecture, Proc. of a conference on Functional programming languages and computer architecture, p.99-112, January 1985, Nancy, France
	12	[12] P. Henderson, "Purely Functional Operating Systems", in Functional Programming and its Applications, J. Darlington, P. Henderson, and D. Turner (eds.), Cambridge University Press, 1982.
	13	Paul Hudak , Benjamin Goldberg, Experiments in diffused combinator reduction, Proceedings of the 1984 ACM Symposium on LISP and functional programming, p.167-176, August 06-08, 1984, Austin, Texas, United States [doi>10.1145/800055.802033]
	14	Paul Hudak , David Kranz, A combinator-based compiler for a functional language, Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.122-132, January 15-18, 1984, Salt Lake City, Utah, United States [doi>10.1145/800017.800523]
	15	Paul Hudak , Benjamin Goldberg, Distributed execution of functional programs using serial combinators, IEEE Transactions on Computers, v.34 n.10, p.881-891, Oct. 1985
	16	M. S. Joy , V. J. Rayward-Smith , F. W. Burton, Efficient combinator code, Computer Languages, v.10 n.3-4, p.211-224, 1985 [doi>10.1016/0096-0551(85)90017-7]
	17	[17] R. M. Keller, F. C. H. Lin, J. Tanaka, "Simulated Performance of a Reduction-Based Multiprocessor", Computer, July 1984, pp 70-82.
	18	[18] A. Mycroft, "Abstract interpretation and optimizing transformations for applicative programs", Thesis, University of Edinburgh, December 1981.
	19	John T. O'Donnell, Dialogues: A basis for constructing programming environments, Proceedings of the ACM SIGPLAN 85 symposium on Language issues in programming environments, p.19-27, June 25-28, 1985, Seattle, Washington, United States
	20	W. R. Stoye , T. J. W. Clarke , A. C. Norman, Some practical methods for rapid combinator reduction, Proceedings of the 1984 ACM Symposium on LISP and functional programming, p.159-166, August 06-08, 1984, Austin, Texas, United States [doi>10.1145/800055.802032]
	21	[21] D. A. Turner, "A New Implementation Technique for Applicative Languages", Software-Practice and Experience 9, 1979, pp 31-49.
	22	[22] D. A. Turner, "Another algorithm for bracket abstraction", The Journal of Symbolic Logic 44 (2), June 1979, pp 267-270.
	23	[23] D. A. Turner, "Combinator Reduction Machines", Proc. of the Int. Workshop on High-Level Computer Architecture, University of Maryland, May 1984, pp 5.26-5.38.

CITED BY 6

	Pascal Fradet , Daniel Le Métayer, Compilation of functional languages by program transformation, ACM Transactions on Programming Languages and Systems (TOPLAS), v.13 n.1, p.21-51, Jan. 1991
	Paul Hudak , Eric Hohr, Graphinators and the duality of SIMD and MIMD, Proceedings of the 1988 ACM conference on LISP and functional programming, p.224-234, July 25-27, 1988, Snowbird, Utah, United States
	J. F. Giorgi , D. Le Métayer, Continuation-based parallel implementation of functional programming languages, Proceedings of the 1990 ACM conference on LISP and functional programming, p.209-217, June 27-29, 1990, Nice, France
	Brent Hailpern , Tien Huynh , Gyorgy Revesz, Comparing Two Functional Programming Systems, IEEE Transactions on Software Engineering, v.15 n.5, p.532-542, May 1989
	M. Castan , A. Contessa , E. Cousin , C. Coustet , B. Lecussan, MaRs: a parallel graph reduction multiprocessor, ACM SIGARCH Computer Architecture News, v.16 n.3, p.17-24, June 1988
	Henry G. Baker, Minimizing reference count updating with deferred and anchored pointers for functional data structures, ACM SIGPLAN Notices, v.29 n.9, p.38-43, Sept. 1994

Collaborative Colleagues:

M. Lemaître: colleagues

M. Castan: colleagues

M.-H. Durand: colleagues

G. Durrieu: colleagues

B. Lecussan: colleagues

Adobe Acrobat

QuickTime

Windows Media Player

Real Player