Results 1 
6 of
6
Final Semantics for a Higher Order Concurrent Language
 CAAP'96 Conference Proceedings, H.Kirchner ed., Springer LNCS
, 1995
"... We show that adequate semantics can be provided for imperative higher order concurrent languages simply using syntactical final coalgebras. In particular we investigate and compare various behavioural equivalences on higher order processes defined by finality using hypersets and c.m.s.'s. Correspond ..."
Abstract

Cited by 15 (11 self)
 Add to MetaCart
We show that adequate semantics can be provided for imperative higher order concurrent languages simply using syntactical final coalgebras. In particular we investigate and compare various behavioural equivalences on higher order processes defined by finality using hypersets and c.m.s.'s. Correspondingly, we derive various coinduction and mixed inductioncoinduction proof principles for establishing these equivalences.
Processes and Hyperuniverses
 Proceedings of the 19th Symposium on Mathematical Foundations of Computer Science 1994, volume 841 of LNCS
, 1994
"... . We show how to define domains of processes, which arise in the denotational semantics of concurrent languages, using hypersets, i.e. nonwellfounded sets. In particular we discuss how to solve recursive equations involving settheoretic operators within hyperuniverses with atoms. Hyperuniverses ar ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
. We show how to define domains of processes, which arise in the denotational semantics of concurrent languages, using hypersets, i.e. nonwellfounded sets. In particular we discuss how to solve recursive equations involving settheoretic operators within hyperuniverses with atoms. Hyperuniverses are transitive sets which carry a uniform topological structure and include as a clopen subset their exponential space (i.e. the set of their closed subsets) with the exponential uniformity. This approach allows to solve many recursive domain equations of processes which cannot be even expressed in standard ZermeloFraenkel Set Theory, e.g. when the functors involved have negative occurrences of the argument. Such equations arise in the semantics of concurrrent programs in connection with function spaces and higher order assignment. Finally, we briefly compare our results to those which make use of complete metric spaces, due to de Bakker, America and Rutten. Introduction In the Semantics of ...
Themes in Final Semantics
 Dipartimento di Informatica, Università di
, 1998
"... C'era una volta un re seduto in canap`e, che disse alla regina raccontami una storia. La regina cominci`o: "C'era una volta un re seduto in canap`e ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
C'era una volta un re seduto in canap`e, che disse alla regina raccontami una storia. La regina cominci`o: "C'era una volta un re seduto in canap`e
From Branching to Linear Metric Domains (and back
 6th Nordic Workshop on Programming Theory, NWPT '6 Proceedings
, 1995
"... is permitted for educational or research use on condition that this copyright notice is included in any copy. See back inner page for a list of recent publications in the BRICS Report Series. Copies may be obtained by contacting: BRICS ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
is permitted for educational or research use on condition that this copyright notice is included in any copy. See back inner page for a list of recent publications in the BRICS Report Series. Copies may be obtained by contacting: BRICS
A fixed point theorem in a category of compact metric spaces
 Theoretical Computer Science
, 1995
"... Various results appear in the literature for deriving existence and uniqueness of fixed points for endofunctors on categories of complete metric spaces. All these results are proved for contracting functors which satisfy some further requirements, depending on the category in question. Following a n ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Various results appear in the literature for deriving existence and uniqueness of fixed points for endofunctors on categories of complete metric spaces. All these results are proved for contracting functors which satisfy some further requirements, depending on the category in question. Following a new kind of approach, based on the notion of ηisometry, we show that the sole hypothesis of contractivity is enough for proving existence and uniqueness of fixed points for endofunctors on the category of compact metric spaces and embeddingprojection pairs. 1
A Theory of Metric Labelled Transition Systems
 Papers on General Topology and Applications: 11th Summer Conference at the University of Southern Maine, volume 806 of Annals of the New York Academy of Sciences
, 1995
"... Labelled transition systems are useful for giving semantics to programming languages. Kok and Rutten have developed some theory to prove semantic models defined by means of labelled transition systems to be equal to other semantic models. Metric labelled transition systems are labelled transition sy ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Labelled transition systems are useful for giving semantics to programming languages. Kok and Rutten have developed some theory to prove semantic models defined by means of labelled transition systems to be equal to other semantic models. Metric labelled transition systems are labelled transition systems with the configurations and actions endowed with metrics. The additional metric structure allows us to generalize the theory developed by Kok and Rutten. Introduction The classical result due to Banach [Ban22] that a contractive function from a nonempty complete metric space to itself has a unique fixed point plays an important role in the theory of metric semantics for programming languages. Metric spaces and Banach's theorem were first employed by Nivat [Niv79] to give semantics to recursive program schemes. Inspired by the work of Nivat, De Bakker and Zucker [BZ82] gave semantics to concurrent languages by means of metric spaces. The metric spaces they used were defined as solutio...