Type Assignment for the Computational lambda-Calculus

07/12/2019

∙

by   Ugo de'Liguoro, et al.

∙

0

∙

share

We study polymorphic type assignment systems for untyped lambda-calculi with effects. We introduce an intersection type assignment system for Moggi's computational lambda-calculus, where a generic monad T is considered, and provide a concrete model of the calculus via a filter model construction. We prove soundness and completeness of the type system, together with subject reduction and expansion properties.