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.

在本文中，我们提出了一个能够处理通用和算法回指和省略号的框架。通过两个基本思想的结合，可以确保这种普遍性。首先，我们使用一种动态语义，该语义通过使用monad结构具有相应的效果。其次，我们灵活地处理范围，并根据需要扩展它们。我们另外将该框架实现为一种算法，该算法将抽象语法转换为逻辑公式。我们认为，该框架可以为大量的照应现象提供统一的说明。具体来说，我们展示了其在处理代词和VP照应，严格和懒惰代词，懒惰身份，绑定变量照应，e型代词和后缀时的有效性。这意味着我们尤其可以处理复杂的情况，例如巴赫-彼得斯的句子，这需要同时处理几种现象的帐户。我们使用Haskell作为元语言来介绍该理论，它也构成了本文讨论的所有现象的实现。为了演示覆盖范围，我们提出了一个可用于评估回指的计算方法的测试套件。