Continuation-Based Program Transformation Strategies

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Continuation-Based Program Transformation Strategies

Full text

Pdf (921 KB)

Source

Journal of the ACM (JACM) archive
Volume 27 , Issue 1 (January 1980) table of contents

Pages: 164 - 180

Year of Publication: 1980

ISSN:0004-5411

Author

Mitchell Wand

Computer Science Department, Indiana University, Bloomington, IN

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 11, Downloads (12 Months): 78, Citation Count: 30

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/322169.322183 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	AUBIN, R Some generahzatton heunsucs in proofs by mductton Proc IRIA Symp on Provmg and Improving Programs, Arc-et-Senans, France, 1975, pp 197-208
	2	R. M. Burstall , John Darlington, A Transformation System for Developing Recursive Programs, Journal of the ACM (JACM), v.24 n.1, p.44-67, Jan. 1977 [doi>10.1145/321992.321996]
	3	Chin-Liang Chang , Richard C. Lee , Richard Char-Tung Lee, Symbolic Logic and Mechanical Theorem Proving, Academic Press, Inc., Orlando, FL, 1997
	4	Ole Johan Dahl, Structured Programming, Academic Press, Inc., Orlando, FL, 1972
	5	Michael J. Fischer, Lambda calculus schemata, Proceedings of ACM conference on Proving assertions about programs, p.104-109, January 06-07, 1972, Las Cruces, New Mexico, United States
	6	HEWITT, C, BISHOP, P, AND STEIGER, R A umversal modular ACTOR formalism for artificial intelligence Proc Third International Jomt Conf on Artificial Intelligence, 1973, pp 235-245
	7	HEWITT, C E, AND SMITH, B Towards a programmmg apprentice IEEE Trans Software Eng SE-1 (1975), 26-45
	8	KNUTH, D E Semantics of context-free languages Math Systems Theory 2 (1968), 127-145, correction, 5 (1971), 95-96
	9	KNUTH, D E An analysts of alpha-beta pruning Tech Rep STAN-CS-74-441, Computer Sct Dept, Stanford U, Stanford, Cahf, 1974
	10	Donald E. Knuth, Structured Programming with go to Statements, ACM Computing Surveys (CSUR), v.6 n.4, p.261-301, Dec. 1974 [doi>10.1145/356635.356640]
	11	LUCKHAM, D C, AND SUZUKI, N Proof of termsnaUon within a weak logic of programs. Acta Informat:ca 8 (1977), 21-36.
	12	Zohar Manna, Introduction to Mathematical Theory of Computation, McGraw-Hill, Inc., New York, NY, 1974
	13	Zohar Manna , Amir Pnueli, Formalization of Properties of Functional Programs, Journal of the ACM (JACM), v.17 n.3, p.555-569, July 1970 [doi>10.1145/321592.321606]
	14	Zohar Manna , Jean Vuillemin, Fixpoint approach to the theory of computation, Communications of the ACM, v.15 n.7, p.528-536, July 1972 [doi>10.1145/361454.361460]
	15	MCCARTHY, J Towards a mathematical soence of computation In information Processing 62, C M Popplewell, Ed, North-Holland, Amsterdam, 1963, pp 21-28
	16	James H. Morris, Jr. , Ben Wegbreit, Subgoal induction, Communications of the ACM, v.20 n.4, p.209-222, April 1977 [doi>10.1145/359461.359466]
	17	Joel Moses, The function of FUNCTION in LISP or why the FUNARG problem should be called the environment problem, ACM SIGSAM Bulletin [doi>10.1145/1093410.1093411]
	18	PARTSCH, H, AND PEPPER, P A family of rules for recurston removal Inform Proc Letters 5 (1976), 174- 177
	19	John C. Reynolds, Definitional interpreters for higher-order programming languages, Proceedings of the ACM annual conference, p.717-740, August 01-01, 1972, Boston, Massachusetts, United States [doi>10.1145/800194.805852]
	20	John C. Reynolds, On the Relation between Direct and Continuation Semantics, Proceedings of the 2nd Colloquium on Automata, Languages and Programming, p.141-156, July 29-August 02, 1974
	21	SCOTT, D, AND STRACHEY, C Toward a mathematical semantics for computer languages In Computers and Automata, J Fox, Ed, Wdey, New York, 1972, pp 19-46
	22	Guy L Steele, LAMBDA: The Ultimate Declarative, Massachusetts Institute of Technology, Cambridge, MA, 1976
	23	Guy L Steele , Gerald J Sussman, Lambda: The Ultimate Imperative, Massachusetts Institute of Technology, Cambridge, MA, 1976
	24	STRACHEY, C, AND WADSWORTH, C P Contmuattons A mathematical semantics for handhng full jumps Tech Monog PRG-I1, Oxford U Computing Laboratory, Oxford U, Oxford, England, 1974
	25	STRONG, H.R Translating recurs~on equations into flow charts J Comptr Syst Scl. 5 (1971), 254-285
	26	Gerald J. Sussman , Guy L. Steele, Jr., An Interpreter for Extended Lambda Calculus, Massachusetts Institute of Technology, Cambridge, MA, 1975
	27	WAND, M., AND FRIEDMAN, D P Complhng lambda expressions using contmuatlons and factorlzattons J Comptr Languages 3 (1978), 241-263.
	28	WEGBREIT, B Goal-dtrected program transformatton. IEEE Trans Software Eng. SE-2 (1976), 69-79.
	29	Niklaus Wirth, Program development by stepwise refinement, Communications of the ACM, v.14 n.4, p.221-227, April 1971 [doi>10.1145/362575.362577]

