Logic and computation: interactive proof with Cambridge LCF
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...
Gespeichert in:
| Beteilige Person: | |
|---|---|
| Format: | E-Book |
| Sprache: | Englisch |
| Veröffentlicht: |
Cambridge
Cambridge University Press
1987
|
| Schriftenreihe: | Cambridge tracts in theoretical computer science
2 |
| Links: | https://doi.org/10.1017/CBO9780511526602 |
| 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. |
| Umfang: | 1 Online-Ressource (xiii, 302 Seiten) |
| ISBN: | 9780511526602 |
Internformat
MARC
| LEADER | 00000nam a2200000 i 4500 | ||
|---|---|---|---|
| 001 | ZDB-20-CTM-CR9780511526602 | ||
| 003 | UkCbUP | ||
| 005 | 20151005020620.0 | ||
| 006 | m|||||o||d|||||||| | ||
| 007 | cr|||||||||||| | ||
| 008 | 090407s1987||||enk o ||1 0|eng|d | ||
| 020 | |a 9780511526602 | ||
| 100 | 1 | |a Paulson, Lawrence C. | |
| 245 | 1 | 0 | |a Logic and computation |b interactive proof with Cambridge LCF |c Lawrence C. Paulson |
| 246 | 3 | |a Logic & Computation | |
| 264 | 1 | |a Cambridge |b Cambridge University Press |c 1987 | |
| 300 | |a 1 Online-Ressource (xiii, 302 Seiten) | ||
| 336 | |b txt | ||
| 337 | |b c | ||
| 338 | |b cr | ||
| 490 | 1 | |a Cambridge tracts in theoretical computer science |v 2 | |
| 520 | |a 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. | ||
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9780521346320 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9780521395601 |
| 966 | 4 | 0 | |l DE-91 |p ZDB-20-CTM |q TUM_PDA_CTM |u https://doi.org/10.1017/CBO9780511526602 |3 Volltext |
| 912 | |a ZDB-20-CTM | ||
| 912 | |a ZDB-20-CTM | ||
| 049 | |a DE-91 | ||
Datensatz im Suchindex
| DE-BY-TUM_katkey | ZDB-20-CTM-CR9780511526602 |
|---|---|
| _version_ | 1825574050256125952 |
| adam_text | |
| any_adam_object | |
| author | Paulson, Lawrence C. |
| author_facet | Paulson, Lawrence C. |
| author_role | |
| author_sort | Paulson, Lawrence C. |
| author_variant | l c p lc lcp |
| building | Verbundindex |
| bvnumber | localTUM |
| collection | ZDB-20-CTM |
| format | eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01886nam a2200277 i 4500</leader><controlfield tag="001">ZDB-20-CTM-CR9780511526602</controlfield><controlfield tag="003">UkCbUP</controlfield><controlfield tag="005">20151005020620.0</controlfield><controlfield tag="006">m|||||o||d||||||||</controlfield><controlfield tag="007">cr||||||||||||</controlfield><controlfield tag="008">090407s1987||||enk o ||1 0|eng|d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780511526602</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Paulson, Lawrence C.</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Logic and computation</subfield><subfield code="b">interactive proof with Cambridge LCF</subfield><subfield code="c">Lawrence C. Paulson</subfield></datafield><datafield tag="246" ind1="3" ind2=" "><subfield code="a">Logic & Computation</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge</subfield><subfield code="b">Cambridge University Press</subfield><subfield code="c">1987</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (xiii, 302 Seiten)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Cambridge tracts in theoretical computer science</subfield><subfield code="v">2</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">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.</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9780521346320</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9780521395601</subfield></datafield><datafield tag="966" ind1="4" ind2="0"><subfield code="l">DE-91</subfield><subfield code="p">ZDB-20-CTM</subfield><subfield code="q">TUM_PDA_CTM</subfield><subfield code="u">https://doi.org/10.1017/CBO9780511526602</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-20-CTM</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-20-CTM</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91</subfield></datafield></record></collection> |
| id | ZDB-20-CTM-CR9780511526602 |
| illustrated | Not Illustrated |
| indexdate | 2025-03-03T11:58:04Z |
| institution | BVB |
| isbn | 9780511526602 |
| language | English |
| open_access_boolean | |
| owner | DE-91 DE-BY-TUM |
| owner_facet | DE-91 DE-BY-TUM |
| physical | 1 Online-Ressource (xiii, 302 Seiten) |
| psigel | ZDB-20-CTM TUM_PDA_CTM ZDB-20-CTM |
| publishDate | 1987 |
| publishDateSearch | 1987 |
| publishDateSort | 1987 |
| publisher | Cambridge University Press |
| record_format | marc |
| series2 | Cambridge tracts in theoretical computer science |
| spelling | Paulson, Lawrence C. Logic and computation interactive proof with Cambridge LCF Lawrence C. Paulson Logic & Computation Cambridge Cambridge University Press 1987 1 Online-Ressource (xiii, 302 Seiten) txt c cr Cambridge tracts in theoretical computer science 2 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. Erscheint auch als Druck-Ausgabe 9780521346320 Erscheint auch als Druck-Ausgabe 9780521395601 |
| spellingShingle | Paulson, Lawrence C. Logic and computation interactive proof with Cambridge LCF |
| title | Logic and computation interactive proof with Cambridge LCF |
| title_alt | Logic & Computation |
| title_auth | Logic and computation interactive proof with Cambridge LCF |
| title_exact_search | Logic and computation interactive proof with Cambridge LCF |
| title_full | Logic and computation interactive proof with Cambridge LCF Lawrence C. Paulson |
| title_fullStr | Logic and computation interactive proof with Cambridge LCF Lawrence C. Paulson |
| title_full_unstemmed | Logic and computation interactive proof with Cambridge LCF Lawrence C. Paulson |
| title_short | Logic and computation |
| title_sort | logic and computation interactive proof with cambridge lcf |
| title_sub | interactive proof with Cambridge LCF |
| work_keys_str_mv | AT paulsonlawrencec logicandcomputationinteractiveproofwithcambridgelcf AT paulsonlawrencec logiccomputation |