Results 1 
9 of
9
Domain Theory in Logical Form
 Annals of Pure and Applied Logic
, 1991
"... 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 229 (10 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:
A Theory of Recursive Domains with Applications to Concurrency
 In Proc. of LICS ’98
, 1997
"... Marcelo Fiore , Glynn Winskel (1) BRICS , University of Aarhus, Denmark (2) LFCS, University of Edinburgh, Scotland December 1997 Abstract We develop a 2categorical theory for recursively defined domains. ..."
Abstract

Cited by 23 (14 self)
 Add to MetaCart
Marcelo Fiore , Glynn Winskel (1) BRICS , University of Aarhus, Denmark (2) LFCS, University of Edinburgh, Scotland December 1997 Abstract We develop a 2categorical theory for recursively defined domains.
Constructive algebraic integration theory without choice. Dagstuhl proceedings
 Mathematics, Algorithms, Proofs, number 05021 in Dagstuhl Seminar Proceedings. Internationales Begegnungs und Forschungszentrum (IBFI), Schloss Dagstuhl
, 2005
"... Abstract. We present a constructive algebraic integration theory. The theory is constructive in the sense of Bishop, however we avoid the axiom of countable, or dependent, choice. Thus our results can be interpreted in any topos. Since we avoid impredicative methods the results may also be interpret ..."
Abstract

Cited by 8 (5 self)
 Add to MetaCart
Abstract. We present a constructive algebraic integration theory. The theory is constructive in the sense of Bishop, however we avoid the axiom of countable, or dependent, choice. Thus our results can be interpreted in any topos. Since we avoid impredicative methods the results may also be interpreted in MartinL type theory or in a predicative topos in the sense of Moerdijk and Palmgren. We outline how to develop most of Bishop’s theorems on integration theory that do not mention points explicitly. Coquand’s constructive version of the Stone representation theorem is an important tool in this process. It is also used to give a new proof of Bishop’s spectral theorem.
An Australian conspectus of higher categories

, 2004
"... Much Australian work on categories is part of, or relevant to, the development of higher categories and their theory. In this note, I hope to describe some of the origins and achievements of our efforts that they might perchance serve as a guide to the development of aspects of higherdimensional wo ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
Much Australian work on categories is part of, or relevant to, the development of higher categories and their theory. In this note, I hope to describe some of the origins and achievements of our efforts that they might perchance serve as a guide to the development of aspects of higherdimensional work. I trust that the somewhat autobiographical style will add interest rather than be a distraction. For so long I have felt rather apologetic when describing how categories might be helpful to other mathematicians; I have often felt even worse when mentioning enriched and higher categories to category theorists. This is not to say that I have doubted the value of our work, rather that I have felt slowed down by the continual pressure to defend it. At last, at this meeting, I feel justified in speaking freely amongst motivated researchers who know the need for the subject is well established. Australian Category Theory has its roots in homology theory: more precisely, in the treatment of the cohomology ring and the Künneth formulas in the book by Hilton and Wylie [HW]. The first edition of the book had a mistake concerning the cohomology ring of a product. The Künneth formulas arise from splittings of the natural short exact sequences
Localic completion of generalized metric spaces I
, 2005
"... Abstract. Following Lawvere, a generalized metric space (gms) is a set X equipped with a metric map from X 2 to the interval of upper reals (approximated from above but not from below) from 0 to ∞ inclusive, and satisfying the zero selfdistance law and the triangle inequality. We describe a complet ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Abstract. Following Lawvere, a generalized metric space (gms) is a set X equipped with a metric map from X 2 to the interval of upper reals (approximated from above but not from below) from 0 to ∞ inclusive, and satisfying the zero selfdistance law and the triangle inequality. We describe a completion of gms’s by Cauchy filters of formal balls. In terms of Lawvere’s approach using categories enriched over [0, ∞], the Cauchy filters are equivalent to flat left modules. The completion generalizes the usual one for metric spaces. For quasimetrics it is equivalent to the Yoneda completion in its netwise form due to Künzi and Schellekens and thereby gives a new and explicit characterization of the points of the Yoneda completion. Nonexpansive functions between gms’s lift to continuous maps between the completions. Various examples and constructions are given, including finite products. The completion is easily adapted to produce a locale, and that part of the work is constructively valid. The exposition illustrates the use of geometric logic to enable pointbased reasoning for locales. 1.
Quantitative Concept Analysis
"... Abstract. Formal Concept Analysis (FCA) begins from a context, given as a binary relation between some objects and some attributes, and derives a lattice of concepts, where each concept is given as a set of objects and a set of attributes, such that the first set consists of all objects that satisfy ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. Formal Concept Analysis (FCA) begins from a context, given as a binary relation between some objects and some attributes, and derives a lattice of concepts, where each concept is given as a set of objects and a set of attributes, such that the first set consists of all objects that satisfy all attributes in the second, and vice versa. Many applications, though, provide contexts with quantitative information, telling not just whether an object satisfies an attribute, but also quantifying this satisfaction. Contexts in this form arise as rating matrices in recommender systems, as occurrence matrices in text analysis, as pixel intensity matrices in digital image processing, etc. Such applications have attracted a lot of attention, and several numeric extensions of FCA have been proposed. We propose the framework of proximity sets (proxets), which subsume partially ordered sets (posets) as well as metric spaces. One feature of this approach is that it extracts from quantified contexts quantified concepts, and thus allows full use of the available information. Another feature is that the categorical approach allows analyzing any universal properties that the classical FCA and the new versions may have, and thus provides structural guidance for aligning and combining the approaches.
Bicompletions of Distance Matrices To Samson Abramsky on the occasion of his 60th birthday
"... Abstract. In the practice of information extraction, the input data are usually arranged into pattern matrices, and analyzed by the methods of linear algebra and statistics, such as principal component analysis. In some applications, the tacit assumptions of these methods lead to wrong results. The ..."
Abstract
 Add to MetaCart
