Titlebook: Declarative Programming, Sasbachwalden 1991; PHOENIX Seminar and John Darlington,Roland Dietrich (Dr. rer. nat.) Conference proceedings 19

分解

一致性

Syntactic and Semantic Inheritance in Logic Programmingf partially ordered sets of logic program units. We develop for such systems operational, declarative and fixed point semantics which are proven equivalent..We begin by discussing, in logic programming terms, the basic types of inheritance that can be achieved. We identify two kinds, semantic and sy

使痛苦

A survey of the implementations of narrowingr a program as a conditional term rewriting system, with conditional narrowing as the goal-solving mechanism. If EQLOG [14] is one of the earliest proposals in that direction, many others have since then followed the trend, including SLOG [10], K-LEAF [12], ALF [15], BABEL [18] and many others.

BLANK

exacerbate

Some Algorithms for Fast and Complete Execution of Logic Programsally and experimentally. In addition to new variants of depth-first iterative-deepening, a novel complete strategy, random iterative-probing, is introduced. The best algorithm in the article combines deep and shallow search and has in comparison with Prolog a much greater class of programs and queri

橡子

A Common Graphical Formistributed processors. A key feature of the structure is its ability to model disparate abstract machines in a uniform manner; this enables us to experiment with different abstract machines without having to recode major parts of the run-time system for each additional machine. Because we are dealin

Ingratiate

Conference proceedings 1992ty of important technical areas such as foundations and languages, program transformation and analysis, integrated approaches, implementation techniques, abstract machines and programming methodology. The resulting volume provides an in-depth picture of current research into declarative programming.

perpetual

共同確定為確

Benedikt Sturzenhecker,Elisabeth Richtererloaded identifiers as well as conformity clauses that declare one abstract type to be more specific than another..The generalization of type classes to abstract types has the advantage of greater expressiveness: We can model polymorphic abstract types and heterogeneous data structures, concepts wh

Magnificent

Demokratiep?dagogik und Verantwortungslernenint semantics, and we prove their equivalence. The equivalence between declarative and operational semantics is based on a two-step reduction of inheritance systems to non-inheritance systems, i.e. systems of standard logic programs, by eliminating first syntactic inheritance and then semantic inher