Computability theory, semantics, and logic programming

Oxford: Clarendon Press (1987)
  Copy   BIBTEX

Abstract

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 interest. Fitting considers the relation of PROLOG logic programming to the LISP type of language.

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 106,756

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2009-01-28

Downloads
53 (#457,493)

6 months
15 (#217,594)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Melvin Fitting
CUNY Graduate Center

Citations of this work

Computability and recursion.Robert I. Soare - 1996 - Bulletin of Symbolic Logic 2 (3):284-321.
Pseudo-Boolean valued prolog.Melvin Fitting - 1988 - Studia Logica 47 (2):85-91.

Add more citations

References found in this work

No references found.

Add more references