We study a Curry style type assignment system for untyped λ-calculi with effects, based on Moggi's monadic approach. Moving from the abstract definition of monads, we introduce a version of the call-by-value computational λ-calculus based on Wadler's variant, without let, and with unit and bind operators. We define a notion of reduction for the calculus and prove it confluent.

We then introduce an intersection type system inspired by Barendregt, Coppo and Dezani system for ordinary untyped λ-calculus, establishing type invariance under conversion.

Finally, we introduce a notion of convergence, which is precisely related to reduction, and characterize convergent terms via their types.

我们基于Moggi的单子方法研究了带效果的无类型λ-结石的Curry样式类型分配系统。从monad的抽象定义出发，我们引入了一种基于Wadler变体的按值调用计算λ演算的版本，该变体不具有let，并且具有unit和bind运算符。我们为演算定义了约化的概念，并证明了它的融合。

然后，我们引入受Barendregt，Coppo和Dezani系统启发的交集类型系统，用于普通的无类型λ微积分，建立转换后的类型不变性。

最后，我们引入一个与归约精确相关的收敛概念，并通过它们的类型来表征收敛项。