Extraction of redundancy-free programs from constructive natural deduction proofs:
Abstract: "Executable codes can be extracted from constructive proofs by using realizability interpretation. However, realizability also generates redundant codes that have no significant computational meaning. This redundancy causes heavy runtime overhead, and is one of the obstacles in applyi...
Saved in:
| Main Author: | |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Tokyo, Japan
1989
|
| Series: | Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report
522 |
| Subjects: | |
| Summary: | Abstract: "Executable codes can be extracted from constructive proofs by using realizability interpretation. However, realizability also generates redundant codes that have no significant computational meaning. This redundancy causes heavy runtime overhead, and is one of the obstacles in applying realizabilty to practical systems that realize the mathematical programming paradigm. This paper presents a method to eliminate redundancy by analyzing proof trees as pre-processing of realizability interpretation; according to the declaration given to the theorem that is proved, each node of the proof tree is marked automatically to show which part of the realizer is needed. This procedure does not always work well. This paper also gives an analysis of it and techniques to resolve critical cases. The method is studied in a simple constructive logic with primitive types, mathematical induction and its q-realizability interpretation. As an example, the extraction of a prime number checker program is given." |
| Physical Description: | 47 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010949417 | ||
| 003 | DE-604 | ||
| 005 | 19961212 | ||
| 007 | t | ||
| 008 | 960916s1989 |||| 00||| engod | ||
| 035 | |a (OCoLC)22495675 | ||
| 035 | |a (DE-599)BVBBV010949417 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 084 | |a DAT 706f |2 stub | ||
| 100 | 1 | |a Takayama, Yukihide |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Extraction of redundancy-free programs from constructive natural deduction proofs |c by Y. Takayama |
| 264 | 1 | |a Tokyo, Japan |c 1989 | |
| 300 | |a 47 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 522 | |
| 520 | 3 | |a Abstract: "Executable codes can be extracted from constructive proofs by using realizability interpretation. However, realizability also generates redundant codes that have no significant computational meaning. This redundancy causes heavy runtime overhead, and is one of the obstacles in applying realizabilty to practical systems that realize the mathematical programming paradigm. This paper presents a method to eliminate redundancy by analyzing proof trees as pre-processing of realizability interpretation; according to the declaration given to the theorem that is proved, each node of the proof tree is marked automatically to show which part of the realizer is needed. This procedure does not always work well. This paper also gives an analysis of it and techniques to resolve critical cases. The method is studied in a simple constructive logic with primitive types, mathematical induction and its q-realizability interpretation. As an example, the extraction of a prime number checker program is given." | |
| 650 | 4 | |a Proof theory | |
| 830 | 0 | |a Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report |v 522 |w (DE-604)BV010923438 |9 522 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007323327 | ||
Record in the Search Index
| _version_ | 1804125436398010368 |
|---|---|
| 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 | BV010949417 |
| classification_tum | DAT 706f |
| ctrlnum | (OCoLC)22495675 (DE-599)BVBBV010949417 |
| discipline | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01993nam a2200301 cb4500</leader><controlfield tag="001">BV010949417</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19961212 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">960916s1989 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)22495675</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010949417</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="084" ind1=" " ind2=" "><subfield code="a">DAT 706f</subfield><subfield code="2">stub</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">Extraction of redundancy-free programs from constructive natural deduction 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">47 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">522</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Executable codes can be extracted from constructive proofs by using realizability interpretation. However, realizability also generates redundant codes that have no significant computational meaning. This redundancy causes heavy runtime overhead, and is one of the obstacles in applying realizabilty to practical systems that realize the mathematical programming paradigm. This paper presents a method to eliminate redundancy by analyzing proof trees as pre-processing of realizability interpretation; according to the declaration given to the theorem that is proved, each node of the proof tree is marked automatically to show which part of the realizer is needed. This procedure does not always work well. This paper also gives an analysis of it and techniques to resolve critical cases. The method is studied in a simple constructive logic with primitive types, mathematical induction and its q-realizability interpretation. As an example, the extraction of a prime number checker program is given."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Proof theory</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">522</subfield><subfield code="w">(DE-604)BV010923438</subfield><subfield code="9">522</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007323327</subfield></datafield></record></collection> |
| id | DE-604.BV010949417 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T18:01:32Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007323327 |
| oclc_num | 22495675 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 47 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 Extraction of redundancy-free programs from constructive natural deduction proofs by Y. Takayama Tokyo, Japan 1989 47 S. txt rdacontent n rdamedia nc rdacarrier Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report 522 Abstract: "Executable codes can be extracted from constructive proofs by using realizability interpretation. However, realizability also generates redundant codes that have no significant computational meaning. This redundancy causes heavy runtime overhead, and is one of the obstacles in applying realizabilty to practical systems that realize the mathematical programming paradigm. This paper presents a method to eliminate redundancy by analyzing proof trees as pre-processing of realizability interpretation; according to the declaration given to the theorem that is proved, each node of the proof tree is marked automatically to show which part of the realizer is needed. This procedure does not always work well. This paper also gives an analysis of it and techniques to resolve critical cases. The method is studied in a simple constructive logic with primitive types, mathematical induction and its q-realizability interpretation. As an example, the extraction of a prime number checker program is given." Proof theory Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report 522 (DE-604)BV010923438 522 |
| spellingShingle | Takayama, Yukihide Extraction of redundancy-free programs from constructive natural deduction proofs Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report Proof theory |
| title | Extraction of redundancy-free programs from constructive natural deduction proofs |
| title_auth | Extraction of redundancy-free programs from constructive natural deduction proofs |
| title_exact_search | Extraction of redundancy-free programs from constructive natural deduction proofs |
| title_full | Extraction of redundancy-free programs from constructive natural deduction proofs by Y. Takayama |
| title_fullStr | Extraction of redundancy-free programs from constructive natural deduction proofs by Y. Takayama |
| title_full_unstemmed | Extraction of redundancy-free programs from constructive natural deduction proofs by Y. Takayama |
| title_short | Extraction of redundancy-free programs from constructive natural deduction proofs |
| title_sort | extraction of redundancy free programs from constructive natural deduction proofs |
| topic | Proof theory |
| topic_facet | Proof theory |
| volume_link | (DE-604)BV010923438 |
| work_keys_str_mv | AT takayamayukihide extractionofredundancyfreeprogramsfromconstructivenaturaldeductionproofs |