activity
20182026
most citedHigher-Order Bayesian Networks, Exactly (Extended version)

4 citations · 6 across the 10 of their papers we have counts for

collaborators

11 papers

cs.LO2026

On Jumps, Interactions, and Intersection Types

Stefano Catozi, Ugo Dal Lago, Gabriele Vanoni

The Jumping Abstract Machine (JAM), an evaluation mechanism for the -calculus, was introduced by Danos and Regnier as an optimization of the Interaction Abstract Machine (IAM),…

cs.LO2024★ 1 cited

Interaction Equivalence

Beniamino Accattoli, Adrienne Lancelot, Giulio Manzonetto +1

Contextual equivalence is the de facto standard notion of program equivalence. A key theorem is that contextual equivalence is an equational theory. Making contextual equivalence m…

cs.FL2024

Slightly Non-Linear Higher-Order Tree Transducers

Lê Thành Dũng Nguyên, Gabriele Vanoni

We investigate the tree-to-tree functions computed by "affine -transducers": tree automata whose memory consists of an affine -term instead of a finite state. They can be see…

cs.LO2023★ 4 cited

Higher-Order Bayesian Networks, Exactly (Extended version)

Claudia Faggian, Daniele Pautasso, Gabriele Vanoni

Bayesian networks (BNs) are graphical \emph{first-order} probabilistic models that allow for a compact representation of large probability distributions, and for efficient inferenc…

cs.LO2023

A Log-Sensitive Encoding of Turing Machines in the -Calculus

Beniamino Accattoli, Ugo Dal Lago, Gabriele Vanoni

This note modifies the reference encoding of Turing machines in the -calculus by Dal Lago and Accattoli, which is tuned for time efficiency, as to accommodate logarithmic space.…

cs.PL2022★ 1 cited

Multi types and reasonable space

Beniamino Accattoli, Ugo Dal Lago, Gabriele Vanoni

Accattoli, Dal Lago, and Vanoni have recently proved that the space used by the Space KAM, a variant of the Krivine abstract machine, is a reasonable space cost model for the lambd…