Type theory is one of the most important tools in the design of higher-level programming
languages, such as ML. This book introduces and teaches its techniques by focusing on one …

Higher-order unification and matching | Handbook of automated reasoning skip to main content
ACM Digital Library home ACM home Google, Inc. (search) Advanced Search Browse About …

The talk will present a survey of higher order unification, covering an outline of its historical
development, a summary of its applications to three fields: automated theorem proving, and …

The second-order unification problem is undecidable. While unification procedures, like
Huet's pre-unification, terminate with success on unifiable problems, they might not …

Ontology engineering is the field, within knowledge representation, concerned with using
logic-based formalisms to represent knowledge, typically moderately sized knowledge …

In recent work, we introduced the notion of elementary cyclic set of equations on first-order
terme. These are non-unifiable sets of equations, but that are non—uniflable in a minimal …

The talk will present a survey of higher order unification, covering an outline of its historical
development, a summary of its applications to three fields: automated theorem proving, and …

The second-order unification problem is undecidable [5]. While unification procedures, like
Huet's pre-unification, terminate with success on unifiable problems, they might not …

The mathematical analysis of proofs and the creation of modern proof calculi were originally
aiming more at analyzing the properties of existing proofs and less at the creation and …

Ti,..,~ T~ 0 where T= 0 L~ 0. it can be seen that closed terms of the type T reflex
constructions in the algebra A. Therefore any term of the type (TA) n~ TA defines some n-ary …