We present $⦇\lambda ⦈$, a calculus with special constructions for dealing with effects and handlers. This is an extension of the simply-typed λ-calculus (STLC). We enrich STLC with a type for representing effectful computations alongside with operations to create and process values of this type. The calculus is motivated by natural language modelling, and especially semantic representation. Traditionally, the meaning of a sentence is calculated using λ-terms, but some semantic phenomena need more flexibility. In this article we introduce the calculus and show that the calculus respects the laws of algebraic structures and it enjoys strong normalisation. To do so, confluence is proven using the Combinatory Reduction Systems (CRSs) of Klop and termination using the Inductive Data Type Systems (IDTSs) of Blanqui.

我们提出 $⦇\lambda ⦈$，具有用于处理效果和处理程序的特殊结构的演算。这是简单类型的λ演算（STLC）的扩展。我们用一种表示有效计算的类型以及用于创建和处理该类型值的操作来丰富STLC。演算的动机是自然语言建模，尤其是语义表示。传统上，句子的含义是使用λ计算的术语，但某些语义现象需要更大的灵活性。在本文中，我们介绍了微积分，并证明了微积分遵循代数结构的定律，并且具有很强的归一化性。为此，使用Klop的组合归约系统（CRS）和使用Blanqui的归纳数据类型系统（IDTS）终止证明了融合。