Related papers: Some Consistent Power Constructions
It has been shown that for a dcpo P, the Scott closure of \Gamma_c(P) in \Gamma(P) is a consistent Hoare powerdomain of P, where \Gamma_c(P) is the family of nonempty, consistent and Scott closed subsets of P, and \Gamma(P) is the…
The theory of regular cost functions is a quantitative extension to the classical notion of regularity. A cost function associates to each input a non-negative integer value (or infinity), as opposed to languages which only associate to…
We develop the theory of continuous and algebraic domains in constructive and predicative univalent foundations, building upon our earlier work on basic domain theory in this setting. That we work predicatively means that we do not assume…
For encompassing the limitations of probabilistic coherence spaces which do not seem to provide natural interpretations of continuous data types such as the real line, Ehrhard and al. introduced a model of probabilistic higher order…
This article establishes the existence of Lyapunov functions for analyzing the stability of a class of state-constrained systems, and it describes algorithms for their numerical computation. The system model consists of a differential…
We study the category Cstabm of measurable cones and measurable stable functions, which is a denotational model of an higher-order language with continuous probabilities and full recursion. We look at Cstabm as a model for discrete…
Turi and Plotkin introduced an elegant approach to structural operational semantics based on universal coalgebra, parametric in the type of syntax and the type of behaviour. Their framework includes abstract GSOS, a categorical…
We present a novel, yet rather simple construction within the traditional framework of Scott domains to provide semantics to probabilistic programming, thus obtaining a solution to a long-standing open problem in this area. Unlike current…
We define a notion of stable and measurable map between cones endowed with measurability tests and show that it forms a cpo-enriched cartesian closed category. This category gives a denotational model of an extension of PCF supporting the…
Prior work [11] established a commutativity result for the Hoare power construction and a modified version of the Smyth power construction consisting of strongly compact sets, which is defined for Us-admitting dcpos, where Us-admissability…
We describe additive (unstable) operations from a theory A^* obtained from Algebraic Cobordism of M.Levine-F.Morel by change of coefficients to any oriented cohomology theory B^*. We prove that there is 1-to-1 correspondence between the set…
We propose a generalized su(2) algebra that perfectly describes the discrete energy part of the Morse potential. Then, we examine particular examples and the approach can be applied to any Morse oscillator and to practically any physical…
The original purpose of component-based development was to provide techniques to master complex software, through composition, reuse and parametrisation. However, such systems are rapidly moving towards a level in which software becomes…
A partitioned process theory, as defined by Coecke, Fritz, and Spekkens, is a symmetric monoidal category together with an all-object-including symmetric monoidal subcategory. We think of the morphisms of this category as processes, and the…
Coherent unit actions on a binary, quadratic operad were introduced by Loday and were shown by him to give Hopf algebra structures on the free algebras when the operad is also regular with a splitting of associativity. Working with such…
This paper concerns a stochastic construction of probabilistic coherent spaces by employing novel ingredients (i) linear exponential comonads arising properly in the measure-theory (ii) continuous orthogonality between measures and…
We develop domain theory in constructive and predicative univalent foundations (also known as homotopy type theory). That we work predicatively means that we do not assume Voevodsky's propositional resizing axioms. Our work is constructive…
We develop domain theory in constructive and predicative univalent foundations (also known as homotopy type theory). That we work predicatively means that we do not assume Voevodsky's propositional resizing axioms. Our work is constructive…
Many combinatorial sequences (for example, the Catalan and Motzkin numbers) may be expressed as the constant term of $P(x)^k Q(x)$, for some Laurent polynomials $P(x)$ and $Q(x)$ in the variable $x$ with integer coefficients. Denoting such…
We introduce a systematic method for constructing set-theoretic operads via iterated application of the power set functor, and use it to uncover a hierarchy connecting several classical operads. Starting from the permutative operad, the…