We study weighted programming, a programming paradigm for specifying mathematical
models. More specifically, the weighted programs we investigate are like usual imperative …

When modelling side-effects using a monad, we need to equip the monad with effectful
operations. This can be done by noting that each algebra of the monad carries …

Premonoidal categories and Freyd categories provide an encompassing framework for the
semantics of call-by-value programming languages. Premonoidal categories are a …

Testing a program based on its specification is necessary to ensure that the program meets
its desired functionality. Formal methods, based on some mathematical theories, are often …

A large class of monads used to model computational effects have natural presentations by
operations and equations, for example, the list monad can be presented by a constant and a …

Statistical artificial intelligence based upon machine learning is facing major challenges
such as machine bias, explainability, and verifiability problems. Resolving them would be of …

Imprecise probability is concerned with uncertainty about which probability distributions to
use. It has applications in robust statistics and elsewhere. Imprecise probability can be …

Hoare Logic has a long tradition in formal verification and has been continuously developed
and used to verify a broad class of programs, including sequential, object-oriented, and …

Several relational program logics have been introduced for integrating reasoning about
relational properties of programs and measurement of quantitative difference between …

Kleene Algebra with Tests (KAT) provides a framework for algebraic equational reasoning
on imperative programs. The recent variant Guarded KAT (GKAT) allows to reason on non …