3 papers
cs.LO2026
On Higher-Order Probabilistic Verification via the Weighted Relational Model of Linear Logic
Ugo Dal Lago, Guido Fiorillo, Paolo Pistone
The problem of determining whether a probabilistic program terminates almost surely (i.e.~with probability one) is undecidable, and actually -complete. For this reason, a g…
cs.LO2025
A Characterization of Basic Feasible Functionals Through Higher-Order Rewriting and Tuple Interpretations
Patrick Baillot, Ugo Dal Lago, Cynthia Kop +1
The class of type-two basic feasible functionals () is the analogue of (polynomial time functions) for type-2 functionals, that is, functionals that c…
cs.LO2025
On The Metric Nature of (Differential) Logical Relations
Ugo Dal Lago, Naohiko Hoshino, Paolo Pistone
Differential logical relations are a method to measure distances between higher-order programs. They differ from standard methods based on program metrics in that differences betwe…