trh@arizona.UUCP (05/21/87)
The response to my request for information on two Scheme references has been so overwhelming that I have decided to summarize the infor- mation I have received. Thanks to everyone who replied, with special thanks to the people at Indiana, who were most encouraging. About THE BOOKS: Will Clinger <willc%tekchips.tek.com@RELAY.CS.NET> of Tektronix, (Beaverton, OR) provides: > Friedman, Haynes, Kohlbecker, & Wand > Fundamental Abstractions of Programming Languages > This book, in draft form, is used in the undergraduate programming > languages course, C 311, at Indiana University. > I expect the book will be published later this year or early next year. > Until then, you might be able to get a copy from the Indiana University > bookstore. One of the authors, Dan Friedman, is more cautious stating only that: > ...is class notes that will be a book published > with MIT-Press & McGraw-Hill sometime in the future. Ken Dickey <kend%tekla.tek.com@RELAY.CS.NET>, also of Tektronix, and Dan Friedman gave the same reference: > "Programming with Continuations", > Program Transformations and Programming Environments > ed: P. Pepper, Springer Verlag, 1984, Pg 263-274. Several people supplied ADDRESSES FOR THE AUTHORS. For Dr. Friedman: > dfried@iuvax.cs.indiana.edu > <cmcl2!seismo!iuvax!iucs!dfried> For Chris Haynes > <cth@indiana.csnet> Both may (apparently) be reached by Smail at: Computer Science Department Lindley Hall Indiana University Bloomington, IN 47405 Finally, Daniel Schneider <cmcl2!seismo!mcvax!cui!shneider> at the University of Geneva, Switzerland passed on some ADDITIONAL (new?) REFERENCES which he had received from Dr Haynes: C. T. Haynes and D. P. Friedman, ``Abstracting timed preemption with engines," to appear in {\it Computer Languages.} An earlier version of this paper appeared in the 1984 Lisp Conf. Proc. C. T. Haynes, D. P. Friedman and M. Wand, ``Obtaining coroutines with continuations," {\it Computer Languages,\/} Vol. II, No.~3/4 (1986), 143--153. D. P. Friedman and C. T. Haynes, ``Embedding continuations in procedural objects," to appear in {\it ACM Trans. Progr. Lang. Sys.\/} An earlier version appeared in the 1985 POPL. C. T. Haynes, ``Logic continuations," {\it Proceedings of the Third Int'l. Conf. on Logic Programming\/} (July, 1985), London, England, {\it Lecture Notes in Computer Science,\/} Vol.~225, Springer-Verlag, Berlin (1985), 671--685. Revised version to appear in {\it The Journal of Logic Programming.\/} This paper gives an embedding of Prolog into Scheme. R. K. Kybvig, D. P. Friedman, and C. T. Haynes, ``Expansion-passing style: beyond conventional macros," {\it Proceedings 1986 ACM Symposium on LISP and Functional Programming\/} (Aug., 1986), 143--150. Proposes a better macro facility for Scheme and other Lisp like languages. D. P. Friedman, C. T. Haynes and E. E. Kohlbecker, ``Programming with continuations," {\it Program Transformation and Programming Environments,\/} (P. Pepper, Ed.), Springer-Verlag, Berlin (1984), 263--274. Once again, thanks to everyone who responded! -Tom (trh@arizona)