Basic Research in Computer Science (2004)
BibTeX
@MISC{Maps04basicresearch,
author = {Profunctors Open Maps and Gian Luca Cattani and Glynn Winskel and Copyright C and Gian Luca Cattani and Glynn Winskel and Gian Luca Cattani and Glynn Winskel},
title = {Basic Research in Computer Science},
year = {2004}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
This paper studies fundamental connections between profunctors (i.e., distributors, or bimodules), open maps and bisimulation. In particular, it proves that a colimit preserving functor between presheaf categories (corresponding to a profunctor) preserves open maps and open map bisimulation. Consequently, the composition of profunctors preserves open maps as 2-cells. A guiding idea is the view that profunctors, and colimit preserving functors, are linear maps in a model of classical linear logic. But profunctors, and colimit preserving functors, as linear maps, are too restrictive for many applications. This leads to a study of a range of pseudo-comonads and how non-linear maps in their co-Kleisli bicategories preserve open maps and bisimulation. The pseudo-comonads considered are based on finite colimit completion, "lifting", and indexed families.
