2 papers
cs.PL2024
On Computational Indistinguishability and Logical Relations
Ugo Dal Lago, Zeinab Galal, Giulia Giusti
A -calculus is introduced in which all programs can be evaluated in probabilistic polynomial time and in which there is sufficient structure to represent sequential cryptograph…
math.CT2024
Combining fixpoint and differentiation theory
Zeinab Galal, Jean-Simon Pacaud Lemay
Interactions between derivatives and fixpoints have many important applications in both computer science and mathematics. In this paper, we provide a categorical framework to combi…