1 citations · 2 across the 9 of their papers we have counts for
Showing 2026Show all
3 papers · 1 filter
cs.PL2026
(Implicitly) Characterizing Probabilistic Polynomial Time as Used in Cryptography
Ugo Dal Lago, Giulia Giusti
In this paper, we show how a recently introduced -calculus for randomized computation, called , can accurately capture the notions of first- and second-order poly…
cs.LO2026
Coinductive reasoning for parametrized functors and monads
Ugo Dal Lago, Zeinab Galal
Lax extensions (also called relators or relation liftings) are a categorical notion to reason about functors acting on functions and relations in a compatible way. They play a cent…
cs.LO2026
When Types Intersect and Effects Get Handled
Stefano Catozi, Ugo Dal Lago, Taro Sekiyama
We introduce a novel intersection type system for a -calculus with algebraic effects and handlers. The system, inherently behavioral in nature, enjoys the classical properties o…