L. Aceto and A. Ingolfsdottir, CPO Models for GSOS Languages---Part I: Compact GSOS Languages, in Inf. and Comp., Vol. 129, No. 2, pp. 107--141, 1994. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Bialgebraic Semantics and Recursion - Plotkin (Correct)
....much less expected was the need to give up defining bisimulations in terms of spans of functional bisimulations, and move to a relational view. Even so the outcome is not yet satisfactory because of well known di#culties involved in prebisimulations. Our work can be compared to, e.g. that of [2]. The principal di#erence is that we aim, following [9] at a conceptual overview of the area using appropriate categorical tools. The main idea of [9] is to represent rules for operational semantics by a natural transformation: # : #(X BX) # BTX where # is the signature functor associated to ....
....by B. # This work has been done with the support of EPSRC grant GR M56333: The Structure of Programming Languages: Syntax and Semantics. Turning to recursion we need first to consider syntax. One way would be to add terms x. t to the usual algebraic terms over a given signature #, as in [2]. However, taken literally, we would then also have to incorporate an extension of the framework to handle binding operators, as in [5] While that would be interesting, it would obscure the issues caused by recursion; we prefer to consider infinite terms, regarding the terms as syntactic sugar ....
[Article contains additional citation context not shown here]
L. Aceto and A. Ingolfsdottir, CPO Models for GSOS Languages---Part I: Compact GSOS Languages, in Inf. and Comp., Vol. 129, No. 2, pp. 107--141, 1994.
Axiomatizing GSOS with termination - Baeten, de Vink (Correct)
....question concerns the application of the tagh format in the setting of metric semantics and co induction (cf. BV96, Rut00] In this paper we have focussed on transition systems and their axiomatizations. Another view is to consider transition systems and denotational models (see, for example, [Rut90, AI96, TP97]) We believe, having the correspondence of the syntactic with the empty semantical process p of metric domain equations, it should be feasible to automatically construct higher order or co inductive de nitions for semantical operators and a denotational semantics that is correct with respect ....
L. Aceto and A. Ingolfsdottir. CPO models for GSOS-languages{Part I: compact GSOS languages. Information and Computation, 129:107-141, 1996.
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