Generalized partial computation for a lazy functional language

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Generalized partial computation for a lazy functional language

Full text

Pdf (828 KB)

Source

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

New Haven, Connecticut, United States

Pages: 1 - 11

Year of Publication: 1991

ISBN:0-89791-433-3

Also published in ...

Author

Akihiko Takano

Advanced Research Laboratory, Hitachi, Ltd., Hatoyama, Saitama 350-03, Japan

Sponsor

SIGPLAN: ACM Special Interest Group on Programming Languages

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 4, Downloads (12 Months): 18, Citation Count: 8

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/115865.115867 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	Lennart Augustsson, Compiling pattern matching, Proc. of a conference on Functional programming languages and computer architecture, p.368-381, January 1985, Nancy, France
	2	A. Bondorf. Towards a Self-applicable Partial Evaluator for Term Rewriting Systems. In D. Bjcrner, A. P. Ershov and N. D. Jones, eds., Partial Evaluation and Mixed Computation, 27-50, North-Holland, 1988.
	3	A. Bondorf, Automatic autoprojection of higher order recursive equations, Proceedings of the third European symposium on programming on ESOP '90, p.70-87, May 1990, Copenhagen, Denmark
	4	A. Bossi , N. Cocco , S. Dulli, A method for specializing logic programs, ACM Transactions on Programming Languages and Systems (TOPLAS), v.12 n.2, p.253-302, April 1990 [doi>10.1145/78942.78947]
	5	Geoffrey Burn, A relationship between abstract interpretation and projection analysis, Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.151-156, December 1989, San Francisco, California, United States [doi>10.1145/96709.96724]
	6	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]
	7	Charles Consel, New Insights into Partial Evaluation: the SCHISM Experiment, Proceedings of the 2nd European Symposium on Programming, p.236-246, March 21-24, 1988
	8	Kei Davis , Philip Wadler, Backwards Strictness Analysis: Proved and Improved, Proceedings of the 1989 Glasgow Workshop on Functional Programming, p.12-30, August 21-23, 1989
	9	H. Fujita. An algorithm for partial evaluation with constraints. ICOT Tech. Memo. TM-0367, ICOT, Tokyo, Aug. 1987.
	10	Y. Futamura. Partial Evaluation of Computation Process- An Approach to a Compiler-Compiler. Systems, Computers, Controls, 2 (5):45-50, 1971.
	11	Y. Futamura and K. Nogi. Generalized Partial Computation. In D. Bj~rner, A. P. Ershov and N. D. Jones, eds., Partial Evaluation and Mixed Computation, 133-151, North-Holland, 1988.
	12	Y. Futamura and K. Nogi. Program Evaluation and Generalized Partial Computation. in Proceedings of the International Conf. on Fifth Generation Computer Systems, 685-692, Tokyo, 1988.
	13	Y. Futamura, K. Nogi, A. Takano. Essence of Generalized Partial Computation. In D. Bjcrner and V. Kotov, eds., Images of Programming, North- Holland, 1991(to appear).
	14	R.M.J. Hughes. Backwards Analysis of Functional Programs. In D. Bjcrner, A. P. Ershov and N. D. Jones, eds., Partial Evaluation and Mixed Computation, 187-208, North-Holland, 1988.
	15	Neil D. Jones , Peter Sestoft , Harald Sondergaard, An experiment in partial evaluation: the generation of a compiler generator, Proc. of the first international conference on Rewriting techniques and applications, p.124-140, December 1985, Dijon, France
	16	N.D. Jones, P. Sestoft and It. S~ndergaard. MIX: An Self-applicable Partial Evaluator for Experiments in Compiler Generation. LISP and Symbolic Computalion, 2 (1) : 9-50, 1989.
	17	J. Launehbury. Projections for Speeialisation. In D. Bj~rner, A. P. Ershov and N. D. Jones, eds., Partial Evaluation and Mixed Computation, 299-315, North-Holland, 1988.
	18	John Launchbury, Dependent Sums Express Separation of Binding Times, Proceedings of the 1989 Glasgow Workshop on Functional Programming, p.238-253, August 21-23, 1989
	19	S. A. Romanenko, Arity raiser and use in program specialization, Proceedings of the third European symposium on programming on ESOP '90, p.341-360, May 1990, Copenhagen, Denmark
	20	P. Sestoft. Automatic Call Unfolding in a Partial Evaluator. In D. Bj~rner, A. P. Ershov and N. D. Jones, eds., Partial Evaluation and Mixed Computation, 485-506, North-Holland, 1988.
	21	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]
	22	Philip Wadler , R. J. M. Hughes, Projections for strictness analysis, Proc. of a conference on Functional programming languages and computer architecture, p.385-407, October 1987, Portland, Oregon, United States
	23	P. Wadler. Efficient Compilation of Patternmatching, in S.L. Peyton Jones, ed., The Implementation of Functional Programming Languages, Prentice Hall, 1987.
	24	Philip Wadler, Deforestation: transforming programs to eliminate trees, Theoretical Computer Science, v.73 n.2, p.231-248, June 22, 1990

CITED BY 8

	Alberto Pettorossi , Maurizio Proietti, Program specialization via algorithmic unfold/fold transformations, ACM Computing Surveys (CSUR), v.30 n.3es, Sept. 1998
	Charles Consel , Siau Cheng Khoo, Parameterized partial evaluation, ACM Transactions on Programming Languages and Systems (TOPLAS), v.15 n.3, p.463-493, July 1993
	L. Lafave , J. P. Gallagher, Extending the power of automatic constraint-based partial evaluators, ACM Computing Surveys (CSUR), v.30 n.3es, Sept. 1998
	Jin Ying , Jin Chengzhi, Constraint-based partial evaluation for imperative languages, Journal of Computer Science and Technology, v.17 n.1, p.64-72, January 2002
	Wei-Ngan Chin , Masami Hagiya, A bounds inference method for vector-based memoization, ACM SIGPLAN Notices, v.32 n.8, p.176-187, Aug. 1997
	Akihiko Takano , Erik Meijer, Shortcut deforestation in calculational form, Proceedings of the seventh international conference on Functional programming languages and computer architecture, p.306-313, June 26-28, 1995, La Jolla, California, United States
	Siau-Cheng Khoo , Kun Shi, Program Adaptation via Output-Constraint Specialization, Higher-Order and Symbolic Computation, v.17 n.1-2, p.93-128, March-June 2004
	Peter A. Jonsson , Johan Nordlander, Positive supercompilation for a higher order call-by-value language, Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages, January 21-23, 2009, Savannah, GA, USA