Results 1 
8 of
8
Wellfounded Trees in Categories
, 1999
"... this paper, we give an abstract 2 categorical characterization of Wtypes. We calculate these Wtypes explicitly in some categories of presheaves and sheaves on a site, and in the gluing category or Freyd cover. (We also have an explicit description in the case of Hyland's realizability topos, ..."
Abstract

Cited by 54 (10 self)
 Add to MetaCart
this paper, we give an abstract 2 categorical characterization of Wtypes. We calculate these Wtypes explicitly in some categories of presheaves and sheaves on a site, and in the gluing category or Freyd cover. (We also have an explicit description in the case of Hyland's realizability topos, which will be presented in [17].) These explicit calculations can be formalized in a weak predicative metatheory, and lead to the result that if E is any suitably filtered pretopos with dependent products and Wtypes, then so is the category of internal sheaves on a site in E (Remark 5.9). Our paper is organized as follows. In Section 2 we review some standard definitions concerning pretoposes and dependent products. In Section 3 we present the categorical definition of the Wconstruction, and in Section 4 we prove some of its basic functoriality properties; e.g., that it turns coequalizers into equalizers. In Section 5, a construction is presented which to each map between (pre)sheaves of sets associates a sheaf of wellfounded trees, and it is proved that this is in fact the Wtype in the category (pre)sheaves of sets (Theorem 5.6). In Section 6, we discuss the Wconstruction for the Freyd cover. Finally, in Section 7 it is shown how these categorical constructions are not only analogous to but explicitly related to MartinLof type theory. 2 Pretoposes and dependent products
Wellfounded Trees and Dependent Polynomial Functors
 OF LECTURE NOTES IN COMPUTER SCIENCE
, 2004
"... We set out to study the consequences of the assumption of types of wellfounded trees in dependent type theories. We do so by investigating the categorical notion of wellfounded tree introduced in [16]. Our main result shows that wellfounded trees allow us to define initial algebras for a wide class ..."
Abstract

Cited by 44 (6 self)
 Add to MetaCart
We set out to study the consequences of the assumption of types of wellfounded trees in dependent type theories. We do so by investigating the categorical notion of wellfounded tree introduced in [16]. Our main result shows that wellfounded trees allow us to define initial algebras for a wide class of endofunctors on locally cartesian closed categories.
Propositions as [Types]
, 2001
"... Image factorizations in regular categories are stable under pullbacks, so they model a natural modal operator in dependent type theory. This unary type constructor [A] has turned up previously in a syntactic form as a way of erasing computational content, and formalizing a notion of proof irrelevanc ..."
Abstract

Cited by 38 (3 self)
 Add to MetaCart
(Show Context)
Image factorizations in regular categories are stable under pullbacks, so they model a natural modal operator in dependent type theory. This unary type constructor [A] has turned up previously in a syntactic form as a way of erasing computational content, and formalizing a notion of proof irrelevance. Indeed, semantically, the notion of a support is sometimes used as surrogate proposition asserting inhabitation of an indexed family. We give rules for bracket types in dependent type theory and provide complete semantics using regular categories. We show that dependent type theory with the unit type, strong extensional equality types, strong dependent sums, and bracket types is the internal type theory of regular categories, in the same way that the usual dependent type theory with dependent sums and products is the internal type theory of locally cartesian closed categories. We also show how to interpret rstorder logic in type theory with brackets, and we make use of the translation to compare type theory with logic. Specically, we show that the propositionsastypes interpretation is complete with respect to a certain fragment of intuitionistic rstorder logic. As a consequence, a modied doublenegation translation into type theory (without bracket types) is complete for all of classical rstorder logic.
Implicit and noncomputational arguments using monads
, 2005
"... Abstract. We provide a monadic view on implicit and noncomputational arguments. This allows us to treat Berger’s noncomputational quantifiers in the Coqsystem. We use Tait’s normalization proof and the concatenation of vectors as case studies for the extraction of programs. With little effort one ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
(Show Context)
Abstract. We provide a monadic view on implicit and noncomputational arguments. This allows us to treat Berger’s noncomputational quantifiers in the Coqsystem. We use Tait’s normalization proof and the concatenation of vectors as case studies for the extraction of programs. With little effort one can eliminate noncomputational arguments from extracted programs. One thus obtains extracted code that is not only closer to the intended one, but also decreases both the running time and the memory usage dramatically. We also study the connection between Harrop formulas, lax modal logic and the Coq type theory.
Why topology in the minimalist foundation must be pointfree
, 2013
"... We give arguments explaining why, when adopting a minimalist approach to constructive mathematics as that formalized in our twolevel minimalist foundation, the choice for a pointfree approach to topology is not just a matter of convenience or mathematical elegance, but becomes compulsory. The main ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We give arguments explaining why, when adopting a minimalist approach to constructive mathematics as that formalized in our twolevel minimalist foundation, the choice for a pointfree approach to topology is not just a matter of convenience or mathematical elegance, but becomes compulsory. The main reason is that in our foundation real numbers, either as Dedekind cuts or as Cauchy sequences, do not form a set.
Semisimplicial Types in Logicenriched Homotopy Type Theory
"... The problem of defining SemiSimplicial Types (SSTs) in Homotopy Type Theory (HoTT) has been recognized as important during the Year of Univalent Foundations at the Institute of Advanced Study [14]. According to the interpretation of HoTT in Quillen model categories [5], SSTs are typetheoretic ver ..."
Abstract
 Add to MetaCart
The problem of defining SemiSimplicial Types (SSTs) in Homotopy Type Theory (HoTT) has been recognized as important during the Year of Univalent Foundations at the Institute of Advanced Study [14]. According to the interpretation of HoTT in Quillen model categories [5], SSTs are typetheoretic versions of Reedy fibrant semisimplicial objects in a model category and simplicial and semisimplicial objects play a crucial role in many constructions in homotopy theory and higher category theory. Attempts to define SSTs in HoTT lead to some difficulties such as the need of infinitary assumptions which are beyond HoTT with only nonstrict equality types. Voevodsky proposed a definition of SSTs in Homotopy Type System (HTS) [26], an extension of HoTT with nonfibrant types, including an extensional strict equality type. However, HTS doesn’t have the desirable computational properties such as decidability of type checking and strong normalization. In this paper, we study a logicenriched homotopy type theory, an alternative extension of HoTT with equational logic based on the idea of logicenriched type theories [1, 17]. In contrast to Voevodsky’s HTS, all types in our system are fibrant and it can be implemented in existing proof assistants. We show how SSTs can be defined in our system and outline an implementation in the proof assistant Plastic [8].
Published In Propositions as [Types]
, 2001
"... Image factorizations in regular categories are stable under pullbacks, so they model a natural modal operator in dependent type theory. This unary type constructor [A] has turned up previously in a syntactic form as a way of erasing computational content, and formalizing a notion of proof irrelev ..."
Abstract
 Add to MetaCart
(Show Context)
Image factorizations in regular categories are stable under pullbacks, so they model a natural modal operator in dependent type theory. This unary type constructor [A] has turned up previously in a syntactic form as a way of erasing computational content, and formalizing a notion of proof irrelevance. Indeed, semantically, the notion of a support is sometimes used as surrogate proposition asserting inhabitation of an indexed family. We give rules for bracket types in dependent type theory and provide complete semantics using regular categories. We show that dependent type theory with the unit type, strong extensional equality types, strong dependent sums, and bracket types is the internal type theory of regular categories, in the same way that the usual dependent type theory with dependent sums and products is the internal type theory of locally cartesian closed categories.