Antifounded Coinduction in Type Theory

1 pages•Published: May 15, 2012

Abstract

Venanzio Capretta, Varmo Vene and I have previously studied antifounded algebras as a a category-theoretic formulation of antifounded coinduction. These are the dual of wellfounded coalgebras, a category theorist's take on wellfounded induction, closely related to the Bove-Capretta method for justifying function definitions by general recursion in type theory.

In this talk, we discuss one possible type-theoretic approach to antifounded coinduction.

Keyphrases: antifounded coinduction, corecursion, subset, quotient types, type theory, wellfounded induction, recursion

In: Ekaterina Komendantskaya, Ana Bove and Milad Niqui (editors). PAR-10. Partiality and Recursion in Interactive Theorem Provers, vol 5, pages 114.

Links:	https://easychair.org/publications/paper/Lv
	https://doi.org/10.29007/gh62

BibTeX entry

@inproceedings{PAR-10:Antifounded_Coinduction_Type_Theory,
  author    = {Tarmo Uustalu},
  title     = {Antifounded Coinduction in Type Theory},
  booktitle = {PAR-10. Partiality and Recursion in Interactive Theorem Provers},
  editor    = {Ekaterina Komendantskaya and Ana Bove and Milad Niqui},
  series    = {EPiC Series in Computing},
  volume    = {5},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/Lv},
  doi       = {10.29007/gh62},
  pages     = {114},
  year      = {2012}}

Download PDF Open PDF in browser