Quotients, inductive types, and quotient inductive types

Quotients, inductive types, and quotient inductive types

This paper introduces an expressive class of indexed quotient-inductive types, called QWI types, within the framework of constructive type theory. They are initial algebras for indexed families of equational theories with possibly infinitary operators and equations. We prove that QWI types can be de...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:arXiv.org 2022-06
Hauptverfasser: Fiore, Marcelo P, Pitts, Andrew M, Steenkamp, S C
Format: Artikel
Sprache:eng
Schlagworte:
Computer Science - Logic in Computer Science
Quotients
Theorem proving
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title arXiv.org
container_volume
creator Fiore, Marcelo P
Pitts, Andrew M
Steenkamp, S C
description This paper introduces an expressive class of indexed quotient-inductive types, called QWI types, within the framework of constructive type theory. They are initial algebras for indexed families of equational theories with possibly infinitary operators and equations. We prove that QWI types can be derived from quotient types and inductive types in the type theory of toposes with natural number object and universes, provided those universes satisfy the Weakly Initial Set of Covers (WISC) axiom. We do so by constructing QWI types as colimits of a family of approximations to them defined by well-founded recursion over a suitable notion of size, whose definition involves the WISC axiom. We developed the proof and checked it using the Agda theorem prover.
doi_str_mv 10.48550/arxiv.2101.02994
format Article
fullrecord <record><control><sourceid>proquest_arxiv</sourceid><recordid>TN_cdi_arxiv_primary_2101_02994</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2476742594</sourcerecordid><originalsourceid>FETCH-LOGICAL-a954-1b7fe6d9f1e26753af6e8c0651feaffb2d3cf46f4f20d38ec0b6dc213b46bb893</originalsourceid><addsrcrecordid>eNpdj01Lw0AQhhdBaKn9AT0Z8Gri7uxHNkcpaoWCCL0vu9kdSNEkzW6K_ffGtidPA_M-vDMPIStGC6GlpE92-GmOBTDKCgpVJW7IHDhnuRYAM7KMcU8pBVWClHxO9OfYpSa0KT5mTevHOjXHkKVTH6aFbX12uOb_0ztyi_YrhuV1Lsju9WW33uTbj7f39fM2t5UUOXMlBuUrZGE6KblFFXRNlWQYLKIDz2sUCgUC9VyHmjrla2DcCeWcrviC3F9qz1qmH5pvO5zMn545603Ew4Xoh-4whpjMvhuHdvrJgChVKUBO1C-tkFNc</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2476742594</pqid></control><display><type>article</type><title>Quotients, inductive types, and quotient inductive types</title><source>arXiv.org</source><source>Free E- Journals</source><creator>Fiore, Marcelo P ; Pitts, Andrew M ; Steenkamp, S C</creator><creatorcontrib>Fiore, Marcelo P ; Pitts, Andrew M ; Steenkamp, S C</creatorcontrib><description>This paper introduces an expressive class of indexed quotient-inductive types, called QWI types, within the framework of constructive type theory. They are initial algebras for indexed families of equational theories with possibly infinitary operators and equations. We prove that QWI types can be derived from quotient types and inductive types in the type theory of toposes with natural number object and universes, provided those universes satisfy the Weakly Initial Set of Covers (WISC) axiom. We do so by constructing QWI types as colimits of a family of approximations to them defined by well-founded recursion over a suitable notion of size, whose definition involves the WISC axiom. We developed the proof and checked it using the Agda theorem prover.</description><identifier>EISSN: 2331-8422</identifier><identifier>DOI: 10.48550/arxiv.2101.02994</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Computer Science - Logic in Computer Science ; Quotients ; Theorem proving</subject><ispartof>arXiv.org, 2022-06</ispartof><rights>2022. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><rights>http://creativecommons.org/licenses/by/4.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,776,780,881,27904</link.rule.ids><backlink>$$Uhttps://doi.org/10.48550/arXiv.2101.02994$$DView paper in arXiv$$Hfree_for_read</backlink><backlink>$$Uhttps://doi.org/10.46298/lmcs-18(2:15)2022$$DView published paper (Access to full text may be restricted)$$Hfree_for_read</backlink></links><search><creatorcontrib>Fiore, Marcelo P</creatorcontrib><creatorcontrib>Pitts, Andrew M</creatorcontrib><creatorcontrib>Steenkamp, S C</creatorcontrib><title>Quotients, inductive types, and quotient inductive types</title><title>arXiv.org</title><description>This paper introduces an expressive class of indexed quotient-inductive types, called QWI types, within the framework of constructive type theory. They are initial algebras for indexed families of equational theories with possibly infinitary operators and equations. We prove that QWI types can be derived from quotient types and inductive types in the type theory of toposes with natural number object and universes, provided those universes satisfy the Weakly Initial Set of Covers (WISC) axiom. We do so by constructing QWI types as colimits of a family of approximations to them defined by well-founded recursion over a suitable notion of size, whose definition involves the WISC axiom. We developed the proof and checked it using the Agda theorem prover.</description><subject>Computer Science - Logic in Computer Science</subject><subject>Quotients</subject><subject>Theorem proving</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2022</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GOX</sourceid><recordid>eNpdj01Lw0AQhhdBaKn9AT0Z8Gri7uxHNkcpaoWCCL0vu9kdSNEkzW6K_ffGtidPA_M-vDMPIStGC6GlpE92-GmOBTDKCgpVJW7IHDhnuRYAM7KMcU8pBVWClHxO9OfYpSa0KT5mTevHOjXHkKVTH6aFbX12uOb_0ztyi_YrhuV1Lsju9WW33uTbj7f39fM2t5UUOXMlBuUrZGE6KblFFXRNlWQYLKIDz2sUCgUC9VyHmjrla2DcCeWcrviC3F9qz1qmH5pvO5zMn545603Ew4Xoh-4whpjMvhuHdvrJgChVKUBO1C-tkFNc</recordid><startdate>20220606</startdate><enddate>20220606</enddate><creator>Fiore, Marcelo P</creator><creator>Pitts, Andrew M</creator><creator>Steenkamp, S C</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20220606</creationdate><title>Quotients, inductive types, and quotient inductive types</title><author>Fiore, Marcelo P ; Pitts, Andrew M ; Steenkamp, S C</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a954-1b7fe6d9f1e26753af6e8c0651feaffb2d3cf46f4f20d38ec0b6dc213b46bb893</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2022</creationdate><topic>Computer Science - Logic in Computer Science</topic><topic>Quotients</topic><topic>Theorem proving</topic><toplevel>online_resources</toplevel><creatorcontrib>Fiore, Marcelo P</creatorcontrib><creatorcontrib>Pitts, Andrew M</creatorcontrib><creatorcontrib>Steenkamp, S C</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection><collection>arXiv Computer Science</collection><collection>arXiv.org</collection><jtitle>arXiv.org</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Fiore, Marcelo P</au><au>Pitts, Andrew M</au><au>Steenkamp, S C</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Quotients, inductive types, and quotient inductive types</atitle><jtitle>arXiv.org</jtitle><date>2022-06-06</date><risdate>2022</risdate><eissn>2331-8422</eissn><abstract>This paper introduces an expressive class of indexed quotient-inductive types, called QWI types, within the framework of constructive type theory. They are initial algebras for indexed families of equational theories with possibly infinitary operators and equations. We prove that QWI types can be derived from quotient types and inductive types in the type theory of toposes with natural number object and universes, provided those universes satisfy the Weakly Initial Set of Covers (WISC) axiom. We do so by constructing QWI types as colimits of a family of approximations to them defined by well-founded recursion over a suitable notion of size, whose definition involves the WISC axiom. We developed the proof and checked it using the Agda theorem prover.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><doi>10.48550/arxiv.2101.02994</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier EISSN: 2331-8422
ispartof arXiv.org, 2022-06
issn 2331-8422
language eng
recordid cdi_arxiv_primary_2101_02994
source arXiv.org; Free E- Journals
subjects Computer Science - Logic in Computer Science
Quotients
Theorem proving
title Quotients, inductive types, and quotient inductive types
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-23T00%3A23%3A40IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_arxiv&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Quotients,%20inductive%20types,%20and%20quotient%20inductive%20types&rft.jtitle=arXiv.org&rft.au=Fiore,%20Marcelo%20P&rft.date=2022-06-06&rft.eissn=2331-8422&rft_id=info:doi/10.48550/arxiv.2101.02994&rft_dat=%3Cproquest_arxiv%3E2476742594%3C/proquest_arxiv%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2476742594&rft_id=info:pmid/&rfr_iscdi=true