See this document in CiteSeerX!

Language Extensibility via First-class Interpreters and Constructive Modules (1993)  (Make Corrections)  (3 citations)
David Espinosa



  Home/Search   Context   Related

 
View or download:
mit.edu/ftpdir/users/dae...generic.ps.Z
mit.edu:8000/users/dae/p...generic.ps.Z
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  mit.edu/ftpdir/users/dae/home (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: This document proposes these theses: ffl First-class interpreters offer a flexible means of language extensibility. ffl A simple module system can provide: -- incremental specialization -- program construction rather than program organization -- static rather than dynamic composition of programs -- explicit rather than implicit control over composition The former two claims duplicate properties presently associated only with object-oriented programming, while we regard the latter two as... (Update)

Context of citations to this paper:   More

.... sums (for values) and self arguments (for interpreter composition) These techniques recall my earlier thesis proposals 89 [Esp93a, Esp93b], although there was no direct connection. In general, it not surprising that Felleisen and Cartwright s system can be extended with...

.... sums (for values) and self arguments (for interpreter composition) These techniques recall my earlier thesis proposals [Esp93a, Esp93b], although there was no direct connection. In general, it not surprising that Felleisen and Cartwright s system can be extended...

Cited by:   More
Semantic Lego - Espinosa (1995)   (Correct)

Active bibliography (related documents):   More   All
0.5:   Screaming Yellow Zonkers - Siskind (1991)   (Correct)
0.5:   Quasi-Static Scoping: Sharing Variable Bindings Across.. - Shinn-Der Lee (1993)   (Correct)
0.4:   Denotational Semantics for Asynchronous Concurrent Languages - Nyström (1996)   (Correct)

Similar documents based on text:   More   All
0.1:   Using Virtual Worlds to Evidence Singular Cognition.. - Espinosa, Puesto, Rojas (2000)   (Correct)
0.1:   Constructing Fuzzy Models with Linguistic Integrity -.. - Espinosa, Vandewalle (1998)   (Correct)
0.1:   Predictive Control Using Fuzzy Models - Espinosa, Vandewalle (1998)   (Correct)

Related documents from co-citation:   More   All
3:   Extensible denotational language specifications - Cartwright, Felleisen - 1994
2:   Category Theory for Computing Science (context) - Barr, Wells - 1990
2:   Building interpreters by composing monads - Steele - 1994

BibTeX entry:   (Update)

Espinosa, D.: Language Extensibility via First-class Interpreters and Constructive Modules, Columbia University, Department of Computer Science, New York, Ph.D. Thesis Proposal, 1993 http://citeseer.ist.psu.edu/espinosa93language.html   More

@misc{ espinosa93language,
  author = "D. Espinosa",
  title = "Language Extensibility via First-class Interpreters and Constructive Modules",
  text = "Espinosa, D.: Language Extensibility via First-class Interpreters and Constructive
    Modules, Columbia University, Department of Computer Science, New York,
    Ph.D. Thesis Proposal, 1993",
  year = "1993",
  url = "citeseer.ist.psu.edu/espinosa93language.html" }
Citations (may not include all citations):
430   Structure and Interpretation of Computer Programs (context) - Abelson, Sussman - 1985
306   Self: The power of simplicity (context) - Ungar, Smith - 1987
293   The essence of functional programming - Wadler - 1992
291   Computational lambda-calculus and monads - Moggi - 1989
257   Smalltalk-80: the Language and its Implementation (context) - Goldberg - 1985
206   Why functional programming matters - Hughes - 1990
137   The Art of the Metaobject Protocol (context) - Kiczales, Rivieres et al. - 1991
128   On understanding types (context) - Cardelli, Wegner - 1985
95   A basis for a mathematical theory of computation - McCarthy - 1963
84   Basic Category Theory for Computer Scientists (context) - Pierce - 1991
78   Scenarios: A Model of Non-Determinate Computation (context) - Brock, Ackermann - 1981
66   Towards a new model of abstraction in software engineering (context) - Kiczales - 1992
63   Realistic Compiler Generation (context) - Lee - 1989
54   The mystery of the tower revealed: a non-reflective descript.. (context) - Wand, Friedman - 1988
46   Reflection and semantics in Lisp (context) - Smith - 1984
41   Sharlit -- a tool for building optimizers - Tjiang, Hennessy - 1992
35   TCL: an embeddable command language - Ousterhout - 1990
35   Modules for standard ML - MacQueen - 1984
34   An architecture for an open compiler - Lamping, Kiczales et al. - 1992
33   A semantic prototyping system (context) - Wand - 1984
32   A module system for Scheme - Curtis, Rauen - 1990
20   A simple reflective interpreter - Jefferson, Friedman - 1992
20   Non-deterministic call by need is neither lazy nor by name (context) - Clinger - 1982
20   Automatic generation of global optimizers (context) - Whitfield, Soffa - 1991
11   McCarthy's amb cannot implement fair merge (context) - Panangaden, Shanbhogue - 1988
11   Reification without evaluation (context) - Bawden - 1988
11   Programming in Oberon (context) - Reiser, Wirth - 1992
10   Partial evaluation as a means of language extensibility (context) - Schooler - 1984
9   Modular Grammars for Programming Language Prototyping - Adams - 1991
8   Computer Science Department (context) - Filinski, categorical et al. - 1989
8   A Formal Model of Non-determinate Dataflow Computation (context) - Brock - 1983
8   Another module system for Scheme - Rees - 1992
6   Language extension via first-class interpreters - Simmons, Jefferson - 1992
6   Dependency-directed backtracking in nondeterministic Scheme (context) - Zabih - 1988
5   The Weyl computer algebra substrate (context) - Zippel - 1993
5   Abstraction in numerical methods - Halfant, Sussman - 1988
5   Non-deterministic Lisp with dependency-directed backtracking (context) - Zabih - 1987
4   Compile-time evaluation and code generation for semantics-di.. (context) - Appel - 1985
3   Denotational Semantics of Determinate and Non-Determinate Da.. - Kosinski - 1979
3   First-class data-type representations in schemexerox (context) - Adams, Curtis et al. - 1992
3   A unified system of parametrization for programming language.. (context) - Lamping - 1988
3   EATCS monographs on theoretical computer science (context) - Tofte - 1990
2   Lisp and Symbolic Computation (context) - Miller, Rozas et al. - 1991
1   Notes for a course on programming languages (context) - Weise
1   On program synthesis knowledge (context) - Greene, Barstow - 1986
1   A transfinite reflective tower (context) - Lamping, Kiczales
1   Functional Programming and its Applications (context) - Henderson - 1982
1   Available by ftp from cecelia (context) - Haase, description et al. - 1992
1   MIT Artificial Intelligence Lab (context) - Clinger, Actor et al. - 1981
1   the efficient synthesis of efficent programs (context) - Kant - 1986
1   Available by ftp from altdorf (context) - Rees, Kelsey
1   or why calculating is better than scheming (context) - Wadler, of et al. - 1987

Documents on the same site (http://www-swiss.ai.mit.edu/ftpdir/users/dae/home.html):   More
Monad Transformers and Modular Interpreters - Liang, Hudak, Jones (1995)   (Correct)
Building Interpreters by Transforming Stratified Monads - Espinosa (1994)   (Correct)
Combining Monads - King, Wadler (1992)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC