A grammatical view of logic programming / Pierre Deransart, Jan Ma�uszy�nski.
By: Deransart, Pierre [author.]
.
Contributor(s): Ma�uszy�nski, Jan | IEEE Xplore (Online Service) [distributor.] | MIT Press [publisher.] | Institut national de recherche en informatique et en automatique (France).
Material type: 
BookSeries: Rapports de recherche (Institut national de recherche en informatique et en automatique (France)): no 883.Publisher: Le Chesnay, France : Institut national de recherche en informatique et en automatique, 1988Distributor: [Piscataqay, New Jersey] : IEEE Xplore, [2003]Description: 1 PDF (27, [1] pages).Content type: text Media type: electronic Carrier type: online resourceISBN: 9780262290845.Subject(s): Logic programmingGenre/Form: Electronic books.Additional physical formats: Print version:: No titleOnline resources: Abstract with links to resource Also available in print.Summary: Within the field of logic programming there have been numerous attempts to transform grammars into logic programs. This book describes a complementary approach that views logic programs as grammars and shows how this new presentation of the foundations of logic programming, based on the notion of proof trees, can enrich the field.The authors' approach facilitates discussion of grammatical aspects of, and introduces new kinds of semantics for, definite programs. They survey relevant grammatical formalisms and provide a comprehensive introduction to the well-known attribute grammars and van Wijngaarden grammars. A formal comparison of definite programs to these grammars allows the authors to identify interesting grammatical concepts.The book also includes a presentation of verification methods for definite programs derived from verification methods for attribute grammars, and an analysis of the occur-check problem as an example of how the grammatical view of logic programming can be applied.Pierre Deransart is Research Director at INRIA-Rocquencourt, Le Chesnay Cedex, France. Jan Maluszynski is Professor in the Department of Computer and Information Science at Linkoping University, Sweden.Contents: Preliminaries. Foundations. Grammatical Extensions of Logic Programs. Attribute Grammars. Attribute Grammars and Logic Programming. Proof Methods. Study of Declarative Properties. The Occur-check Problem.
Summary in French.
Restricted to subscribers or individual electronic text purchasers.
Within the field of logic programming there have been numerous attempts to transform grammars into logic programs. This book describes a complementary approach that views logic programs as grammars and shows how this new presentation of the foundations of logic programming, based on the notion of proof trees, can enrich the field.The authors' approach facilitates discussion of grammatical aspects of, and introduces new kinds of semantics for, definite programs. They survey relevant grammatical formalisms and provide a comprehensive introduction to the well-known attribute grammars and van Wijngaarden grammars. A formal comparison of definite programs to these grammars allows the authors to identify interesting grammatical concepts.The book also includes a presentation of verification methods for definite programs derived from verification methods for attribute grammars, and an analysis of the occur-check problem as an example of how the grammatical view of logic programming can be applied.Pierre Deransart is Research Director at INRIA-Rocquencourt, Le Chesnay Cedex, France. Jan Maluszynski is Professor in the Department of Computer and Information Science at Linkoping University, Sweden.Contents: Preliminaries. Foundations. Grammatical Extensions of Logic Programs. Attribute Grammars. Attribute Grammars and Logic Programming. Proof Methods. Study of Declarative Properties. The Occur-check Problem.
Also available in print.
Mode of access: World Wide Web
Description based on PDF viewed 12/29/2015.
There are no comments for this item.