Computability Theory, Semantics, and Logic Programming

Clarendon Press (1987)
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.
Keywords Computable functions  Data structures (Computer science
Categories (categorize this paper)
Buy the book $8.78 used (83% off)   $74.56 new    Amazon page
Call number QA9.59.F58 1987
ISBN(s) 0195036913  
DOI 10.2307/2274624
Options
 Save to my reading list
Follow the author(s)
Edit this record
My bibliography
Export citation
Find it on Scholar
Mark as duplicate
Request removal from index
Revision history
Download options
Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 30,727
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA
Pseudo-Boolean Valued Prolog.Melvin Fitting - 1988 - Studia Logica 47 (2):85-91.

Add more citations

Similar books and articles
Added to PP index
2009-01-28

Total downloads
7 ( #538,599 of 2,197,326 )

Recent downloads (6 months)
2 ( #149,011 of 2,197,326 )

How can I increase my downloads?

Monthly downloads
My notes
Sign in to use this feature