Reference. Profunctors, open maps and bisimulation [cattani-winskel-2005]

2005
Gian Luca Cattani, Glynn Winskel
Mathematical Structures in Computer Science
10.1017/S0960129505004718

@article{cattani-winskel-2005,
  author = {Cattani, Gian Luca and Winskel, Glynn},
  publisher = {Cambridge University Press},
  year = {2005},
  doi = {10.1017/S0960129505004718},
  journal = {Mathematical Structures in Computer Science},
  number = {3},
  pages = {553--614},
  title = {Profunctors, open maps and bisimulation},
  volume = {15},
}

Reference. Profunctors, open maps and bisimulation [cattani-winskel-2005]

Presentation. Baby steps in higher domain theory [00RN]

Slide. What is domain theory?

Slide. Domains for computer science

Slide. Recursion as passage to the (co)limit

Slide. Denotational semantics in domains

Slide. 2-dimensional domain theory for concurrency (I)

Slide. 2-dimensional domain theory for concurrency (II)

Slide. Towards $\infty$ -bicategories of domains

Slide. Simplicial homotopy type theory

Slide. Lifting and partial map classifiers

Slide. Right-handed universal property of partial map classifiers

Slide. Phoa’s principle in higher domain theory

Slide. The higher Phoa principle (Leoni Pugh)

Slide. The Phoa principle vs. synthetic quasicoherence

Slide. The partial map classifier of a synthetic ${\mathopen {}\left (\infty ,1\right )\mathclose {}}$ -category

Slide. Is the partial map classifier a Sierpiński cone? (I)

Slide. Is the partial map classifier a Sierpiński cone? (II)

Slide. Is the partial map classifier a Sierpiński cone? (III)

Slide. Is the partial map classifier a Sierpiński cone? (IV)

Slide. Is the partial map classifier a Sierpiński cone? (V) [012P]

Slide. Analytic vs. synthetic domain theory (I)

Slide. Analytic vs. synthetic domain theory (II)

Slide.

Slide. Analytic vs. synthetic domain theory (III)

Slide.

Journal. Mathematical Structures in Computer Science [mscs]