Introducing ⦇ λ ⦈, a λ-calculus for effectful computation - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Theoretical Computer Science Year : 2021

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

Jirka Maršík
Maxime Amblard
Philippe de Groote


We present λ , 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.
Fichier principal
Vignette du fichier
Marsik1.pdf (805.84 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-03200474 , version 1 (16-04-2021)



Jirka Maršík, Maxime Amblard, Philippe de Groote. Introducing ⦇ λ ⦈, a λ-calculus for effectful computation. Theoretical Computer Science, 2021, 869, pp.108-155. ⟨10.1016/j.tcs.2021.02.038⟩. ⟨hal-03200474⟩
118 View
217 Download



Gmail Mastodon Facebook X LinkedIn More