Results 1  10
of
14,287
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
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
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
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
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
A Decidable Case of the SemiUnification Problem (Draft Version)
, 1991
"... Semiunification is a common generalization of unification and matching. The semiunification problem is to decide solvability of finite sets of equations s = t and inequations ˜s ≤i ˜t between firstorder terms, with different inequality relations ≤i, i ∈ I. A solution consists of a substitution T0 ..."
Abstract
 Add to MetaCart
Semiunification is a common generalization of unification and matching. The semiunification problem is to decide solvability of finite sets of equations s = t and inequations ˜s ≤i ˜t between firstorder terms, with different inequality relations ≤i, i ∈ I. A solution consists of a substitution T0
Term Rewriting Systems
, 1992
"... Term Rewriting Systems play an important role in various areas, such as abstract data type specifications, implementations of functional programming languages and automated deduction. In this chapter we introduce several of the basic comcepts and facts for TRS's. Specifically, we discuss Abstra ..."
Abstract

Cited by 613 (18 self)
 Add to MetaCart
Term Rewriting Systems play an important role in various areas, such as abstract data type specifications, implementations of functional programming languages and automated deduction. In this chapter we introduce several of the basic comcepts and facts for TRS's. Specifically, we discuss
Mediators in the architecture of future information systems
 IEEE COMPUTER
, 1992
"... The installation of highspeed networks using optical fiber and high bandwidth messsage forwarding gateways is changing the physical capabilities of information systems. These capabilities must be complemented with corresponding software systems advances to obtain a real benefit. Without smart softw ..."
Abstract

Cited by 1128 (20 self)
 Add to MetaCart
software we will gain access to more data, but not improve access to the type and quality of information needed for decision making. To develop the concepts needed for future information systems we model information processing as an interaction of data and knowledge. This model provides criteria for a high
Results 1  10
of
14,287