Results 1  10
of
1,079,431
Sort Inheritance for OrderSorted Equational Presentations
 In Recent Trends in Data Types Specification
, 1995
"... 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, neede ..."
Abstract

Cited by 5 (4 self)
 Add to MetaCart
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
Termination of OrderSorted Rewriting
"... We present a method for proving termination of ordersorted rewrite systems by transforming an ordersorted rewrite system into an unsorted one such that termination of the latter implies termination of the ordersorted system. The method is inspired by ideas of Gnaedig and Ganzinger and contains as ..."
Abstract
 Add to MetaCart
We present a method for proving termination of ordersorted rewrite systems by transforming an ordersorted rewrite system into an unsorted one such that termination of the latter implies termination of the ordersorted system. The method is inspired by ideas of Gnaedig and Ganzinger and contains
Colimits of OrderSorted Specifications
 In Recent Trends in Algebraic Development Techniques, Proc. 12th International Workshop, WADT '97
"... . We prove cocompleteness of the category of CASL signatures, of monotone signatures, of strongly regular signatures and of strongly locally filtered signatures. This shows that using these signature categories is compatible with a pushout or colimit based module system. 1 Introduction "Given ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
"Putting theories together to make specifications" [3]. That is, specifications should be developed in a modular way, using colimits to combine different modules properly. An orthogonal question is that of the logic that is used to specify the individual modules. Ordersorted algebra is a
OrderSorted Feature Theory Unification
, 1997
"... Ordersorted feature (OSF) terms provide an adequate representation for objects as flexible records. They are sorted, attributed, possibly nested, structures, ordered thanks to a subsort ordering. Sort definitions offer the functionality of classes imposing structural constraints on objects. These c ..."
Abstract

Cited by 21 (3 self)
 Add to MetaCart
Ordersorted feature (OSF) terms provide an adequate representation for objects as flexible records. They are sorted, attributed, possibly nested, structures, ordered thanks to a subsort ordering. Sort definitions offer the functionality of classes imposing structural constraints on objects
OrderSorted Termination: the Unsorted Way
 In Proceedings from NIK'95: Norwegian Conference on Informatics, Gran (Hadeland
, 1996
"... We consider the problem of proving termination of ordersorted rewrite systems. The dominating method for proving termination of ordersorted systems has been to simply ignore sort information, and use the techniques developed for unsorted rewriting. The problem with this approach is that many order ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
implies termination of the former. By encoding sort information into the unsorted mapping, we are able to use general purpose termination orderings to prove termination of ordersorted rewrite systems whose termination depend on the sort hierarchy. We present a sequence of gradually stronger methods
OrderSorted Reasoning in the Situation Calculus
"... We propose a theory for reasoning about actions based on ordersorted predicate logic where one can consider an elaborate taxonomy of objects. We are interested in the projection problem: whether a statement is true after executing a sequence of actions. To solve it we design a regression operator t ..."
Abstract
 Add to MetaCart
We propose a theory for reasoning about actions based on ordersorted predicate logic where one can consider an elaborate taxonomy of objects. We are interested in the projection problem: whether a statement is true after executing a sequence of actions. To solve it we design a regression operator
OrderSorted Equality Enrichments Modulo
"... All intext references underlined in blue are linked to publications on ResearchGate, letting you access and read them immediately. ..."
Abstract
 Add to MetaCart
All intext references underlined in blue are linked to publications on ResearchGate, letting you access and read them immediately.
Logic Programming over Polymorphically OrderSorted Types
, 1989
"... This thesis presents the foundations for relational logic programming over polymorphically ordersorted data types. This type discipline combines the notion of parametric polymorphism, which has been developed for higherorder functional programming, with the notion of ordersorted typing, which ha ..."
Abstract

Cited by 59 (0 self)
 Add to MetaCart
This thesis presents the foundations for relational logic programming over polymorphically ordersorted data types. This type discipline combines the notion of parametric polymorphism, which has been developed for higherorder functional programming, with the notion of ordersorted typing, which
Ordersorted polymorphism in isabelle
 Logical Environments
, 1993
"... MLstyle polymorphism can be generalized from a singlesorted algebra of types to an ordersorted one by adding a partially ordered layer of “sorts ” on top of the types. Type inference proceeds as in the Hindley/Milner system, except that ordersorted unification of types is used. The resulting sys ..."
Abstract

Cited by 37 (2 self)
 Add to MetaCart
MLstyle polymorphism can be generalized from a singlesorted algebra of types to an ordersorted one by adding a partially ordered layer of “sorts ” on top of the types. Type inference proceeds as in the Hindley/Milner system, except that ordersorted unification of types is used. The resulting
OrderSorted Algebra I: Equational Deduction for Multiple Inheritance, Overloading, Exceptions and Partial Operations
 Theoretical Computer Science
, 1992
"... This paper generalizes manysorted algebra (hereafter, MSA) to ordersorted algebra (hereafter, OSA) by allowing a partial ordering relation on the set of sorts. This supports abstract data types with multiple inheritance (in roughly the sense of objectoriented programming), several forms of pol ..."
Abstract

Cited by 231 (36 self)
 Add to MetaCart
This paper generalizes manysorted algebra (hereafter, MSA) to ordersorted algebra (hereafter, OSA) by allowing a partial ordering relation on the set of sorts. This supports abstract data types with multiple inheritance (in roughly the sense of objectoriented programming), several forms
Results 1  10
of
1,079,431