See this document in CiteSeerX!

Extensible Denotational Language Specifications (1994)  (Make Corrections)  (20 citations)
Robert Cartwright, Matthias Felleisen
Theoretical Aspects of Computer Software



  Home/Search   Context   Related

 
View or download:
rice.edu/CS/PLT/Publi...tacs94cf.ps.gz
mit.edu/ftpdir/users/d...felleisen.ps.Z
mit.edu:8000/users/dae...felleisen.ps.Z
Cached:  PS.gz  PS  PDF   Image  Update  Help

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

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

Abstract: . Traditional denotational semantics assigns radically different meanings to one and the same phrase depending on the rest of the programming language. If the language is purely functional, the denotation of a numeral is a function from environments to integers. But, in a functional language with imperative control operators, a numeral denotes a function from environments and continuations to integers. This paper introduces a new format for denotational language specifications, extended direct ... (Update)

Context of citations to this paper:   More

.... appears to provide some inherent modularity, but obtaining full modularity may involve the introduction of many artificial internal steps [5]. Reppy s evaluation context semantics for ML concurrency primitives [33, 34] has better modularity than the SOS given in [4] see...

...no location occurring more than once. It is quite straightforward to give reduction rules for variable allocation, assignment, and dereferencing [4]: s E[ref v] s, l, v) E[l] if l is not used in s (43) s, l, v) s # E[l : v # ] s, l, v # ) s # E[ 44) s, l, v) s #...

Cited by:   More
Modularity in Meta-Languages - Mosses   (Correct)
Synthesizing Object-Oriented and Functional Design.. - Krishnamurthi.. (1998)   (Correct)
Effective Static Debugging via Componential Set-Based Analysis - Flanagan (1997)   (Correct)

Active bibliography (related documents):   More   All
0.6:   Universal Domains For Sequential Computation - Kanneganti (1995)   (Correct)
0.4:   The Formal Relationship Between Direct and Continuation-Passing.. - Sabry (1994)   (Correct)
0.4:   The Formal Relationship between Direct and Continuation-Passing.. - Sabry (1994)   (Correct)

Similar documents based on text:   More   All
0.2:   SPCF: Its Model, Calculus, and Computational Power.. - Kanneganti.. (1992)   (Correct)
0.1:   Observable Sequentiality and Full Abstraction - Cartwright, Felleisen (1992)   (Correct)
0.1:   DrJava: A lightweight pedagogic environment for Java - Eric Allen Robert (2002)   (Correct)

Related documents from co-citation:   More   All
12:   The Definition of Standard ML (context) - Milner, Tofte et al. - 1990
7:   Monad transformers and modular interpreters - Liang, Hudak et al. - 1992
7:   Natural Semantics (context) - Kahn - 1987

BibTeX entry:   (Update)

Cartwright, R. S. and M. Felleisen. Extensible denotational language specifications. In Hagiya, M. and J. C. Mitchell, editors, Symposium on Theoretical Aspects of Computer Science, pages 244--272. Springer-Verlag, April 1994. LNCS 789. http://citeseer.ist.psu.edu/cartwright94extensible.html   More

@incollection{ cartwright94extensible,
    author = "Robert Cartwright and Matthias Felleisen",
    title = "Extensible Denotational Language Specifications",
    booktitle = "Theoretical Aspects of Computer Software",
    volume = "789",
    publisher = "Springer-Verlag",
    editor = "Masami Hagiya and John C. Mitchell",
    pages = "244--272",
    year = "1994",
    url = "citeseer.ist.psu.edu/cartwright94extensible.html" }
Citations (may not include all citations):
1074   The Definition of Standard ML (context) - Milner, Tofte et al. - 1990
484   Common Lisp---The Language (context) - Steele - 1984
346   Denotational Semantics: The Scott-Strachey Approach to Progr.. (context) - Stoy - 1981
293   The essence of functional programming - Wadler - 1992
291   Computational lambda-calculus and monads - Moggi - 1989
221   Denotational Semantics: A Methodology for Language Developme.. (context) - Schmidt - 1986
214   Domains for denotational semantics (context) - Scott - 1982
197   The revised 3 report on the algorithmic language Scheme - Rees, Clinger - 1986
162   Data types as lattices (context) - Scott - 1976
87   Notions of computations and monads - Moggi - 1991
84   The Denotational Description of Programming Languages (context) - Gordon - 1979
80   The Scheme Programming Language (context) - Dybvig - 1987
73   Denotational Semantics (context) - Mosses - 1991
72   An abstract view of programming languages (context) - Moggi - 1990
67   Representing monads - Filinski - 1994
66   Continuation semantics in typed lambdacalculi - Meyer, Wand - 1985
61   Continuations: A mathematical semantics for handling full ju.. (context) - Strachey, Wadsworth - 1974
57   Continuation-based multiprocessing - Wand - 1980
54   Building interpreters by composing monads - Steele - 1994
52   the relation between direct and continuation semantics (context) - Reynolds - 1974
36   Parameter-passing and the lambdacalculus - Crank, Felleisen - 1991
27   Scheme: An interpreter for extended lambda calculus (context) - Sussman, Jr - 1975
25   as a Universal Domain (context) - Plotkin - 1978
23   Engines from continuations (context) - Dybvig, Hieb - 1989
18   Programming with continuations (context) - Friedman, Haynes et al. - 1985
12   A reduction semantics for imperative higher-order languages (context) - Felleisen, Friedman - 1987
11   A Practical Introduction to Denotational Semantics (context) - Allison - 1986
11   Prentice Hall International (context) - Bjorner, Jones - 1982
10   The congruence of two programming language definitions (context) - Stoy - 1981
9   Naive denotational semantics (context) - Blikle, Tarlecki - 1983
9   Constructing call-by-value continuation semantics (context) - Sethi, Tang - 1980
7   Modeling continuations without continuations (context) - Sitaram, Felleisen - 1991
2   What is a universal higherorder programming language - Kanneganti
2   Direct semantics and exceptions define jumps and coroutines (context) - Allison - 1989
1   Overview: The Common Lisp Object System (context) - Demichiel - 1988



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://www.cs.rice.edu/CS/PLT/Publications/):   More
Synthesizing Object-Oriented and Functional Design.. - Krishnamurthi.. (1998)   (Correct)
Reasoning about Explicit and Implicit Representations of State - Sabry, Field (1993)   (Correct)
A Practical Soft Type System for Scheme - Wright, Cartwright (1994)   (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