Results 1  10
of
40,639
Complete Polymorphic OrderSorted Unification
 Programming Languages and Fundamentals of Programming, number 9717 in Bericht
, 1997
"... Unification in a polymorphic ordersorted signature differs substantially from the nonpolymorphic ordersorted unification. For the polymorphic ordersorted unification we need a type unification algorithm instead of a simple infimum function as in the nonpolymorphic case. In this paper we solve t ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Unification in a polymorphic ordersorted signature differs substantially from the nonpolymorphic ordersorted unification. For the polymorphic ordersorted unification we need a type unification algorithm instead of a simple infimum function as in the nonpolymorphic case. In this paper we solve
Regular Expression OrderSorted Unification and Matching
"... We extend ordersorted unification by permitting regular expression sorts for variables and in the domains of function symbols. The obtained signature corresponds to a finite bottomup unranked tree automaton. We prove that regular expression ordersorted (REOS) unification is of type infinitary and ..."
Abstract
 Add to MetaCart
We extend ordersorted unification by permitting regular expression sorts for variables and in the domains of function symbols. The obtained signature corresponds to a finite bottomup unranked tree automaton. We prove that regular expression ordersorted (REOS) unification is of type infinitary
Regular Expression OrderSorted Unification and Matching
"... We extend ordersorted unification by permitting regular expression sorts for variables and in the domains of function symbols. The obtained signature corresponds to a finite bottomup unranked tree automaton. We prove that regular expression ordersorted (REOS) unification is of type infinitary and ..."
Abstract
 Add to MetaCart
We extend ordersorted unification by permitting regular expression sorts for variables and in the domains of function symbols. The obtained signature corresponds to a finite bottomup unranked tree automaton. We prove that regular expression ordersorted (REOS) unification is of type infinitary
OrderSorted Unification with Regular Expression Sorts (Work in Progress)
"... Abstract. We extend firstorder ordersorted unification by permitting regular expression sorts for variables and in the domains of function symbols. The set of basic sorts is finite. The corresponding unification problem is infinitary. We conjecture that this unification problem is decidable and gi ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. We extend firstorder ordersorted unification by permitting regular expression sorts for variables and in the domains of function symbols. The set of basic sorts is finite. The corresponding unification problem is infinitary. We conjecture that this unification problem is decidable
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 Polymorphism in Isabelle \Lambda
, 1992
"... Abstract 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 ..."
Abstract
 Add to MetaCart
Abstract 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
Syntactic Unification Problems under Constrained Substitutions
, 1996
"... ... This paper is a collection of results on the decidability and the computational complexity of a syntactic unification problem under constrained substitutions. A number of decidable, undecidable, tractable and intractable results of the problem are presented. Since a unification problem under con ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
constrained substitutions can be regarded as an ordersorted unification problem with term declarations such that the number of sorts is only one, the results presented in this paper also indicate how the intractability of ordersorted unification problems is reduced by restricting the number of sorts to one.
Refinement of a typed WAM extension by polymorphic ordersorted types
, 1996
"... We refine the mathematical specification of a WAM extension to typeconstraint logic programming given in [BB96]. We provide a full specification and correctness proof of the PROTOS Abstract Machine (PAM), an extension of the WAM by polymorphic ordersorted unification as required by the logic pro ..."
Abstract

Cited by 10 (5 self)
 Add to MetaCart
We refine the mathematical specification of a WAM extension to typeconstraint logic programming given in [BB96]. We provide a full specification and correctness proof of the PROTOS Abstract Machine (PAM), an extension of the WAM by polymorphic ordersorted unification as required by the logic
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
Results 1  10
of
40,639