Representing Nested Inductive Types Using W-types

Representing Nested Inductive Types Using W-types

Cached

Download Links

by Michael Abbott, Thorsten Altenkirch , Neil Ghani

Citations:

BibTeX

@MISC{Abbott_representingnested,
    author = {Michael Abbott and Thorsten Altenkirch and Neil Ghani},
    title = {Representing Nested Inductive Types Using W-types},
    year = {}
}

Bookmark

OpenURL

Abstract

We show that strictly positive inductive types, constructed from polynomial functors, constant exponentiation and arbitrarily nested inductive

Citations

301	Intuitionistic Type Theory - Martin-Löf - 1984
157	Topos theory - Johnstone - 1977
37	Syntax and semantics of dependent types - Hofmann - 1997
36	Indexed induction-recursion - Dybjer, Setzer - 2006
35	A.: A finite axiomatization of inductive-recursive definitions - Dybjer, Setzer - 1999
32	On the interpretation of type theory in locally cartesian closed categories - Hofmann - 1995
30	Categories of containers - Abbott, Altenkirch, et al. - 2003
28	Categorical logic and type theory. Number 141 in Studies in logic and the foundations of mathematics - Jacobs - 1999
25	Handbook of categorical algebra. 2, volume 51 of Encyclopedia of Mathematics and its Applications - Borceux - 1994
22	Locally presentable and accessible categories. Number 189 - Adamek, Rosicky - 1994
14	Representing inductively defined sets by wellorderings in Martin-Löf’s type theory - Dybjer - 1997
13	Least fixed point of a functor - Adámek, Koubek - 1979
8	A predicative strong normalisation proof for a λcalculus with interleaving inductive types - Abel, Altenkirch - 2000
6	Wellfounded trees in categories. Annals of pure and applied logic - Moerdijk, Palmgren - 2000
1	Representing strictly positive types. Presented at APPSEM annual meeting, invited for submission to Theoretical Computer Science - Abbott, Altenkirch, et al. - 2004