P. Mosses. Denotational semantics. Technical Report DAIMI-PB-276, CS Dept., Aarhus University, 1989. to appear in North Holland Handbook of Theoretical Computer Science. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Metalanguages and Applications - Moggi (1995) (9 citations) (Correct)
.... up to strong bisimulation) TX = X 0 :P fin ( X X 0 ) S) S , which captures parallel imperative programs (in fact TX is closely related to resumptions) One could give further examples (in the category of cpos) based on the denotational semantics for various programming languages (see [Sch86, GS89, Mos89]) To exemplify the use of computational types, for each of the programming languages introduced in Section 1 we de ne a translation into a metalanguage ML T ( with computational types, for a suitable choice of , and indicate a possible interpretation for computational types and . More ....
P. Mosses. Denotational semantics. Technical Report DAIMI-PB-276, CS Dept., Aarhus University, 1989. to appear in North Holland Handbook of Theoretical Computer Science.
Notions of Computation and Monads - Moggi (1989) (83 citations) (Correct)
....only after developing a semantics based on mathematical structures rather than term models, but it does not give clear criteria to single out the general principles among the properties satis ed by the model. Moreover, the theory at the heart of Denotational Semantics, i.e. Domain Theory (see [GS89, Mos89]) has focused on the mathematical structures for giving semantics to recursive de nitions of types and functions (see [SP82] while other structures, that might be relevant to a better understanding of programming languages, have been overlooked. This paper identify one of such structures, i.e. ....
....the set of U branching trees with nite branches and A labelled leaves interactive output TA = A (U ) More explicitly TA is (isomorphic to) U A. Further examples (in a category of cpos) could be given based on the denotational semantics for various programming languages (see [Sch86, GS89, Mos89]) Rather than focusing on a speci c T , we want to nd the general properties common to all notions of computation, therefore we impose as only requirement that programs should form a category. The aim of this section is to convince the reader, with a sequence of informal argumentations, that ....
P. Mosses. Denotational semantics. Technical Report MS-CIS-89-16, Dept. of Comp. and Inf. Science, Univ. of Pennsylvania, 1989. to appear in North Holland Handbook of Theoretical Computer Science.
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