Abstract
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”.
Cite
CITATION STYLE
Emele, M., & Zajac, R. (1991). A fixed-point semantics for feature type systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 516 LNCS, pp. 383–388). Springer Verlag. https://doi.org/10.1007/3-540-54317-1_106
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
