Extended projection, a new method to extract efficient programs from constructive proofs:
Abstract: "This paper gives a method to extract redundancy free programs from constructive proofs, using the realizability interpretation. The proof trees are analyzed in the style of program analysis, and they are mechanically translated into trees with additional information, called marked pr...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Tokyo, Japan
1989
|
| Schriftenreihe: | Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report
461 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "This paper gives a method to extract redundancy free programs from constructive proofs, using the realizability interpretation. The proof trees are analyzed in the style of program analysis, and they are mechanically translated into trees with additional information, called marked proof trees. The program extractor takes marked proof trees as input, and generates programs in a type-free lambda calculus with sequences." |
| Beschreibung: | 20 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010947167 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 960912s1989 |||| 00||| engod | ||
| 035 | |a (OCoLC)22495619 | ||
| 035 | |a (DE-599)BVBBV010947167 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Takayama, Yukihide |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Extended projection, a new method to extract efficient programs from constructive proofs |c by Y. Takayama |
| 264 | 1 | |a Tokyo, Japan |c 1989 | |
| 300 | |a 20 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 461 | |
| 520 | 3 | |a Abstract: "This paper gives a method to extract redundancy free programs from constructive proofs, using the realizability interpretation. The proof trees are analyzed in the style of program analysis, and they are mechanically translated into trees with additional information, called marked proof trees. The program extractor takes marked proof trees as input, and generates programs in a type-free lambda calculus with sequences." | |
| 650 | 4 | |a Computer programming | |
| 650 | 4 | |a Computer programs |x Correctness | |
| 830 | 0 | |a Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report |v 461 |w (DE-604)BV010923438 |9 461 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007321384 | ||
Datensatz im Suchindex
| _version_ | 1804125433809076224 |
|---|---|
| any_adam_object | |
| author | Takayama, Yukihide |
| author_facet | Takayama, Yukihide |
| author_role | aut |
| author_sort | Takayama, Yukihide |
| author_variant | y t yt |
| building | Verbundindex |
| bvnumber | BV010947167 |
| ctrlnum | (OCoLC)22495619 (DE-599)BVBBV010947167 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01444nam a2200301 cb4500</leader><controlfield tag="001">BV010947167</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">960912s1989 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)22495619</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010947167</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">Takayama, Yukihide</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Extended projection, a new method to extract efficient programs from constructive proofs</subfield><subfield code="c">by Y. Takayama</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Tokyo, Japan</subfield><subfield code="c">1989</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">20 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">461</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "This paper gives a method to extract redundancy free programs from constructive proofs, using the realizability interpretation. The proof trees are analyzed in the style of program analysis, and they are mechanically translated into trees with additional information, called marked proof trees. The program extractor takes marked proof trees as input, and generates programs in a type-free lambda calculus with sequences."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer programming</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer programs</subfield><subfield code="x">Correctness</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">461</subfield><subfield code="w">(DE-604)BV010923438</subfield><subfield code="9">461</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007321384</subfield></datafield></record></collection> |
| id | DE-604.BV010947167 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T18:01:29Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007321384 |
| oclc_num | 22495619 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 20 S. |
| publishDate | 1989 |
| publishDateSearch | 1989 |
| publishDateSort | 1989 |
| 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 | Takayama, Yukihide Verfasser aut Extended projection, a new method to extract efficient programs from constructive proofs by Y. Takayama Tokyo, Japan 1989 20 S. txt rdacontent n rdamedia nc rdacarrier Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report 461 Abstract: "This paper gives a method to extract redundancy free programs from constructive proofs, using the realizability interpretation. The proof trees are analyzed in the style of program analysis, and they are mechanically translated into trees with additional information, called marked proof trees. The program extractor takes marked proof trees as input, and generates programs in a type-free lambda calculus with sequences." Computer programming Computer programs Correctness Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report 461 (DE-604)BV010923438 461 |
| spellingShingle | Takayama, Yukihide Extended projection, a new method to extract efficient programs from constructive proofs Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report Computer programming Computer programs Correctness |
| title | Extended projection, a new method to extract efficient programs from constructive proofs |
| title_auth | Extended projection, a new method to extract efficient programs from constructive proofs |
| title_exact_search | Extended projection, a new method to extract efficient programs from constructive proofs |
| title_full | Extended projection, a new method to extract efficient programs from constructive proofs by Y. Takayama |
| title_fullStr | Extended projection, a new method to extract efficient programs from constructive proofs by Y. Takayama |
| title_full_unstemmed | Extended projection, a new method to extract efficient programs from constructive proofs by Y. Takayama |
| title_short | Extended projection, a new method to extract efficient programs from constructive proofs |
| title_sort | extended projection a new method to extract efficient programs from constructive proofs |
| topic | Computer programming Computer programs Correctness |
| topic_facet | Computer programming Computer programs Correctness |
| volume_link | (DE-604)BV010923438 |
| work_keys_str_mv | AT takayamayukihide extendedprojectionanewmethodtoextractefficientprogramsfromconstructiveproofs |