Higher-order expression procedures

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Higher-order expression procedures

Full text

Pdf (1.18 MB)

Source

ACM/SIGPLAN Workshop Partial Evaluation and Semantics-Based Program Manipulation archive
Proceedings of the 1995 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation table of contents

La Jolla, California, United States

Pages: 178 - 189

Year of Publication: 1995

ISBN:0-89791-720-0

Author

David Sands

DIKU, University of Copenhagen

Sponsor

SIGPLAN: ACM Special Interest Group on Programming Languages

Publisher

ACM New York, NY, USA

Bibliometrics

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

Additional Information:

references cited by index terms collaborative colleagues peer to peer

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

	Abr90	Samson Abramsky, The lazy lambda calculus, Research topics in functional programming, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1990
	Ale92	Francis Alexandre, A technique for Transforming Logic Programs by Fold-Unfold Transformations, Proceedings of the 4th International Symposium on Programming Language Implementation and Logic Programming, p.202-216, August 26-28, 1992
	Amt92	Torben Amtoft, Unfold/fold Transformations Preserving Termination Properties, Proceedings of the 4th International Symposium on Programming Language Implementation and Logic Programming, p.187-201, August 26-28, 1992
	Amt93	T. Amtoft. Sharing of computations. PhD thesis, DAIMI, Aahus University, 1993.
	BCE92	Annalisa Bossi , Nicoletta Cocco , Sandro Etalle, Transforming Normal Programs by Replacement, Proceedings of the 3rd International Workshop on Meta-Programming in Logic, p.265-279, June 10-12, 1992
	BD77	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]
	Deb88	S. K. Debray, Unfold/fold transformations and loop optimization of logic programs, Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation, p.297-307, June 20-24, 1988, Atlanta, Georgia, United States
	FFK87	M. Felleisen , D. P. Friedman , E. Kohlbecker , B. Duba, A syntactic theory of sequential control, Theoretical Computer Science, v.52 n.3, p.205-237, June 1987 [doi>10.1016/0304-3975(87)90109-5]
	FN88	Y. Futamura and K. Nogi. Generalised partial computation, in D. BjCrner, Ershov, and N. D. Jones, editors, Partial Evaluation and Mixed Computation. Proceedings of the IFIP TC2 Workshop, Caramel Averna~s, Denmark, October 198Z North-Holland, 1988.
	GK93	Robert Glück , Andrei V. Klimov, Occam's Razor in Metacompuation: the Notion of a Perfect Process Tree, Proceedings of the Third International Workshop on Static Analysis, p.112-123, September 22-24, 1993
	How89	D. Howe, Equality in lazy computation systems, Proceedings of the Fourth Annual Symposium on Logic in computer science, p.198-203, June 1989, Pacific Grove, California, United States
	Kot78	L. Kott. About transformation system: A theoretical study. In B. Robinet, editor, Program Transformations, pages 232-247. Dunod, 1978.
	Mas86	Ian A. Mason, The semantics of destructive LISP, Center for the Study of Language and Information, Stanford, CA, 1987
	Mil77	R. Milner. Fully abstract models of the typed )~-calculus. Theoretical Computer Science, 4, 1977.
	MW79	Z. Manna and R. Waldinger. Synthesis: Dreams -+ programs. Transactions on Programming Languages and Systems, 5(4), 1979.
	Plo75	G.D. Plotkin. Call-by-name, Call-by-value and the X-calculus. Theoretical Computer Science, 1(1):125-159, 1975.
	RFJ89	Colin Runciman , Mike Firth , Nigel Jagger, Transformation in a Non-Strict Language: An Approach to Instantiation, Proceedings of the 1989 Glasgow Workshop on Functional Programming, p.133-141, August 21-23, 1989
	San91	David Sands, Operational Theories of Improvement in Functional Languages (Extended Abstract), Proceedings of the 1991 Glasgow Workshop on Functional Programming, p.298-311, August 12-14, 1991
	San94	D. Sands. Total ~)rrectness and improvement in the transformation of functional programs. DIKU, Univelrsity of Copenhagen, Unpublished (53 pages), May 1994.
	San95a	David Sands, Proving the Correctness of Recursion-Based Automatic Program Transformations, Proceedings of the 6th International Joint Conference CAAP/FASE on Theory and Practice of Software Development, p.681-695, May 22-26, 1995
	San95b	David Sands, Total correctness by local improvement in program transformation, Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.221-232, January 23-25, 1995, San Francisco, California, United States [doi>10.1145/199448.199485]
	Sch80	William Louis Scherlis, Expression procedures and program derivation, 1980
	Sch81	William L. Scherlis, Program improvement by internal specialization, Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.41-49, January 26-28, 1981, Williamsburg, Virginia [doi>10.1145/567532.567536]
	SGJ94	Morten Heine Sørensen , Robert Glück , Neil D. Jones, Towards Unifying Partial Evaluation, Deforestation, Supercompilation, and GPC, Proceedings of the 5th European Symposium on Programming: Programming Languages and Systems, p.485-500, April 11-13, 1994
	Sør94	M H Sorensen. Turchin's supercompiler revisited: An operational theory of positive information propagation. Master's thesis, Department of Computer Science, University of Copenhagen, 1994.
	TS84	H. Tamaki and T. Sato. Unfold/fold transformation of logic programs. In S. Tarnlund, editor, ~nd International Logic Programming Conference, pages 1'~7-138, 1984.
	Tur86	Valentin F. Turchin, The concept of a supercompiler, ACM Transactions on Programming Languages and Systems (TOPLAS), v.8 n.3, p.292-325, July 1986 [doi>10.1145/5956.5957]
	Wad90	Philip Wadler, Deforestation: transforming programs to eliminate trees, Theoretical Computer Science, v.73 n.2, p.231-248, June 22, 1990
	Weg76	B. Wegbreit. Goal-directed program transformation. IEEE Tran,~actions on Sofware Engineering, 2:69-80, June 1976.

CITED BY 3

	David Sands, From SOS rules to proof principles: an operational metatheory for functional languages, Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.428-441, January 15-17, 1997, Paris, France
	David Sands, Total correctness by local improvement in the transformation of functional programs, ACM Transactions on Programming Languages and Systems (TOPLAS), v.18 n.2, p.175-234, March 1996
	María Alpuente , Moreno Falaschi , Germán Vidal, Partial evaluation of functional logic programs, ACM Transactions on Programming Languages and Systems (TOPLAS), v.20 n.4, p.768-844, July 1998