Results 1 
3 of
3
Type Theory via Exact Categories (Extended Abstract)
 In Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science LICS '98
, 1998
"... Partial equivalence relations (and categories of these) are a standard tool in semantics of type theories and programming languages, since they often provide a cartesian closed category with extended definability. Using the theory of exact categories, we give a categorytheoretic explanation of why ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
Partial equivalence relations (and categories of these) are a standard tool in semantics of type theories and programming languages, since they often provide a cartesian closed category with extended definability. Using the theory of exact categories, we give a categorytheoretic explanation of why the construction of a category of partial equivalence relations often produces a cartesian closed category. We show how several familiar examples of categories of partial equivalence relations fit into the general framework. 1 Introduction Partial equivalence relations (and categories of these) are a standard tool in semantics of programming languages, see e.g. [2, 5, 7, 9, 15, 17, 20, 22, 35] and [6, 29] for extensive surveys. They are usefully applied to give proofs of correctness and adequacy since they often provide a cartesian closed category with additional properties. Take for instance a partial equivalence relation on the set of natural numbers: a binary relation R ` N\ThetaN on th...
Constructive Natural Deduction And Its "omegaSet" Interpretation
, 1990
"... . Various Theories of Types are introduced, by stressing the analogy "propositionsas types" : from propositional to higher order types (and Logic). In accordance with this, proofs are described as terms of various calculi, in particular of polymorphic (second order) l calculus. A semantic explana ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
. Various Theories of Types are introduced, by stressing the analogy "propositionsas types" : from propositional to higher order types (and Logic). In accordance with this, proofs are described as terms of various calculi, in particular of polymorphic (second order) l calculus. A semantic explanation is then given by interpreting individual types and the collection of all types in two simple categories built out of the natural numbers (the modest sets and the universe of wsets). The first part of this paper (syntax) may be viewed as a short tutorial with a constructive understanding of the deduction theorem and some work on the expressive power of first and second order quantification. Also in the second part (semantics, .67) the presentation is meant to be elementary, even though we introduce some new facts on types as quotient sets in order to interpret "explicit polymorphism". (The experienced reader in Type Theory may directly go, at first reading, to .678). Content. Remark...
Reflections On Formalism And Reductionism In Logic And Computer Science
"... This report contains a preprint (paper 1) and a reprint (paper 2). The first develops some epistemological views which were hinted in the second, in particular by stressing the need of a greater role of geometric insight and images in foundational studies and in approaches to cognition. The second p ..."
Abstract
 Add to MetaCart
This report contains a preprint (paper 1) and a reprint (paper 2). The first develops some epistemological views which were hinted in the second, in particular by stressing the need of a greater role of geometric insight and images in foundational studies and in approaches to cognition. The second paper is the "philosophical" part of a lecture in Type Theory, whose technical sections, omitted here, have been largely subsumed by subsequent publications (see references). The part reprinted below discusses more closely some historical remarks recalled in paper 1. 1. Reflections on formalism and reductionism in Logic and Computer Science (pp. 1  9)