Mechanized Metatheory for the Masses: The PoplMark Challenge
How close are we to a world where every paper on programming languages is accompanied by an electronic appendix with machine-checked proofs? We propose an initial set of benchmarks for measuring progress in this area. Based on the metatheory of System F
Gespeichert in:
| Hauptverfasser: | , , , , , , , , , |
|---|---|
| Format: | Buchkapitel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 65 |
|---|---|
| container_issue | |
| container_start_page | 50 |
| container_title | |
| container_volume | |
| creator | Aydemir, Brian E. Bohannon, Aaron Fairbairn, Matthew Foster, J. Nathan Pierce, Benjamin C. Sewell, Peter Vytiniotis, Dimitrios Washburn, Geoffrey Weirich, Stephanie Zdancewic, Steve |
| description | How close are we to a world where every paper on programming languages is accompanied by an electronic appendix with machine-checked proofs?
We propose an initial set of benchmarks for measuring progress in this area. Based on the metatheory of System F |
| doi_str_mv | 10.1007/11541868_4 |
| format | Book Chapter |
| fullrecord | <record><control><sourceid>pascalfrancis_sprin</sourceid><recordid>TN_cdi_pascalfrancis_primary_17116284</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>17116284</sourcerecordid><originalsourceid>FETCH-LOGICAL-c361t-c4c049deb88df42a07deeab916118e02e1f00009b160e0ca89c12fc470b5ac9a3</originalsourceid><addsrcrecordid>eNpFkEtPwzAQhM1LopRe-AW5IHEJ7NpObCMuVcVLagSHcrY2zoaWhqaKeym_nkRFYi8z0oxWn0aIK4RbBDB3iJlGm1uvj8TEGasyDQqtBDgWI8wRU6W0OxEXQyCtMlKeihEokKkzWp2LSYxf0J-SoLJ8JB4KDkvarH64Sgre0W7JbbdP6rZLepsUFCPH-2TR-_d22xTUrZPZkpqGN598Kc5qaiJP_nQsPp4eF7OXdP72_DqbztOgctylQQfQruLS2qrWksBUzFS6gdcySMZ6QHIl5sAQyLqAsg7aQJlRcKTG4vrwd0sxUFN3tAmr6Lfd6pu6vUeDmEur-97NoRf7qOfrfNm26-gR_LCe_19P_QLLQlr3</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>book_chapter</recordtype></control><display><type>book_chapter</type><title>Mechanized Metatheory for the Masses: The PoplMark Challenge</title><source>Springer Books</source><creator>Aydemir, Brian E. ; Bohannon, Aaron ; Fairbairn, Matthew ; Foster, J. Nathan ; Pierce, Benjamin C. ; Sewell, Peter ; Vytiniotis, Dimitrios ; Washburn, Geoffrey ; Weirich, Stephanie ; Zdancewic, Steve</creator><contributor>Hurd, Joe ; Melham, Tom</contributor><creatorcontrib>Aydemir, Brian E. ; Bohannon, Aaron ; Fairbairn, Matthew ; Foster, J. Nathan ; Pierce, Benjamin C. ; Sewell, Peter ; Vytiniotis, Dimitrios ; Washburn, Geoffrey ; Weirich, Stephanie ; Zdancewic, Steve ; Hurd, Joe ; Melham, Tom</creatorcontrib><description>How close are we to a world where every paper on programming languages is accompanied by an electronic appendix with machine-checked proofs?
We propose an initial set of benchmarks for measuring progress in this area. Based on the metatheory of System F< :, a typed lambda-calculus with second-order polymorphism, subtyping, and records, these benchmarks embody many aspects of programming languages that are challenging to formalize: variable binding at both the term and type levels, syntactic forms with variable numbers of components (including binders), and proofs demanding complex induction principles. We hope that these benchmarks will help clarify the current state of the art, provide a basis for comparing competing technologies, and motivate further research.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 3540283722</identifier><identifier>ISBN: 9783540283720</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 9783540318200</identifier><identifier>EISBN: 3540318208</identifier><identifier>DOI: 10.1007/11541868_4</identifier><language>eng</language><publisher>Berlin, Heidelberg: Springer Berlin Heidelberg</publisher><subject>Applied sciences ; Computer science; control theory; systems ; Exact sciences and technology ; Logical, boolean and switching functions ; Theoretical computing</subject><ispartof>Lecture notes in computer science, 2005, p.50-65</ispartof><rights>Springer-Verlag Berlin Heidelberg 2005</rights><rights>2005 INIST-CNRS</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c361t-c4c049deb88df42a07deeab916118e02e1f00009b160e0ca89c12fc470b5ac9a3</citedby><relation>Lecture Notes in Computer Science</relation></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/11541868_4$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/11541868_4$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>309,310,775,776,780,785,786,789,4036,4037,27902,38232,41418,42487</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=17116284$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Hurd, Joe</contributor><contributor>Melham, Tom</contributor><creatorcontrib>Aydemir, Brian E.</creatorcontrib><creatorcontrib>Bohannon, Aaron</creatorcontrib><creatorcontrib>Fairbairn, Matthew</creatorcontrib><creatorcontrib>Foster, J. Nathan</creatorcontrib><creatorcontrib>Pierce, Benjamin C.</creatorcontrib><creatorcontrib>Sewell, Peter</creatorcontrib><creatorcontrib>Vytiniotis, Dimitrios</creatorcontrib><creatorcontrib>Washburn, Geoffrey</creatorcontrib><creatorcontrib>Weirich, Stephanie</creatorcontrib><creatorcontrib>Zdancewic, Steve</creatorcontrib><title>Mechanized Metatheory for the Masses: The PoplMark Challenge</title><title>Lecture notes in computer science</title><description>How close are we to a world where every paper on programming languages is accompanied by an electronic appendix with machine-checked proofs?
We propose an initial set of benchmarks for measuring progress in this area. Based on the metatheory of System F< :, a typed lambda-calculus with second-order polymorphism, subtyping, and records, these benchmarks embody many aspects of programming languages that are challenging to formalize: variable binding at both the term and type levels, syntactic forms with variable numbers of components (including binders), and proofs demanding complex induction principles. We hope that these benchmarks will help clarify the current state of the art, provide a basis for comparing competing technologies, and motivate further research.</description><subject>Applied sciences</subject><subject>Computer science; control theory; systems</subject><subject>Exact sciences and technology</subject><subject>Logical, boolean and switching functions</subject><subject>Theoretical computing</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>3540283722</isbn><isbn>9783540283720</isbn><isbn>9783540318200</isbn><isbn>3540318208</isbn><fulltext>true</fulltext><rsrctype>book_chapter</rsrctype><creationdate>2005</creationdate><recordtype>book_chapter</recordtype><recordid>eNpFkEtPwzAQhM1LopRe-AW5IHEJ7NpObCMuVcVLagSHcrY2zoaWhqaKeym_nkRFYi8z0oxWn0aIK4RbBDB3iJlGm1uvj8TEGasyDQqtBDgWI8wRU6W0OxEXQyCtMlKeihEokKkzWp2LSYxf0J-SoLJ8JB4KDkvarH64Sgre0W7JbbdP6rZLepsUFCPH-2TR-_d22xTUrZPZkpqGN598Kc5qaiJP_nQsPp4eF7OXdP72_DqbztOgctylQQfQruLS2qrWksBUzFS6gdcySMZ6QHIl5sAQyLqAsg7aQJlRcKTG4vrwd0sxUFN3tAmr6Lfd6pu6vUeDmEur-97NoRf7qOfrfNm26-gR_LCe_19P_QLLQlr3</recordid><startdate>2005</startdate><enddate>2005</enddate><creator>Aydemir, Brian E.</creator><creator>Bohannon, Aaron</creator><creator>Fairbairn, Matthew</creator><creator>Foster, J. Nathan</creator><creator>Pierce, Benjamin C.</creator><creator>Sewell, Peter</creator><creator>Vytiniotis, Dimitrios</creator><creator>Washburn, Geoffrey</creator><creator>Weirich, Stephanie</creator><creator>Zdancewic, Steve</creator><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>IQODW</scope></search><sort><creationdate>2005</creationdate><title>Mechanized Metatheory for the Masses: The PoplMark Challenge</title><author>Aydemir, Brian E. ; Bohannon, Aaron ; Fairbairn, Matthew ; Foster, J. Nathan ; Pierce, Benjamin C. ; Sewell, Peter ; Vytiniotis, Dimitrios ; Washburn, Geoffrey ; Weirich, Stephanie ; Zdancewic, Steve</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c361t-c4c049deb88df42a07deeab916118e02e1f00009b160e0ca89c12fc470b5ac9a3</frbrgroupid><rsrctype>book_chapters</rsrctype><prefilter>book_chapters</prefilter><language>eng</language><creationdate>2005</creationdate><topic>Applied sciences</topic><topic>Computer science; control theory; systems</topic><topic>Exact sciences and technology</topic><topic>Logical, boolean and switching functions</topic><topic>Theoretical computing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Aydemir, Brian E.</creatorcontrib><creatorcontrib>Bohannon, Aaron</creatorcontrib><creatorcontrib>Fairbairn, Matthew</creatorcontrib><creatorcontrib>Foster, J. Nathan</creatorcontrib><creatorcontrib>Pierce, Benjamin C.</creatorcontrib><creatorcontrib>Sewell, Peter</creatorcontrib><creatorcontrib>Vytiniotis, Dimitrios</creatorcontrib><creatorcontrib>Washburn, Geoffrey</creatorcontrib><creatorcontrib>Weirich, Stephanie</creatorcontrib><creatorcontrib>Zdancewic, Steve</creatorcontrib><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Aydemir, Brian E.</au><au>Bohannon, Aaron</au><au>Fairbairn, Matthew</au><au>Foster, J. Nathan</au><au>Pierce, Benjamin C.</au><au>Sewell, Peter</au><au>Vytiniotis, Dimitrios</au><au>Washburn, Geoffrey</au><au>Weirich, Stephanie</au><au>Zdancewic, Steve</au><au>Hurd, Joe</au><au>Melham, Tom</au><format>book</format><genre>bookitem</genre><ristype>CHAP</ristype><atitle>Mechanized Metatheory for the Masses: The PoplMark Challenge</atitle><btitle>Lecture notes in computer science</btitle><seriestitle>Lecture Notes in Computer Science</seriestitle><date>2005</date><risdate>2005</risdate><spage>50</spage><epage>65</epage><pages>50-65</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>3540283722</isbn><isbn>9783540283720</isbn><eisbn>9783540318200</eisbn><eisbn>3540318208</eisbn><abstract>How close are we to a world where every paper on programming languages is accompanied by an electronic appendix with machine-checked proofs?
We propose an initial set of benchmarks for measuring progress in this area. Based on the metatheory of System F< :, a typed lambda-calculus with second-order polymorphism, subtyping, and records, these benchmarks embody many aspects of programming languages that are challenging to formalize: variable binding at both the term and type levels, syntactic forms with variable numbers of components (including binders), and proofs demanding complex induction principles. We hope that these benchmarks will help clarify the current state of the art, provide a basis for comparing competing technologies, and motivate further research.</abstract><cop>Berlin, Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/11541868_4</doi><tpages>16</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0302-9743 |
| ispartof | Lecture notes in computer science, 2005, p.50-65 |
| issn | 0302-9743 1611-3349 |
| language | eng |
| recordid | cdi_pascalfrancis_primary_17116284 |
| source | Springer Books |
| subjects | Applied sciences Computer science control theory systems Exact sciences and technology Logical, boolean and switching functions Theoretical computing |
| title | Mechanized Metatheory for the Masses: The PoplMark Challenge |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-08T03%3A52%3A58IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-pascalfrancis_sprin&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=bookitem&rft.atitle=Mechanized%20Metatheory%20for%20the%20Masses:%20The%20PoplMark%20Challenge&rft.btitle=Lecture%20notes%20in%20computer%20science&rft.au=Aydemir,%20Brian%20E.&rft.date=2005&rft.spage=50&rft.epage=65&rft.pages=50-65&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=3540283722&rft.isbn_list=9783540283720&rft_id=info:doi/10.1007/11541868_4&rft_dat=%3Cpascalfrancis_sprin%3E17116284%3C/pascalfrancis_sprin%3E%3Curl%3E%3C/url%3E&rft.eisbn=9783540318200&rft.eisbn_list=3540318208&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |