Program synthesis by a model generation theorem prover:
Abstract: "The combination of theorem provers and program synthesis, that can obviously provide us of automated programming, has been left out of consideration because of the theoretical darkness how to relate proofs obtained by the resolution based provers to the executable programs. We here p...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Tokyo, Japan
1991
|
| Series: | Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report
629 |
| Subjects: | |
| Summary: | Abstract: "The combination of theorem provers and program synthesis, that can obviously provide us of automated programming, has been left out of consideration because of the theoretical darkness how to relate proofs obtained by the resolution based provers to the executable programs. We here propose a new approach to this goal with using a clear framework of program extraction, which is based on the constructive mathematics. The basic principle of this framework is the Realizability Interpretation, which allows us to relate programs with proofs. Realizability Interpretation can be a mathematical basis of building a formal program extraction system from proofs obtained by a wide variety of first-order provers Besides the theoretical research of this approach, we have built an experimental system with using a model generation theorem prover (MGTP) and a formal logic system (PAPYRUS) and have obtained several programs such as sorting programs. |
| Physical Description: | 9 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010953897 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 960917s1991 |||| 00||| engod | ||
| 035 | |a (OCoLC)24995735 | ||
| 035 | |a (DE-599)BVBBV010953897 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Fujita, Masayuki |e Verfasser |0 (DE-588)116852380 |4 aut | |
| 245 | 1 | 0 | |a Program synthesis by a model generation theorem prover |c by M. Fujita & R. Hasegawa |
| 264 | 1 | |a Tokyo, Japan |c 1991 | |
| 300 | |a 9 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report |v 629 | |
| 520 | 3 | |a Abstract: "The combination of theorem provers and program synthesis, that can obviously provide us of automated programming, has been left out of consideration because of the theoretical darkness how to relate proofs obtained by the resolution based provers to the executable programs. We here propose a new approach to this goal with using a clear framework of program extraction, which is based on the constructive mathematics. The basic principle of this framework is the Realizability Interpretation, which allows us to relate programs with proofs. Realizability Interpretation can be a mathematical basis of building a formal program extraction system from proofs obtained by a wide variety of first-order provers | |
| 520 | 3 | |a Besides the theoretical research of this approach, we have built an experimental system with using a model generation theorem prover (MGTP) and a formal logic system (PAPYRUS) and have obtained several programs such as sorting programs. | |
| 650 | 4 | |a Automatic theorem proving | |
| 650 | 4 | |a Programming (Mathematics) | |
| 700 | 1 | |a Hasegawa, Ruzo |e Verfasser |4 aut | |
| 830 | 0 | |a Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report |v 629 |w (DE-604)BV010923438 |9 629 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007326322 | ||
Record in the Search Index
| _version_ | 1804125440748552192 |
|---|---|
| any_adam_object | |
| author | Fujita, Masayuki Hasegawa, Ruzo |
| author_GND | (DE-588)116852380 |
| author_facet | Fujita, Masayuki Hasegawa, Ruzo |
| author_role | aut aut |
| author_sort | Fujita, Masayuki |
| author_variant | m f mf r h rh |
| building | Verbundindex |
| bvnumber | BV010953897 |
| ctrlnum | (OCoLC)24995735 (DE-599)BVBBV010953897 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02023nam a2200325 cb4500</leader><controlfield tag="001">BV010953897</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">960917s1991 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)24995735</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010953897</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">Fujita, Masayuki</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)116852380</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Program synthesis by a model generation theorem prover</subfield><subfield code="c">by M. Fujita & R. Hasegawa</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Tokyo, Japan</subfield><subfield code="c">1991</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">9 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">Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report</subfield><subfield code="v">629</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "The combination of theorem provers and program synthesis, that can obviously provide us of automated programming, has been left out of consideration because of the theoretical darkness how to relate proofs obtained by the resolution based provers to the executable programs. We here propose a new approach to this goal with using a clear framework of program extraction, which is based on the constructive mathematics. The basic principle of this framework is the Realizability Interpretation, which allows us to relate programs with proofs. Realizability Interpretation can be a mathematical basis of building a formal program extraction system from proofs obtained by a wide variety of first-order provers</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Besides the theoretical research of this approach, we have built an experimental system with using a model generation theorem prover (MGTP) and a formal logic system (PAPYRUS) and have obtained several programs such as sorting programs.</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">Programming (Mathematics)</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Hasegawa, Ruzo</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report</subfield><subfield code="v">629</subfield><subfield code="w">(DE-604)BV010923438</subfield><subfield code="9">629</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007326322</subfield></datafield></record></collection> |
| id | DE-604.BV010953897 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T18:01:36Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007326322 |
| oclc_num | 24995735 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 9 S. |
| publishDate | 1991 |
| publishDateSearch | 1991 |
| publishDateSort | 1991 |
| record_format | marc |
| series | Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report |
| series2 | Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report |
| spelling | Fujita, Masayuki Verfasser (DE-588)116852380 aut Program synthesis by a model generation theorem prover by M. Fujita & R. Hasegawa Tokyo, Japan 1991 9 S. txt rdacontent n rdamedia nc rdacarrier Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report 629 Abstract: "The combination of theorem provers and program synthesis, that can obviously provide us of automated programming, has been left out of consideration because of the theoretical darkness how to relate proofs obtained by the resolution based provers to the executable programs. We here propose a new approach to this goal with using a clear framework of program extraction, which is based on the constructive mathematics. The basic principle of this framework is the Realizability Interpretation, which allows us to relate programs with proofs. Realizability Interpretation can be a mathematical basis of building a formal program extraction system from proofs obtained by a wide variety of first-order provers Besides the theoretical research of this approach, we have built an experimental system with using a model generation theorem prover (MGTP) and a formal logic system (PAPYRUS) and have obtained several programs such as sorting programs. Automatic theorem proving Programming (Mathematics) Hasegawa, Ruzo Verfasser aut Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report 629 (DE-604)BV010923438 629 |
| spellingShingle | Fujita, Masayuki Hasegawa, Ruzo Program synthesis by a model generation theorem prover Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report Automatic theorem proving Programming (Mathematics) |
| title | Program synthesis by a model generation theorem prover |
| title_auth | Program synthesis by a model generation theorem prover |
| title_exact_search | Program synthesis by a model generation theorem prover |
| title_full | Program synthesis by a model generation theorem prover by M. Fujita & R. Hasegawa |
| title_fullStr | Program synthesis by a model generation theorem prover by M. Fujita & R. Hasegawa |
| title_full_unstemmed | Program synthesis by a model generation theorem prover by M. Fujita & R. Hasegawa |
| title_short | Program synthesis by a model generation theorem prover |
| title_sort | program synthesis by a model generation theorem prover |
| topic | Automatic theorem proving Programming (Mathematics) |
| topic_facet | Automatic theorem proving Programming (Mathematics) |
| volume_link | (DE-604)BV010923438 |
| work_keys_str_mv | AT fujitamasayuki programsynthesisbyamodelgenerationtheoremprover AT hasegawaruzo programsynthesisbyamodelgenerationtheoremprover |