Type Theory via Exact Categories (Extended Abstract)

Type Theory via Exact Categories (Extended Abstract) (1998)

Cached

Download Links

by L. Birkedal , A. Carboni , G. Rosolini , D. S. Scott

Venue:	In Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science LICS '98
Citations:	7 - 0 self

Versions

Version History

Metadata Version 3

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Type Theory via Exact Categories (Extended Abstract)	user correction - Legacy Corrections
AUTHOR NAME	L. Birkedal	SVM HeaderParse 0.1
AUTHOR AFFIL	School of Computer Science II Facolta di Scienze MFN DISI School of Computer Science; CMU Univ. di Milano Univ. di Genova CMU	SVM HeaderParse 0.2
AUTHOR ADDR	Pittsburgh, USA Como, Italy Genova, Italy Pittsburgh, USA	SVM HeaderParse 0.1
AUTHOR NAME	A. Carboni	SVM HeaderParse 0.1
AUTHOR AFFIL	School of Computer Science II Facolta di Scienze MFN DISI School of Computer Science; CMU Univ. di Milano Univ. di Genova CMU	SVM HeaderParse 0.2
AUTHOR ADDR	Pittsburgh, USA Como, Italy Genova, Italy Pittsburgh, USA	SVM HeaderParse 0.1
AUTHOR NAME	G. Rosolini	SVM HeaderParse 0.1
AUTHOR AFFIL	School of Computer Science II Facolta di Scienze MFN DISI School of Computer Science; CMU Univ. di Milano Univ. di Genova CMU	SVM HeaderParse 0.2
AUTHOR ADDR	Pittsburgh, USA Como, Italy Genova, Italy Pittsburgh, USA	SVM HeaderParse 0.1
AUTHOR NAME	D. S. Scott	SVM HeaderParse 0.1
AUTHOR AFFIL	School of Computer Science II Facolta di Scienze MFN DISI School of Computer Science; CMU Univ. di Milano Univ. di Genova CMU	SVM HeaderParse 0.2
AUTHOR ADDR	Pittsburgh, USA Como, Italy Genova, Italy Pittsburgh, USA	SVM HeaderParse 0.1
ABSTRACT	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 category-theoretic 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...	user correction - Legacy Corrections
YEAR	1998	INFERENCE
VENUE	In Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science LICS '98	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	188--198	INFERENCE
CITATIONS	42 found	ParsCit 1.0