We argue that symmetric (semi)monoidal comonads provide a means to structure context-dependent notions of computation such as notions of dataflow computation (computation on streams) and of tree relabelling as in attribute evaluation. We propose a generic semantics for extensions of simply typed lambda calculus with context-dependent operations analogous to the Moggi-style semantics for effectf...

In this paper, we address the equivalence of the analytic and probabilistic notions of harmonicity in the context of general symmetric Hunt processes on locally compact separable metric spaces. Extensions to general symmetric right processes on Lusin spaces including infinite dimensional spaces are mentioned at the end of this paper. AMS 2000 Mathematics Subject Classification: Primary 60J45, 3...

This is a philosophical analysis of commonly held notions and concepts about thinking and mind. The empirically derived notions are inadequate and insufficient for a deeper understanding of thought itself, but this prephilosophical understanding of thinking leads to a more refined and profound distinction of different forms of thought and their prominent common features of aspectuality and rela...

Secure multi-party computation (MPC, for short) is a powerful cryptographic concept which lets mutually distrusting parties collaborate without compromising their private information (beyond what is required by the functionality for which they collaborate). The functionality allowed in such a collaboration is so general that MPC subsumes virtually all other cryptographic tasks. Much of the two ...

Testability, and design for testability, are widely discussed practical issues in software engineering, especially in protocol engineering. Existing definitions (or circumscriptions) of testability seem to be either quite vague, or, if more or less formal, then dedicated only to very special system models. Testability is usually decomposed into aspects like observability and controllability, an...

Categorical universal algebra can be developed either using Lawvere theories (single-sorted finite product theories) or using monads, and the category of Lawvere theories is equivalent to the category of finitary monads on Set. We show how this equivalence, and the basic results of universal algebra, can be generalized in three ways: replacing Set by another category, working in an enriched set...

We deene and discuss various conceivable notions of induc-tive validity for rst-order equational clauses. This is done within the framework of constructor-based positive/negative conditional equational speciications which permits to treat negation and incomplete function deenitions in an adequate and natural fashion. Moreover, we show that under some reasonable assumptions all these notions are...

The key-generation algorithm for the RSA cryptosystem is specified in several standards, such as PKCS#1, IEEE 1363-2000, FIPS 186-3, ANSI X9.44, or ISO/IEC 18033-2. All of them substantially differ in their requirements. This indicates that for computing a “secure” RSA modulus it does not matter how exactly one generates RSA integers. In this work we show that this is indeed the case to a large...

We consider several ordinal formulations of submodularity, defined for arbitrary binary relations on lattices. Two of these formulations are essentially due to David Kreps (A Representation Theorem for “Preference for Flexibility”, Econometrica, 1979) and one is a weakening of a notion due to Paul Milgrom and Chris Shannon (Monotone Comparative Statics, Econometrica, 1994). We show that any ref...

Five algebraic notions of termination are formalised, analysed and compared: well-foundedness or Noetherity, Löb’s formula, absence of infinite iteration, absence of divergence and normalisation. The study is based on modal semirings, which are additively idempotent semirings with forward and backward modal operators. To reason about infinite behaviour, semirings are extended to divergence semi...