Results 1 
8 of
8
The identity type weak factorisation system
 U.U.D.M. REPORT 2008:20
, 2008
"... ... theory T with axioms for identity types admits a nontrivial weak factorisation system. After characterising this weak factorisation system explicitly, we relate it to the homotopy theory of groupoids. ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
... theory T with axioms for identity types admits a nontrivial weak factorisation system. After characterising this weak factorisation system explicitly, we relate it to the homotopy theory of groupoids.
General structural operational semantics through categorical logic (Extended Abstract)
, 2008
"... Certain principles are fundamental to operational semantics, regardless of the languages or idioms involved. Such principles include rulebased definitions and proof techniques for congruence results. We formulate these principles in the general context of categorical logic. From this general formul ..."
Abstract

Cited by 7 (6 self)
 Add to MetaCart
Certain principles are fundamental to operational semantics, regardless of the languages or idioms involved. Such principles include rulebased definitions and proof techniques for congruence results. We formulate these principles in the general context of categorical logic. From this general formulation we recover precise results for particular language idioms by interpreting the logic in particular categories. For instance, results for firstorder calculi, such as CCS, arise from considering the general results in the category of sets. Results for languages involving substitution and name generation, such as the πcalculus, arise from considering the general results in categories of sheaves and group actions. As an extended example, we develop a tyft/tyxtlike rule format for open bisimulation in the πcalculus.
A minimalist twolevel foundation for constructive mathematics
, 811
"... We present a twolevel theory to formalize constructive mathematics as advocated in a previous paper with G. Sambin [MS05]. One level is given by an intensional type theory, called Minimal type theory. This theory extends the settheoretic version introduced in [MS05] with collections. The other lev ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
We present a twolevel theory to formalize constructive mathematics as advocated in a previous paper with G. Sambin [MS05]. One level is given by an intensional type theory, called Minimal type theory. This theory extends the settheoretic version introduced in [MS05] with collections. The other level is given by an extensional set theory that is interpreted in the first one by means of a quotient model. This twolevel theory has two main features: it is minimal among the most relevant foundations for constructive mathematics; it is constructive thanks to the way the extensional level is linked to the intensional one which fulfills the “proofsasprograms ” paradigm and acts as a programming language.
Quotients over Minimal Type Theory
"... Abstract. We consider an extensional version, called qmTT, of the intensional Minimal Type Theory mTT, introduced in a previous paper with G. Sambin, enriched with proofirrelevance of propositions and effective quotient sets. Then, by using the construction of total setoid à la Bishop we build a mo ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. We consider an extensional version, called qmTT, of the intensional Minimal Type Theory mTT, introduced in a previous paper with G. Sambin, enriched with proofirrelevance of propositions and effective quotient sets. Then, by using the construction of total setoid à la Bishop we build a model of qmTT over mTT. The design of an extensional type theory with quotients and its interpretation in mTT is a key technical step in order to build a two level system to serve as a minimal foundation for constructive mathematics as advocated in the mentioned paper about mTT.
Constructivist and Structuralist Foundations: Bishop’s and Lawvere’s Theories of Sets
, 2009
"... Bishop’s informal set theory is briefly discussed and compared to Lawvere’s Elementary Theory of the Category of Sets (ETCS). We then present a constructive and predicative version of ETCS, whose standard model is based on the constructive type theory of MartinLöf. The theory, CETCS, provides a str ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Bishop’s informal set theory is briefly discussed and compared to Lawvere’s Elementary Theory of the Category of Sets (ETCS). We then present a constructive and predicative version of ETCS, whose standard model is based on the constructive type theory of MartinLöf. The theory, CETCS, provides a structuralist foundation for constructive mathematics in the style of Bishop.
JOYAL’S ARITHMETIC UNIVERSE AS LISTARITHMETIC PRETOPOS
"... Abstract. We explain in detail why the notion of listarithmetic pretopos should be taken as the general categorical definition for the construction of arithmetic universes introduced by André Joyal to give a categorical proof of Gödel’s incompleteness results. We motivate this definition for three ..."
Abstract
 Add to MetaCart
Abstract. We explain in detail why the notion of listarithmetic pretopos should be taken as the general categorical definition for the construction of arithmetic universes introduced by André Joyal to give a categorical proof of Gödel’s incompleteness results. We motivate this definition for three reasons: first, Joyal’s arithmetic universes are listarithmetic pretopoi; second, the initial arithmetic universe among Joyal’s constructions is equivalent to the initial listarithmetic pretopos; third, any listarithmetic pretopos enjoys the existence of free internal categories and diagrams as required to prove Gödel’s incompleteness. In doing our proofs we make an extensive use of the internal type theory of the categorical structures involved in Joyal’s constructions. The definition of listarithmetic pretopos is equivalent to the general one that I came to know in a recent talk by André Joyal. 1.
TYPES, SETS AND CATEGORIES
"... This essay is an attempt to sketch the evolution of type theory from its beginnings early in the last century to the present day. Central to the development of the type concept has been its close relationship with set theory to begin with and later its even more intimate relationship with category t ..."
Abstract
 Add to MetaCart
This essay is an attempt to sketch the evolution of type theory from its beginnings early in the last century to the present day. Central to the development of the type concept has been its close relationship with set theory to begin with and later its even more intimate relationship with category theory. Since it is effectively impossible to describe these relationships (especially in regard to the latter) with any pretensions to completeness within the space of a comparatively short article, I have elected to offer detailed technical presentations of just a few important instances. 1 THE ORIGINS OF TYPE THEORY The roots of type theory lie in set theory, to be precise, in Bertrand Russell’s efforts to resolve the paradoxes besetting set theory at the end of the 19 th century. In analyzing these paradoxes Russell had come to find the set, or class, concept itself philosophically perplexing, and the theory of types can be seen as the outcome of his struggle to resolve these perplexities. But at first he seems to have regarded type theory as little more than a faute de mieux.