Anzeige
Erschienen in:
2009 | OriginalPaper | Buchkapitel
β-Reduction and Antecedent–Anaphora Relations in the Language of Acyclic Recursion
verfasst von : Roussanka Loukanova
Erschienen in: Bio-Inspired Systems: Computational and Ambient Intelligence
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
In this paper, I introduce briefly the formal language of Acyclic Recursion
${L^{\lambda}_{ar}}$
(see Moschovakis ). Then I present the
β
-reduction rule of the calculus of the referential synonymy in
${L^{\lambda}_{ar}}$
and some arguments for its restricted manifestation with respect to preserving the algorithmic sense of the
${L^{\lambda}_{ar}}$
-terms. This paper demonstrates further evidence for the need of restricted
β
-reduction. It also contributes to exploration of the inherent potentials of
${L^{\lambda}_{ar}}$
for underspecified semantic representations. I show that the restricted
β
-reduction, in combination with “underspecified” terms, gives rise to various distinctions between antecedent-anaphora and co-denotation relations in NL.