Computer Program Synthesis Methodologies: Proceedings of the NATO Advanced Study Institute held at Bonas, France, September 28–October 10, 1981
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Dordrecht
Springer Netherlands
1983
|
| Schriftenreihe: | NATO Advanced Study Institutes Series, Series C — Mathematical and Physical Sciences
95 |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Beschreibung: | powerful operations on them. An early step in this direction was the development of APl, and more recent examples have been SETl which enables a user to code in terms of mathematical enti ties such as sets and BDl which allows a user, presumably a businessman, to specify a computation in terms of a series of tabular forms and a series of processing paths through which data flows. The design and implementation of such languages are examined in chapters by P. GOLDBERG. Another extension to traditional methods is made possible by systems designed to automatically handle low level flow-of control decisions. All the above higher level languages do this implicitly with their built in operators. PROLOG is a language which does this with a theorem proving mechanism employing primarily unification and backtracking. The programmer specifies the problem to be solved with a set of formal logic statements including a theorem to be proved. The theorem proving system finds a way to combine the axioms to prove the theorem, and in the process, it completes the desired calculation. H. GAllAIRE has contributed a chapter describing PROLOG giving many examples of its usage |
| Beschreibung: | 1 Online-Ressource (IX, 374 p) |
| ISBN: | 9789400970199 9789400970212 |
| ISSN: | 1389-2185 |
| DOI: | 10.1007/978-94-009-7019-9 |
Internformat
MARC
| LEADER | 00000nmm a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV042415307 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 150316s1983 |||| o||u| ||||||eng d | ||
| 020 | |a 9789400970199 |c Online |9 978-94-009-7019-9 | ||
| 020 | |a 9789400970212 |c Print |9 978-94-009-7021-2 | ||
| 024 | 7 | |a 10.1007/978-94-009-7019-9 |2 doi | |
| 035 | |a (OCoLC)863864386 | ||
| 035 | |a (DE-599)BVBBV042415307 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91 |a DE-83 | ||
| 082 | 0 | |a 510 |2 23 | |
| 084 | |a PHY 000 |2 stub | ||
| 100 | 1 | |a Biermann, Alan W. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Computer Program Synthesis Methodologies |b Proceedings of the NATO Advanced Study Institute held at Bonas, France, September 28–October 10, 1981 |c edited by Alan W. Biermann, Gérard Guiho |
| 246 | 1 | 3 | |a Proceedings of the NATO Advanced Study Institute, Bonas, France, September 28-October 10, 1981 |
| 264 | 1 | |a Dordrecht |b Springer Netherlands |c 1983 | |
| 300 | |a 1 Online-Ressource (IX, 374 p) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a NATO Advanced Study Institutes Series, Series C — Mathematical and Physical Sciences |v 95 |x 1389-2185 | |
| 500 | |a powerful operations on them. An early step in this direction was the development of APl, and more recent examples have been SETl which enables a user to code in terms of mathematical enti ties such as sets and BDl which allows a user, presumably a businessman, to specify a computation in terms of a series of tabular forms and a series of processing paths through which data flows. The design and implementation of such languages are examined in chapters by P. GOLDBERG. Another extension to traditional methods is made possible by systems designed to automatically handle low level flow-of control decisions. All the above higher level languages do this implicitly with their built in operators. PROLOG is a language which does this with a theorem proving mechanism employing primarily unification and backtracking. The programmer specifies the problem to be solved with a set of formal logic statements including a theorem to be proved. The theorem proving system finds a way to combine the axioms to prove the theorem, and in the process, it completes the desired calculation. H. GAllAIRE has contributed a chapter describing PROLOG giving many examples of its usage | ||
| 650 | 4 | |a Mathematics | |
| 650 | 4 | |a Mathematics, general | |
| 650 | 4 | |a Mathematik | |
| 650 | 0 | 7 | |a Programmierung |0 (DE-588)4076370-5 |2 gnd |9 rswk-swf |
| 655 | 7 | |8 1\p |0 (DE-588)1071861417 |a Konferenzschrift |y 1981 |z Bonas |2 gnd-content | |
| 689 | 0 | 0 | |a Programmierung |0 (DE-588)4076370-5 |D s |
| 689 | 0 | |8 2\p |5 DE-604 | |
| 700 | 1 | |a Guiho, Gérard |e Sonstige |4 oth | |
| 856 | 4 | 0 | |u https://doi.org/10.1007/978-94-009-7019-9 |x Verlag |3 Volltext |
| 912 | |a ZDB-2-PHA |a ZDB-2-BAE | ||
| 940 | 1 | |q ZDB-2-PHA_Archive | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-027850800 | ||
| 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 | |
Datensatz im Suchindex
| _version_ | 1804153082199670784 |
|---|---|
| any_adam_object | |
| author | Biermann, Alan W. |
| author_facet | Biermann, Alan W. |
| author_role | aut |
| author_sort | Biermann, Alan W. |
| author_variant | a w b aw awb |
| building | Verbundindex |
| bvnumber | BV042415307 |
| classification_tum | PHY 000 |
| collection | ZDB-2-PHA ZDB-2-BAE |
| ctrlnum | (OCoLC)863864386 (DE-599)BVBBV042415307 |
| dewey-full | 510 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 510 - Mathematics |
| dewey-raw | 510 |
| dewey-search | 510 |
| dewey-sort | 3510 |
| dewey-tens | 510 - Mathematics |
| discipline | Physik Mathematik |
| doi_str_mv | 10.1007/978-94-009-7019-9 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03154nmm a2200493zcb4500</leader><controlfield tag="001">BV042415307</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">150316s1983 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9789400970199</subfield><subfield code="c">Online</subfield><subfield code="9">978-94-009-7019-9</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9789400970212</subfield><subfield code="c">Print</subfield><subfield code="9">978-94-009-7021-2</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-94-009-7019-9</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)863864386</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV042415307</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91</subfield><subfield code="a">DE-83</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">510</subfield><subfield code="2">23</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">PHY 000</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Biermann, Alan W.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Computer Program Synthesis Methodologies</subfield><subfield code="b">Proceedings of the NATO Advanced Study Institute held at Bonas, France, September 28–October 10, 1981</subfield><subfield code="c">edited by Alan W. Biermann, Gérard Guiho</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">Proceedings of the NATO Advanced Study Institute, Bonas, France, September 28-October 10, 1981</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Dordrecht</subfield><subfield code="b">Springer Netherlands</subfield><subfield code="c">1983</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (IX, 374 p)</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">NATO Advanced Study Institutes Series, Series C — Mathematical and Physical Sciences</subfield><subfield code="v">95</subfield><subfield code="x">1389-2185</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">powerful operations on them. An early step in this direction was the development of APl, and more recent examples have been SETl which enables a user to code in terms of mathematical enti ties such as sets and BDl which allows a user, presumably a businessman, to specify a computation in terms of a series of tabular forms and a series of processing paths through which data flows. The design and implementation of such languages are examined in chapters by P. GOLDBERG. Another extension to traditional methods is made possible by systems designed to automatically handle low level flow-of control decisions. All the above higher level languages do this implicitly with their built in operators. PROLOG is a language which does this with a theorem proving mechanism employing primarily unification and backtracking. The programmer specifies the problem to be solved with a set of formal logic statements including a theorem to be proved. The theorem proving system finds a way to combine the axioms to prove the theorem, and in the process, it completes the desired calculation. H. GAllAIRE has contributed a chapter describing PROLOG giving many examples of its usage</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematics, general</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematik</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Programmierung</subfield><subfield code="0">(DE-588)4076370-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="8">1\p</subfield><subfield code="0">(DE-588)1071861417</subfield><subfield code="a">Konferenzschrift</subfield><subfield code="y">1981</subfield><subfield code="z">Bonas</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Programmierung</subfield><subfield code="0">(DE-588)4076370-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Guiho, Gérard</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-94-009-7019-9</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-PHA</subfield><subfield code="a">ZDB-2-BAE</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">ZDB-2-PHA_Archive</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-027850800</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></record></collection> |
| genre | 1\p (DE-588)1071861417 Konferenzschrift 1981 Bonas gnd-content |
| genre_facet | Konferenzschrift 1981 Bonas |
| id | DE-604.BV042415307 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T01:20:57Z |
| institution | BVB |
| isbn | 9789400970199 9789400970212 |
| issn | 1389-2185 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-027850800 |
| oclc_num | 863864386 |
| open_access_boolean | |
| owner | DE-91 DE-BY-TUM DE-83 |
| owner_facet | DE-91 DE-BY-TUM DE-83 |
| physical | 1 Online-Ressource (IX, 374 p) |
| psigel | ZDB-2-PHA ZDB-2-BAE ZDB-2-PHA_Archive |
| publishDate | 1983 |
| publishDateSearch | 1983 |
| publishDateSort | 1983 |
| publisher | Springer Netherlands |
| record_format | marc |
| series2 | NATO Advanced Study Institutes Series, Series C — Mathematical and Physical Sciences |
| spelling | Biermann, Alan W. Verfasser aut Computer Program Synthesis Methodologies Proceedings of the NATO Advanced Study Institute held at Bonas, France, September 28–October 10, 1981 edited by Alan W. Biermann, Gérard Guiho Proceedings of the NATO Advanced Study Institute, Bonas, France, September 28-October 10, 1981 Dordrecht Springer Netherlands 1983 1 Online-Ressource (IX, 374 p) txt rdacontent c rdamedia cr rdacarrier NATO Advanced Study Institutes Series, Series C — Mathematical and Physical Sciences 95 1389-2185 powerful operations on them. An early step in this direction was the development of APl, and more recent examples have been SETl which enables a user to code in terms of mathematical enti ties such as sets and BDl which allows a user, presumably a businessman, to specify a computation in terms of a series of tabular forms and a series of processing paths through which data flows. The design and implementation of such languages are examined in chapters by P. GOLDBERG. Another extension to traditional methods is made possible by systems designed to automatically handle low level flow-of control decisions. All the above higher level languages do this implicitly with their built in operators. PROLOG is a language which does this with a theorem proving mechanism employing primarily unification and backtracking. The programmer specifies the problem to be solved with a set of formal logic statements including a theorem to be proved. The theorem proving system finds a way to combine the axioms to prove the theorem, and in the process, it completes the desired calculation. H. GAllAIRE has contributed a chapter describing PROLOG giving many examples of its usage Mathematics Mathematics, general Mathematik Programmierung (DE-588)4076370-5 gnd rswk-swf 1\p (DE-588)1071861417 Konferenzschrift 1981 Bonas gnd-content Programmierung (DE-588)4076370-5 s 2\p DE-604 Guiho, Gérard Sonstige oth https://doi.org/10.1007/978-94-009-7019-9 Verlag 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 |
| spellingShingle | Biermann, Alan W. Computer Program Synthesis Methodologies Proceedings of the NATO Advanced Study Institute held at Bonas, France, September 28–October 10, 1981 Mathematics Mathematics, general Mathematik Programmierung (DE-588)4076370-5 gnd |
| subject_GND | (DE-588)4076370-5 (DE-588)1071861417 |
| title | Computer Program Synthesis Methodologies Proceedings of the NATO Advanced Study Institute held at Bonas, France, September 28–October 10, 1981 |
| title_alt | Proceedings of the NATO Advanced Study Institute, Bonas, France, September 28-October 10, 1981 |
| title_auth | Computer Program Synthesis Methodologies Proceedings of the NATO Advanced Study Institute held at Bonas, France, September 28–October 10, 1981 |
| title_exact_search | Computer Program Synthesis Methodologies Proceedings of the NATO Advanced Study Institute held at Bonas, France, September 28–October 10, 1981 |
| title_full | Computer Program Synthesis Methodologies Proceedings of the NATO Advanced Study Institute held at Bonas, France, September 28–October 10, 1981 edited by Alan W. Biermann, Gérard Guiho |
| title_fullStr | Computer Program Synthesis Methodologies Proceedings of the NATO Advanced Study Institute held at Bonas, France, September 28–October 10, 1981 edited by Alan W. Biermann, Gérard Guiho |
| title_full_unstemmed | Computer Program Synthesis Methodologies Proceedings of the NATO Advanced Study Institute held at Bonas, France, September 28–October 10, 1981 edited by Alan W. Biermann, Gérard Guiho |
| title_short | Computer Program Synthesis Methodologies |
| title_sort | computer program synthesis methodologies proceedings of the nato advanced study institute held at bonas france september 28 october 10 1981 |
| title_sub | Proceedings of the NATO Advanced Study Institute held at Bonas, France, September 28–October 10, 1981 |
| topic | Mathematics Mathematics, general Mathematik Programmierung (DE-588)4076370-5 gnd |
| topic_facet | Mathematics Mathematics, general Mathematik Programmierung Konferenzschrift 1981 Bonas |
| url | https://doi.org/10.1007/978-94-009-7019-9 |
| work_keys_str_mv | AT biermannalanw computerprogramsynthesismethodologiesproceedingsofthenatoadvancedstudyinstituteheldatbonasfranceseptember28october101981 AT guihogerard computerprogramsynthesismethodologiesproceedingsofthenatoadvancedstudyinstituteheldatbonasfranceseptember28october101981 AT biermannalanw proceedingsofthenatoadvancedstudyinstitutebonasfranceseptember28october101981 AT guihogerard proceedingsofthenatoadvancedstudyinstitutebonasfranceseptember28october101981 |