Sprache: Englisch
Verlag: Cambridge University Press, 1990
ISBN 10: 0521395607 ISBN 13: 9780521395601
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
EUR 69,74
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New. In.
Sprache: Englisch
Verlag: Cambridge University Press, 1990
ISBN 10: 0521395607 ISBN 13: 9780521395601
Anbieter: Kennys Bookstore, Olney, MD, USA
EUR 100,40
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New. A study of techniques for formal theorem-proving, with particular reference to Cambridge LCF (Logic for Computable Functions). The book is aimed at graduate students and researchers in theoretical computer science. Series Editor(s): Van Rijsbergen, C. J.; Abramsky, S.; Aczel, P. H.; Bakker, J. W. de; Gurevich, Y.; Tucker, J. V. Series: Cambridge Tracts in Theoretical Computer Science. Num Pages: 320 pages, bibliography, index. BIC Classification: PBCD; UKD; UYA. Category: (P) Professional & Vocational. Dimension: 247 x 174 x 17. Weight in Grams: 580. . 2008. Revised ed. paperback. . . . . Books ship from the US and Ireland.
Sprache: Englisch
Verlag: Cambridge University Press, 1987
ISBN 10: 0521346320 ISBN 13: 9780521346320
Anbieter: Anybook.com, Lincoln, Vereinigtes Königreich
EUR 87,64
Anzahl: 1 verfügbar
In den WarenkorbZustand: Fair. This is an ex-library book and may have the usual library/used-book markings inside.This book has hardback covers. In fair condition, suitable as a study copy. No dust jacket. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,900grams, ISBN:9780521346320.
Sprache: Englisch
Verlag: Cambridge University Press, 1990
ISBN 10: 0521395607 ISBN 13: 9780521395601
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.