1 citations · 1 across the 4 of their papers we have counts for
16 papers
On Randomized Computational Models and Complexity Classes: a Historical Overview
Melissa Antonelli, Ugo Dal Lago, Paolo Pistone
Since their appearance in the 1950s, computational models capable of performing probabilistic choices have received wide attention and are nowadays pervasive in almost every areas…
Tropical Mathematics and the Lambda Calculus I: Metric and Differential Analysis of Effectful Programs
Davide Barbarossa, Paolo Pistone
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 quantitati…
Enumerating Error Bounded Polytime Algorithms Through Arithmetical Theories
Melissa Antonelli, Ugo Dal Lago, Davide Davoli +2
We consider a minimal extension of the language of arithmetic, such that the bounded formulas provably total in a suitably-defined theory à la Buss (expressed in this new language)…
On Quantitative Algebraic Higher-Order Theories
Ugo Dal Lago, Furio Honsell, Marina Lenisa +1
We explore the possibility of extending Mardare et al. quantitative algebras to the structures which naturally emerge from Combinatory Logic and the lambda-calculus. First of all,…
Curry and Howard Meet Borel
Melissa Antonelli, Ugo Dal Lago, Paolo Pistone
We show that an intuitionistic version of counting propositional logic corresponds, in the sense of Curry and Howard, to an expressive type system for the probabilistic event lambd…
A New Conjecture About Identity of Proofs
Paolo Pistone
A central problem in proof-theory is that of finding criteria for identity of proofs, that is, for when two distinct formal derivations can be taken as denoting the same logical ar…