Deduction and declarative programming:
Declarative programs consist of mathematical functions and relations and are amenable to formal specification and verification, since the methods of logic and proof can be applied to the programs in a well-defined manner. Here Dr Padawitz emphasizes verification based on logical inference rules, i.e...
Gespeichert in:
| Beteilige Person: | |
|---|---|
| Format: | E-Book |
| Sprache: | Englisch |
| Veröffentlicht: |
Cambridge
Cambridge University Press
1992
|
| Schriftenreihe: | Cambridge tracts in theoretical computer science
28 |
| Links: | https://doi.org/10.1017/CBO9780511569876 |
| Zusammenfassung: | Declarative programs consist of mathematical functions and relations and are amenable to formal specification and verification, since the methods of logic and proof can be applied to the programs in a well-defined manner. Here Dr Padawitz emphasizes verification based on logical inference rules, i.e. deduction (in contrast with model-theoretic approaches, deductive methods can be automated to some extent). His treatment of the subject differs from others in that he tries to capture the actual styles and applications of programming; neither too general with respect to the underlying logic, nor too restrictive for the practice of programming. He generalizes and unifies results from classical theorem-proving and term rewriting to provide proof methods tailored to declarative program synthesis and verification. Detailed examples accompany the development of the methods, whose use is supported by a documented prototyping system. The book can be used for graduate courses or as a reference for researchers in formal methods, theorem-proving and declarative languages. |
| Umfang: | 1 Online-Ressource (vi, 279 Seiten) |
| ISBN: | 9780511569876 |
Internformat
MARC
| LEADER | 00000nam a2200000 i 4500 | ||
|---|---|---|---|
| 001 | ZDB-20-CTM-CR9780511569876 | ||
| 003 | UkCbUP | ||
| 005 | 20151005020622.0 | ||
| 006 | m|||||o||d|||||||| | ||
| 007 | cr|||||||||||| | ||
| 008 | 090520s1992||||enk o ||1 0|eng|d | ||
| 020 | |a 9780511569876 | ||
| 100 | 1 | |a Padawitz, Peter |d 1953- | |
| 245 | 1 | 0 | |a Deduction and declarative programming |c Peter Padawitz |
| 246 | 3 | |a Deductive & Declarative Programming | |
| 264 | 1 | |a Cambridge |b Cambridge University Press |c 1992 | |
| 300 | |a 1 Online-Ressource (vi, 279 Seiten) | ||
| 336 | |b txt | ||
| 337 | |b c | ||
| 338 | |b cr | ||
| 490 | 1 | |a Cambridge tracts in theoretical computer science |v 28 | |
| 520 | |a Declarative programs consist of mathematical functions and relations and are amenable to formal specification and verification, since the methods of logic and proof can be applied to the programs in a well-defined manner. Here Dr Padawitz emphasizes verification based on logical inference rules, i.e. deduction (in contrast with model-theoretic approaches, deductive methods can be automated to some extent). His treatment of the subject differs from others in that he tries to capture the actual styles and applications of programming; neither too general with respect to the underlying logic, nor too restrictive for the practice of programming. He generalizes and unifies results from classical theorem-proving and term rewriting to provide proof methods tailored to declarative program synthesis and verification. Detailed examples accompany the development of the methods, whose use is supported by a documented prototyping system. The book can be used for graduate courses or as a reference for researchers in formal methods, theorem-proving and declarative languages. | ||
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9780521032513 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9780521417235 |
| 966 | 4 | 0 | |l DE-91 |p ZDB-20-CTM |q TUM_PDA_CTM |u https://doi.org/10.1017/CBO9780511569876 |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-CR9780511569876 |
|---|---|
| _version_ | 1825574050265563136 |
| adam_text | |
| any_adam_object | |
| author | Padawitz, Peter 1953- |
| author_facet | Padawitz, Peter 1953- |
| author_role | |
| author_sort | Padawitz, Peter 1953- |
| author_variant | p p pp |
| 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>01948nam a2200277 i 4500</leader><controlfield tag="001">ZDB-20-CTM-CR9780511569876</controlfield><controlfield tag="003">UkCbUP</controlfield><controlfield tag="005">20151005020622.0</controlfield><controlfield tag="006">m|||||o||d||||||||</controlfield><controlfield tag="007">cr||||||||||||</controlfield><controlfield tag="008">090520s1992||||enk o ||1 0|eng|d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780511569876</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Padawitz, Peter</subfield><subfield code="d">1953-</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Deduction and declarative programming</subfield><subfield code="c">Peter Padawitz</subfield></datafield><datafield tag="246" ind1="3" ind2=" "><subfield code="a">Deductive & Declarative Programming</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge</subfield><subfield code="b">Cambridge University Press</subfield><subfield code="c">1992</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (vi, 279 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">28</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Declarative programs consist of mathematical functions and relations and are amenable to formal specification and verification, since the methods of logic and proof can be applied to the programs in a well-defined manner. Here Dr Padawitz emphasizes verification based on logical inference rules, i.e. deduction (in contrast with model-theoretic approaches, deductive methods can be automated to some extent). His treatment of the subject differs from others in that he tries to capture the actual styles and applications of programming; neither too general with respect to the underlying logic, nor too restrictive for the practice of programming. He generalizes and unifies results from classical theorem-proving and term rewriting to provide proof methods tailored to declarative program synthesis and verification. Detailed examples accompany the development of the methods, whose use is supported by a documented prototyping system. The book can be used for graduate courses or as a reference for researchers in formal methods, theorem-proving and declarative languages.</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">9780521032513</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">9780521417235</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/CBO9780511569876</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-CR9780511569876 |
| illustrated | Not Illustrated |
| indexdate | 2025-03-03T11:58:04Z |
| institution | BVB |
| isbn | 9780511569876 |
| language | English |
| open_access_boolean | |
| owner | DE-91 DE-BY-TUM |
| owner_facet | DE-91 DE-BY-TUM |
| physical | 1 Online-Ressource (vi, 279 Seiten) |
| psigel | ZDB-20-CTM TUM_PDA_CTM ZDB-20-CTM |
| publishDate | 1992 |
| publishDateSearch | 1992 |
| publishDateSort | 1992 |
| publisher | Cambridge University Press |
| record_format | marc |
| series2 | Cambridge tracts in theoretical computer science |
| spelling | Padawitz, Peter 1953- Deduction and declarative programming Peter Padawitz Deductive & Declarative Programming Cambridge Cambridge University Press 1992 1 Online-Ressource (vi, 279 Seiten) txt c cr Cambridge tracts in theoretical computer science 28 Declarative programs consist of mathematical functions and relations and are amenable to formal specification and verification, since the methods of logic and proof can be applied to the programs in a well-defined manner. Here Dr Padawitz emphasizes verification based on logical inference rules, i.e. deduction (in contrast with model-theoretic approaches, deductive methods can be automated to some extent). His treatment of the subject differs from others in that he tries to capture the actual styles and applications of programming; neither too general with respect to the underlying logic, nor too restrictive for the practice of programming. He generalizes and unifies results from classical theorem-proving and term rewriting to provide proof methods tailored to declarative program synthesis and verification. Detailed examples accompany the development of the methods, whose use is supported by a documented prototyping system. The book can be used for graduate courses or as a reference for researchers in formal methods, theorem-proving and declarative languages. Erscheint auch als Druck-Ausgabe 9780521032513 Erscheint auch als Druck-Ausgabe 9780521417235 |
| spellingShingle | Padawitz, Peter 1953- Deduction and declarative programming |
| title | Deduction and declarative programming |
| title_alt | Deductive & Declarative Programming |
| title_auth | Deduction and declarative programming |
| title_exact_search | Deduction and declarative programming |
| title_full | Deduction and declarative programming Peter Padawitz |
| title_fullStr | Deduction and declarative programming Peter Padawitz |
| title_full_unstemmed | Deduction and declarative programming Peter Padawitz |
| title_short | Deduction and declarative programming |
| title_sort | deduction and declarative programming |
| work_keys_str_mv | AT padawitzpeter deductionanddeclarativeprogramming AT padawitzpeter deductivedeclarativeprogramming |