Peter D. Mosses. Denotational semantics. In Handbook of Theoretical Computer Science, Volume B: Formal Models and Semantics, chapter 11, pages 575--631. MIT Press, December 1990.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....researchers and has been used as a method for the semantic analysis, description, evaluation as well as the implementation of various programming 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 ....

....have not agreed on a standard meta language for this purpose and there is considerable variation in the notational conventions used by various authors, it seems that variations of the calculus are very popular. Such a variation will be used in this thesis, following mostly the notation of [Moss90] and [Gunt90] In this section, the meta language is outlined, keeping in mind the definitions of Section 3.3. The core of the meta language is first presented, followed by additional notational conventions that add nothing substantial to the language and can be regarded as syntactic sugar. 3.4.1 ....

[Article contains additional citation context not shown here]

P. D. Mosses, "Denotational Semantics", in J. van Leeuwen, editor, Handbook of Theoretical Computer Science, vol. B, chapter 11, pp. 577--631, Elsevier Science Publishers B.V., 1990.

....in expressing both an o#cial and an actual semantics, and the relationship between the two. For example, what is called the operational semantics of a programming language describes the computation mechanism which corresponds to a program (see, e.g. 19] whereas denotational semantics [18] describes the relation between the input and output data of the program. It is natural to consider that the essence of a program is in how it works, rather than into what it does. But from the point of view of the function of the norm, things are di#erent. Indeed, in norms, as for C99 above, ....

Peter D. Mosses. Denotational semantics. In Jan van Leeuwen, editor, Handbook of Theoretical Computer Science, pages 575--631. Elsevier Science Publishers, 1990.

.... two di#erent possibilities for their treatment: Tuples, for instance, may be defined as follows: #, X ) Y , with the consequence: and second(#, Y ) Alternatively, tuples may be defined as: #, X ) #= Y , #) #= # with the natural consequence: X and second(#, Y ) Y In [19, 20], the former is called smashed product , while the latter is the standard product. We also apply this terminology for sets, bags and sequences and suggest the use of smashed collection types and strict access operations (the OCL 2.0 proposal suggests a non strict, even non executable includes ....

Mosses, P.D.: Denotational semantics. [26] chapter 11

....being adequately used in a reference document to be used by any programmer. 2.3. 1 Operational, Denotational What is called the operational semantics of a programming language describes the computation mechanism which corresponds to a program (see, e.g. 32] whereas denotational semantics [28] describes the relation between the input and output data of the program. It is natural to consider that the essence of a program is in how it works, rather than into what it does. But from the point of view of the function of the reference semantics, things are di erent. Indeed, in reference ....

Peter D. Mosses. Denotational semantics. In Jan van Leeuwen, editor, Handbook of Theoretical Computer Science, pages 575-631. Elsevier Science Publishers, 1990.

....for these structures. We demonstrate the techniques for a simple lazy functional language F by modelling the escape behaviour of F programs. 1 Introduction Using denotational semantics for the formal description of programming language semantics is a well known and widely used technique [Mos90]. It allows the definition of a computation independent meaning of programs, without the necessity to fix details of an implementation. Furthermore, reasoning about programs, especially about the correctness of program optimisations, becomes possible. In many cases, however, this approach is too ....

P.D. Mosses. Denotational Semantics. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, Volume B: Formal Models and Semantics, chapter 11. Elsevier, 1990.

