M. J. Gordon. The Denotational Description Of Programming Languages. Springer Verlag, 1979. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
A Formal Semantics for the C Programming Language - Nikolaos Papaspyrou Doctoral (1998) (1 citation) (Correct)
....languages. The seminal paper on denotational semantics is [Scot71] Other introductory papers including useful bibliography are [Tenn76] and [Moss90] Introductory books presenting in more depth the underlying theory and the techniques that have been developed include [Miln76] Stoy77] [Gord79], Alli86] and [Schm86] An graduate level book with more mathematical depth is [Gunt92] This thesis was strongly influenced by [Tenn91] an excellent book revealing the connections between syntax and the various flavours of semantics. The same is accomplished by [Mitc96] focusing mainly on the ....
M. J. C. Gordon, The Denotational Descriptions of Programming Languages, Springer Verlag, Berlin, Germany, 1979.
Constrained Cuantification in Polymorphic - Type Analysis Pavel (Correct)
....is taken from lecture notes by Alan Demers that are, unfortunately for the field, not widely available. The reader desiring more information on domain theory and or denotational semantics can refer to the groundbreaking paper by Scott [21] a survey paper by Tennent [25] or books by Gordon [10] or Stoy [23] The formal definition of the semantics of programming languages and their types seems at first a reasonably straightforward undertaking, if a bit tedious. However, if one takes as a goal the mapping of language constructs into well understood mathematical objects, 1 the problem ....
Gordon, Michael, The Denotational Description of Programming Languages, Springer-Verlag, 1979.
Mapping Object Descriptions to Behaviours - Nierstrasz (1988) (Correct)
....to a particular cell. In addition to a more powerful version of the Abacus language, we would need a semantic mapping language for describing how programs and program fragments are to be interpreted as behaviours. We expect that ideas from denotational semantics will be useful [Tennent 1976; Gordon 1979] 4 Conclusions The problem we would like to address is typified by the following example. Given a programming language such as Hybrid, a concurrent programming language supporting object oriented language constructs in addition to various forms of synchronous and asynchronous message passing ....
M.J.C. Gordon, The Denotational Description of Programming Languages, SpringerVerlag, 1979.
A Denotational Semantics of Inheritance - Cook (1989) (109 citations) (Correct)
....is a form of invocation just like client invocation. 2.2.1 Fixed point Semantics The fixed point semantics of recursive programs, developed by Scott[24] provides the mathematical setting for the inheritance model. Thorough introductory explanations are given by Stoy[27] Gordon[12], and Scott[24] To see the use of fixed points in the analysis of recursive programs, consider the following definition of the factorial function: fact(n The identifier fact is equated with a function definition in which fact appears. In the body of the definition, fact is a bound variable ....
....connection to the standard semantics of programming languages via fixed point analysis. 44 Denotational Semantics with Generators This chapter illustrates the analysis of class inheritance within the framework of denotational semantics. A simple language is defined, similar to Gordon s TINY [12] but with classes and inheritance, and its denotational semantics is presented. This Chapter shows that inheritance can be explained using the standard techniques of denotational semantics. The essential change from previous work on the semantics of classes [28] 13] is the introduction of a ....
M. J. C. Gordon. The Denotational Description of Programming Languages. Springer-Verlag, 1979.
An Approach to Algebraic Semantics of Object-Oriented Languages - Fronk (2002) (Correct)
....without loss of generality. 1 The approach works in two steps. First, we formalize classes, attributes and methods as well as class relations such as aggregation, locality, inheritance and genericity through suitable algebraic specifications. Transformation rules establish semantic functions [29] for each syntactic concept offered by DoDL. The integration of simple algebraic specifications, hierarchical specifications, specifications with hidden symbols, and parameterized specifications allows formalizing these concepts as close as possible to the object oriented paradigm. Thereby, our ....
M. Gordon. The Denotational Description of Programming Languages. Springer, Berlin, 1979.
Types in Programming Languages - Camarão, Figueiredo, Pimentel (Correct)
....meaning. In this section, we discuss formal methods used in the definition of the semantics of programming languages (and their relation to type systems) Usually, two approaches are taken: ffl Denotational associates to each phrase a meaning, as an element of a chosen semantic domain [Sto77, Gor79, Mos90] Formally, a denotational semantics can be defined as an homomorphism between a term algebra (initial algebra over the signature of types and symbols of the language) and a semantic algebra (an algebra over the same signature, whose carriers are semantic domains, that contain the values ....
M. J. C. Gordon. The denotational description of programming languages. SpringerVerlag, 1979.
by Elaine Gouvea Pimentel - Marcelo Luiz Silva RT 0XX/98 - Caixa Postal Belo (Correct)
....abaixo e a condic ao, caso exista, a direita desta linha: premissa 1 : premissa 2 : premissa n conclus ao condic ao Regras com um conjunto vazio de premissas s ao chamadas axiomas, e a linha horizontal e omitida. Neste texto, descreveremos a semantica operacional da linguagem TINY [Gor87], uma linguagem que cont em express oes e comandos, ambos podendo conter identificadores. 1.1 Especificando a Sintaxe A sintaxe abstrata de programas em TINY e formada a partir das categorias sint aticas definidas na Figura 1. A Figura 2 apresenta uma vers ao da sintaxe abstrata de TINY no ....
....Vamos ignorar, por enquanto, declarac oes em programas, assumindo que qualquer programa cuja semantica esteja sendo analisada tenha sido verificado como sintaticamente correto. I 2 Ide =Conjunto de identificadores E 2 Exp =Conjunto de express oes C 2 Com =Conjunto dos Comandos Figura 1 Como em [Gor87], definimos os dom inios State de estados, Memory de mem oria, Input de inputs , Output de outputs e Value de valores. A definic ao destes dom inios consiste das seguintes equac oes de dom inio: State = Memory x Input x Ouput Memory = Ide [Value funboundg] Input = Value Output = Value ....
. J. C. Gordon, The Denotational Description of Programming Languages - An Introduction, Springer-Verlag, New York (1987).
A Framework for Multi-Notation, Model-Oriented Requirements Analysis - Day (Correct)
....of a record. Accessing the field of different records constitutes accessing the value of the name at different times [Raj95] ffl The configuration takes a name and returns a value for the name in that configuration as in denotational semantics where the configuration represents the memory [Gor79] We chose a fourth approach 2 of making each name a mapping from a configuration to a value, which is conveniently done in higher order logic where functions can have arguments that are functions. The user is freed from having to group explicitly all the names of the specification. In our ....
....for all example notational styles can be found in Appendices C through K. 5. 1 Formal operational semantics Operational semantics define the meaning of a notation by describing its behaviour on an abstract machine [Win93] Automata are often used to define the operational semantics of a notation [Gor79] In our framework, the semantics of model oriented notations are defined as next configuration relations in logic, i.e. the transition relation of an automaton where the possible states of the automaton are the reachable configurations of the system. These semantics are formal because they are ....
[Article contains additional citation context not shown here]
Michael J. C. Gordon. The Denotational Description of Programming Languages. Springer-Verlag, New York, 1979.
Monads and Effects (revised) - Benton, Hughes, Moggi (2000) (1 citation) (Correct)
.... used for formalizing reasoning principles or for translating specification languages; ffl ML may be chosen as the internal language for a class of categories (e.g. CCC) or for a specific semantic category (e.g. that of sets or cpos) to use ML for hiding details of semantic categories (see [Gor79] For instance, when ML is the internal language for a class of categories, it has one intended interpretation in each of them, therefore a translation into ML will induce a variety of interpretations C 1 PL transl ML Phi Phi Phi Phi Phi interp : H H H H H interp ....
M.J.C. Gordon. Denotational Description of Programming Languages. Springer, 1979.
The Origins of Structural Operational Semantics - Plotkin (2003) (1 citation) Self-citation (Gordon) (Correct)
No context found.
Michael J. C. Gordon, The Denotational Description of Programming Languages, Berlin: Springer Verlag, 1979.
Christopher Strachey: recollections of his influence - Gordon (1999) Self-citation (Gordon) (Correct)
....is written in the language CPL, which Strachey, Barron, Hartley and others were working on at the time. The de nition of Product in ML would be fun Product L = foldr (fn (k,z) foldr (fn (x,y) foldr (fn (p,q) x: p) q) y z) k) L For example, evaluating Product [ 1,2] 3,4] [5,6]] yields [ 1,3,5] 1,3,6] 1,4,5] 1,4,6] 2,3,5] 2,3,6] 2,4,5] 2,4,6] The question naturally arose of what could and couldn t be programmed just using Lit. Plotkin had shown (personal communication, Edinburgh, about 1972) that if the number n was represented by a list of n empty lists, then ....
....the language CPL, which Strachey, Barron, Hartley and others were working on at the time. The de nition of Product in ML would be fun Product L = foldr (fn (k,z) foldr (fn (x,y) foldr (fn (p,q) x: p) q) y z) k) L For example, evaluating Product [ 1,2] 3,4] 5,6] yields [[1,3,5], 1,3,6] 1,4,5] 1,4,6] 2,3,5] 2,3,6] 2,4,5] 2,4,6] The question naturally arose of what could and couldn t be programmed just using Lit. Plotkin had shown (personal communication, Edinburgh, about 1972) that if the number n was represented by a list of n empty lists, then all primitive ....
[Article contains additional citation context not shown here]
M. J. C. Gordon. The Denotational Description of Programming Languages. Springer-Verlag, 1979.
Software Reuse by Specialization of Generic Procedures through.. - Novak, Jr. (1997) (11 citations) Self-citation (Gordon) (Correct)
....Section 8 surveys related work, and Section 9 presents conclusions. 3 2 Views 2.1 Computation as Isomorphism It is useful to think of all computation as simulation or, more formally, as isomorphism. This idea has a long history; for example, isomorphism is the basis of denotational semantics [20]. Goguen [18] 19] describes views as isomorphisms, with mappings of unary and binary operators. Our views allow broader mappings between concrete and abstract types and include algorithms as well as operators. We use isomorphism to introduce the use of views. Preparata and Yeh [56] give a ....
M. J. C. Gordon, The Denotational Description of Programming Languages, Springer, 1979.
Formal Models for Aspect-Oriented Software Development - Skipper (2004) (Correct)
No context found.
M. J. Gordon. The Denotational Description Of Programming Languages. Springer Verlag, 1979.
A Foundation for Conventional and Temporal Query.. - Slivinskas, Jensen.. (2000) (Correct)
No context found.
M. J. C. Gordon. The Denotational Description of Programming Languages. Springer-Verlag (1987).
Instrumented Sensor System Architecture - Mohamed Dekhil And (1997) (1 citation) (Correct)
No context found.
GORDON, M. J. C. Denotational description of programming languages. Springer-Verlag, 1979.
A Framework for Module-Based Language Processors - Banavar, Lindstrom (1993) (Correct)
No context found.
Michael J. C. Gordon. The Denotational Description of Programming Languages. Springer-Verlag, 1979.
Compiling Object-Oriented Programs for Distributed.. - Muthukrishnan, Bryant.. (Correct)
No context found.
Gordon, M.J.C., The Denotational Description of Programming Languages - An Introduction , Springer-Verlag, New York, 1979.
Instrumented Sensor System Architecture - Mohamed Dekhil And (1997) (1 citation) (Correct)
No context found.
GORDON,M.J.C. Denotational description of programming languages. Springer-Verlag, 1979.
Formal Semantics of Synchronous SystemC - Salem (2003) (Correct)
No context found.
M. Gordon, The Denotational Descriptions of Programming Languages, Springer-Verlag, 1979.
From Contract Drafting to Software Specification: Linguistic.. - Berry, al. (2000) (Correct)
No context found.
Gordon, M.J.C., The Denotational Description of Programming Languages: An Introduction, SpringerVerlag, Berlin (1979).
Specyfikacja I Optymalizacja Programw W - Smalltalku Marcin Ml (Correct)
No context found.
Michael J. C. Gordon. The Denotational Description of Programming Languages: An Introduction. Texts and Monographs in Computer Science. Springer-Verlag, New York, 1979.
Swinging Data Types - The dielectic between actions and.. - Padawitz (1998) (Correct)
No context found.
M.J.C. Gordon, The Denotational Description of Programming Languages, Springer 1979
Operational Machine Specification in a Functional Programming.. - Koopman (1995) (3 citations) (Correct)
No context found.
M. J. C. Gordon, The Denotational Description of Programming Languages, An Introduction. SpringerVerlag, New York, 1979.
Gedanken: A tool for pondering the tractability of correct.. - Ericson (1994) (Correct)
No context found.
Michael J.C. Gordon. The denotational description of programming languages. Springer-Verlag, 1979.
Abacus: a Notation for Describing Concurrent Computations - Nierstrasz (Correct)
No context found.
M.J.C. Gordon, The Denotational Description of Programming Languages, Springer-Verlag, 1979.
First 50 documents Next 50
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