This is a disambiguation page: a list of articles associated with the same title. If an internal link referred you to this page, you may wish to change the link to point directly to the intended article.
In this paper we present a disambiguation algorithm that, based on the work of Brüggemann-Klein and Wood, transform an ambiguous content model in to an unambiguous one by generalizing the language.
The aim of this thesis is to study the problems induced by the static and dynamic type transformations.
The words of that language are generated from an alphabet composed of the identifiers of the basic types of the system, the identifiers of the generic structures and a set of symbols representing the available constructors.
Feeds |
Contact