scientific article

From MaRDI portal
Publication:3946875

zbMath0486.60034MaRDI QIDQ3946875

Michele Giry

Publication date: 1982


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items

Retracing some paths in process algebraA linear exponential comonad in s-finite transition kernels and probabilistic coherent spacesDivergences on monads for relational program logicsA concrete model for a typed linear algebraic lambda calculusControl-data separation and logical condition propagation for efficient inference on probabilistic programsMultilevel Delayed Acceptance MCMCA categorical approach to statistical mechanicsCategorical information geometryValue Iteration is Optic CompositionUnnamed ItemA categorical characterization of relative entropy on standard Borel spacesOn block structures in quantum computationContinuous-variable nonlocality and contextualityA non-commutative Bayes' theoremThe factorization of the Giry monadA categorical characterization of relative entropy on standard Borel spacesCategory-theoretic structure for independence and conditional independenceOn bisimilarity in lambda calculi with continuous probabilistic choiceMonads, partial evaluations, and rewritingBorel kernels and their approximation, categoricallyBimonoidal structure of probability monadsContinuous probability distributions in concurrent gamesRecursively defined metric spaces without contractionSynthetic topology in Homotopy Type Theory for probabilistic programmingProbabilistic operational semantics for the lambda calculusBisimulation as a logical relationThe expectation monad in quantum foundationsUnnamed ItemUnnamed ItemGeneric Infinite Traces and Path-Based Coalgebraic Temporal LogicsKan extensions are partial colimitsEilenberg--Moore algebras for stochastic relationsProgram logic for higher-order probabilistic programs in Isabelle/HOLA functional account of probabilistic programming with possible worlds. Declarative pearlProbability, valuations, hyperspace: Three monads on top and the support as a morphismNon-Archimedean preferences over countable lotteriesFunctional distribution monads in functional-analytic contextsReduction semantics in Markovian process algebraFrom probability monads to commutative effectusesGeneric weakest precondition semantics from monads enriched with orderCodensity and the Giry monadA synthetic approach to Markov kernels, conditional independence and theorems on sufficient statisticsFrom gs-monoidal to oplax cartesian categories: constructions and functorial completenessNon-commutative disintegrations: existence and uniqueness in finite dimensionsAlgebraic properties of stochastic effectivity functionsAn axiomatization of information flow measuresApproximating labelled Markov processesProgram algebra for quantitative information flowCategorical approach to modelling and to coupling of modelsLattice properties of congruences for stochastic relationsAlgebraic theory of vector-valued integrationMarkov chains and Markov decision processes in Isabelle/HOLMaximal traces and path-based coalgebraic temporal logicsApproximating Markov processes through filtrationUnnamed ItemAll adapted topologies are equalUnnamed ItemUnnamed ItemUnnamed ItemDirichlet is naturalAn effect-theoretic account of Lebesgue integrationBisimulation for probabilistic transition systems: A coalgebraic approachLinking theories in probabilistic programmingProofs of randomized algorithms in CoqThe sheaf-theoretic structure of non-locality and contextualityPointless LearningCommutative Semantics for Probabilistic ProgrammingA trustful monad for axiomatic reasoning with probability and nondeterminismGiry and the MachineA predicate/state transformer semantics for Bayesian learningApproximate relational Hoare logic for continuous random samplingsThe Giry monad is not strong for the canonical symmetric monoidal closed structure on \textbf {Meas}Codensity Lifting of Monads and its DualA stochastic interpretation of game logicClassifying financial markets up to isomorphismA compositional modelling and analysis framework for stochastic hybrid systemsBisimilarity of Distributionally Equivalent Markov Transition SystemsBisimulation for Markov Decision Processes through Families of Functional ExpressionsAffine Monads and Side-Effect-FreenessThe converse of a stochastic relationUnprovability of the logical characterization of bisimulationDomain theory, testing and simulation for labelled Markov processesA behavioural pseudometric for probabilistic transition systemsBisimulation and cocongruence for probabilistic systemsFinal coalgebras for functors on measurable spacesUnnamed ItemApproximating and computing behavioural distances in probabilistic transition systemsBisimulation for labelled Markov processesKleisli morphisms and randomized congruences for the Giry monadVerified analysis of random binary tree structuresProbabilistic Inference by Program Transformation in Hakaru (System Description)An Application of Computable Distributions to the Semantics of Probabilistic Programming LanguagesLong-term values in Markov decision processes, (co)algebraically(in)finite trace equivalence of probabilistic transition systemsCategories of Timed Stochastic RelationsUnnamed ItemA channel-based perspective on conjugate priorsAlgebraic theories and commutativity in a sheaf toposCoalgebraic logic for stochastic right coalgebrasStochastic order on metric spaces and the ordered Kantorovich monadDomain semantics of possibility computationsDisintegration and Bayesian inversion via string diagramsA concrete categorical semantics of lambda-\(\mathcal{S}\)Measure and probability for concurrency theoristsUnnamed ItemStructural operational semantics for continuous state stochastic transition systemsLabelled Markov Processes as Generalised Stochastic RelationsExtensional equality preservation and verified generic programmingOn the correctness of monadic backward inductionNonparametric Estimations and the Diffeological Fisher Metric