3 citations · 4 across the 5 of their papers we have counts for
Showing cs.PLShow all
2 papers · 1 filter
cs.PL2024
Monadic Intersection Types, Relationally (Extended Version)
Francesco Gavazzo, Riccardo Treglia, Gabriele Vanoni
We extend intersection types to a computational -calculus with algebraic operations à la Plotkin and Power. We achieve this by considering monadic intersections, whereby computa…
cs.PL2021★ 1 cited
From Semantics to Types: the Case of the Imperative lambda-Calculus
Ugo de'Liguoro, Riccardo Treglia
We propose an intersection type system for an imperative lambda-calculus based on a state monad and equipped with algebraic operations to read and write to the store. The system is…