๐”– Scriptorium
โœฆ   LIBER   โœฆ
๐Ÿ“

Logic Programming: Operational Semantics and Proof Theory (Distinguished Dissertations in Computer Science)

โœ Scribed by James H. Andrews

Tongue
English
Leaves
116
Category
Library
โฌ‡  Acquire This Volume

No coin nor oath required. For personal study only.

โœฆ Synopsis

Dr Andrews here provides a homogeneous treatment of the semantics (operational and logical) of both theoretical and practical logic programming languages. He shows how the rift between theory and practice in logic programming can be bridged. This is achieved by precisely characterizing the way in which 'depth-first' search for solutions to a logical formula - the usual strategy in most practical languages - is incomplete. Languages that perform 'breadth-first' searches reflect more closely the theory underlying logic programming languages. Researchers interested in logic programming or semantics, as well as artificial intelligence search strategies, will want to consult this book as the only source for some essential and new ideas in the area.

๐Ÿ“œ SIMILAR VOLUMES

Logic Programming: Operational Semantics
๐Ÿ“ Logic Programming: Operational Semantics and Proof Theory
โœ James H. Andrews ๐Ÿ“‚ Library ๐Ÿ“… 1993 ๐Ÿ› Cambridge University Press ๐ŸŒ English

Dr Andrews here provides a homogeneous treatment of the semantics (operational and logical) of both theoretical and practical logic programming languages. He shows how the rift between theory and practice in logic programming can be bridged. This is achieved by precisely characterizing the way in wh

Logic Programming: Operational Semantics
๐Ÿ“ Logic Programming: Operational Semantics and Proof Theory
โœ James H. Andrews ๐Ÿ“‚ Library ๐Ÿ“… 1992 ๐Ÿ› Cambridge University Press ๐ŸŒ English

Dr Andrews here provides a homogeneous treatment of the semantics (operational and logical) of both theoretical and practical logic programming languages. He shows how the rift between theory and practice in logic programming can be bridged. This is achieved by precisely characterizing the way in wh

Functional Programming and Input/Output
๐Ÿ“ Functional Programming and Input/Output (Distinguished Dissertations in Computer Science)
โœ Andrew D. Gordon ๐Ÿ“‚ Library ๐Ÿ“… 2008 ๐Ÿ› Cambridge University Press ๐ŸŒ English

A common attraction to functional programming is the ease with which proofs can be given of program properties. A common disappointment with functional programming is the difficulty of expressing input/output (I/O) while at the same time being able to verify programs. Here, the author shows how a th

Computability Theory, Semantics, and Log
๐Ÿ“ Computability Theory, Semantics, and Logic Programming
โœ Melvin Fitting ๐Ÿ“‚ Library ๐Ÿ“… 1987 ๐Ÿ› Oxford University Press ๐ŸŒ English

This book describes computability theory and provides an extensive treatment of data structures and program correctness. It makes accessible some of the author's work on generalized recursion theory, particularly the material on the logic programming language PROLOG, which is currently of great int

Qualified Types: Theory and Practice (Di
๐Ÿ“ Qualified Types: Theory and Practice (Distinguished Dissertations in Computer Science (No. 9))
โœ Mark P. Jones ๐Ÿ“‚ Library ๐Ÿ“… 2003 ๐Ÿ› Cambridge University Press ๐ŸŒ English

This book describes the use of qualified types to provide a general framework for the combination of polymorphism and overloading. For example, qualified types can be viewed as a generalization of type classes in the functional language Haskell and the theorem prover Isabelle. These in turn are exte