Professor Glynn Winskel

Fellow of Emmanuel College.

Formerly, Professor at the Computer Science Department, University of Aarhus and

Director of BRICS (centre for Basic Research in Computer Science). CV

PhD Students and former PhD students

Teaching

Mini-courses in theory. (Former mini-courses).

Lecture notes:

Notes for Topics in Concurrency a Part II Computer Science course at the University of Cambridge.

Notes for Denotational Semantics a Part II Computer Science course at the University of Cambridge.

Notes for Discrete Mathematics (cont): Set Theory for Computer Science a Part IA Computer Science course at the University of Cambridge. Seminars 1, Seminars 2, Seminars 3, Seminars 4.

`Lecture Notes on Category theory' jointly with Mario Caccamo inspired by Martin Hyland's Part III Mathematics course at the University of Cambridge. Available from Mario Caccamo's homepage.

Material for Fields Institute Summer School, June 2003.

Research grants

Domain Theory for Concurrency---New Categorical Foundations. EPSRC grant application, March 2004.

Publications

Ancient:

• PhD thesis: Events in Computation, 1980
  pdf.

• Event Structure Semantics for CCS and Related Languages.
  DAIMI Research Report, University of Aarhus, 67 pp., April 1983. Full version of ICALP'82 article.
  pdf, ps.

Recent:

• Name Generation and Linearity.
  Submitted, Jan 2005. pdf.

• Limit preservation from naturality. With Mario Caccamo.
  Accepted for CTCS'04, 2004. pdf.

• Probabilistic event structures and domains. With Daniele Varacca and Hagen Voelzer.
  CONCUR'04, 2004. pdf, ps. Full version submitted to TCS special issue.

• new-HOPLA: a higher-order process language with name generation. With Francesco Zappa Nardelli.
  Accepted for TCS@2004, Third IFIP International Conference on Theoretical Computer Science, 2004. pdf.

• Profunctors, Open Maps and Bisimulation. With Gian Luca Cattani.
  Accepted for MSCS, April 2004. ps.

• Domain Theory for Concurrency. With Mikkel Nygaard.
  Based on a talk given at the Copenhagen Workshop in Honour of Dana S. Scott's 70th birthday. Appears TCS special issue, May 2004. pdf, ps.

• Full Abstraction for HOPLA. With Mikkel Nygaard.
  CONCUR'03. pdf, ps.

• A Relational Model of Nondeterministic Dataflow. With Thomas Hildebrandt and Prakash Panangaden.
  Accepted for the journal MSCS, 2003. pdf.

• HOPLA---A Higher-Order Process Language. With Mikkel Nygaard.
  CONCUR'02. ps.

• Linearity in Process Languages. With Mikkel Nygaard.
  LICS'02. ps.

• Linearity and nonlinearity in distributed computation.
  To appear as an invited chapter in the Book on Linear Logic, CUP.
  pdf, ps.

• Composing Strand Spaces. With Federico Crazzolara.
  FSTTCS'02.
  pdf, ps.

• Events in Security Protocols. With Federico Crazzolara.
  In proc. the 8th ACM Conference on Computer and Communication Security, Philadelphia, November, 2001.
  pdf. In BRICS reports series RS-01-13 . Awarded the British Computer Society Brendan Murphy Memorial Prize 2002.

• A Higher-Order Calculus for Categories. With Mario Caccamo.
  In Boulton and Jackson, editors, Theorem Proving in Higher Order Logics: 14th International Conference, TPHOLs 2001 Proceedings, LNCS 2152, 2001, pages 136-153. Extended version in BRICS reports series RS-01-27

Other papers online

Partial list of publications from the DBLP Bibliography Server. A complete list of publications is included in CV.