3 citations · 4 across the 5 of their papers we have counts for
5 papers
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…
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…
On reduction and normalization in the computational core
Claudia Faggian, Giulio Guerrieri, Ugo de'Liguoro +1
We study the reduction in a lambda-calculus derived from Moggi's computational one, that we call the computational core. The reduction relation consists of rules obtained by orient…
Intersection Types for a Computational Lambda-Calculus with Global State
Ugo de'Liguoro, Riccardo Treglia
We study the semantics of an untyped lambda-calculus equipped with operators representing read and write operations from and to a global store. We adopt the monadic approach to mod…
Intersection Types for the Computational lambda-Calculus
Ugo de'Liguoro, Riccardo Treglia
We study polymorphic type assignment systems for untyped lambda-calculi with effects, based on Moggi's monadic approach. Moving from the abstract definition of monads, we introduce…