Automating the synthesis of functional programs in constructive type theory:
Abstract: "The task of constructing programs can be treated as a task of finding proofs in an appropriate logic. For recursive programs, the corresponding logic includes appropriate induction principles. We describe a system that automates program synthesis via theorem proving in this way, buil...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Edinburgh
1995
|
| Schriftenreihe: | University <Edinburgh> / Department of Artificial Intelligence: DAI research paper
777 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "The task of constructing programs can be treated as a task of finding proofs in an appropriate logic. For recursive programs, the corresponding logic includes appropriate induction principles. We describe a system that automates program synthesis via theorem proving in this way, building on control strategies developed for verification proofs using proof plans. This involves some extensions to the planning system. The resultant system automates an approach to programming where program development and correctness proof proceed hand in hand, as advocated by Gries." |
| Beschreibung: | 15 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV011045853 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 961108s1995 |||| 00||| engod | ||
| 035 | |a (OCoLC)37017353 | ||
| 035 | |a (DE-599)BVBBV011045853 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Smaill, Alan |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Automating the synthesis of functional programs in constructive type theory |c Smaill, A. ; Green, I. |
| 264 | 1 | |a Edinburgh |c 1995 | |
| 300 | |a 15 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a University <Edinburgh> / Department of Artificial Intelligence: DAI research paper |v 777 | |
| 520 | 3 | |a Abstract: "The task of constructing programs can be treated as a task of finding proofs in an appropriate logic. For recursive programs, the corresponding logic includes appropriate induction principles. We describe a system that automates program synthesis via theorem proving in this way, building on control strategies developed for verification proofs using proof plans. This involves some extensions to the planning system. The resultant system automates an approach to programming where program development and correctness proof proceed hand in hand, as advocated by Gries." | |
| 650 | 7 | |a Bionics and artificial intelligence |2 sigle | |
| 650 | 7 | |a Computer software |2 sigle | |
| 650 | 4 | |a Automatic theorem proving | |
| 650 | 4 | |a Computer software |x Development | |
| 650 | 4 | |a Functional programming (Computer science) | |
| 650 | 4 | |a Type theory | |
| 700 | 1 | |a Green, Ian |e Verfasser |4 aut | |
| 810 | 2 | |a Department of Artificial Intelligence: DAI research paper |t University <Edinburgh> |v 777 |w (DE-604)BV010450646 |9 777 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007396867 | ||
Datensatz im Suchindex
| _version_ | 1804125536323108864 |
|---|---|
| any_adam_object | |
| author | Smaill, Alan Green, Ian |
| author_facet | Smaill, Alan Green, Ian |
| author_role | aut aut |
| author_sort | Smaill, Alan |
| author_variant | a s as i g ig |
| building | Verbundindex |
| bvnumber | BV011045853 |
| ctrlnum | (OCoLC)37017353 (DE-599)BVBBV011045853 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01822nam a2200361 cb4500</leader><controlfield tag="001">BV011045853</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">961108s1995 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)37017353</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV011045853</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="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Smaill, Alan</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Automating the synthesis of functional programs in constructive type theory</subfield><subfield code="c">Smaill, A. ; Green, I.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Edinburgh</subfield><subfield code="c">1995</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">15 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">University <Edinburgh> / Department of Artificial Intelligence: DAI research paper</subfield><subfield code="v">777</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "The task of constructing programs can be treated as a task of finding proofs in an appropriate logic. For recursive programs, the corresponding logic includes appropriate induction principles. We describe a system that automates program synthesis via theorem proving in this way, building on control strategies developed for verification proofs using proof plans. This involves some extensions to the planning system. The resultant system automates an approach to programming where program development and correctness proof proceed hand in hand, as advocated by Gries."</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Bionics and artificial intelligence</subfield><subfield code="2">sigle</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="4"><subfield code="a">Automatic theorem proving</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer software</subfield><subfield code="x">Development</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Functional programming (Computer science)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Type theory</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Green, Ian</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Artificial Intelligence: DAI research paper</subfield><subfield code="t">University <Edinburgh></subfield><subfield code="v">777</subfield><subfield code="w">(DE-604)BV010450646</subfield><subfield code="9">777</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007396867</subfield></datafield></record></collection> |
| id | DE-604.BV011045853 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T18:03:06Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007396867 |
| oclc_num | 37017353 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 15 S. |
| publishDate | 1995 |
| publishDateSearch | 1995 |
| publishDateSort | 1995 |
| record_format | marc |
| series2 | University <Edinburgh> / Department of Artificial Intelligence: DAI research paper |
| spelling | Smaill, Alan Verfasser aut Automating the synthesis of functional programs in constructive type theory Smaill, A. ; Green, I. Edinburgh 1995 15 S. txt rdacontent n rdamedia nc rdacarrier University <Edinburgh> / Department of Artificial Intelligence: DAI research paper 777 Abstract: "The task of constructing programs can be treated as a task of finding proofs in an appropriate logic. For recursive programs, the corresponding logic includes appropriate induction principles. We describe a system that automates program synthesis via theorem proving in this way, building on control strategies developed for verification proofs using proof plans. This involves some extensions to the planning system. The resultant system automates an approach to programming where program development and correctness proof proceed hand in hand, as advocated by Gries." Bionics and artificial intelligence sigle Computer software sigle Automatic theorem proving Computer software Development Functional programming (Computer science) Type theory Green, Ian Verfasser aut Department of Artificial Intelligence: DAI research paper University <Edinburgh> 777 (DE-604)BV010450646 777 |
| spellingShingle | Smaill, Alan Green, Ian Automating the synthesis of functional programs in constructive type theory Bionics and artificial intelligence sigle Computer software sigle Automatic theorem proving Computer software Development Functional programming (Computer science) Type theory |
| title | Automating the synthesis of functional programs in constructive type theory |
| title_auth | Automating the synthesis of functional programs in constructive type theory |
| title_exact_search | Automating the synthesis of functional programs in constructive type theory |
| title_full | Automating the synthesis of functional programs in constructive type theory Smaill, A. ; Green, I. |
| title_fullStr | Automating the synthesis of functional programs in constructive type theory Smaill, A. ; Green, I. |
| title_full_unstemmed | Automating the synthesis of functional programs in constructive type theory Smaill, A. ; Green, I. |
| title_short | Automating the synthesis of functional programs in constructive type theory |
| title_sort | automating the synthesis of functional programs in constructive type theory |
| topic | Bionics and artificial intelligence sigle Computer software sigle Automatic theorem proving Computer software Development Functional programming (Computer science) Type theory |
| topic_facet | Bionics and artificial intelligence Computer software Automatic theorem proving Computer software Development Functional programming (Computer science) Type theory |
| volume_link | (DE-604)BV010450646 |
| work_keys_str_mv | AT smaillalan automatingthesynthesisoffunctionalprogramsinconstructivetypetheory AT greenian automatingthesynthesisoffunctionalprogramsinconstructivetypetheory |