Mini-courses in theory. (Former mini-courses).
Notes for Topics in Concurrency a Part II Computer Science course at the University of Cambridge.
Notes for Denotational Semantics (pdf, ps) a Part II Computer Science course at the University of Cambridge.
Notes for
Discrete Mathematics: Set Theory for Computer Science
(pdf )
a Part IA Computer Science course at the
University of Cambridge.
The notes are a corrected version of the handout; they
now have additional exercises on induction at the end of Ch 1 plus an
extra exercise on the Schroeder-Bernstein theorem at the end of Ch 3.
Exercises for
the seminars 2008:
Seminars 1,
Seminars 2,
Seminars 3,
Seminars 4.
Solutions courtesy of Dave Turner and Sam Staton:
Solutions 1,
Solutions 2,
Solutions 3
,
Solutions 4.
`Lecture Notes on Category theory' jointly with Mario Caccamo inspired by Martin Hyland's Part III Mathematics course at the University of Cambridge.
Material for Fields Institute Summer School, June 2003.
Domain Theory for Concurrency---New Categorical Foundations. EPSRC grant (1/7/05 - 30/6/08).
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.
Event Structures.
Advances in Petri Nets 1986. Springer
Lecture Notes in Computer Science 255, 1987.
pdf.
Symmetry and concurrency.
Invited talk for CALCO'07, May 2007. pdf.
Summarises 'Event
structures with symmetry' below.
Event structures with symmetry.
For Gordon
Plotkin Festschrift, ENTCS 172, February 2007.
pdf.
(Errors in the
'Applications' section 'Event types' of ENTCS 172 are corrected.)
Event structure spans for non-deterministic dataflow. With
Lucy Saunders-Evans.
EXPRESS'06, 2006. pdf.
Independence and concurrent separation logic. With
Jonathan Hayman.
LICS'06, 2006. pdf.
Relations in concurrency.
Invited talk,
LICS'05, 2005 (Revised). pdf.
Name generation and linearity.
LICS'05 (plus appendix), 2005. pdf.
Unfortunately this paper contains a serious error. We are working on its correction.
Distributing probability over nondeterminism. With Daniele Varacca.
Accepted MSCS, 2005. pdf.
Limit preservation from naturality. With Mario Caccamo.
CTCS'04, 2004. pdf.
Probabilistic event structures and domains. With Daniele Varacca and Hagen Voelzer.
CONCUR'04, 2004. pdf, ps.
Full version accepted for 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.
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.
Invited chapter in the book Linear Logic in Computer
Science, CUP.
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