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...
Saved in:
| Main Author: | |
|---|---|
| Format: | Electronic eBook |
| Language: | English |
| Published: |
Cambridge
Cambridge University Press
1992
|
| Series: | Cambridge tracts in theoretical computer science
28 |
| Subjects: | |
| Online Access: | BSB01 FHN01 Volltext |
| Summary: | 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 |
| Item Description: | Title from publisher's bibliographic system (viewed on 05 Oct 2015) |
| Physical Description: | 1 online resource (vi, 279 pages) |
| ISBN: | 9780511569876 |
| DOI: | 10.1017/CBO9780511569876 |
Staff View
MARC
| LEADER | 00000nmm a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV043941891 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 161206s1992 |||| o||u| ||||||eng d | ||
| 020 | |a 9780511569876 |c Online |9 978-0-511-56987-6 | ||
| 024 | 7 | |a 10.1017/CBO9780511569876 |2 doi | |
| 035 | |a (ZDB-20-CBO)CR9780511569876 | ||
| 035 | |a (OCoLC)967602089 | ||
| 035 | |a (DE-599)BVBBV043941891 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-12 |a DE-92 | ||
| 082 | 0 | |a 005.13/1 |2 20 | |
| 084 | |a ST 120 |0 (DE-625)143585: |2 rvk | ||
| 084 | |a ST 130 |0 (DE-625)143588: |2 rvk | ||
| 100 | 1 | |a Padawitz, Peter |d 1953- |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Deduction and declarative programming |c Peter Padawitz |
| 246 | 1 | 3 | |a Deductive & Declarative Programming |
| 264 | 1 | |a Cambridge |b Cambridge University Press |c 1992 | |
| 300 | |a 1 online resource (vi, 279 pages) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a Cambridge tracts in theoretical computer science |v 28 | |
| 500 | |a Title from publisher's bibliographic system (viewed on 05 Oct 2015) | ||
| 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 | ||
| 650 | 4 | |a Declarative programming | |
| 650 | 0 | 7 | |a Logischer Schluss |0 (DE-588)4139983-3 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Deklarative Programmierung |0 (DE-588)4293503-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Softwarespezifikation |0 (DE-588)4056186-0 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Deduktion |0 (DE-588)4011271-8 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Softwarespezifikation |0 (DE-588)4056186-0 |D s |
| 689 | 0 | 1 | |a Deduktion |0 (DE-588)4011271-8 |D s |
| 689 | 0 | |8 1\p |5 DE-604 | |
| 689 | 1 | 0 | |a Deklarative Programmierung |0 (DE-588)4293503-9 |D s |
| 689 | 1 | |8 2\p |5 DE-604 | |
| 689 | 2 | 0 | |a Logischer Schluss |0 (DE-588)4139983-3 |D s |
| 689 | 2 | |8 3\p |5 DE-604 | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druckausgabe |z 978-0-521-03251-3 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druckausgabe |z 978-0-521-41723-5 |
| 856 | 4 | 0 | |u https://doi.org/10.1017/CBO9780511569876 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
| 912 | |a ZDB-20-CBO | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-029350861 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 2\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 3\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 966 | e | |u https://doi.org/10.1017/CBO9780511569876 |l BSB01 |p ZDB-20-CBO |q BSB_PDA_CBO |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1017/CBO9780511569876 |l FHN01 |p ZDB-20-CBO |q FHN_PDA_CBO |x Verlag |3 Volltext | |
Record in the Search Index
| _version_ | 1804176884151353344 |
|---|---|
| any_adam_object | |
| author | Padawitz, Peter 1953- |
| author_facet | Padawitz, Peter 1953- |
| author_role | aut |
| author_sort | Padawitz, Peter 1953- |
| author_variant | p p pp |
| building | Verbundindex |
| bvnumber | BV043941891 |
| classification_rvk | ST 120 ST 130 |
| collection | ZDB-20-CBO |
| ctrlnum | (ZDB-20-CBO)CR9780511569876 (OCoLC)967602089 (DE-599)BVBBV043941891 |
| dewey-full | 005.13/1 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 005 - Computer programming, programs, data, security |
| dewey-raw | 005.13/1 |
| dewey-search | 005.13/1 |
| dewey-sort | 15.13 11 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| doi_str_mv | 10.1017/CBO9780511569876 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03644nmm a2200613zcb4500</leader><controlfield tag="001">BV043941891</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">161206s1992 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780511569876</subfield><subfield code="c">Online</subfield><subfield code="9">978-0-511-56987-6</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1017/CBO9780511569876</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-20-CBO)CR9780511569876</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)967602089</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV043941891</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-12</subfield><subfield code="a">DE-92</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.13/1</subfield><subfield code="2">20</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 120</subfield><subfield code="0">(DE-625)143585:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 130</subfield><subfield code="0">(DE-625)143588:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Padawitz, Peter</subfield><subfield code="d">1953-</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</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="1" ind2="3"><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 resource (vi, 279 pages)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Cambridge tracts in theoretical computer science</subfield><subfield code="v">28</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Title from publisher's bibliographic system (viewed on 05 Oct 2015)</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="650" ind1=" " ind2="4"><subfield code="a">Declarative programming</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Logischer Schluss</subfield><subfield code="0">(DE-588)4139983-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Deklarative Programmierung</subfield><subfield code="0">(DE-588)4293503-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Softwarespezifikation</subfield><subfield code="0">(DE-588)4056186-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Deduktion</subfield><subfield code="0">(DE-588)4011271-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Softwarespezifikation</subfield><subfield code="0">(DE-588)4056186-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Deduktion</subfield><subfield code="0">(DE-588)4011271-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Deklarative Programmierung</subfield><subfield code="0">(DE-588)4293503-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">Logischer Schluss</subfield><subfield code="0">(DE-588)4139983-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="8">3\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druckausgabe</subfield><subfield code="z">978-0-521-03251-3</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druckausgabe</subfield><subfield code="z">978-0-521-41723-5</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1017/CBO9780511569876</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Erstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-20-CBO</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-029350861</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">3\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/CBO9780511569876</subfield><subfield code="l">BSB01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">BSB_PDA_CBO</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/CBO9780511569876</subfield><subfield code="l">FHN01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">FHN_PDA_CBO</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV043941891 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T07:39:16Z |
| institution | BVB |
| isbn | 9780511569876 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-029350861 |
| oclc_num | 967602089 |
| open_access_boolean | |
| owner | DE-12 DE-92 |
| owner_facet | DE-12 DE-92 |
| physical | 1 online resource (vi, 279 pages) |
| psigel | ZDB-20-CBO ZDB-20-CBO BSB_PDA_CBO ZDB-20-CBO FHN_PDA_CBO |
| publishDate | 1992 |
| publishDateSearch | 1992 |
| publishDateSort | 1992 |
| publisher | Cambridge University Press |
| record_format | marc |
| series2 | Cambridge tracts in theoretical computer science |
| spelling | Padawitz, Peter 1953- Verfasser aut Deduction and declarative programming Peter Padawitz Deductive & Declarative Programming Cambridge Cambridge University Press 1992 1 online resource (vi, 279 pages) txt rdacontent c rdamedia cr rdacarrier Cambridge tracts in theoretical computer science 28 Title from publisher's bibliographic system (viewed on 05 Oct 2015) 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 Declarative programming Logischer Schluss (DE-588)4139983-3 gnd rswk-swf Deklarative Programmierung (DE-588)4293503-9 gnd rswk-swf Softwarespezifikation (DE-588)4056186-0 gnd rswk-swf Deduktion (DE-588)4011271-8 gnd rswk-swf Softwarespezifikation (DE-588)4056186-0 s Deduktion (DE-588)4011271-8 s 1\p DE-604 Deklarative Programmierung (DE-588)4293503-9 s 2\p DE-604 Logischer Schluss (DE-588)4139983-3 s 3\p DE-604 Erscheint auch als Druckausgabe 978-0-521-03251-3 Erscheint auch als Druckausgabe 978-0-521-41723-5 https://doi.org/10.1017/CBO9780511569876 Verlag URL des Erstveröffentlichers Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 2\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 3\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Padawitz, Peter 1953- Deduction and declarative programming Declarative programming Logischer Schluss (DE-588)4139983-3 gnd Deklarative Programmierung (DE-588)4293503-9 gnd Softwarespezifikation (DE-588)4056186-0 gnd Deduktion (DE-588)4011271-8 gnd |
| subject_GND | (DE-588)4139983-3 (DE-588)4293503-9 (DE-588)4056186-0 (DE-588)4011271-8 |
| 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 |
| topic | Declarative programming Logischer Schluss (DE-588)4139983-3 gnd Deklarative Programmierung (DE-588)4293503-9 gnd Softwarespezifikation (DE-588)4056186-0 gnd Deduktion (DE-588)4011271-8 gnd |
| topic_facet | Declarative programming Logischer Schluss Deklarative Programmierung Softwarespezifikation Deduktion |
| url | https://doi.org/10.1017/CBO9780511569876 |
| work_keys_str_mv | AT padawitzpeter deductionanddeclarativeprogramming AT padawitzpeter deductivedeclarativeprogramming |