A Combinatory Logic Approach to Higher-Order E-Unification

نویسندگان

  • Daniel J. Dougherty
  • Patricia Johann
چکیده

Let E be a rst-order equational theory. A translation of typed higher-order E-uniication problems into a typed combinatory logic framework is presented and justiied. The case in which E admits presentation as a convergent term rewriting system is treated in detail: in this situation, a modiication of ordinary narrowing is shown to be a complete method for enumerating higher-order E-uniiers. In fact, we treat a more general problem, in which the types of terms contain type variables.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Higher-Order Rigid E-Unification

Higher-order E-uniication, i.e. the problem of nding substitutions that make two simply typed-terms equal modulo or-equivalence and a given equational theory, is undecidable. We propose to rigidify it, to get a resource-bounded decidable uniication problem (with arbitrary high bounds), providing a complete higher-order E-uniication procedure. The techniques are inspired from Gallier's rigid E-u...

متن کامل

Using Higher-Order Logic Programming for Semantic Interpretation of Coordinate Constructs

Many theories of semantic interpretation use λ-term manipulation to compositionally compute the meaning of a sentence. These theories are usually implemented in a language such as Prolog that can simulate λ-term operations with first-order unification. However, for some interesting cases, such as a Combinatory Categorial Grammar account of coordination constructs, this can only be done by obscu...

متن کامل

Higher-Order and Semantic Unification

Abstrac t . We provide a complete system of transformation rules for semantic unification with respect to theories defined by convergent rewrite systems. We show that this standard unification procedure, with slight modifications, can be used to solve the satisfiability problem in combinatory logic with a convergent set of algebraic axioms R, thus resulting in a complete higher-order unificatio...

متن کامل

A Functional Logic Language Based on Higher Order Narrowing

Functional logic languageshave a syntax like a purely functional language but use narrowing as operational semantics. We present the functional logic language Higher Order Babel which provides higher order unification for parameter passing and solving equations. When searching for a function which solves an equation “polynomial functions” as well as defined functions are taken into account. In ...

متن کامل

Type-2 Fuzzy Logic Approach To Increase The Accuracy Of Software Development Effort Estimation

predicting the effort of a successful project has been a major problem for software engineers the significance of which has led to extensive investigation in this area. One of the main objectives of software engineering society is the development of useful models to predict the costs of software product development. The absence of these activities before starting the project will lead to variou...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Theor. Comput. Sci.

دوره 139  شماره 

صفحات  -

تاریخ انتشار 1995