Introducing ⦇ λ ⦈, a λ-calculus for effectful computation

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