A Higher-Order Calculus for Categories

A calculus for a fragment of category theory is presented. The types in the language denote categories and the expressions functors. The judgements of the calculus systematise categorical arguments such as: an expression is functorial in its free variables; two expressions are naturally isomorphic in their free variables. There are special binders for limits and more general ends. The rules for limits and ends support an algebraic manipulation of universal constructions as opposed to a more traditional diagrammatic approach. Duality within the calculus and applications in proving continuity are discussed with examples. The calculus gives a basis for mechanising a theory of categories in a generic theorem prover like Isabelle.

[1]  Rod M. Burstall,et al.  Computational category theory , 1988, Prentice Hall International Series in Computer Science.

[2]  Michael Barr,et al.  Category theory for computing science , 1995, Prentice Hall International Series in Computer Science.

[3]  Bengt Nordström,et al.  Programming in Martin-Lo¨f's type theory: an introduction , 1990 .

[4]  Bengt Nordström,et al.  Programming in Martin-Löf's Type Theory , 1990 .

[5]  Giuseppe Longo,et al.  Categories, types and structures - an introduction to category theory for the working computer scientist , 1991, Foundations of computing.

[6]  Dov M. Gabbay,et al.  Handbook of logic in computer science. Volume 2. Background: Computational structures , 1993, LICS 1993.

[7]  Glynn Winskel,et al.  Bisimulation and open maps , 1993, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science.

[8]  Roy L. Crole,et al.  Categories for Types , 1994, Cambridge mathematical textbooks.

[9]  R. Pollack.  The Theory of LEGO A Proof Checker for the Extended Calculus of Constructions , 1994 .

[10]  Lawrence Charles Paulson,et al.  Isabelle: A Generic Theorem Prover , 1994 .

[11]  Michael Barr,et al.  Category theory for computing science (2. ed.) , 1995, Prentice Hall international series in computer science.

[12]  Makoto Takeyama.  Universal structure and a categorical framework for type theory , 1995 .

[13]  Peter Dybjer,et al.  Extracting a Proof of Coherence for Monoidal Categories from a Proof of Normalization for Monoids , 1995, TYPES.

[14]  Glynn Winskel,et al.  Presheaf Models for Concurrency , 1996, CSL.

[15]  Torben Braüner,et al.  An Axiomatic Approach to Adequacy , 1996 .

[16]  Tobias Nipkow,et al.  Isabelle HOL - The Tutorial , 2000 .

[17]  G. Winskel,et al.  A Higher-Order Calculus for Categories , 2001 .

[18]  Zoltán Ésik,et al.  Automata on Series-Parallel Biposets , 2001, Developments in Language Theory.

[19]  Olivier Danvy,et al.  Defunctionalization at work , 2001, PPDP '01.

[20]  Zoltán Ésik,et al.  The Equational Theory of Fixed Points with Applications to Generalized Language Theory , 2001, Developments in Language Theory.

[21]  Bernd Grobauer,et al.  Cost recurrences for DML programs , 2001, ICFP '01.

[22]  Jesper Nyholm Jensen,et al.  A Complete Axiomatization of Simulation for Regular CCS Expressions , 2001 .