Results 11  20
of
69
The expression lemma ⋆
"... Abstract. Algebraic data types and catamorphisms (folds) play a central role in functional programming as they allow programmers to define recursive data structures and operations on them uniformly by structural recursion. Likewise, in objectoriented (OO) programming, recursive hierarchies of objec ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
Abstract. Algebraic data types and catamorphisms (folds) play a central role in functional programming as they allow programmers to define recursive data structures and operations on them uniformly by structural recursion. Likewise, in objectoriented (OO) programming, recursive hierarchies of object types with virtual methods play a central role for the same reason. There is a semantical correspondence between these two situations which we reveal and formalize categorically. To this end, we assume a coalgebraic model of OO programming with functional objects. The development may be helpful in deriving refactorings that turn sufficiently disciplined functional programs into OO programs of a designated shape and vice versa. Key words: expression lemma, expression problem, functional object, catamorphism, fold, the composite design pattern, program calculation, distributive law, free monad, cofree comonad. 1
A Unified SheafTheoretic Account Of NonLocality and Contextuality
, 2011
"... A number of landmark results in the foundations of quantum mechanics show that quantum systems exhibit behaviour that defies explanation in classical terms, and that cannot be accounted for in such terms even by postulating “hidden variables” as additional unobserved factors. Much has been written o ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
A number of landmark results in the foundations of quantum mechanics show that quantum systems exhibit behaviour that defies explanation in classical terms, and that cannot be accounted for in such terms even by postulating “hidden variables” as additional unobserved factors. Much has been written on these matters, but there is surprisingly little unanimity even on basic definitions or the interrelationships among the various concepts and results. We use the mathematical language of sheaves and monads to give a very general and mathematically robust description of the behaviour of systems in which one or more measurements can be selected, and one or more outcomes observed. We say that an empirical model is extendable if it can be extended consistently to all sets of measurements, regardless of compatibility. A hiddenvariable model is factorizable if, for each value of the hidden variable, it factors as a product of distributions on the basic measurements. We prove that an empirical model is extendable if and only if there is a factorizable hiddenvariable model which realizes it. From this we are able to prove generalized versions of wellknown NoGo theorems. At the conceptual level, our equivalence result says that the existence of incompatible measurements is the essential ingredient in nonlocal and contextual behavior in quantum mechanics.
Formal Specification of Substitutability Property for FaultTolerance in Reactive Autonomic Systems
"... Abstract. MultiAgent Systems (MAS) have been widely proposed and applied to various application domains, where traditional approaches are impractical, such as space exploration missions. MAS can offer greater redundancy, efficiency, and scalability; however, they also raise new challenges, such as ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
Abstract. MultiAgent Systems (MAS) have been widely proposed and applied to various application domains, where traditional approaches are impractical, such as space exploration missions. MAS can offer greater redundancy, efficiency, and scalability; however, they also raise new challenges, such as complex and often unexpected emergent group behavior, which require a formal specification as well as verification. Therefore, we have proposed a formal approach, named Reactive Autonomic Systems Framework (RASF), based on category theory to tackle those challenges. In this paper, we focus on the formal specification of substitutability property for the faulttolerance and illustrate our approach through a Marsworld case study implemented as MAS using JADEX.
Generalized Topological Semantics for FirstOrder Modal Logic
, 2010
"... This dissertation provides a new semantics for firstorder modal logic. It is philosophically motivated by the epistemic reading of modal operators and, in particular, three desiderata in the analysis of epistemic modalities. (i) The semantic modelling of epistemic modalities, in particular verifia ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
This dissertation provides a new semantics for firstorder modal logic. It is philosophically motivated by the epistemic reading of modal operators and, in particular, three desiderata in the analysis of epistemic modalities. (i) The semantic modelling of epistemic modalities, in particular verifiability and falsifiability, cannot be properly achieved by Kripke’s relational notion of accessibility. It requires instead a more general, topological notion of accessibility. (ii) Also, the epistemic reading of modal operators seems to require that we combine modal logic with fully classical firstorder logic. For this purpose, however, Kripke’s semantics for quantified modal logic is inadequate; its logic is free logic as opposed to classical logic. (iii) More importantly, Kripke’s semantics comes with a restriction that is too strong to let us semantically express, for instance, that the identity of Hesperus and Phosphorus, even if metaphysically necessary, can still be a matter of epistemic discovery. To provide a semantics that accommodates the three desiderata, I show, on the one hand, how the desideratum (i) can be achieved with topological semantics, and more generally neighborhood semantics, for propositional modal logic. On the other hand, to achieve (ii) and (iii), it turns out
MSc in Logic
, 2010
"... under the supervision of Prof.dr J. F. A. K. van Benthem, and submitted to the Board of ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
under the supervision of Prof.dr J. F. A. K. van Benthem, and submitted to the Board of
Are Newtonian Gravitation and Geometrized Newtonian Gravitation Theoretically Equivalent?
"... I argue that a criterion of theoretical equivalence due to Clark Glymour [Noûs 11(3), 227– 251 (1977)] does not capture an important sense in which two theories may be equivalent. I then motivate and state an alternative criterion that does capture the sense of equivalence I have in mind. The princ ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
I argue that a criterion of theoretical equivalence due to Clark Glymour [Noûs 11(3), 227– 251 (1977)] does not capture an important sense in which two theories may be equivalent. I then motivate and state an alternative criterion that does capture the sense of equivalence I have in mind. The principal claim of the paper is that relative to this second criterion, the answer to the question posed in the title is “yes”, at least on one natural understanding of Newtonian gravitation.
Operational Theories and Categorical Quantum Mechanics
, 2013
"... A central theme in current work in quantum information and quantum foundations is to see quantum mechanics as occupying one point in a space of possible theories, and to use this perspective to understand the special features and properties which single it out, and the possibilities for alternative ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
A central theme in current work in quantum information and quantum foundations is to see quantum mechanics as occupying one point in a space of possible theories, and to use this perspective to understand the special features and properties which single it out, and the possibilities for alternative theories. Two formalisms which have been used in this context are operational theories, and categorical quantum mechanics. The aim of the present paper is to establish strong connections between these two formalisms. We show how models of categorical quantum mechanics have representations as operational theories. We then show how nonlocality can be formulated at this level of generality, and study a number of examples from this point of view, including Hilbert spaces, sets and relations, and stochastic maps. The local, quantum, and nosignalling models are characterized in these terms.
Reoccurring Patterns in Hierarchical Protein Materials and Music: The Power of Analogies
, 2011
"... Abstract Complex hierarchical structures composed of simple nanoscale building blocks form the basis of most biological materials. Here, we demonstrate how analogies between seemingly different fields enable the understanding of general principles by which functional properties in hierarchical syste ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
Abstract Complex hierarchical structures composed of simple nanoscale building blocks form the basis of most biological materials. Here, we demonstrate how analogies between seemingly different fields enable the understanding of general principles by which functional properties in hierarchical systems emerge, similar to an analogy learning process. Specifically, natural hierarchical materials like spider silk exhibit properties comparable to classical music in terms of their hierarchical structure and function. As a comparative tool, here, we apply hierarchical ontology logs that follow a rigorous mathematical formulation based on category theory to provide an insightful system representation by expressing knowledge in a conceptual map. We
DISTRIBUTIVE LAWS IN PROGRAMMING STRUCTURES
, 2009
"... Generalised Distributive laws in Computer Science are rules governing the transformation of one programming structure into another. In programming, they are programs satisfying certain formal conditions. Their importance has been to date documented in several isolated cases by diverse formal approac ..."
Abstract
 Add to MetaCart
Generalised Distributive laws in Computer Science are rules governing the transformation of one programming structure into another. In programming, they are programs satisfying certain formal conditions. Their importance has been to date documented in several isolated cases by diverse formal approaches. These applications have always meant leaps in understanding the nature of the subject. However, distributive laws have not yet been given the attention they deserve. One of the reasons for this omission is certainly the lack of a formal notion of distributive laws in their full generality. This hinders the discovery and formal description of occurrences of distributive laws, which is the precursor of any formal manipulation. In this thesis, an approach to formalisation of distributive laws is presented based on the functorial approach to formal Category Theory pioneered by Lawvere and others, notably Gray. The proposed formalism discloses a rather simple nature of distributive laws of the kind found in programming structures based on lax 2naturality and Gray’s tensor product of 2categories. It generalises the existing more specific notions of distributive