A Fixed-Point Semantics for Feature Type Systems

The solution of a set of recursive feature type equations is defined in terms of a fixed-point semantics. Using the corresponding operational semantics, the result of the evaluation of a feature term is computed by successive continuous approximations. This semantics allows the usage of any order for evaluating a term, and also allows for cyclic feature terms, alleviating the need for an “occur-check”.