Representing Anaphora with Dependent Types

DOI10.1007/978-3-662-43742-1_2zbMath1291.68405OpenAlexW27606498MaRDI QIDQ4981265

Daisuke Bekki

Publication date: 24 June 2014

Published in: Logical Aspects of Computational Linguistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-43742-1_2

Mathematics Subject Classification ID

Logic of natural languages (03B65) Natural language processing (68T50)

Related Items (6)

Propositional forms of judgemental interpretations ⋮ Inverse linking, possessive weak definites and Haddock descriptions: a unified dependent type account ⋮ Variable handling and compositionality: comparing DRT and DTS ⋮ Implementing Variable Vectors in a CCG Parser ⋮ Proof Assistants for Natural Language Semantics ⋮ Type Reconstruction for $$\lambda $$-DRT Applied to Pronoun Resolution

This page was built for publication: Representing Anaphora with Dependent Types