A trustful monad for axiomatic reasoning with probability and ...
A Modal Logic of Near Certainty? - A Neighborhood of Infinity
as an approximation, and as long as we don't push our reasoning too far we won't get bad results. (And in fact you could probably derive some ...
Monadic Intersection Types, Relationally
Probabilistic computations are modelled by the (finitary) distribution monad ... axioms of a monad to extend it. Relational Extensions. We overcome this ...
Dijkstra Monads for Free - Danel Ahman
Abstract. Dijkstra monads enable a dependent type theory to be enhanced with support for specifying and verifying effectful code via weakest preconditions.
Formal Verification of Higher-Order Probabilistic Programs
... monadic type for probability ... We enrich this equational theory with axioms and equations reflecting common reasoning principles for probabilistic programming ...
A Convenient Category for Higher-Order Probability Theory
Thus quasi-Borel spaces form semantics for a probabilistic programming language in the monadic style [26]. We also illustrate the use of quasi-Borel spaces. • ...
On Discrete Presheaf Monads - MDPI
For a quantale I, which is a unit interval endowed with a continuous triangular norm and the Barr extension β¯I of the ultrafilter monad to I-Rel, ...
monad (disambiguation) in nLab
Various concepts in philosophy and mathematics go by the name monad. There is a surprising (if partly accidental) coherence in these notions ...
Axioms for Information Leakage - Hal-Inria
“probability monad”, that is in effect a type constructor that obeys ... Kifer, “Reasoning about privacy using axioms,” in Confer- ence ...
Set Theory and Algebra in CS: Introduction to Mathematical ...
Axiomatic set theory isn't just for "pedantry" and mechanical reasoning, though that's an important application. It's also like a telescope ...
Trace Abstraction Modulo Probability - NSF PAR
We automate proof construction by reducing probabilistic reasoning to logical reasoning: we use program synthesis methods to select axioms for sampling ...
Commutative Monads as a Theory of Distributions - tac.mta.ca
It is shown how the theory of commutative monads provides an axiomatic ... reasoning is mainly diagrammatic. In the remainder, we take the ...
Stochastic Lambda Calculus and Monads of Probability Distributions
currently used in probabilistic reasoning. The problem arises because a monad does not exploit intensional prop- erties of functions; it only applies ...
1 Trace Abstraction Modulo Probability - cs.wisc.edu
Second, as we demonstrate, reasoning about one nite trace at a time allows us to reduce probabilistic reasoning to logical reasoning. ... axiom for the Laplace ...
Commutative Monads for Probabilistic Programming Languages
Applying the reasoning above about simple valuations, we obtain a commutative monad of valuations on DCPO by restricting to a suitable completion of SD inside ...
Product Operations in Strong Monads 1 Introduction - CiteSeerX
MY and A in MX. The reader is invited to check the validity of the monad axioms. ... There is another, less obvious axiom for the probabilistic ...
Reasoning about Conditional Probabilities in a Higher-order-Logic ...
The formalized prob and E can be used to derive all the basic axioms of probability in the HOL theorem prover. For example, some of the formally ...
Notes on axiomatic reasoning - PhilArchive
Since truths and other non-falsities in a theory are all. (intended to be) determined by the axioms, they have to be in the reaches of logical consequences ...
March | 2019 | Fabulous adventures in coding
An additive monad is a monad where there is a “zero value”; like the number zero, “multiplying” by zero produces a zero, and “adding” a zero is an identity.