Reflection And Semantics In Lisp

Di: Stella

This article presents a model of the reflective tower based on the formal semantics of its levels. They are augment our previous protocol by related extensionally by their mutual interpretation and intensionally by reification and reflection.

3-lisp: an infinite tower of meta-circular interpreters.

Functional Programming Languages - ppt download

M-LISP is introduced, a dialect of LISP designed with an eye toward reconciling LISp’s metalinguistic power with the structural style of operational semantics advocated by Plotkin [28].

The remainder of the paper is organized as follows: Section 2 describes our mini-language and its operational semantics. Section 3 presents the main technical results. Section 4 discusses some of the ways in which the results might be extended to systems with environ-ments, including traditional Lisp fexprs. Section 5 discusses the implications of our results for the existence of We show how a computational system can be constructed to „reason“ effectively and consequentially, about its own inferential processes. We prescnt three successive dialects of LISP: 1-l1 SP, a distillation of current practice; 2-LISP, a dialect constructed in terms of our rationalised semantics.

Details CRID 1573387449968829952 NII Article ID 10015083696 Data Source CiNii Articles Lisp (historically LISP, an abbreviation of „list processing“) is a family of programming languages with a long history and a distinctive, fully parenthesized prefix notation. [3] Originally specified on the formal in the late 1950s, it is the second-oldest 3-LISP is a dialect of LISP designed and implemented by Brian C. Smith as part of his PhD. thesis Procedural Reflection in Programming Languages (what this thesis refers to as „reflection“ is nowadays more usually called „reification“).

The reflective tower is one of the attempts to structure computational reflection, that is, access from a running process to its computational state. This paper gives the framework of a denotational semantics of a reflective tower, isolating the features which we have found to be sufficient to describe this model. A reflective language text and the context makes the language semantics open to user programs and allows them to access, extend, and modify it from within the same language framework. Because of its high flexibility and expressiveness, it can be an ideal platform for programming language research as well as practical applications in dynamic environments. However, efficient

In Malenfant et al. [19], we have described a reflective model for a prototype-based language based on thelookup o apply reflective introspection protocol. In this paper, we augment our previous protocol by converting it to handle continuations reified as first-class objects. First-class continuations provide much more control over the current computation; during the introspection Reflection has the potential to bring areas as disparate as programming language design, compiler construction, code generation, debugging, tracing, concurrent programming, and semantics together under a single umbrella.

Reflection and Sentantics in Lisp Brian Cantwell Smith XEROX Pale
Apex to Lisp snippet converter
The mystery of the tower revealed
Objects, Reflection, and Open Languages
Compiling a reflective language using MetaOCaml

We consider how the data structures of an interpreter may be made available to the program it is running, and how the program may alter its interpreter’s structures. We refer to these processes as reification and reflection. We show how these processes may be considered as an extension of the fexpr concept in which not only the form and the environment, but also the continuation, are Smith, B. C. “Reflection and Semantics in Lisp,” Conference Record of the 14th Annual ACM Symposium on Principles of Programming Languages, pp. 23–35 (January 1984). variations on lisp, exploring reflection. Contribute to namin/lisp-variations development by creating an account on GitHub.

Duplication and partial evaluation

We present Pink, a meta-circular Lisp-like evaluator on top of this calculus, and demonstrate that we can collapse arbitrarily many levels of self-interpretation, including levels with semantic modifications. We discuss several examples: compiling regular expressions through an interpreter to base code, building program transformers from modi ed interpreters, and others. This article presents a model of the reflective tower based on the formal semantics of its levels. They are related extensionally by their mutual interpretation and intensionally by reification and reflection.

(PDF) A Semantics of Compile-time Reflection

Reflection and Sentantics in Lisp Brian Cantwell S m i t h XEROX Pale Alto Research Center 3333 Coyote Hill Road. Pale Alto. CA 94304; and Center for the Study of l.anguage and Information Stantbrd University. Stanlbrd. CA 94305 and continuation char;wtcrising the s t a t e of the computation at that pui,~t. T h u s , such constructs as ttmow and C,~TCII, which m u s t Details CRID 1573668924268576640 NII Article ID 10006536597 Data Source CiNii Articles BibTeX EndNote APA Chicago DIN 1505 Harvard MSOffice XML %0 Conference Paper %1 smith84 %A Smith, B.C. %B Proceedings of the 11th ACM Symposium on Principles of Programming Languages %C Salt Lake City, Utah %D 1984 %K lisp,reflexivite,meta-circularite,semantique %P 23–35 %T Reflection and Semantics in Lisp

Reflection and semantics in LISP (Report / Center for the Study of Language and Information) [Smith, Brian Cantwell] on Amazon.com. *FREE* shipping on qualifying offers.

Artifact Details Title Reflection and Semantics in a Procedural Language Catalog Number 102719214 Type Document Description Ph.D. thesis. M.I.T., Computer Science Lab., MIT/LCS/TR-272, Cambridge, Mass. Abstract Inan important series of papers [8, 9], Brian Smith hasdiscussed the nature ofprograms that know about their text and the context i which t ey are executed. He called this kind of knowledge reflection. Smith proposed aprogramming language, 3-LISP. called which mbodied such self-knowledge in th domain of metacircular interpreters. Every 3-LISP program ‪Professor of Information, Philosophy, and Computer Science, University of Toronto‬ – ‪‪引用次数：9,518 次‬‬ – ‪Computer Science‬ – ‪Reflection‬ – ‪Semantics‬ – ‪Artificial Intelligence‬ – ‪Cognitive Science‬

“A Simple Reflective Interpreter,”Proceedings of the International Workshop on Reflection and Meta-Level described a reflective Architecture, pp. 24–35 (November 1992), the extended version also appears in this volume.

Brian Cantwell Smith, a person who founded of a lot of work in reflective languages with his POPL’84 paper „Reflection and Semantics in LISP“ consequential to his PhD works. He has moved away from Computer Science to Philosophy. I (Fare) couldn’t quite manage to read his book „On the Origin of Objects“. Journal Proc. POPL’84 Proc. POPL’84 23-35, 1984 This article presents a model of the reflective tower based on the formal semantics of its levels. They are related extensionally by their mutual interpretation and intensionally by reification and reflection.

We provide a very simple model of a reflective facility based on the pure λ-calculus, and we show that its theory of contextual equivalence is trivial: two terms in the language are contextually equivalent iff they are α-congruent. J-STAGEPDF閲覧時に認証を求められる記事がございます（発行後2年間）が，人工知能学会の個人会員は無料で閲覧可能です．認証のための購読者番号やパスワードは会員マイページにログインし「学会からのお知らせ」にてご確認下さい（会員情報管理システムとオンラインで連携していない

A series of general techniques, which should be applicable to reflective variants of any standard applicative or imperative programming languages, are illustrated in a complete implementation for a particular reflective LISP dialect called 3-LISP. Buy Reflection and semantics in LISP (Report / Center for the Study of Language and this thesis Information) by Smith, Brian Cantwell (ISBN: ) from Amazon’s Book Store. Everyday low prices and free delivery on eligible orders. In this paper we introduce M-LISP, a dialect of LISP designed with an eye toward reconciling LISP’s metalinguistic power with the structural style of operational semantics advocated by Plotkin [28].

JQDN

General