Dale Miller, Gopalan Nadathur, Frank Pfenning, and Andre Scedrov. Uniform proof systems as a foundation for logic programming. To appear in the Annals of Pure and Applied Logic.

 Home/Search   Document Not in Database   Summary   Related Articles  

This paper is cited in the following contexts:
Representing Objects in a Logic Programming Language with.. - Hodas, Miller (1990)   (16 citations)  Self-citation (Miller)   (Correct)

....Various extensions to the foundation of logic programming have been proposed to provide scoping constructs for program clauses and constants. We shall base our language on a logic similar to N Prolog [8] the intuitionistic clausal system of [4,13,14] and the hereditary Harrop formulas of [15,16,17]. Since a simple modification of the latter logic is the logic we consider here, we refer to it simply as hH 0 . We briefly describe hH 0 from an operational pointof view below. The reader interested in proof theoretic semantics should refer to the papers mentioned above. Positive Horn ....

Dale Miller, Gopalan Nadathur, Frank Pfenning, and Andre Scedrov. Uniform proof systems as a foundation for logic programming. To appear in the Annals of Pure and Applied Logic.

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