Equational completion in order-sorted algebras
نویسندگان
چکیده
منابع مشابه
Order-sorted Equational Unification Revisited
This paper presents a rule-based algorithm for performing order-sorted E-unification using an unsorted E-unification decision procedure under assumptions about E that are commonly satisfied in practice. We have implemented this algorithm in Maude for use with the Maude-NRL protocol analyzer and have used CiME for unsorted E-unification for E any set of AC and ACU axioms. In many examples of int...
متن کاملOrder Sorted Algebras
In this paper i is a set. Let I be a set, let f be a many sorted set indexed by I, and let p be a finite sequence of elements of I. One can check that f · p is finite sequence-like. Let S be a non empty many sorted signature. A sort symbol of S is an element of S. Let S be a non empty many sorted signature. (Def. 1) An element of the operation symbols of S is said to be an operation symbol of S...
متن کاملThe Institution of Order-Sorted Equational Logic
The paper provides an organisation of order-sorted equational logic as an Institution.
متن کاملSort Inheritance for Order-Sorted Equational Presentations
In an algebraic framework, where equational, membership and existence formulas can be expressed, decorated terms and rewriting provide operational semantics and decision procedures for these formulas. We focus in this work on testing sort inheritance, an undecidable property of speciications, needed for uniication in this context. A test and three speciic processes, based on completion of a set...
متن کاملA modular order-sorted equational generalization algorithm
Generalization, also called anti-unification, is the dual of unification. Given terms t and t′, a generalization is a term t′′ of which t and t′ are substitution instances. The dual of a most general unifier (mgu) is that of least general generalization (lgg). In this work, we extend the known untyped generalization algorithm to, first, an order-sorted typed setting with sorts, subsorts, and su...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1990
ISSN: 0304-3975
DOI: 10.1016/0304-3975(90)90034-f