Abstract. In the practice of information extraction, the input data are usually arranged into pattern matrices, and analyzed by the methods of linear algebra and statistics, such as principal component analysis. In some applications, the tacit assumptions of these methods lead to wrong results. The usual reason is that the matrix composition of linear algebra presents information as flowing in waves, whereas it sometimes flows in particles, which seek the shortest paths. This waveparticle duality in computation and information processing has been originally observed by Abramsky. In this paper we pursue a particle view of information, formalized in distance spaces, which generalize metric spaces, but are slightly less general than Lawvere’s generalized metric spaces. In this framework, the task of extracting the ’principal components ’ from a given matrix of data boils down to a bicompletion, in the sense of enriched category theory. We describe the bicompletion construction for distance matrices. The practical goal that motivates this research is to develop a method to estimate the hardness of attack constructions in security. 1
A UNIFIED APPROACH TO THE THEORY OF NORMED STRUCTURES PART I: THE SINGLESORTED CASE
"... Abstract. We introduce the concept of a prenormed model of a particular kind of singlesorted finitary firstorder theories, interpreted over a category with finite products. These are referred to as prealgebraic theories, for the fact that their signature comprises, together with arbitrary function ..."
Abstract
 Add to MetaCart
Abstract. We introduce the concept of a prenormed model of a particular kind of singlesorted finitary firstorder theories, interpreted over a category with finite products. These are referred to as prealgebraic theories, for the fact that their signature comprises, together with arbitrary function symbols (of finite ariety), only relation symbols whose interpretation, in any possible model, is a reflexive and transitive binary relation, namely a preorder. The result is an abstract approach to the very notion of norm and, consequently, to the theory of normed structures. hal00696491, version 3 22 May 2012 1.
Towards Measurable Types for Dynamical Process Modeling Languages
, 2010
"... Process modeling languages such as “Dynamical Grammars ” are highly expressive in the processes they model using stochastic and deterministic dynamical systems, and can be given formal semantics in terms of an operator algebra. However such process languages may be more limited in the types of objec ..."
Abstract
 Add to MetaCart
Process modeling languages such as “Dynamical Grammars ” are highly expressive in the processes they model using stochastic and deterministic dynamical systems, and can be given formal semantics in terms of an operator algebra. However such process languages may be more limited in the types of objects whose dynamics is easily expressible. For many applications in biology, the dynamics of spatial objects in particular (including combinations of discrete and continuous spatial structures) should be formalizable at a high level of abstraction. We suggest that this may be achieved by formalizating such objects within a type system endowed with type constructors suitable for complex dynamical objects. To this end we review and illustrate the operator algebraic formulation of heterogeneous process modeling and semantics, extending it to encompass partial differential equations and intrinsic graph grammar dynamics. We show that in the operator approach to heterogeneous dynamics, types require integration measures. From this starting point, “measurable ” object types can be enriched with generalized metrics under which approximation can be defined. The resulting measurable and “metricated ” types can be built up systematically by type constructors such as vectors, products, and labelled graphs. We find conditions under which functions and quotients can be added as constructors of measurable and metricated types. 1 Measureable Types V25.nb 1