English
Related papers

Related papers: Quantitative Behavioural Reasoning for Higher-orde…

200 papers

In systems involving quantitative data, such as probabilistic, fuzzy, or metric systems, behavioural distances provide a more fine-grained comparison of states than two-valued notions of behavioural equivalence or behaviour inclusion. Like…

Logic in Computer Science · Computer Science 2023-06-22 Paul Wild , Lutz Schröder

Graded modal types systems and coeffects are becoming a standard formalism to deal with context-dependent computations where code usage plays a central role. The theory of program equivalence for modal and coeffectful languages, however, is…

Logic in Computer Science · Computer Science 2021-03-08 Ugo Dal Lago , Francesco Gavazzo

In order to reason about effects, we can define quantitative formulas to describe behavioural aspects of effectful programs. These formulas can for example express probabilities that (or sets of correct starting states for which) a program…

Logic in Computer Science · Computer Science 2019-04-29 Niels Voorneveld

We study Abramsky's applicative bisimilarity abstractly, in the context of call-by-value $\lambda$-calculi with algebraic effects. We first of all endow a computational $\lambda$-calculus with a monadic operational semantics. We then show…

Logic in Computer Science · Computer Science 2017-04-18 Ugo Dal Lago , Francesco Gavazzo , Paul Blain Levy

Behavioural metrics provide a quantitative refinement of classical two-valued behavioural equivalences on systems with quantitative data, such as metric or probabilistic transition systems. In analogy to the linear-time/branching-time…

Logic in Computer Science · Computer Science 2025-01-28 Jonas Forster , Lutz Schröder , Paul Wild , Harsh Beohar , Sebastian Gurke , Barbara König , Karla Messing

The analysis and control of stochastic dynamical systems rely on probabilistic models such as (continuous-space) Markov decision processes, but large or continuous state spaces make exact analysis intractable and call for principled…

Logic in Computer Science · Computer Science 2026-03-13 Nivar Anwer , Ezequiel López-Rubio , David Elizondo , Rafael M. Luque-Baena

The paper investigates behavioural equivalence between programs in a call-by-value functional language extended with a signature of (algebraic) effect-triggering operations. Two programs are considered as being behaviourally equivalent if…

Logic in Computer Science · Computer Science 2019-10-28 Alex Simpson , Niels Voorneveld

Behavioural conformances -- e.g. behavioural equivalences, distances, preorders -- on a wide range of system types (non-deterministic, probabilistic, weighted etc.) can be dealt with uniformly in the paradigm of universal coalgebra. One of…

Logic in Computer Science · Computer Science 2025-02-04 Paul Wild , Lutz Schröder

Behavioural distances measure the deviation between states in quantitative systems, such as probabilistic or weighted systems. There is growing interest in generic approaches to behavioural distances. In particular, coalgebraic methods…

Category Theory · Mathematics 2023-05-03 Sergey Goncharov , Dirk Hofmann , Pedro Nora , Lutz Schröder , Paul Wild

We consider the probabilistic applicative bisimilarity (PAB), a coinductive relation comparing the applicative behaviour of probabilistic untyped lambda terms according to a specific operational semantics. This notion has been studied with…

Logic in Computer Science · Computer Science 2020-04-28 Gianluca Curzi , Michele Pagani

Probabilistic applicative bisimulation is a recently introduced coinductive methodology for program equivalence in a probabilistic, higher-order, setting. In this paper, the technique is applied to a typed, call-by-value, lambda-calculus.…

Logic in Computer Science · Computer Science 2014-01-30 Raphaelle Crubille , Ugo Dal Lago

Applicative bisimulation is a coinductive technique to check program equivalence in higher-order functional languages. It is known to be sound, and sometimes complete, with respect to context equivalence. In this paper we show that…

Logic in Computer Science · Computer Science 2015-06-23 Ugo Dal Lago , Alessandro Rioli

The framework of quantitative equational logic has been successfully applied to reason about algebras whose carriers are metric spaces and operations are nonexpansive. We extend this framework in two orthogonal directions: algebras endowed…

Logic in Computer Science · Computer Science 2022-01-25 Matteo Mio , Ralph Sarkis , Valeria Vignudelli

We study the interpretation of the lambda-calculus in a framework based on tropical mathematics, and we show that it provides a unifying framework for two well-developed quantitative approaches to program semantics: on the one hand program…

Logic in Computer Science · Computer Science 2023-11-28 Davide Barbarossa , Paolo Pistone

The Fuzz programming language [Reed and Pierce, 2010] uses an elegant linear type system combined with a monad-like type to express and reason about probabilistic sensitivity properties, most notably $\epsilon$-differential privacy. We show…

Programming Languages · Computer Science 2019-04-22 Arthur Azevedo de Amorim , Marco Gaboardi , Justin Hsu , Shin-ya Katsumata

While behavioural equivalences among systems of the same type, such as Park/Milner bisimilarity of labelled transition systems, are an established notion, a systematic treatment of relationships between systems of different type is…

Logic in Computer Science · Computer Science 2025-02-07 Pedro Nora , Jurriaan Rot , Lutz Schröder , Paul Wild

Substructural logics naturally support a quantitative interpretation of formulas, as they are seen as consumable resources. Distances are the quantitative counterpart of equivalence relations: they measure how much two objects are similar,…

Logic in Computer Science · Computer Science 2025-02-05 Francesco Dagnino , Fabio Pasquali

Most fuzzy systems including fuzzy decision support and fuzzy control systems provide out-puts in the form of fuzzy sets that represent the inferred conclusions. Linguistic interpretation of such outputs often involves the use of linguistic…

Artificial Intelligence · Computer Science 2013-01-30 Ryszard Kowalczyk

Generalized metrics, arising from Lawvere's view of metric spaces as enriched categories, have been widely applied in denotational semantics as a way to measure to which extent two programs behave in a similar, although non equivalent, way.…

Logic in Computer Science · Computer Science 2021-04-28 Paolo Pistone

Taking a quotient roughly means changing the notion of equality on a given object, set or type. In a quantitative setting, equality naturally generalises to a distance, measuring how much elements are similar instead of just stating their…

Category Theory · Mathematics 2024-12-17 Francesco Dagnino , Fabio Pasquali
‹ Prev 1 2 3 10 Next ›