Add to ORKGThis paper focuses on the issue of modelling sequential composition in denotational linear time semantics for (nondeterministic) languages which admit infinite computations. This operator deserves special attention as it causes problems to meet the requirements of a standard denotational semantics based on metric or cpo. We present a general framework for the treatment of sequential composition. It turns out that a program can be described by its maximal computations in the metric approach whereas the partial order approach is suitable to describe a program by all its partial computations
AbstractOperational and denotational semantic models are designed for languages with process creatio...
A denotational, hence, compositional semantics for a subset of Concurrent Prolog is developed and re...
We present a variety of denotational linear time semantics for a language with recursion and true co...
This paper focuses on the issue of modelling sequential composition in denotational linear time sema...
AbstractWe consider two ways of assigning semantics to a class of statements built from a set of ato...
We consider two ways of assigning semantics to a class of statements built from a set of atomic acti...
We study the semantics of a simple language with concurrency and recursion. Our semantic domain cons...
AbstractWe provide a sequential denotational semantics for sequential programming languages, based o...
AbstractOur focus is on the semantics of programming and specification languages. Over the years, di...
AbstractWe investigate the implications of choosing a cpo-framework resp. a complete metric space fr...
AbstractComplete partial orders have been used for a long time for defining semantics of programming...
AbstractIn order to define semantics of non deterministic recursive programs we are led to consider ...
Abstract. In this paper we study a special operator for sequential compo-sition, which is dened rela...
AbstractThis paper shows the equivalence of two semantics for a version of Concurrent Prolog with no...
We initially establish a fundamental connection between the semantic theories of concurrency and com...
AbstractOperational and denotational semantic models are designed for languages with process creatio...
A denotational, hence, compositional semantics for a subset of Concurrent Prolog is developed and re...
We present a variety of denotational linear time semantics for a language with recursion and true co...
This paper focuses on the issue of modelling sequential composition in denotational linear time sema...
AbstractWe consider two ways of assigning semantics to a class of statements built from a set of ato...
We consider two ways of assigning semantics to a class of statements built from a set of atomic acti...
We study the semantics of a simple language with concurrency and recursion. Our semantic domain cons...
AbstractWe provide a sequential denotational semantics for sequential programming languages, based o...
AbstractOur focus is on the semantics of programming and specification languages. Over the years, di...
AbstractWe investigate the implications of choosing a cpo-framework resp. a complete metric space fr...
AbstractComplete partial orders have been used for a long time for defining semantics of programming...
AbstractIn order to define semantics of non deterministic recursive programs we are led to consider ...
Abstract. In this paper we study a special operator for sequential compo-sition, which is dened rela...
AbstractThis paper shows the equivalence of two semantics for a version of Concurrent Prolog with no...
We initially establish a fundamental connection between the semantic theories of concurrency and com...
AbstractOperational and denotational semantic models are designed for languages with process creatio...
A denotational, hence, compositional semantics for a subset of Concurrent Prolog is developed and re...
We present a variety of denotational linear time semantics for a language with recursion and true co...