J.A. Goguen and J. Meseguer. Equality, types, modules, and (why not?) generics for logic programming. Journal of Logic Programming, 2, 1984.  Home/Search   Document Not in Database   Summary   Related Articles   Check

.... Among the efforts which have been focusing on the dynamic aspects of object oriented programming (i.e. change of state) we have mentioned [11, 17, 19, 29, 30, 31, 32] efforts which have been focusing on the static aspects (i.e. inheritance) of object oriented programming are described in [2, 9, 12, 16, 21, 33]. The framework presented here should provide a theoretical basis for the integration of these two traditions. 10, 28, 8] provide also extensions of Prolog in the direction of object oriented and distributed programming where formulae with multiple heads are allowed; some of the ideas ....

J.A. Goguen and J. Meseguer. Equality, types, modules, and (why not?) generics for logic programming. Journal of Logic Programming, 2, 1984.

.... Among the efforts which have been focusing on the dynamic aspects of object oriented programming (i.e. change of state) we have mentioned [6, 12, 14, 22, 23, 24, 25] efforts which have been focusing on the static aspects (i.e. inheritance) of object oriented programming are described in [1, 4, 7, 11, 26]. The framework presented here should provide a theoretical basis for the integration of these two traditions. 5] provides also an extension of Prolog in the direction of object oriented programming where clauses with multiple heads are allowed; some of the ideas characterizing this approach are ....

J.A. Goguen and J. Meseguer. Equality, types, modules, and (why not?) generics for logic programming. Journal of Logic Programming, 2, 1984.

....thousands of squaremiles area such as 8708 (the problem would become even more noticeable if the exact areas were stored, perhaps as real numbers, with rounding problems etc. Therefore 3 , in our opinion this historical DATALOG example should be rewritten functionally, as already implied in [GM84] For this we extract the second argument from the DATALOG facts and use it as the so called foot after a : infix: area(china) 3380. area(india) 1139. area(ussr) 8708. area(usa) 3609. The resulting special DATAFUN clauses are called footed facts, here used for the pointwise ....

Joseph A. Goguen and Jos'e Meseguer. Equality, types, modules, and (why not?) generics for logic programming. J. Logic Programming, 1(2):179--210, 1984.

....a logic programming system to cope with functional programming features and results in a new logic programming system. Most approaches take first order equational logic as the semantic logic of functional languages and combine it with Horn clause logic. The following remarks made by Goguen in [GM84] reveal the underlying philosophy of the approach. Not only does logic programming in our broad sense include both relational and functional programming, but we will attempt to convince the reader that a very natural way to unify relational and functional programming is just to unify their logics, ....

....with some form of equational deduction such as paramodulation [ or narrowing [Hul80] A complete computational model was proposed recently by Snyder et al. Sny90] as a goal directed inference system. Systems which aim to support the full power of Horn clause logic with equality include Eqlog [GM84], which exploits fully the order sorted variation of the logic, SLOG [Fri85] in which a completion procedure is used as the computational model, and Yukawa s system [Yuk88] which uses an explicit axiomatization of equality. The computational difficulties of constructing a practical programming ....

Joseph A. Goguen and Jose Meseguer. Equality, types, modules, and (why not?) generics for logic programming. Journal of Logic Programming, 2:179--210, 1984.

....integrate SLD resolution with some form of equational deduction such as paramodulation. A complete computational model was proposed recently by Snyder et al. Sny90] as a goal directed inference system. Systems which aim to support the full power of Horn clause logic with equality include Eqlog [GM84], which exploits fully the order sorted variation of the logic, SLOG [Fri85] in which a completion procedure is used as the computational model, and Yukawa s system [Yuk88] which uses an explicit axiomatization of equality. The computational difficulties of constructing a practical programming ....

Joseph A. Goguen and Jose Meseguer. Equality, types, modules, and (why not?) generics for logic programming. Journal of Logic Programming, 2:179--210, 1984.

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