article

A simple reflective interpreter

Authors:

Stanley Jefferson,

Daniel P. FriedmanAuthors Info & Claims

Lisp and Symbolic Computation, Volume 9, Issue 2-3

Pages 181 - 202

https://doi.org/10.1007/BF01806112

Published: 01 May 1996 Publication History

Abstract

No abstract available.

Cited By

View all

Amin NRompf T(2017)Collapsing towers of interpretersProceedings of the ACM on Programming Languages10.1145/31581402:POPL(1-33)Online publication date: 27-Dec-2017
https://dl.acm.org/doi/10.1145/3158140
van der Storm TCook WLoh A(2014)The design and implementation of Object GrammarsScience of Computer Programming10.1016/j.scico.2014.02.02396:P4(460-487)Online publication date: 15-Dec-2014
https://dl.acm.org/doi/10.1016/j.scico.2014.02.023
Steunebrink BSchmidhuber J(2011)A family of Gödel machine implementationsProceedings of the 4th international conference on Artificial general intelligence10.5555/2032873.2032904(275-280)Online publication date: 3-Aug-2011
https://dl.acm.org/doi/10.5555/2032873.2032904
Show More Cited By

Index Terms

A simple reflective interpreter
1. Software and its engineering
  1. Software notations and tools
    1. Compilers
      1. Interpreters
    2. General programming languages
      1. Language types
        Functional languages
2. Theory of computation
  1. Semantics and reasoning
    1. Program semantics

Recommendations

Definitional Interpreters for Higher-Order Programming Languages

Higher-order programming languages (i.e., languages in which procedures or labels can occur as values) are usually defined by interpreters that are themselves written in a programming language based on the lambda calculus (i.e., an applicative language ...
Definitional interpreters for higher-order programming languages
ACM '72: Proceedings of the ACM annual conference - Volume 2

Higher-order programming languages (i.e., languages in which procedures or labels can occur as values) are usually defined by interpreters which are themselves written in a programming language based on the lambda calculus (i.e., an applicative language ...
Collapsing towers of interpreters

Given a tower of interpreters, i.e., a sequence of multiple interpreters interpreting one another as input programs, we aim to collapse this tower into a compiler that removes all interpretive overhead and runs in a single pass. In the real world, a use ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

Publisher

Kluwer Academic Publishers

United States

Publication History

Published: 01 May 1996

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

7
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 22 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Amin NRompf T(2017)Collapsing towers of interpretersProceedings of the ACM on Programming Languages10.1145/31581402:POPL(1-33)Online publication date: 27-Dec-2017
https://dl.acm.org/doi/10.1145/3158140
van der Storm TCook WLoh A(2014)The design and implementation of Object GrammarsScience of Computer Programming10.1016/j.scico.2014.02.02396:P4(460-487)Online publication date: 15-Dec-2014
https://dl.acm.org/doi/10.1016/j.scico.2014.02.023
Steunebrink BSchmidhuber J(2011)A family of Gödel machine implementationsProceedings of the 4th international conference on Artificial general intelligence10.5555/2032873.2032904(275-280)Online publication date: 3-Aug-2011
https://dl.acm.org/doi/10.5555/2032873.2032904
Asai K(2011)Reflection in direct styleACM SIGPLAN Notices10.1145/2189751.204788247:3(97-106)Online publication date: 22-Oct-2011
https://dl.acm.org/doi/10.1145/2189751.2047882
Asai KDenney ESchultz U(2011)Reflection in direct styleProceedings of the 10th ACM international conference on Generative programming and component engineering10.1145/2047862.2047882(97-106)Online publication date: 22-Oct-2011
https://dl.acm.org/doi/10.1145/2047862.2047882
Glenstrup AJones N(2005)Termination analysis and specialization-point insertion in offline partial evaluationACM Transactions on Programming Languages and Systems10.1145/1108970.110897327:6(1147-1215)Online publication date: 1-Nov-2005
https://dl.acm.org/doi/10.1145/1108970.1108973
Wand M(1998)The Theory of Fexprs is TrivialLisp and Symbolic Computation10.1023/A:100772063273410:3(189-199)Online publication date: 1-May-1998
https://dl.acm.org/doi/10.1023/A%3A1007720632734

View Options

View options

Get Access

Login options

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

Abstract

Cited By

Index Terms

Recommendations

Definitional Interpreters for Higher-Order Programming Languages

Definitional interpreters for higher-order programming languages

Collapsing towers of interpreters

Comments

Information

Published In

Publisher

Publication History

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations