Automating Squiggol:
Abstract: "The Squiggol style of program development is shown to be readily automated using LP, an equational reasoning theorem prover. Higher-order functions are handled by currying and the introduction of an application operator. We present an automated verification of Bird's development...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Cambridge
1989
|
| Schriftenreihe: | Computer Laboratory <Cambridge>: Technical report
179 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "The Squiggol style of program development is shown to be readily automated using LP, an equational reasoning theorem prover. Higher-order functions are handled by currying and the introduction of an application operator. We present an automated verification of Bird's development of the maximum segment sum algorithm, and a similar treatment of a proof of the binomial theorem." |
| Beschreibung: | 16 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010411127 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 951006s1989 |||| 00||| engod | ||
| 035 | |a (OCoLC)22409131 | ||
| 035 | |a (DE-599)BVBBV010411127 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 100 | 1 | |a Martin, Ursula |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Automating Squiggol |c by Ursula Martin and Tobias Nipkow |
| 264 | 1 | |a Cambridge |c 1989 | |
| 300 | |a 16 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Computer Laboratory <Cambridge>: Technical report |v 179 | |
| 520 | 3 | |a Abstract: "The Squiggol style of program development is shown to be readily automated using LP, an equational reasoning theorem prover. Higher-order functions are handled by currying and the introduction of an application operator. We present an automated verification of Bird's development of the maximum segment sum algorithm, and a similar treatment of a proof of the binomial theorem." | |
| 650 | 7 | |a Computer software |2 sigle | |
| 650 | 7 | |a Mathematics |2 sigle | |
| 650 | 4 | |a Mathematik | |
| 650 | 4 | |a Automatic theorem proving |x Computer programs | |
| 700 | 1 | |a Nipchow, Tobias |e Verfasser |4 aut | |
| 830 | 0 | |a Computer Laboratory <Cambridge>: Technical report |v 179 |w (DE-604)BV004055605 |9 179 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006933101 | ||
Datensatz im Suchindex
| _version_ | 1804124839261241344 |
|---|---|
| any_adam_object | |
| author | Martin, Ursula Nipchow, Tobias |
| author_facet | Martin, Ursula Nipchow, Tobias |
| author_role | aut aut |
| author_sort | Martin, Ursula |
| author_variant | u m um t n tn |
| building | Verbundindex |
| bvnumber | BV010411127 |
| ctrlnum | (OCoLC)22409131 (DE-599)BVBBV010411127 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01395nam a2200325 cb4500</leader><controlfield tag="001">BV010411127</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">951006s1989 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)22409131</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010411127</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Martin, Ursula</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Automating Squiggol</subfield><subfield code="c">by Ursula Martin and Tobias Nipkow</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge</subfield><subfield code="c">1989</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">16 S.</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">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Computer Laboratory <Cambridge>: Technical report</subfield><subfield code="v">179</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "The Squiggol style of program development is shown to be readily automated using LP, an equational reasoning theorem prover. Higher-order functions are handled by currying and the introduction of an application operator. We present an automated verification of Bird's development of the maximum segment sum algorithm, and a similar treatment of a proof of the binomial theorem."</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer software</subfield><subfield code="2">sigle</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Mathematics</subfield><subfield code="2">sigle</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematik</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Automatic theorem proving</subfield><subfield code="x">Computer programs</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Nipchow, Tobias</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Computer Laboratory <Cambridge>: Technical report</subfield><subfield code="v">179</subfield><subfield code="w">(DE-604)BV004055605</subfield><subfield code="9">179</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006933101</subfield></datafield></record></collection> |
| id | DE-604.BV010411127 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:52:02Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006933101 |
| oclc_num | 22409131 |
| open_access_boolean | |
| physical | 16 S. |
| publishDate | 1989 |
| publishDateSearch | 1989 |
| publishDateSort | 1989 |
| record_format | marc |
| series | Computer Laboratory <Cambridge>: Technical report |
| series2 | Computer Laboratory <Cambridge>: Technical report |
| spelling | Martin, Ursula Verfasser aut Automating Squiggol by Ursula Martin and Tobias Nipkow Cambridge 1989 16 S. txt rdacontent n rdamedia nc rdacarrier Computer Laboratory <Cambridge>: Technical report 179 Abstract: "The Squiggol style of program development is shown to be readily automated using LP, an equational reasoning theorem prover. Higher-order functions are handled by currying and the introduction of an application operator. We present an automated verification of Bird's development of the maximum segment sum algorithm, and a similar treatment of a proof of the binomial theorem." Computer software sigle Mathematics sigle Mathematik Automatic theorem proving Computer programs Nipchow, Tobias Verfasser aut Computer Laboratory <Cambridge>: Technical report 179 (DE-604)BV004055605 179 |
| spellingShingle | Martin, Ursula Nipchow, Tobias Automating Squiggol Computer Laboratory <Cambridge>: Technical report Computer software sigle Mathematics sigle Mathematik Automatic theorem proving Computer programs |
| title | Automating Squiggol |
| title_auth | Automating Squiggol |
| title_exact_search | Automating Squiggol |
| title_full | Automating Squiggol by Ursula Martin and Tobias Nipkow |
| title_fullStr | Automating Squiggol by Ursula Martin and Tobias Nipkow |
| title_full_unstemmed | Automating Squiggol by Ursula Martin and Tobias Nipkow |
| title_short | Automating Squiggol |
| title_sort | automating squiggol |
| topic | Computer software sigle Mathematics sigle Mathematik Automatic theorem proving Computer programs |
| topic_facet | Computer software Mathematics Mathematik Automatic theorem proving Computer programs |
| volume_link | (DE-604)BV004055605 |
| work_keys_str_mv | AT martinursula automatingsquiggol AT nipchowtobias automatingsquiggol |