This book is concerned with techniques for formal theorem-proving, with particular reference to Cambridge LCF (Logic for Computable Functions). Cambridge LCF is a computer program for reasoning about computation. It combines the methods of mathematical logic with domain theory, the basis of the deno...

Ausführliche Beschreibung

Bibliographische Detailangaben

1. Verfasser:	Paulson, Lawrence C. (VerfasserIn)
Format:	Elektronisch E-Book
Sprache:	English
Veröffentlicht:	Cambridge Cambridge University Press 1987
Schriftenreihe:	Cambridge tracts in theoretical computer science 2
Schlagworte:	Datenverarbeitung Cambridge LCF (Computer system) Computable functions / Data processing Mathematische Logik Logische Programmierung Berechenbarkeit Berechenbare Funktion
Online-Zugang:	BSB01 FHN01 Volltext
Zusammenfassung:	This book is concerned with techniques for formal theorem-proving, with particular reference to Cambridge LCF (Logic for Computable Functions). Cambridge LCF is a computer program for reasoning about computation. It combines the methods of mathematical logic with domain theory, the basis of the denotational approach to specifying the meaning of program statements. Cambridge LCF is based on an earlier theorem-proving system, Edinburgh LCF, which introduced a design that gives the user flexibility to use and extend the system. A goal of this book is to explain the design, which has been adopted in several other systems. The book consists of two parts. Part I outlines the mathematical preliminaries, elementary logic and domain theory, and explains them at an intuitive level, giving reference to more advanced reading; Part II provides sufficient detail to serve as a reference manual for Cambridge LCF. It will also be a useful guide for implementors of other programs based on the LCF approach
Beschreibung:	Title from publisher's bibliographic system (viewed on 05 Oct 2015)
Beschreibung:	1 online resource (xiii, 302 pages)
ISBN:	9780511526602
DOI:	10.1017/CBO9780511526602