Justifying Algorithms for βη-Conversion
Deciding the typing judgement of type theories with dependent types such as the Logical Framework relies on deciding the equality judgement for the same theory. Implementing the conversion algorithm for βη-equality and justifying this algorithm is therefore an important problem for applications such...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buchkapitel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 424 |
|---|---|
| container_issue | |
| container_start_page | 410 |
| container_title | |
| container_volume | |
| creator | Goguen, Healfdene |
| description | Deciding the typing judgement of type theories with dependent types such as the Logical Framework relies on deciding the equality judgement for the same theory. Implementing the conversion algorithm for βη-equality and justifying this algorithm is therefore an important problem for applications such as proof assistants and modules systems. This article gives a proof of decidability, correctness and completeness of the conversion algorithms for βη-equality defined by Coquand [3] and Harper and Pfenning [8] for the Logical Framework, relying on established metatheoretic results for the type theory. Proofs are also given of the same properties for a typed algorithm for conversion for System F, a new result. |
| doi_str_mv | 10.1007/978-3-540-31982-5_26 |
| format | Book Chapter |
| fullrecord | <record><control><sourceid>pascalfrancis_sprin</sourceid><recordid>TN_cdi_pascalfrancis_primary_16895774</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>16895774</sourcerecordid><originalsourceid>FETCH-LOGICAL-p1896-b5b3c28f7d10aad8eb908fa355559cc9e76fc72400a64c9fafd39d493b3875ef3</originalsourceid><addsrcrecordid>eNotkE1OwzAUhM2fRAi5AYtuWLAw2H52bC-rqPypEhtYW44Th0CbVHZB6rXYcIueCbdlNiPNjJ70PoSuKLmlhMg7LRUGLDjBQLViWBhWHqELSMk-4McooyWlGIDrE1Sk_a5jApTipygjQBjWksM5KmL8IElApZQqQzfPX3Hd-00_dJPpohtDv35fxokfw2T7s_3F1Th8tyH243CJzrxdxLb49xy93c9eq0c8f3l4qqZzvKJKl7gWNTimvGwosbZRba2J8hZEknZOt7L0TjJOiC250976BnTDNdSgpGg95Oj6cHdlo7MLH-zg-mhWoV_asDG0VFrI9EuO2GEXUzV0bTD1OH5GQ4nZQTMJggGTMJg9I7ODBn8TsVtA</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>book_chapter</recordtype></control><display><type>book_chapter</type><title>Justifying Algorithms for βη-Conversion</title><source>Springer Books</source><creator>Goguen, Healfdene</creator><contributor>Sassone, Vladimiro</contributor><creatorcontrib>Goguen, Healfdene ; Sassone, Vladimiro</creatorcontrib><description>Deciding the typing judgement of type theories with dependent types such as the Logical Framework relies on deciding the equality judgement for the same theory. Implementing the conversion algorithm for βη-equality and justifying this algorithm is therefore an important problem for applications such as proof assistants and modules systems. This article gives a proof of decidability, correctness and completeness of the conversion algorithms for βη-equality defined by Coquand [3] and Harper and Pfenning [8] for the Logical Framework, relying on established metatheoretic results for the type theory. Proofs are also given of the same properties for a typed algorithm for conversion for System F, a new result.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 9783540253884</identifier><identifier>ISBN: 3540253882</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 3540319824</identifier><identifier>EISBN: 9783540319825</identifier><identifier>DOI: 10.1007/978-3-540-31982-5_26</identifier><language>eng</language><publisher>Berlin, Heidelberg: Springer Berlin Heidelberg</publisher><subject>Applied sciences ; Computer science; control theory; systems ; Exact sciences and technology ; Induction Hypothesis ; Inference Rule ; Logical Framework ; Normal Form ; Software ; Software engineering ; Type Theory</subject><ispartof>Foundations of Software Science and Computational Structures, 2005, p.410-424</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><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/978-3-540-31982-5_26$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/978-3-540-31982-5_26$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>309,310,779,780,784,789,790,793,4050,4051,27925,38255,41442,42511</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=16895774$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Sassone, Vladimiro</contributor><creatorcontrib>Goguen, Healfdene</creatorcontrib><title>Justifying Algorithms for βη-Conversion</title><title>Foundations of Software Science and Computational Structures</title><description>Deciding the typing judgement of type theories with dependent types such as the Logical Framework relies on deciding the equality judgement for the same theory. Implementing the conversion algorithm for βη-equality and justifying this algorithm is therefore an important problem for applications such as proof assistants and modules systems. This article gives a proof of decidability, correctness and completeness of the conversion algorithms for βη-equality defined by Coquand [3] and Harper and Pfenning [8] for the Logical Framework, relying on established metatheoretic results for the type theory. Proofs are also given of the same properties for a typed algorithm for conversion for System F, a new result.</description><subject>Applied sciences</subject><subject>Computer science; control theory; systems</subject><subject>Exact sciences and technology</subject><subject>Induction Hypothesis</subject><subject>Inference Rule</subject><subject>Logical Framework</subject><subject>Normal Form</subject><subject>Software</subject><subject>Software engineering</subject><subject>Type Theory</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>9783540253884</isbn><isbn>3540253882</isbn><isbn>3540319824</isbn><isbn>9783540319825</isbn><fulltext>true</fulltext><rsrctype>book_chapter</rsrctype><creationdate>2005</creationdate><recordtype>book_chapter</recordtype><recordid>eNotkE1OwzAUhM2fRAi5AYtuWLAw2H52bC-rqPypEhtYW44Th0CbVHZB6rXYcIueCbdlNiPNjJ70PoSuKLmlhMg7LRUGLDjBQLViWBhWHqELSMk-4McooyWlGIDrE1Sk_a5jApTipygjQBjWksM5KmL8IElApZQqQzfPX3Hd-00_dJPpohtDv35fxokfw2T7s_3F1Th8tyH243CJzrxdxLb49xy93c9eq0c8f3l4qqZzvKJKl7gWNTimvGwosbZRba2J8hZEknZOt7L0TjJOiC250976BnTDNdSgpGg95Oj6cHdlo7MLH-zg-mhWoV_asDG0VFrI9EuO2GEXUzV0bTD1OH5GQ4nZQTMJggGTMJg9I7ODBn8TsVtA</recordid><startdate>2005</startdate><enddate>2005</enddate><creator>Goguen, Healfdene</creator><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>IQODW</scope></search><sort><creationdate>2005</creationdate><title>Justifying Algorithms for βη-Conversion</title><author>Goguen, Healfdene</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p1896-b5b3c28f7d10aad8eb908fa355559cc9e76fc72400a64c9fafd39d493b3875ef3</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>Induction Hypothesis</topic><topic>Inference Rule</topic><topic>Logical Framework</topic><topic>Normal Form</topic><topic>Software</topic><topic>Software engineering</topic><topic>Type Theory</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Goguen, Healfdene</creatorcontrib><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Goguen, Healfdene</au><au>Sassone, Vladimiro</au><format>book</format><genre>bookitem</genre><ristype>CHAP</ristype><atitle>Justifying Algorithms for βη-Conversion</atitle><btitle>Foundations of Software Science and Computational Structures</btitle><seriestitle>Lecture Notes in Computer Science</seriestitle><date>2005</date><risdate>2005</risdate><spage>410</spage><epage>424</epage><pages>410-424</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>9783540253884</isbn><isbn>3540253882</isbn><eisbn>3540319824</eisbn><eisbn>9783540319825</eisbn><abstract>Deciding the typing judgement of type theories with dependent types such as the Logical Framework relies on deciding the equality judgement for the same theory. Implementing the conversion algorithm for βη-equality and justifying this algorithm is therefore an important problem for applications such as proof assistants and modules systems. This article gives a proof of decidability, correctness and completeness of the conversion algorithms for βη-equality defined by Coquand [3] and Harper and Pfenning [8] for the Logical Framework, relying on established metatheoretic results for the type theory. Proofs are also given of the same properties for a typed algorithm for conversion for System F, a new result.</abstract><cop>Berlin, Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/978-3-540-31982-5_26</doi><tpages>15</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0302-9743 |
| ispartof | Foundations of Software Science and Computational Structures, 2005, p.410-424 |
| issn | 0302-9743 1611-3349 |
| language | eng |
| recordid | cdi_pascalfrancis_primary_16895774 |
| source | Springer Books |
| subjects | Applied sciences Computer science control theory systems Exact sciences and technology Induction Hypothesis Inference Rule Logical Framework Normal Form Software Software engineering Type Theory |
| title | Justifying Algorithms for βη-Conversion |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-25T15%3A17%3A14IST&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=Justifying%20Algorithms%20for%20%CE%B2%CE%B7-Conversion&rft.btitle=Foundations%20of%20Software%20Science%20and%20Computational%20Structures&rft.au=Goguen,%20Healfdene&rft.date=2005&rft.spage=410&rft.epage=424&rft.pages=410-424&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=9783540253884&rft.isbn_list=3540253882&rft_id=info:doi/10.1007/978-3-540-31982-5_26&rft_dat=%3Cpascalfrancis_sprin%3E16895774%3C/pascalfrancis_sprin%3E%3Curl%3E%3C/url%3E&rft.eisbn=3540319824&rft.eisbn_list=9783540319825&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |