A computational treatment of anaphora and its algorithmic implementation

DOI10.1007/S10849-020-09322-7zbMath1496.03057OpenAlexW3112838676MaRDI QIDQ2035844

Jean-Philippe Bernardy, Stergios Chatzikyriakidis, Aleksandre Maskharashvili

Publication date: 25 June 2021

Published in: Journal of Logic, Language and Information (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10849-020-09322-7

zbMATH Keywords

formal semanticsanaphoradynamic semanticsmonadstype theory

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Logic of natural languages (03B65) Combinatory logic and lambda calculus (03B40)

Related Items (1)

Algebraic effects for extensible dynamic semantics

Cites Work

• Notions of computation and monads
• Combining effects: sum and tensor
• Introducing a Calculus of Effects and Handlers for Natural Language Semantics
• Handlers of Algebraic Effects
• Common Nouns as Types
• Adverbs in a Modern Type Theory
• Dynamic predicate logic
• Unnamed Item
• Unnamed Item

This page was built for publication: A computational treatment of anaphora and its algorithmic implementation