Sort Inheritance for Order-Sorted Equational Presentations

@inproceedings{Hintermeier1994SortIF,
  title={Sort Inheritance for Order-Sorted Equational Presentations},
  author={Claus Hintermeier and Claude Kirchner and H{\'e}l{\`e}ne Kirchner},
  booktitle={COMPASS/ADT},
  year={1994}
}
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 specifications, needed for unification in this context. A test and three specific processes, based on completion of a set of rewrite rules, are proposed to check sort inheritance. They depend on the kinds of membership… 
R nand G n-Logics
TLDR
A simple, set-theoretic framework providing expressive typing, higher-order functions and initial models at the same time, and the theory of R-logics, which are axiomatisable by an order-sorted equational Horn logic with a membership predicate, and of G-logic, that provide in addition partial functions.
Rn- and Gn-Logics
TLDR
A simple, set-theoretic framework providing expressive typing, higher-order functions and initial models at the same time, and the theory of R n -logics, which are axiomatisable by an order-sorted equational Horn logic with a membership predicate, and of G n - Logics, that provide in addition partial functions.
An Approach to Algebraic Semantics of Object-Oriented Languages
TLDR
This paper develops an algebraic semantics of basic object-oriented principles, into which the semantics of the language’s imperative parts is embedded, and can be employed to formalize the semanticsof "standard" object- oriented languages such as Eiffel, Java, or C++.
What is an Abstract Data Type, after all?
We look back on ten Workshops on Abstract Data Types. Organizers and publications, a list of authors referencing their talks and papers on the workshops, and a workshop bibliography are presented.
Compilation de règles de réécriture et de stratégies non-déterministes
Les techniques de reecriture ont ete developpees depuis les annees 1970 et appliquees en particulier au prototypage des specifications formelles algebriques et a la demonstration de proprietes liees

References

SHOWING 1-10 OF 25 REFERENCES
Dynamically-Typed Computations for Order-Sorted Equational Presentations
TLDR
This work addresses the problem of computing in order-sorted algebras, with very few restrictions on the allowed presentations, and adopts an algebraic framework where equational, membership and existence formulas can be expressed.
Logic Programming over Polymorphically Order-Sorted Types
TLDR
This thesis presents the foundations for relational logic programming over polymorphically order-sorted data types, which are obtained as canonical models of a class of speci cations in a suitable logic accommodating sort functions.
Rn- and Gn-Logics
TLDR
A simple, set-theoretic framework providing expressive typing, higher-order functions and initial models at the same time, and the theory of R n -logics, which are axiomatisable by an order-sorted equational Horn logic with a membership predicate, and of G n - Logics, that provide in addition partial functions.
Semantics of Order-Sorted Specifications
Completion of Rewrite Systems with Membership Constraints
TLDR
This work considers a constrained equational logic where the constraints are membership conditions t ∈ s where s is interpreted as a regular tree language and gives a terminating set of transformation rules for these formulas, which decides the existence of a solution.
Algebraic Semantics of Rewriting Terms and Types
TLDR
A universal algebraic framework for rewriting terms and types over an arbitrary equational specification of types and typed combinators is presented and it is proved that rewriting for ground terms and ground types coincides with calculation in the initial model I of the equational type specification.
Computational Aspects of an Order-Sorted Logic with Term Declarations
TLDR
Sorted resolution-based calculi are used for solving the problem of sorting problems by automating the very labor-intensive and therefore time-heavy process of sorting.
...
...