The Integration of Functions into Logic Programming: a Survey K I N F O R M a T I K Im Stadtwald D 66123 Saarbr Ucken Germany Author's Address
نویسنده
چکیده
Functional and logic programming are the most important declarative programming paradigms, and interest in combining them has grown over the last decade. Early research concentrated on the de nition and improvement of execution principles for such integrated languages, while more recently e cient implementations of these execution principles have been developed so that these languages became relevant for practical applications. In this paper we survey the development of the operational semantics as well as the improvement of the implementation of functional logic languages.
منابع مشابه
Max-planck-institut F Ur Informatik Linear 0 -1 Inequalities and Extended Clauses K I N F O R M a T I K Im Stadtwald D 66123 Saarbr Ucken Germany Author's Address
Extended clauses are the basic formulas of the 0-1 constraint solver for the constraint logic programming language CLP(PB). We present a method for transforming an arbitrary linear 0-1 inequality into a set of extended clauses, such that the solution space remains invariant. After applying well-known linearization techniques on non-linear 0-1 constraints followed by the presented transformation...
متن کاملMax-planck-institut F Ur Informatik Middle-out Reasoning for Logic Program Synthesis K I N F O R M a T I K Im Stadtwald D 66123 Saarbr Ucken Germany Authors' Addresses
Logic programs can be synthesized as a by-product of the planning of their veri cation proofs. This is achieved by using higher-order variables at the proof planning level, which become instantiated in the course of planning. We illustrate two uses of such variables in proof planning for program synthesis, one for synthesis proper and one for the selection of induction schemes. We demonstrate t...
متن کاملMax-planck-institut F Ur Informatik an Abstract Program Generation Logic K I N F O R M a T I K Im Stadtwald D 66123 Saarbr Ucken Germany Authors' Addresses
We present a system for representing programs as proofs which combines features of classical and constructive logic We present the syntax semantics and inference rules of the system and establish soundness and consistency The system is based on an unspeci ed underlying logic possessing certain properties We show how proofs in this system can be systematically converted to programs in a class of...
متن کاملMax-planck-institut F Ur Informatik Metalogical Frameworks K I N F O R M a T I K Im Stadtwald D 66123 Saarbr Ucken Germany Authors' Addresses Publication Notes
In computer science we speak of implementing a logic; this is done in a programming language, such as Lisp, called here the implementation language. We also reason about the logic, as in understanding how to search for proofs; these arguments are expressed in the metalanguage and conducted in the metalogic of the object language being implemented. We also reason about the implementation itself,...
متن کاملThe Search Eciency of Theorem Proving Strategies: an Analytical Comparison K I N F O R M a T I K Im Stadtwald D 66123 Saarbr Ucken Germany Authors' Addresses Publication Notes
We analyze the search e ciency of a number of common refutational theorem proving strategies for rst order logic Search e ciency is concerned with the total number of proofs and partial proofs generated rather than with the sizes of the proofs We show that most common strategies produce search spaces of exponential size even on simple sets of clauses or else are not sensitive to the goal Howeve...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994