CITED BY 30

	Alberto Pettorossi , Maurizio Proietti, Program specialization via algorithmic unfold/fold transformations, ACM Computing Surveys (CSUR), v.30 n.3es, Sept. 1998
	Steven D. Johnson, Applicative programming and digital design, Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.218-227, January 15-18, 1984, Salt Lake City, Utah, United States
	Guy Lewis Steele, Jr. , Gerald Jay Sussman, The dream of a lifetime: A lazy variable extent mechanism, Proceedings of the 1980 ACM conference on LISP and functional programming, p.163-172, August 25-27, 1980, Stanford University, California, United States
	Jeremy Gibbons , Geraint Jones, The under-appreciated unfold, ACM SIGPLAN Notices, v.34 n.1, p.273-279, Jan. 1999
	Jonathan Sobel , Daniel P. Friedman, Recycling continuations, ACM SIGPLAN Notices, v.34 n.1, p.251-260, Jan. 1999
	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
	William D. Clinger, Proper tail recursion and space efficiency, ACM SIGPLAN Notices, v.33 n.5, p.174-185, May 1998
	Dennis M. Volpano , Richard B. Kieburtz, Software templates, Proceedings of the 8th international conference on Software engineering, p.55-60, August 28-30, 1985, London, England
	Robert D. Cameron , M. Robert Ito, Grammar-Based Definition of Metaprogramming Systems, ACM Transactions on Programming Languages and Systems (TOPLAS), v.6 n.1, p.20-54, Jan. 1984
	Guy Lewis Steele, Jr. , Gerald Jay Sussman, Design of a LISP-based microprocessor, Communications of the ACM, v.23 n.11, p.628-645, Nov. 1980
	Mitchell Wand, Deriving Target Code as a Representation of Continuation Semantics, ACM Transactions on Programming Languages and Systems (TOPLAS), v.4 n.3, p.496-517, July 1982
	Donald A. Smith, Partial evaluation of pattern matching in constraint logic programming languages, ACM SIGPLAN Notices, v.26 n.9, p.62-71, Sept. 1991
	Tim Sheard , Leonidas Fegaras, A fold for all seasons, Proceedings of the conference on Functional programming languages and computer architecture, p.233-242, June 09-11, 1993, Copenhagen, Denmark
	Alberto Pettorossi , Maurizio Proietti, Rules and strategies for transforming functional and logic programs, ACM Computing Surveys (CSUR), v.28 n.2, p.360-414, June 1996
	Yanhong A. Liu , Scott D. Stoller, From recursion to iteration: what are the optimizations?, ACM SIGPLAN Notices, v.34 n.11, p.73-82, Nov. 1999
	Dariusz Biernacki , Olivier Danvy , Chung-chieh Shan, On the dynamic extent of delimited continuations, Information Processing Letters, v.96 n.1, p.7-17, 16 October 2005
	R. N. Banerjee , A. Bujosa, A geometric interpretation of LD-resolution, Theoretical Computer Science, v.318 n.3, p.435-470, 8 June 2004
	Olivier Danvy , Lasse R. Nielsen, Defunctionalization at work, Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming, p.162-174, September 05-07, 2001, Florence, Italy
	Dariusz Biernacki , Olivier Danvy , Chung-chieh Shan, On the static and dynamic extents of delimited continuations, Science of Computer Programming, v.60 n.3, p.274-297, May 2006
	Chung-Chieh Shan, A static simulation of dynamic delimited control, Higher-Order and Symbolic Computation, v.20 n.4, p.371-401, December 2007
	Traian Florin Şerbănuţă , Grigore Roşu , José Meseguer, A Rewriting Logic Approach to Operational Semantics (Extended Abstract), Electronic Notes in Theoretical Computer Science (ENTCS), v.192 n.1, p.125-141, October, 2007
	Deling Ren , Martin Erwig, A generic recursion toolbox for Haskell or: scrap your boilerplate systematically, Proceedings of the 2006 ACM SIGPLAN workshop on Haskell, September 17-17, 2006, Portland, Oregon, USA
	Ozan S. Yigit, Readings in scheme, ACM SIGPLAN Lisp Pointers, v.2 n.1, p.56-61, July-August-September 1988
	Kwangkeun Yi, EDUCATIONAL PEARL: ‘Proof-directed debugging’ revisited for a first-order version, Journal of Functional Programming, v.16 n.6, p.663-670, November 2006
	Alberto Pettorossi , Maurizio Proietti, Transformations of logic programs with goals as arguments, Theory and Practice of Logic Programming, v.4 n.4, p.495-537, July 2004
	Olivier Danvy , Mayer Goldberg, There and Back Again, Fundamenta Informaticae, v.66 n.4, p.397-413, December 2005
	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, Continuation conscious compilation, ACM SIGPLAN Lisp Pointers, v.VI n.1, p.2-14, Jan.-March 1993
	Olivier Danvy, Defunctionalized interpreters for programming languages, ACM SIGPLAN Notices, v.43 n.9, p.131-142, September 2008