G. Nadathur and D. Miller. An Overview of -Prolog. Fifth International Conference Symposium on Logic Programming, 1988.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....Section, is based on such an idea. Other approaches are also obtainable by simply implementing different strategies of messages handling. 6 Current and Future Work An experimental implementation of a simple OO language, based on the previously presented ideas, has been developed using Prolog [13], a higherorder logic programming language based on intuitionistic logic and on simply typed lambda calculus. In order to define a prototype for F O it is necessary to get rid of the order between formulas in a goal, forcing non determinism in the selection of atoms. However, to develop the ....

G. Nadathur and D. Miller. An Overview of -Prolog. Fifth International Conference Symposium on Logic Programming, 1988.

....interchangeability of programs and data and the representation of sequentiality, which is important to model method invocations, by using a continuation passing technique. Furthermore, the main advantage of Forum with respect to other higherorder extensions of logic programming, such as Prolog [38] and HiLog [12] is that its linear logic component provides for a logical account of state and state transitions, expressed by propositions and logical rules, respectively. In order to simplify the work we will focus on a simply typed formulation of Chimera, exploiting term constructors to ....

....of advanced deductive database systems. Moreover, the good computational properties of the language E hhf allowed us to define an executable specification for Chimera; an experimental implementation for E hhf , in fact, has been developed by the authors using the higher order language Prolog [38]. This implementation could be useful, for instance, in order to study properties concerning query and method optimization. The advantages of using linear logic derive from its being a general purpose logic whose relationships with computational paradigms for imperative and concurrent programming ....

[Article contains additional citation context not shown here]

G. Nadathur and D. Miller. An Overview of -Prolog. Fifth International Conference Symposium on Logic Programming, 1988.

....E formulas, and replaced by the use of logical variables within top level goal formulas. As a further remark, we note that our encoding of quantified formulas as terms differs from the more conventional use of the simply typed calculus adopted elsewhere to define higher order languages (cfr. [4, 13, 9]) Since we don t need abstraction and application for the aims of the present paper, the choice of this simplified encoding is possible, and appealing for several reasons: first, it reduces the notion of equality over Sigma terms to ff convertibility, and it makes unification of Sigma terms a ....

G. Nadathur and D. Miller. An Overview of -Prolog. Fifth International Conference Symposium on Logic Programming, 1988.

No context found.

G. Nadathur and D. Miller. An Overview of -Prolog. Fifth International Conference Symposium on Logic Programming, 1988.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC