レミ・ザジャック
タイプ付き素性構造に対する操作：動槻および諸定義
Abstract:In the spirit of functional programming (à la LISP), we propose a systematic
framework for introducing a variety of extensions to unification-based grammar
formalisms. Feature structures are interpreted as objects which have a set
structure, and not as denotation of sets. We introduce associated functions
derived from set theory. For example, union is defined as a weak form of
unification. We have developed an experimental interpreter to test these ideas.
The basic data structure of the language is a Typed Feature Structure, as the list
is the basic data structure of LISP.
This report presents the motivations of this approach, and describes the formal
framework used for the language, which integrate functions and equations on Typed
Feature Structures. The interpreter of the language and the grammar formalism will
described in a forthcoming report.