Towards multiple self-application

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Towards multiple self-application

Full text

Pdf (1.29 MB)

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: 309 - 320

Year of Publication: 1991

ISBN:0-89791-433-3

Also published in ...

Author

Robert Glück

Technische Universität Wien, Institut für Computersprachen, A-1040 Vienna, Austria

Sponsor

SIGPLAN: ACM Special Interest Group on Programming Languages

Publisher

ACM New York, NY, USA

Bibliometrics

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

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.115900 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	Bjcmer D., Ershov A. P., Jones N. D. (ed.), Partial Evaluation and Mixed Computation. North-Holland: Amsterdam 1988.
	2	Bondorf A., Danvy O., Automatic autoprojection of recursive equations with global variables and abstract data types. Institute of Datalogy, University of Copenhagen. DIKU Report No. 90/4, 1990.
	3	Bondorf A., Jones N. D., Mogensen T. AL et al., Binding time analysis and the taming of self-application. Institute of Datalogy, University of Copenhagen. Report 1988.
	4	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
	5	Charles Consel , Olivier Danvy, Partial evaluation of pattern matching in strings, Information Processing Letters, v.30 n.2, p.79-86, January 1989 [doi>10.1016/0020-0190(89)90113-0]
	6	Danvy O., Across the bridge between reflection and partial evaluation. In: Bj0rner D., Ershov A. P., Jones N. D. (ed.), Partial Evaluation and Mixed Computation. (Gammel Avermes, Denmark). 83-116, North-Holland 1988.
	7	Ershov A. P., On the essence of compilation. In: Neuhold E. J. (ed.), Formal Description of Programming Concepts. 391- 420, North-Holland Publishing Co. 1978.
	8	Futamura Y., Partial evaluation of computation process - an approach to a compiler-compiler. In: Systems, Computers, Controls, 2(5): 45-50, 1971.
	9	Futamura Y., Nogi K., Generalized partial evaluation. In: BjCmer D., Ershov A. P., Jones N. D. (ed.), Partial Evaluation and Mixed Computation. (Gammel Averna~s, Denmark). 133- 151, Elsevier Science Publishers B. V. 1988.
	10	Gliick R., Turchin V. F., Experiments with a self-applicable supercompiler. City University New York. Technical Report 1989,
	11	R. Glueck , V. F. Turchin, Application of metasystem transition to function inversion and transformation, Proceedings of the international symposium on Symbolic and algebraic computation, p.286-287, August 20-24, 1990, Tokyo, Japan [doi>10.1145/96877.96953]
	12	Holst N. C. K., Language triplets: the Amix approach. In: Bj0mer D., Ershov A. P., Jones N. D. (ed.), Partial Evaluation and Mixed Computation. (Gammel Averna~s, Denmark). 167- 185, North-Holland 1988.
	13	Neil D. Jones, Partial evaluation, self-application and types, Proceedings of the seventeenth international colloquium on Automata, languages and programming, p.639-659, July 1990, Warwick University, England
	14	Jones N. D., Gomard C. K., Bondorf A. et al., A selfapplicable partial evaluator for the lambda calculus. In: IEEE Computer Society 1990 - International Conference on Computer Languages. (New Orleans, Louisiana). 1-10, IEEE Computer Society 1990.
	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	Jones N. D., Sestoft P., SCndergaard H., Mix: a selfapplicable partial evaluator for experiments in compiler generation. In: Lisp and Symbolic Computation, 2(1): 9-50, 1989.
	17	John McCarthy, LISP 1.5 Programmer's Manual, The MIT Press, 1962
	18	Mogensen T./E., Partially static structures in a self-applicable partial evaluator, in: Bjcrner D., Ershov A. P., Jones N. D. (ed.), Partial Evaluation and Mixed Computation. (Gammel Avemaes, Denmark). 325-347, North-Holland 1988.
	19	Mogensen T. AL, Binding time aspects of partial evaluation. University of Copenhagen, Ph.D. Thesis, 1989.
	20	J Rees , W Clinger, Revised report on the algorithmic language scheme, ACM SIGPLAN Notices, v.21 n.12, p.37-79, Dec. 1986 [doi>10.1145/15042.15043]
	21	Romanenko S. A., A compiler generator produced by a selfapplicable specializer can have a surprisingly natural and understandable structure. In: Bjorner D., Ershov A. P., Jones N. D. (ed.), Partial Evaluation and Mixed Computation. (Gammel Averages, Denmark). 445-463, North-Holland 1988.
	22	Peter. Sestoft, The structure of a self-applicable partial evaluator, on Programs as data objects, p.257-281, April 1986, Copenhagen, Denmark
	23	Turchin V. F., The Phenomenon of Science. Columbia University Press: New York 1977.
	24	V. F. Turchin, A supercompiler system based on the language REFAL, ACM SIGPLAN Notices, v.14 n.2, p.46-54, February 1979 [doi>10.1145/954063.954069]
	25	Turchin V. F., The language Refal - the theory of compilation and metasystem analysis. Courant Institute of Mathematical Sciences. Courant Computer Science Report No. 20, 1980.
	26	Valentin F. Turchin, The Use of Metasystem Transition in Theorem Proving and Program Optimization, Proceedings of the 7th Colloquium on Automata, Languages and Programming, p.645-657, July 14-18, 1980
	27	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]
	28	Turchin V. F., A constructive interpretation of the full set theory. In: The Journal of Symbolic Logic, 52(1): 172-201, 1987.
	29	Turchin V. F., Refal-5, Programming Guide and Reference Manual. New England Publishing Co.: Holyoke, Massachusetts 1989.

CITED BY 4

	Renaud Marlet , Charles Consel , Philippe Boinot, Efficient incremental run-time specialization for free, ACM SIGPLAN Notices, v.34 n.5, p.281-292, May 1999
	Torben Æ. Mogensen, Self-applicable online partial evaluation of the pure lambda calculus, Proceedings of the 1995 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation, p.39-44, June 21-23, 1995, La Jolla, California, United States
	Rogardt Heldal , John Hughes, Partial evaluation and separate compilation, ACM SIGPLAN Notices, v.32 n.12, p.1-11, Dec. 1997
	Robert Glück , Jesper Jørgensen, An Automatic Program Generator for Multi-Level Specialization, Lisp and Symbolic Computation, v.10 n.2, p.113-158, July 1997