Engines build process abstractions

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Engines build process abstractions

Full text

Pdf (498 KB)

Source

Conference on LISP and Functional Programming archive
Proceedings of the 1984 ACM Symposium on LISP and functional programming table of contents

Austin, Texas, United States

Pages: 18 - 24

Year of Publication: 1984

ISBN:0-89791-142-3

Authors

Christopher T. Haynes
Daniel P. Friedman

Sponsors

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

Publisher

ACM New York, NY, USA

Bibliometrics

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

Additional Information:

abstract 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/800055.802018 What is a DOI?

ABSTRACT

Engines are a new programming language abstraction for timed preemption. In conjunction with first class continuations, engines allow the language to be extended with a time-sharing implementation of process abstraction facilities. To illustrate engine programming techniques, we implement a round-robin process scheduler. The importance of simple but powerful primitives such as engines is discussed.

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	Robert E. Filman , Daniel P. Friedman, Coordinated computing: tools and techniques for distributed software, McGraw-Hill, Inc., New York, NY, 1984
	2	Friedman, D.P., Haynes, C.T., Kohlbecker, E., and Wand, M. "The Scheme 84 Reference Manual" Indiana University Computer Science Department Technical Report No. 153 (March, 1984).
	3	James H. Morris, Jr., Protection in programming languages, Communications of the ACM, v.16 n.1, p.15-21, Jan. 1973 [doi>10.1145/361932.361937]
	4	Steele, G., Woods, D., Finkel, R., Crispin, M., Stallman, R., and Goodfellow, G., The Hacker's Dictionary, Harper & Row, 1983.
	5	Mitchell Wand, Continuation-based multiprocessing, Proceedings of the 1980 ACM conference on LISP and functional programming, p.19-28, August 25-27, 1980, Stanford University, California, United States [doi>10.1145/800087.802786]

CITED BY 21

	Robert Ennals , Simon Peyton Jones, Optimistic evaluation: an adaptive evaluation strategy for non-strict programs, ACM SIGPLAN Notices, v.38 n.9, p.287-298, September 2003
	Satish Chandra , Brad Richards , James R. Larus, Teapot: language support for writing memory coherence protocols, ACM SIGPLAN Notices, v.31 n.5, p.237-248, May 1996
	Will Clinger , Anne Hartheimer , Eric Ost, Implementation strategies for continuations, Proceedings of the 1988 ACM conference on LISP and functional programming, p.124-131, July 25-27, 1988, Snowbird, Utah, United States
	Richard P. Draves , Brian N. Bershad , Richard F. Rashid , Randall W. Dean, Using continuations to implement thread management and communication in operating systems, ACM SIGOPS Operating Systems Review, v.25 n.5, p.122-136, Oct. 1991
	Andrew Tolmach , Sergio Antoy , Marius Nita, Implementing functional logic languages using multiple threads and stores, ACM SIGPLAN Notices, v.39 n.9, September 2004
	Martin Gasbichler , Michael Sperber, Integrating User-Level Threads with Processes in Scsh, Higher-Order and Symbolic Computation, v.18 n.3-4, p.327-354, December 2005
	Henry G. Baker, “Use-once” variables and linear objects: storage management, reflection and multi-threading, ACM SIGPLAN Notices, v.30 n.1, p.45-52, Jan. 1995
	Luc Moreau , Christian Queinnec, Design and semantics of quantum: a language to control resource consumption in distributed computing, Proceedings of the Conference on Domain-Specific Languages on Conference on Domain-Specific Languages (DSL), 1997, p.15-15, October 15-17, 1997, Santa Barbara, California
	Ozan S. Yigit, Readings in scheme, ACM SIGPLAN Lisp Pointers, v.2 n.1, p.56-61, July-August-September 1988
	Matthew Fluet , Mike Rainey , John Reppy , Adam Shaw , Yingqi Xiao, Manticore: a heterogeneous parallel language, Proceedings of the 2007 workshop on Declarative aspects of multicore programming, p.37-44, January 16-16, 2007, Nice, France
	Daniel P. Friedman , Christopher T. Haynes, Constraining control, Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.245-254, January 14-16, 1985, New Orleans, Louisiana, United States
	Sanjeev Kumar , Carl Bruggeman , R. Kent Dybvig, Threads Yield Continuations, Lisp and Symbolic Computation, v.10 n.3, p.223-236, May 1998
	H. Abelson , R. K. Dybvig , C. T. Haynes , G. J. Rozas , N. I. Adams, IV , D. P. Friedman , E. Kohlbecker , G. L. Steele, Jr. , D. H. Bartley , R. Halstead , D. Oxley , G. J. Sussman , G. Brooks , C. Hanson , K. M. Pitman , M. Wand , William Clinger , Jonathan Rees, Revised report on the algorithmic language scheme, ACM SIGPLAN Lisp Pointers, v.IV n.3, p.1-55, July, 1991
	J Rees , W Clinger, Revised report on the algorithmic language scheme, ACM SIGPLAN Notices, v.21 n.12, p.37-79, Dec. 1986
	Christian Queinnec, A library of high level control operators, ACM SIGPLAN Lisp Pointers, v.VI n.4, p.11-26, Oct.-Dec. 1993
	O. Danvy, Memory allocation and higher-order functions, ACM SIGPLAN Notices, v.22 n.7, p.241-252, July 1987
	William D. Clinger , Anne H. Hartheimer , Eric M. Ost, Implementation Strategies for First-Class Continuations, Higher-Order and Symbolic Computation, v.12 n.1, p.7-45, April 1999
	Matthew Fluet , Nic Ford , Mike Rainey , John Reppy , Adam Shaw , Yingqi Xiao, Status report: the manticore project, Proceedings of the 2007 workshop on Workshop on ML, October 05-05, 2007, Freiburg, Germany
	Zena m. Ariola , Hugo Herbelin, Control reduction theories: The benefit of structural substitution, Journal of Functional Programming, v.18 n.3, p.373-419, May 2008
	Matthew Fluet , Mike Rainey , John Reppy, A scheduling framework for general-purpose parallel languages, ACM SIGPLAN Notices, v.43 n.9, September 2008
	Philipp Haller , Martin Odersky, Scala Actors: Unifying thread-based and event-based programming, Theoretical Computer Science, v.410 n.2-3, p.202-220, February, 2009