A syntactic approach to eta equality in type theory
This paper outlines an elementary approach for showing the decidability of type checking for type theories with βη-equality, relevant to foundations for modules systems and type theory-based proof systems. The key to the approach is a syntactic translation mapping terms in the βη presentation into t...
Gespeichert in:
| Veröffentlicht in: | SIGPLAN notices 2005-01, Vol.40 (1), p.75-84 |
|---|---|
| 1. Verfasser: | |
| Format: | Artikel |
| Sprache: | eng |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 84 |
|---|---|
| container_issue | 1 |
| container_start_page | 75 |
| container_title | SIGPLAN notices |
| container_volume | 40 |
| creator | Goguen, Healfdene |
| description | This paper outlines an elementary approach for showing the decidability of type checking for type theories with βη-equality, relevant to foundations for modules systems and type theory-based proof systems. The key to the approach is a syntactic translation mapping terms in the βη presentation into their full η-expansions in the β presentation. Decidability of type checking is lifted from the target β presentation to the βη presentation. The approach extends to other inductive kinds with a single constructor, and is demonstrated for singletons and dependent pairs. |
| doi_str_mv | 10.1145/1047659.1040312 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_29491365</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>29491365</sourcerecordid><originalsourceid>FETCH-LOGICAL-c272t-eb5f4da999a47e7d36a10be540dff874983415fcf3d9b6daf2a0552d2f602aa93</originalsourceid><addsrcrecordid>eNotkDtrwzAURkVpoW7auaumbk7u1cvWGEJfEOjSzuJGloiLYzuWMvjfNyWZznL4-DiMPSMsEZVeIajKaLs8EySKG1ag1nWJaOCWFSCNKFEquGcPKf0CgARRF0yueZr7TD63ntM4TgP5Pc8DD5l4OJ6oa_PM257neQw878MwzY_sLlKXwtOVC_bz9vq9-Si3X--fm_W29KISuQw7HVVD1lpSVagaaQhhF7SCJsa6UraWCnX0UTZ2ZxqKgkBr0YhoQBBZuWAvl93zq-MppOwObfKh66gPwyk5YZVFafRZXF1EPw0pTSG6cWoPNM0Owf3Hcdc47hpH_gGgYVY1</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>29491365</pqid></control><display><type>article</type><title>A syntactic approach to eta equality in type theory</title><source>Access via ACM Digital Library</source><creator>Goguen, Healfdene</creator><creatorcontrib>Goguen, Healfdene</creatorcontrib><description>This paper outlines an elementary approach for showing the decidability of type checking for type theories with βη-equality, relevant to foundations for modules systems and type theory-based proof systems. The key to the approach is a syntactic translation mapping terms in the βη presentation into their full η-expansions in the β presentation. Decidability of type checking is lifted from the target β presentation to the βη presentation. The approach extends to other inductive kinds with a single constructor, and is demonstrated for singletons and dependent pairs.</description><identifier>ISSN: 0362-1340</identifier><identifier>EISSN: 1558-1160</identifier><identifier>DOI: 10.1145/1047659.1040312</identifier><language>eng</language><ispartof>SIGPLAN notices, 2005-01, Vol.40 (1), p.75-84</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c272t-eb5f4da999a47e7d36a10be540dff874983415fcf3d9b6daf2a0552d2f602aa93</citedby><cites>FETCH-LOGICAL-c272t-eb5f4da999a47e7d36a10be540dff874983415fcf3d9b6daf2a0552d2f602aa93</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,27924,27925</link.rule.ids></links><search><creatorcontrib>Goguen, Healfdene</creatorcontrib><title>A syntactic approach to eta equality in type theory</title><title>SIGPLAN notices</title><description>This paper outlines an elementary approach for showing the decidability of type checking for type theories with βη-equality, relevant to foundations for modules systems and type theory-based proof systems. The key to the approach is a syntactic translation mapping terms in the βη presentation into their full η-expansions in the β presentation. Decidability of type checking is lifted from the target β presentation to the βη presentation. The approach extends to other inductive kinds with a single constructor, and is demonstrated for singletons and dependent pairs.</description><issn>0362-1340</issn><issn>1558-1160</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2005</creationdate><recordtype>article</recordtype><recordid>eNotkDtrwzAURkVpoW7auaumbk7u1cvWGEJfEOjSzuJGloiLYzuWMvjfNyWZznL4-DiMPSMsEZVeIajKaLs8EySKG1ag1nWJaOCWFSCNKFEquGcPKf0CgARRF0yueZr7TD63ntM4TgP5Pc8DD5l4OJ6oa_PM257neQw878MwzY_sLlKXwtOVC_bz9vq9-Si3X--fm_W29KISuQw7HVVD1lpSVagaaQhhF7SCJsa6UraWCnX0UTZ2ZxqKgkBr0YhoQBBZuWAvl93zq-MppOwObfKh66gPwyk5YZVFafRZXF1EPw0pTSG6cWoPNM0Owf3Hcdc47hpH_gGgYVY1</recordid><startdate>20050101</startdate><enddate>20050101</enddate><creator>Goguen, Healfdene</creator><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20050101</creationdate><title>A syntactic approach to eta equality in type theory</title><author>Goguen, Healfdene</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c272t-eb5f4da999a47e7d36a10be540dff874983415fcf3d9b6daf2a0552d2f602aa93</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2005</creationdate><toplevel>online_resources</toplevel><creatorcontrib>Goguen, Healfdene</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>SIGPLAN notices</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Goguen, Healfdene</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A syntactic approach to eta equality in type theory</atitle><jtitle>SIGPLAN notices</jtitle><date>2005-01-01</date><risdate>2005</risdate><volume>40</volume><issue>1</issue><spage>75</spage><epage>84</epage><pages>75-84</pages><issn>0362-1340</issn><eissn>1558-1160</eissn><abstract>This paper outlines an elementary approach for showing the decidability of type checking for type theories with βη-equality, relevant to foundations for modules systems and type theory-based proof systems. The key to the approach is a syntactic translation mapping terms in the βη presentation into their full η-expansions in the β presentation. Decidability of type checking is lifted from the target β presentation to the βη presentation. The approach extends to other inductive kinds with a single constructor, and is demonstrated for singletons and dependent pairs.</abstract><doi>10.1145/1047659.1040312</doi><tpages>10</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0362-1340 |
| ispartof | SIGPLAN notices, 2005-01, Vol.40 (1), p.75-84 |
| issn | 0362-1340 1558-1160 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_29491365 |
| source | Access via ACM Digital Library |
| title | A syntactic approach to eta equality in type theory |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-25T03%3A43%3A06IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20syntactic%20approach%20to%20eta%20equality%20in%20type%20theory&rft.jtitle=SIGPLAN%20notices&rft.au=Goguen,%20Healfdene&rft.date=2005-01-01&rft.volume=40&rft.issue=1&rft.spage=75&rft.epage=84&rft.pages=75-84&rft.issn=0362-1340&rft.eissn=1558-1160&rft_id=info:doi/10.1145/1047659.1040312&rft_dat=%3Cproquest_cross%3E29491365%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=29491365&rft_id=info:pmid/&rfr_iscdi=true |