Results 1  10
of
29,275
SemiUnification
"... Semiunifiability is a generalization of both unification and matching. It is used to check nontermination of rewrite rules. In this paper an inference system is presented that decides semiunifiability of two terms s and t and computes a semiunifier. In contrast to an algorithm by Kapur, Musser et ..."
Abstract
 Add to MetaCart
Semiunifiability is a generalization of both unification and matching. It is used to check nontermination of rewrite rules. In this paper an inference system is presented that decides semiunifiability of two terms s and t and computes a semiunifier. In contrast to an algorithm by Kapur, Musser
On QuasiMonadic SemiUnification
, 1991
"... Semiunification is a generalization of both unification and matching with applications in proof theory, term rewriting systems, polymorphic type inference, and natural language processing. It is the problem of solving a set of term inequalities M1 ≤ N1,..., Mk ≤ Nk, where ≤ is interpreted as the su ..."
Abstract
 Add to MetaCart
Semiunification is a generalization of both unification and matching with applications in proof theory, term rewriting systems, polymorphic type inference, and natural language processing. It is the problem of solving a set of term inequalities M1 ≤ N1,..., Mk ≤ Nk, where ≤ is interpreted
A General Theory of SemiUnification
, 1993
"... Various restrictions on the terms allowed for substitution give rise to different cases of semiunification. Semiunification on finite and regular terms has already been considered in the literature. We introduce a general case of semiunification where substitutions are allowed on nonregular term ..."
Abstract
 Add to MetaCart
Various restrictions on the terms allowed for substitution give rise to different cases of semiunification. Semiunification on finite and regular terms has already been considered in the literature. We introduce a general case of semiunification where substitutions are allowed on non
Type inference and semiunification
 In Proceedings of the ACM Conference on LISP and Functional Programming (LFP ) (Snowbird
, 1988
"... In the last ten years declarationfree programming languages with a polymorphic typing discipline (ML, B) have been developed to approximate the flexibility and conciseness of dynamically typed languages (LISP, SETL) while retaining the safety and execution efficiency of conventional statically type ..."
Abstract

Cited by 32 (7 self)
 Add to MetaCart
polymorphism found in, e.g., ML with a polymorphic typing rule for recursive definitions. We show that semiunification, the problem of solving inequalities over firstorder terms, characterizes type checking in the MilnerMycroft Calculus to polynomial time, even in the restricted case where nested definitions
Fast leftlinear semiunification
 In Proc. Int’l. Conf. on Computing and Information
, 1990
"... Semiunification is a generalization of both unification and matching with applications in proof theory, term rewriting systems, polymorphic type inference, and natural language processing. It is the problem of solving a set of term inequalities M1 ≤ N1,..., Mk ≤ Nk, where ≤ is interpreted as the su ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
Semiunification is a generalization of both unification and matching with applications in proof theory, term rewriting systems, polymorphic type inference, and natural language processing. It is the problem of solving a set of term inequalities M1 ≤ N1,..., Mk ≤ Nk, where ≤ is interpreted
Fast Algorithms for Uniform SemiUnification
, 1999
"... We present a fast algorithm for uniform semiunification based on adapting the Huet unification closure method for standard unification. It solves the following decision problem in O(n 2 ff(n) 2 ), where n is the size of the two terms, and ff is the functional inverse of Ackermann 's funct ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
We present a fast algorithm for uniform semiunification based on adapting the Huet unification closure method for standard unification. It solves the following decision problem in O(n 2 ff(n) 2 ), where n is the size of the two terms, and ff is the functional inverse of Ackermann &apos
Logic Program Schemas, SemiUnification and Constraints
 In: N.E. Fuchs (ed), Proc. of LOPSTR'97 (this volume
"... The use of schemas is a classical way of synthesizing, transforming and analyzing logic programs. Operations on schemas are needed, in particular, the semiunification of schemas with programs. Since schemas are secondorder objects, the related semiunification is the secondorder semiunification, ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
The use of schemas is a classical way of synthesizing, transforming and analyzing logic programs. Operations on schemas are needed, in particular, the semiunification of schemas with programs. Since schemas are secondorder objects, the related semiunification is the secondorder semiunification
Logic Program Schemas, Constraints and SemiUnification
 In Proc. of LOPSTR’97, volume 1463 of LNCS
, 1998
"... . Program schemas are known to be useful in different applications such as program synthesis, transformation, analysis, debugging, teaching : : : This paper tackles two complementary aspects of program schemas. We first propose a language for the description of program schemas. It is based on a subs ..."
Abstract

Cited by 10 (1 self)
 Add to MetaCart
subset of secondorder logic, enhanced with constraints and specific features of program schemas. One of the basic operations on schemas is the semiunification of a schema with a program. We then express the semiunification process over schemas as rewriting and reduction rules, using CLP techniques
Semiunification of Two Terms in Abelian Groups
, 1994
"... A substitution oe AGsemiunifies the inequation s ? AG t iff there is another substitution ae such that ae(oe(s)) =AG oe(t), where =AG is equality in Abelian groups. I give an algorithm that decides if an inequation has an AGsemiunifier and, if so, returns a most general one. This is a firs ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
first step towards type derivation in programming languages with dimension types and polymorphic recursion. Key words: algorithms; Abelian groups; equational semiunification; programming languages; compilers; dimension types; polymorphic recursion. 1 Introduction This article describes an algebraic
Results 1  10
of
29,275