Introducing a Calculus of Effects and Handlers for Natural Language Semantics

Maršík, Jirka; Amblard, Maxime

doi:10.1007/978-3-662-53042-9_15

Cited by 3 publications

(1 citation statement)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Another related approach to study natural language semantics, including certain kinds of anaphora, was proposed by Maršík and Amblard (2016). They instead of monads use effects and handlers, a theory developed by Plotkin and Pretnar (2009).…”

Section: Related Workmentioning

confidence: 99%

A Computational Treatment of Anaphora and Its Algorithmic Implementation

Bernardy

Chatzikyriakidis

Maskharashvili

2020

J of Log Lang and Inf

View full text Add to dashboard Cite

In this paper, we propose a framework capable of dealing with anaphora and ellipsis which is both general and algorithmic. This generality is ensured by the compination of two general ideas. First, we use a dynamic semantics which reperent effects using a monad structure. Second we treat scopes flexibly, extending them as needed. We additionally implement this framework as an algorithm which translates abstract syntax to logical formulas. We argue that this framework can provide a unified account of a large number of anaphoric phenomena. Specifically, we show its effectiveness in dealing with pronominal and VP-anaphora, strict and lazy pronouns, lazy identity, bound variable anaphora, e-type pronouns, and cataphora. This means that in particular we can handle complex cases like Bach–Peters sentences, which require an account dealing simultaneously with several phenomena. We use Haskell as a meta-language to present the theory, which also consitutes an implementation of all the phenomena discussed in the paper. To demonstrate coverage, we propose a test suite that can be used to evaluate computational approaches to anaphora.

show abstract

Section: Related Workmentioning

confidence: 99%

A Computational Treatment of Anaphora and Its Algorithmic Implementation

Bernardy

Chatzikyriakidis

Maskharashvili

2020

J of Log Lang and Inf

View full text Add to dashboard Cite

show abstract

Algebraic Effects for Extensible Dynamic Semantics

Grove

Bernardy

2022

J of Log Lang and Inf

View full text Add to dashboard Cite

Research in dynamic semantics has made strides by studying various aspects of discourse in terms of computational effect systems, for example, monads (Shan, 2002; Charlow, 2014), Barker and 2014), (Maršik, 2016). We provide a system, based on graded monads, that synthesizes insights from these programs by formalizing individual discourse phenomena in terms of separate effects, or grades. Included are effects for introducing and retrieving discourse referents, non-determinism for indefiniteness, and generalized quantifier meanings. We formalize the behavior of individual effects, as well as the interactions between effects, in terms of algebraic laws tailored to the relevant discourse phenomena. The system we propose is thus modular and suggests a novel approach to integrating formal accounts of distinct semantic phenomena. Finally, we give an interpretation of the system into pure $$ \lambda $$ λ -calculus that respects the laws. Future work will aim to integrate more discourse phenomena using the same methodology, for example, presupposition and conventional implicature.

show abstract

Effects as capabilities: effect handlers and lightweight effect polymorphism

Brachthäuser

Schuster

Ostermann

2020

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

Effect handlers have recently gained popularity amongst programming language researchers. Existing type- and effect systems for effect handlers are often complicated and potentially hinder a wide-spread adoption. We present the language Effekt with the goal to close the gap between research languages with effect handlers and languages for working programmers. The design of Effekt revolves around a different view of effects and effect types. Traditionally, effect types express which side effects a computation might have. In Effekt, effect types express which capabilities a computation requires from its context. While this new point in the design space of effect systems impedes reasoning about purity, we demonstrate that it simplifies the treatment of effect polymorphism and the related issues of effect parametricity and effect encapsulation. To guarantee effect safety, we separate functions from values and treat all functions as second-class. We define the semantics of Effekt as a translation to System Xi, a calculus in explicit capability-passing style.

show abstract

Introducing a Calculus of Effects and Handlers for Natural Language Semantics

Cited by 3 publications

References 23 publications

A Computational Treatment of Anaphora and Its Algorithmic Implementation

A Computational Treatment of Anaphora and Its Algorithmic Implementation

Algebraic Effects for Extensible Dynamic Semantics

Effects as capabilities: effect handlers and lightweight effect polymorphism

Contact Info

Product

Resources

About