article

Free access

Towards multiple self-application

Author:

Robert GlückAuthors Info & Claims

ACM SIGPLAN Notices, Volume 26, Issue 9

Pages 309 - 320

https://doi.org/10.1145/115866.115900

Published: 01 May 1991 Publication History

PDF eReader

References

[1]

Bjcmer D., Ershov A. P., Jones N. D. (ed.), Partial Evaluation and Mixed Computation. North-Holland: Amsterdam 1988.

Google Scholar

[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.

Google Scholar

[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.

Google Scholar

[4]

Consel C., New insights into partial evaluation: the Schism experiment. In: Ganzinger H. (ed.), ESOP '88. (Nancy, France). Lecture Notes in Computer Science, Vol. 300, 236- 246, Springer-Verlag 1988.

Digital Library

Google Scholar

[5]

Consel C., Danvy O., Partial evaluation of pattern matching in strings. In: Information Processing Letters, 30: 79-86, 1989.

Digital Library

Google Scholar

[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.

Google Scholar

[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.

Google Scholar

[8]

Futamura Y., Partial evaluation of computation process - an approach to a compiler-compiler. In: Systems, Computers, Controls, 2(5): 45-50, 1971.

Google Scholar

[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.

Google Scholar

[10]

Gliick R., Turchin V. F., Experiments with a self-applicable supercompiler. City University New York. Technical Report 1989,

Google Scholar

[11]

Gliick R., Turchin V. F., Application of metasystem transition to function inversion and transformation. In: Proceedings of the ISSAC '90. (Tokyo, Japan). 286-287, ACM Press 1990.

Digital Library

Google Scholar

[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.

Google Scholar

[13]

Jones N. D., Partial evaluation, self-application and types. In: Paterson M. S. (ed.), Automata, Languages and Programming. (Warwick University, England). Lecture Notes in Computer Science, Vol. 443, 639-659, Springer-Verlag 1990.

Digital Library

Google Scholar

[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.

Google Scholar

[15]

Jones N. D., Sestoft P., SCndergaard H., An experiment in partial evaluation: the generation of a compiler generator. In: Jouannaud J.-P. (ed.), Rewriting Techniques and Applications. (Dijon, France). Lecture Notes in Computer Science, Vol. 202, 124-140, Springer-Verlag 1985.

Digital Library

Google Scholar

[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.

Google Scholar

[17]

McCarthy J., Abrahams P. W., Edwards D. J. et al., Lisp 1.5 Programmer's Manual. MIT Press: Cambridge, Massachusetts 1962.

Digital Library

Google Scholar

[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.

Google Scholar

[19]

Mogensen T. AL, Binding time aspects of partial evaluation. University of Copenhagen, Ph.D. Thesis, 1989.

Google Scholar

[20]

Rees J., Clinger W., Revised3 report on the algorithmic language Scheme. In: SIGPLAN Notices, 21(12): 37-79, 1986,

Digital Library

Google Scholar

[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.

Google Scholar

[22]

Sestoft P., The structure of a self-applicable partial evaluator. In: Ganzinger H., Jones N. D. (ed.), Programs as Data Objects. (Copenhagen, Denmark). Lecture Notes in Computer Science, Vol. 217, 236-256, Springer-Verlag 1986.

Digital Library

Google Scholar

[23]

Turchin V. F., The Phenomenon of Science. Columbia University Press: New York 1977.

Google Scholar

[24]

Turchin V. F., A supercompiler system based on the language Refal. In: SIGPLAN Notices, 14(2): 46-54, 1979.

Digital Library

Google Scholar

[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.

Google Scholar

[26]

Turchin V. F., The use of metasystem transition in theorem proving and program optimization. In: de Bakker J. W., van Leeuwen J. (ed.), Automata, Languages and Programming. (Noordwijkerhout, Netherlands), Lecture Notes in Computer Science, Vol. 85, 645-657, Springer-Verlag 1980.

Digital Library

Google Scholar

[27]

Turchin V. F., The concept of a supercompiler. In: ACM TOPLAS, 8(3): 292-325, 1986.

Digital Library

Google Scholar

[28]

Turchin V. F., A constructive interpretation of the full set theory. In: The Journal of Symbolic Logic, 52(1): 172-201, 1987.

Google Scholar

[29]

Turchin V. F., Refal-5, Programming Guide and Reference Manual. New England Publishing Co.: Holyoke, Massachusetts 1989.

Google Scholar

Cited By

View all

Marlet RConsel CBoinot P(2019)Efficient incremental run-time specialization for freeACM SIGPLAN Notices10.1145/301631.30168134:5(281-292)Online publication date: 28-Feb-2019
https://dl.acm.org/doi/10.1145/301631.301681
Marlet RConsel CBoinot PRyder BZorn B(1999)Efficient incremental run-time specialization for freeProceedings of the ACM SIGPLAN 1999 conference on Programming language design and implementation10.1145/301618.301681(281-292)Online publication date: 1-May-1999
https://dl.acm.org/doi/10.1145/301618.301681
Heldal RHughes J(1997)Partial evaluation and separate compilationACM SIGPLAN Notices10.1145/258994.25899632:12(1-11)Online publication date: 1-Dec-1997
https://dl.acm.org/doi/10.1145/258994.258996
Show More Cited By

Index Terms

Towards multiple self-application
1. Software and its engineering
  1. Software notations and tools
    1. Compilers
    2. General programming languages
      1. Language features
      2. Language types
2. Theory of computation
  1. Semantics and reasoning
    1. Program constructs

Recommendations

Type checking modular multiple dispatch with parametric polymorphism and multiple inheritance
OOPSLA '11

In previous work, we presented rules for defining overloaded functions that ensure type safety under symmetric multiple dispatch in an object-oriented language with multiple inheritance, and we showed how to check these rules without requiring the ...
Self type constructors
OOPSLA '09: Proceedings of the 24th ACM SIGPLAN conference on Object oriented programming systems languages and applications

Bruce and Foster proposed the language LOOJ, an extension of Java with the notion of MyType, which represents the type of a self reference and changes its meaning along with inheritance. MyType is useful to write extensible yet type-safe classes for ...
Self type constructors
OOPSLA '09

Bruce and Foster proposed the language LOOJ, an extension of Java with the notion of MyType, which represents the type of a self reference and changes its meaning along with inheritance. MyType is useful to write extensible yet type-safe classes for ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

ACM SIGPLAN Notices Volume 26, Issue 9

Sept. 1991

333 pages

ISSN:0362-1340

EISSN:1558-1160

DOI:10.1145/115866

Editor:
Richard L. Wexelblat
IDA/CSED, Alexandria, VA

Issue’s Table of Contents

PEPM '91: Proceedings of the 1991 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
May 1991
333 pages
ISBN:0897914333
DOI:10.1145/115865
Chairmen:
Charles Consel,
Olivier Danvy

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 May 1991

Published in SIGPLAN Volume 26, Issue 9

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

16
Total Citations
View Citations
333
Total Downloads

Downloads (Last 12 months)46
Downloads (Last 6 weeks)11

Reflects downloads up to 19 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Marlet RConsel CBoinot P(2019)Efficient incremental run-time specialization for freeACM SIGPLAN Notices10.1145/301631.30168134:5(281-292)Online publication date: 28-Feb-2019
https://dl.acm.org/doi/10.1145/301631.301681
Marlet RConsel CBoinot PRyder BZorn B(1999)Efficient incremental run-time specialization for freeProceedings of the ACM SIGPLAN 1999 conference on Programming language design and implementation10.1145/301618.301681(281-292)Online publication date: 1-May-1999
https://dl.acm.org/doi/10.1145/301618.301681
Heldal RHughes J(1997)Partial evaluation and separate compilationACM SIGPLAN Notices10.1145/258994.25899632:12(1-11)Online publication date: 1-Dec-1997
https://dl.acm.org/doi/10.1145/258994.258996
Heldal RHughes JGallagher JConsel C(1997)Partial evaluation and separate compilationProceedings of the 1997 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation10.1145/258993.258996(1-11)Online publication date: 1-Dec-1997
https://dl.acm.org/doi/10.1145/258993.258996
Marlet R(2013)BibliographyProgram Specialization10.1002/9781118576984.biblio(487-522)Online publication date: 5-Feb-2013
https://doi.org/10.1002/9781118576984.biblio
Glück R(2008)On the generation of specializersJournal of Functional Programming10.1017/S09567968000011674:04(499-514)Online publication date: 7-Nov-2008
https://doi.org/10.1017/S0956796800001167
Glück RSørensen M(2005)A roadmap to metacomputation by supercompilationPartial Evaluation10.1007/3-540-61580-6_8(137-160)Online publication date: 2-Jun-2005
https://doi.org/10.1007/3-540-61580-6_8
Turchin V(2005)Metacomputation: Metasystem transitions plus supercompilationPartial Evaluation10.1007/3-540-61580-6_24(481-509)Online publication date: 2-Jun-2005
https://doi.org/10.1007/3-540-61580-6_24
Nemytykh APinchuk VTurchin V(2005)A Self-Applicable supercompilerPartial Evaluation10.1007/3-540-61580-6_16(322-337)Online publication date: 2-Jun-2005
https://doi.org/10.1007/3-540-61580-6_16
Glück R(2005)On the mechanics of metasystem hierarchies in program transformationLogic Program Synthesis and Transformation10.1007/3-540-60939-3_18(234-251)Online publication date: 1-Jun-2005
https://doi.org/10.1007/3-540-60939-3_18
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

References

Cited By

Index Terms

Recommendations

Type checking modular multiple dispatch with parametric polymorphism and multiple inheritance

Self type constructors

Self type constructors

Comments

Information

Published In

Publisher

Publication History

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations