Results 1 
5 of
5
Domain Theory and the Logic of Observable Properties
, 1987
"... The mathematical framework of Stone duality is used to synthesize a number of hitherto separate developments in Theoretical Computer Science: • Domain Theory, the mathematical theory of computation introduced by Scott as a foundation for denotational semantics. • The theory of concurrency and system ..."
Abstract

Cited by 41 (5 self)
 Add to MetaCart
The mathematical framework of Stone duality is used to synthesize a number of hitherto separate developments in Theoretical Computer Science: • Domain Theory, the mathematical theory of computation introduced by Scott as a foundation for denotational semantics. • The theory of concurrency and systems behaviour developed by Milner, Hennessy et al. based on operational semantics. • Logics of programs. Stone duality provides a junction between semantics (spaces of points = denotations of computational processes) and logics (lattices of properties of processes). Moreover, the underlying logic is geometric, which can be computationally interpreted as the logic of observable properties—i.e. properties which can be determined to hold of a process on the basis of a finite amount of information about its execution. These ideas lead to the following programme: 1. A metalanguage is introduced, comprising
Combining effects: sum and tensor
"... We seek a unified account of modularity for computational effects. We begin by reformulating Moggi’s monadic paradigm for modelling computational effects using the notion of enriched Lawvere theory, together with its relationship with strong monads; this emphasises the importance of the operations ..."
Abstract

Cited by 30 (4 self)
 Add to MetaCart
We seek a unified account of modularity for computational effects. We begin by reformulating Moggi’s monadic paradigm for modelling computational effects using the notion of enriched Lawvere theory, together with its relationship with strong monads; this emphasises the importance of the operations that produce the effects. Effects qua theories are then combined by appropriate bifunctors on the category of theories. We give a theory for the sum of computational effects, which in particular yields Moggi’s exceptions monad transformer and an interactive input/output monad transformer. We further give a theory of the commutative combination of effects, their tensor, which yields Moggi’s sideeffects monad transformer. Finally we give a theory of operation transformers, for redefining operations when adding new effects; we derive explicit forms for the operation transformers associated to the above monad transformers.
On the Finitary Bisimulation
 Nils Klarlund, Madhavan Mukund, and Milind Sohoni
, 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 4 (0 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
On The Finitary Bisimulation
, 1995
"... The finitely observable, or finitary, part of bisimulation is a key tool in establishing full abstraction results for denotational semantics for process algebras with respect to bisimulationbased preorders. A bisimulationlike characterization of this relation for arbitrary transition systems is ..."
Abstract
 Add to MetaCart
The finitely observable, or finitary, part of bisimulation is a key tool in establishing full abstraction results for denotational semantics for process algebras with respect to bisimulationbased preorders. A bisimulationlike characterization of this relation for arbitrary transition systems is given, relying on Abramsky's characterization in terms of the finitary domain logic. More informative behavioural, observationindependent characterizations of the finitary bisimulation are also offered for several interesting classes of transition systems. These include transition systems with countable action sets, those that have bounded convergent sort and the sortfinite ones. The result for sortfinite transition systems sharpens a previous behavioural characterization of the finitary bisimulation for this class of structures given by Abramsky.
UNC is an Equal Opportunity/Affirmative Action Institution. Practical Higherorder Functional a nd Logic Programming based o n Lambda Calculus and Set Abstract ioni
, 1988
"... This dissertation addresses the unification of functional and logic programming. We concentrate on the role of set abstraction in this integration. The proposed approach combines the expressive power of lazy higherorder functional programming with not only firstorder Rom logic, but also a useful s ..."
Abstract
 Add to MetaCart
This dissertation addresses the unification of functional and logic programming. We concentrate on the role of set abstraction in this integration. The proposed approach combines the expressive power of lazy higherorder functional programming with not only firstorder Rom logic, but also a useful subset of higherorder Horn logic. Set abstractions take the place of Horn logic predicates. Like functions, they are firstclass objects. The denota~io nal semantics of traditional functional programming languages is based on an extended lambda calculus. Set abstractions are added to the semantic domain via angelic powerdomains, which are compatible with lazy evaluation and are welldefined over even nonflat (higherorder) domains. From the denotational equations we derive an equivalent operational semantics. A new computation rule more efficient than the paralleloutermost rule is developed and proven to be a correct computation rule for this type of language. Concepts from resolution are generalized to provide efficient computation of set abstractions. T he implementation avoids computationally explosive primitives such as