....by CNPq, Brazil. 1 1 Introduction Action semantics [Mos92] is a formal framework for semantic description, developed to provide tractable descriptions of real life languages (for example, see [Tof93, NT94, HT94] Action semantic descriptions, like those written in denotational semantics [Mos90, Sch86], are compositional : semantic functions, mapping abstract syntax to semantic entities, are defined inductively using semantic equations. However, in action semantics the semantic entities are actions rather than higher order functions, and the essence of actions is much more computational than ....

Peter D. Mosses. Denotational semantics. In J. van Leeuwen, A. Meyer, M. Nivat, M. Paterson, and D. Perrin, editors, Handbook of Theoretical Computer Science, volume B, chapter 11. Elsevier Science Publishers, Amsterdam; and MIT Press, 1990.

....element of type ( Hence T( is a suitable semantic domain to model the behaviour of arbitrary O programs of type . It better models the interleaving of input and output than early denotational semantics models that passed around a state containing input and output sequences (see Mosses [18]) O expressions are inductively translated into M expressions following the monadic style pioneered by Moggi [19] and Pitts [20] The translation is parameterised by a monad (in the type theoretic sense of Wadler [26] T; Val; Let) where Val and Let are M combinators with the following types. ....

....perhaps the only other to consider an equational theory for a strict functional language with what amounts to sideeffecting I O, but they do not consider operational semantics. Similarly, the semantic domains for I O studied in early work in the Scott Strachey tradition of denotational semantics [18, 23] were not related to operational semantics. In his CSLI lecture notes, Plotkin [24] showed how Scott Strachey denotational semantics could be reconciled with operational semantics by equipping his metalanguage (analogous to our M) with an operational semantics. He showed for a given object ....

Peter D. Mosses. Denotational semantics. In Jan Van Leeuven, editor, Handbook of Theoretical Computer Science, pages 575--631. Elsevier 1990.

....of any programming construct in a given model with the denotation of its translation in that model. The resulting semantics thus assigns a mathematical object to each programming construct in each model. This last aspect makes the paper fall within the tradition of Denotational Semantics [21, 20, 3, 19, 13, 22]. But we shall deviate considerably from the usual denotational approach by not making any use of the Scott domains which are ubiquitous in that tradition. A characteristic property of such domains is that they can be re exive, i.e. a domain D can be isomorphic to, and can in fact be identi ed ....

P. Mosses. Denotational Semantics. In A.J. van Leeuwen, editor, Handbook of Theoretical Computer Science, pages 577-632. Elsevier, Amsterdam, 1990.

....that is used to specify concrete syntax, for example: 7 ID EXP NAT EXP EXP EXP EXP fleftg EXP EXP EXP fleftg ( EXP ) EXP fbracketg Abstract syntax trees are then generated automatically from parsed strings. Denotational semantics (see [16] for a comprehensive text, or [11] for an introduction) has exploited various meta notations for specifying abstract syntax. Scott and Strachey [17] originally paid scant respect to syntax: they used ambiguous, indexed grammars, written in a variant of BNF; they assumed that languages come equipped with grouping parentheses so ....

P. D. Mosses. Denotational semantics. In J. van Leeuwen, A. Meyer, M. Nivat, M. Paterson, and D. Perrin, editors, Handbook of Theoretical Computer Science, volume B, chapter 11. Elsevier Science Publishers, Amsterdam; and MIT Press, 1990.

....elegant and powerful theory of denotational semantics, there are severe pragmatic problems with applying it to languages of the scale of Pascal, C, etc. These problems can be observed already in the descriptions of small illustrative languages given in pedagogical texts on denotational semantics [40, 61, 64]: when changes or extensions to the described language require changes to the definitions of the semantic domains, the original semantic equations may need to be completely reformulated. This is admittedly only a minor annoyance when dealing with small examples, but it becomes a serious hindrance ....

P. D. Mosses. Denotational semantics. In Handbook of Theoretical Computer Science, volume B, chapter 11. Elsevier Science Publishers, Amsterdam; and MIT

....and sequence points. No similar denotational approach is known to us. In the present paper we summarize the results of our research [28] aiming at the development of a complete and accurate formal description for the semantics of ANSI C. For this purpose, we have chosen the denotational approach [35,26] and employ monads and monad transformers [23,38,20] in order to improve the modularity and elegance of the developed semantics. Our formalization is based on the 1990 version of the standard and all references to paragraphs and pages are with respect to that version [14] The rest of the paper ....

P. D. Mosses. Denotational semantics. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, chapter 11, pages 577--631. Elsevier Science Publishers B.V., 1990.

.... 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 denoting ....

P. D. Mosses. Denotational semantics. In J. van Leewen, editor, Handbook of Theoretical Computer Science, volume B: Formal Models and Semantics, chapter 11, pages 577--631. The MIT Press, New York, N.Y., 1990.

....not a ect our approach. It works for theories axiomatizing the denotational semantics in the same way like for the operational semantics. However, often the operational semantics is closer related to a proof theoretic view while the denotational one is related to a model theoretic view, cf. e.g. Mos90] At the end of this section we give a brief discussion of formal frameworks given in the literature. For the concrete examples, a programming language with a logical background is easier to handle. For this reason, we work with Prolog. Moreover, since we would like to give an illustration of ....

Peter Mosses. Denotational semantics. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, Volume B, pages 575-631. Elsevier and MIT Press, 1990.

....for this notation seems to be the flavor of a natural language provided to the Algollike programming languages originally specified by such rules [Nau63] and its potential to disambiguate word expressions thus specified. SemanticsMacro used so far as semantics specification rules are denotations [Mos90] used in the study of semantics of programming languages, attributes [DJL88] used in compiler construction, semantics feature representations [Jac90,Hau99] used 33 in natural language processing, and derived operations [Jan86,Rus91] used in algebraic treatment of languages. The language ....

P. Mosses. Denotational semantics. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, pages 475--631. MIT Press/Elsevier, 1990.

....language with side effects or exceptions we have to redefine the operational denotational semantics every time we considered a different extension. The problem remains even when the semantics is given via translation in a typed lambda calculus: one would keep redefining the translation. In [Mos90] this problem is identified very clearly, and it is stressed how the use of auxiliary notation may help in making semantic definitions more reusable. Mog91] identifies monads as an important structuring device for denotational semantics (but not for operational semantics ) The basic idea is ....

P. Mosses. Denotational semantics. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, chapter 11. MIT press, 1990.

....same. Moreover this do not do anything with semantics: all this is syntax. In fact, the semantics of a language has to be given in relation with the meaning and this cannot be done by syntax. Formal semantics has been developed for logic languages [7] and adapted to computer programming languages [5] and knowledge representation systems [6] Logicians have developed powerful ways to provide the semantics of a language by model theory. Roughly, they provide a structural way to interpret a language in a domain. From a domain D, an interpretation function I is defined over the language to the ....

Peter Mosses, `Denotational semantics', in Hanbook of theoretical computer science, ed., Jean van Leeuwen, chapter 11, 575--631, Elsevier, (1990).

....design have to be compositional and have to express the described functional behaviour. Denotational semantic models are compositional and they are the most suitable formal semantic models when described functional behaviour have to be expressed. Denotational semantic models consist of three parts [11]: abstract syntax . semantic algebra s . valuation functions. Mathematical representations of the semantics form the semantic domains. These domains together with some operations are the semantic algebra s. Valuation functions map syntax elements into the semantic domains. 4: Denotational ....

P.D. Mosses, Denotational Semantics, in: J. van Leeuwen eds.,Formal Models and Semantics, Handbook of Theoretical Comp. Sc. Volume B, Elsevier Science Publishers, North-Holland,1990, pp. 577- 631.

No context found.

P. D. Mosses. Denotational semantics. In Handbook of Theoretical Computer Science, volume B, chapter 11. Elsevier Science Publishers, Amsterdam; and MIT Press, 1990.

No context found.

Peter D. Mosses. Denotational semantics. In J. van Leeuwen, A. Meyer, M. Nivat, M. Paterson, and D. Perrin, editors, Handbook of Theoretical Computer Science, volume B, chapter 11. Elsevier Science Publishers, Amsterdam; and MIT Press, 1990.

....it is assumed that the reader has some familiarity with the concepts and notation of denotational and structural operational semantics. Familiarity with the basic notions of monads and monad transformers is not a prerequisite. 1 Modularity in Denotational Semantics It is well known [5, 12, 13, 22] that the cause of poor modularity in conventional denotational semantic descriptions is the unrestricted use of (typed) notation to specify semantic entities. When the described language is extended with unanticipated new constructs, the domains of denotations may need to be changed, and then ....

P. D. Mosses. Denotational semantics. In Handbook of Theoretical Computer Science, volume B, chapter 11. Elsevier Science Publishers, Amsterdam; and MIT Press, 1990.

No context found.

Peter D. Mosses. Denotational semantics. In Handbook of Theoretical Computer Science, Volume B: Formal Models and Semantics, chapter 11, pages 575--631. MIT Press, December 1990.

No context found.

P. D. Mosses. Denotational semantics. In Handbook of Theoretical Computer Science, Vol. B. North-Holland, 1990.

No context found.

P. D. Mosses. Denotational semantics. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B: Formal Models and Semantics, pages 575--631. Elsevier, Amsterdam, 1990.

No context found.

Mosses P.D.: "Denotational Semantics." Chapter 11 in Handbook of Theoretical Computer Science, Volume B: "Formal Models and Semantics". Edited J. van Leeuwen. Elsevier Science Publishers B.V., 1990, pp. 575-631.

No context found.

P. D. Mosses. Denotational semantics. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B: Formal Models and Semantics, chapter 11, pages 575-632. Elsevier Science Publishers B.V., 1990.

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