Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Intrigila, B. | Inverardi, P. | Venturini Zilli, M.
Affiliations: Dipartimento di Matematica pura ed applicata, University of L'Aquila, L'Aquila, Italy. [email protected] | Dipartimento di Matematica pura ed applicata, University of L'Aquila, L'Aquila, Italy. [email protected] | Dipartimento di Scienze dell'informazione, University of Rome ‘La Sapienza’ Rome, Italy. [email protected]
Note: [] Address for correspondence: Dipartimento di Matematica pura ed applicata, University of L'Aquila, L'Aquila, Italy
Note: [] Address for correspondence: Dipartimento di Matematica pura ed applicata, University of L'Aquila, L'Aquila, Italy
Note: [] Address for correspondence: Dipartimento di Scienze dell'informazione, University of Rome ‘La Sapienza’, Rome, Italy
Abstract: Terms finitely representing infinite sequences of finite first-order terms have received attention by several authors. In this paper, we consider the class of recurrent terms proposed by H. Chen and J. Hsiang, and we extend it to allow infinite terms. This extension helps in clarifying the relationships between matching and unification over the class of terms we consider, that we call iterative terms. In fact, it holds that if a term s matches a term t by a substitution Γ, then the limit of iterations of the matching Γ, if it exists, is a most general unifier of s and t. A crucial feature of iterative terms is the notion of maximally-folded normal form that allows for a comprehensive treatment of both finite and infinite iterative terms. In this setting, infinite terms can be simply characterized as limits of sequences of finite terms. For finite terms we positively settle an open problem of H. Chen and J. Hsiang on the number of most general unifiers for a pair of terms.
Keywords: Infinite sequences of terms, infinite terms, normal forms, matching, unification, most general unifiers
DOI: 10.3233/FI-1999-39304
Journal: Fundamenta Informaticae, vol. 39, no. 3, pp. 273-304, 1999
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
[email protected]
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office [email protected]
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
如果您在出版方面需要帮助或有任何建, 件至: [email protected]