Theorem proving and program synthesis with Oyster:
Abstract: "Martin-Löf type theory provides a formal framework for the construction of verified programs, both specified and written in the type theory. We describe an implementation of the type theory that aims to provide an environment for software engineering using this approach. We illustrat...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Edinburgh
1990
|
| Schriftenreihe: | University <Edinburgh> / Department of Artificial Intelligence: DAI research paper
505 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "Martin-Löf type theory provides a formal framework for the construction of verified programs, both specified and written in the type theory. We describe an implementation of the type theory that aims to provide an environment for software engineering using this approach. We illustrate this by describing the synthesis of a simple evaluator for arithmetic expressions in the system." |
| Beschreibung: | 12 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010452736 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 951027s1990 |||| 00||| engod | ||
| 035 | |a (OCoLC)24437327 | ||
| 035 | |a (DE-599)BVBBV010452736 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Horn, Christian |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Theorem proving and program synthesis with Oyster |c Christian Horn & Alan Smaill |
| 264 | 1 | |a Edinburgh |c 1990 | |
| 300 | |a 12 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 505 | |
| 520 | 3 | |a Abstract: "Martin-Löf type theory provides a formal framework for the construction of verified programs, both specified and written in the type theory. We describe an implementation of the type theory that aims to provide an environment for software engineering using this approach. We illustrate this by describing the synthesis of a simple evaluator for arithmetic expressions in the system." | |
| 650 | 7 | |a Computer software |2 sigle | |
| 650 | 4 | |a Automatic theorem proving | |
| 700 | 1 | |a Smaill, Alan |e Verfasser |4 aut | |
| 810 | 2 | |a Department of Artificial Intelligence: DAI research paper |t University <Edinburgh> |v 505 |w (DE-604)BV010450646 |9 505 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006965596 | ||
Datensatz im Suchindex
| _version_ | 1804124886015148032 |
|---|---|
| any_adam_object | |
| author | Horn, Christian Smaill, Alan |
| author_facet | Horn, Christian Smaill, Alan |
| author_role | aut aut |
| author_sort | Horn, Christian |
| author_variant | c h ch a s as |
| building | Verbundindex |
| bvnumber | BV010452736 |
| ctrlnum | (OCoLC)24437327 (DE-599)BVBBV010452736 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01430nam a2200313 cb4500</leader><controlfield tag="001">BV010452736</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">951027s1990 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)24437327</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010452736</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">Horn, Christian</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Theorem proving and program synthesis with Oyster</subfield><subfield code="c">Christian Horn & Alan Smaill</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Edinburgh</subfield><subfield code="c">1990</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">12 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">505</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Martin-Löf type theory provides a formal framework for the construction of verified programs, both specified and written in the type theory. We describe an implementation of the type theory that aims to provide an environment for software engineering using this approach. We illustrate this by describing the synthesis of a simple evaluator for arithmetic expressions in the system."</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="700" ind1="1" ind2=" "><subfield code="a">Smaill, Alan</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">505</subfield><subfield code="w">(DE-604)BV010450646</subfield><subfield code="9">505</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006965596</subfield></datafield></record></collection> |
| id | DE-604.BV010452736 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:52:47Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006965596 |
| oclc_num | 24437327 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 12 S. |
| publishDate | 1990 |
| publishDateSearch | 1990 |
| publishDateSort | 1990 |
| record_format | marc |
| series2 | University <Edinburgh> / Department of Artificial Intelligence: DAI research paper |
| spelling | Horn, Christian Verfasser aut Theorem proving and program synthesis with Oyster Christian Horn & Alan Smaill Edinburgh 1990 12 S. txt rdacontent n rdamedia nc rdacarrier University <Edinburgh> / Department of Artificial Intelligence: DAI research paper 505 Abstract: "Martin-Löf type theory provides a formal framework for the construction of verified programs, both specified and written in the type theory. We describe an implementation of the type theory that aims to provide an environment for software engineering using this approach. We illustrate this by describing the synthesis of a simple evaluator for arithmetic expressions in the system." Computer software sigle Automatic theorem proving Smaill, Alan Verfasser aut Department of Artificial Intelligence: DAI research paper University <Edinburgh> 505 (DE-604)BV010450646 505 |
| spellingShingle | Horn, Christian Smaill, Alan Theorem proving and program synthesis with Oyster Computer software sigle Automatic theorem proving |
| title | Theorem proving and program synthesis with Oyster |
| title_auth | Theorem proving and program synthesis with Oyster |
| title_exact_search | Theorem proving and program synthesis with Oyster |
| title_full | Theorem proving and program synthesis with Oyster Christian Horn & Alan Smaill |
| title_fullStr | Theorem proving and program synthesis with Oyster Christian Horn & Alan Smaill |
| title_full_unstemmed | Theorem proving and program synthesis with Oyster Christian Horn & Alan Smaill |
| title_short | Theorem proving and program synthesis with Oyster |
| title_sort | theorem proving and program synthesis with oyster |
| topic | Computer software sigle Automatic theorem proving |
| topic_facet | Computer software Automatic theorem proving |
| volume_link | (DE-604)BV010450646 |
| work_keys_str_mv | AT hornchristian theoremprovingandprogramsynthesiswithoyster AT smaillalan theoremprovingandprogramsynthesiswithoyster |