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.00 used (84% off) $83.75 new Amazon page|
|Call number||QA9.59.F58 1987|
|External links||This entry has no external links. Add one.|
|Through your library||Configure|
Similar books and articles
Carlo Cellucci (1987). Using Full First Order Logic As a Programming Language. In G. Lolli (ed.), Logic and Computer Science: New Trends and Applications. Rosenberg & Sellier.
Roberto M. Amadio (1998). Domains and Lambda-Calculi. Cambridge University Press.
George Boolos, John Burgess, Richard P. & C. Jeffrey (2007). Computability and Logic. Cambridge University Press.
Nigel Cutland (1980). Computability, an Introduction to Recursive Function Theory. Cambridge University Press.
S. B. Cooper, T. A. Slaman & S. S. Wainer (eds.) (1996). Computability, Enumerability, Unsolvability: Directions in Recursion Theory. Cambridge University Press.
Lawrence C. Paulson (1987). Logic and Computation: Interactive Proof with Cambridge Lcf. Cambridge University Press.
Martin Davis (1990). Book Review: Melvin Fitting. Computability Theory, Semantics, and Logic Programming. [REVIEW] Notre Dame Journal of Formal Logic 31 (3):485-486.
Sorry, there are not enough data points to plot this chart.
Added to index2009-01-28
Recent downloads (6 months)0
How can I increase my downloads?