ECSYM application material: Extended Synopsis;
Scientific Proposal.
ERC Evaluation Report.
Event structures with symmetry. Symmetry and concurrency. On the expressivity of symmetry in event structures. With Sam Staton. Event structure spans for non-deterministic dataflow. With
Lucy Saunders-Evans. Introduction to sequentiality.
.Affine sequential algorithms as spans, rough notes from July 2009. They were type-set to send to Martin Hyland and Pierre-Louis Curien.
The 'beliefs' there are now mostly established (jointly with intern Silvain Rideau from ENS-Paris); in particular sequential spans can be obtained from general spans. Affine sequential algorithms can be viewed as the basic games underlying game semantics. Silvain's current working notes---these are being extended with a new treatment of concurrent games.
Nominal Domain Theory for Concurrency. With David Turner.
new-HOPLA: a higher-order process language with name generation. With Francesco Zappa Nardelli.
Symmetry in Petri nets. With
Jonathan Hayman.
Bisimulation from Open Maps.
With Andre Joyal and Mogens Nielsen.
Weak Bisimulation and Open Maps.
With Marcelo P. Fiore and Gian Luca Cattani.
Independence and concurrent separation logic. With
Jonathan Hayman.
Distributing probability over nondeterminism. With Daniele Varacca.
Probabilistic event structures and domains. With Daniele Varacca and Hagen Voelzer.
Profunctors, Open Maps and Bisimulation. With Gian Luca Cattani.
The cartesian closed bicategory of generalised species of structures.With M. Fiore, N. Gambino and M. Hyland.
Limit preservation from naturality. With Mario Caccamo.
A Higher-Order Calculus for Categories.
With Mario Caccamo.
Events in Security Protocols. With Federico Crazzolara.
Linearity in Process Languages. With Mikkel Nygaard.
Handwritten notes on compression for biochemical pathways.
Relations in concurrency. Domain Theory for Concurrency. With Mikkel Nygaard. Event Structures.
Models for Concurrency.
With Mogens Nielsen.
Events, Causality and Symmetry. Martin Hyland. Some Reasons for Generalising Domain Theory. Event structures with symmetry and their expressivity:
For Gordon
Plotkin Festschrift, ENTCS 172, February 2007.
pdf.
(Errors especially in the
'Applications' section 'Event types' of ENTCS 172 are corrected.)
Invited talk for CALCO'07, May 2007. pdf.
Summarises 'Event
structures with symmetry' above.
The above three papers demonstrate the increased expressivity symmetry brings to event structures; the last paper enables the transfer of equivalences/techniques on presheaves
to event structures with symmetry.
To appear in LICS 2010.
pdf.
Stable spans:
EXPRESS'06, 2006. pdf.
Game semantics:
Handwritten slides explaining sequential algorithms for a course at Aarhus, 1994. In particular, they explain composition of sequential algorithms as a form of relational composition. A historical precursor to the presentation via spans. This early work was inspired by Francois Lamarche's work as was a similar result by P-L Curien.
pdf.
Name generation:
CSL 2009.
pdf.
Accepted for TCS@2004, Third IFIP International Conference on Theoretical Computer Science, 2004. pdf.
Petri nets:
Perspectives in Concurrency Theory,
K. Lodaya, M. Mukund and R. Ramanujam (eds)
Universities Press, 2008. pdf.
Equivalences:
In LICS '93 special issue of
Information and Computation, 127(2):164-185, June 1996.
In BRICS reports series
RS-94-7
The articles provide general methods for equivalences and equational reasoning, as does 'Profunctors, Open Maps and Bisimulation' below. The above LICS 2010 paper ''On the expressivity of event structures with symmetry'' provides methods to transfer the techniques to event structures with symmetry.
LICS '99.
In BRICS reports series
RS-99-14
Concurrent separation logic:
LICS'06, 2006. pdf.
Probability
MSCS, 2006. pdf.
CONCUR'04, 2004. pdf, ps.
Full version in TCS special issue, 2006.Presheaves and profunctors:
MSCS, 2005. ps.
Journal of the London Mathematical Society, 77 2, 203-220.
pdf.
CTCS'04, 2004. pdf.
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
Security protocols:
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.
Strong correspondence
Proofs of strong correspondence for affine HOPLA and HOPLA can be found in
and at my former PhD student's web page, see Mikkel Nygaard's publications.
LICS'02. ps.
Systems biology
The last page on strong compression has been revised - see pdf. A ''Prelude to notes on compression'', exploring and arguing for a broader graphical representation of biochemical systems - inspired by the kappa workshop in Barbados, March 2010 - is found in pdf.
Dec. 2009. pdf.
Relevant survey or general articles
Invited talk,
LICS'05, 2005 (Revised). pdf.
Based on a talk given at the Copenhagen Workshop in Honour of
Dana S. Scott's 70th birthday. TCS special issue, May
2004. pdf, ps.
Advances in Petri Nets 1986. Springer
Lecture Notes in Computer Science 255, 1987.
pdf.
Pre-published version of a chapter in the Handbook of Logic and the
Foundations of Computer Science, vol. 4, pages 1-148, Oxford
University Press, 1995.
In DAIMI and BRICS reports series
RS-94-12
An earlier version appeared in the BCS conference `Visions in Computer Science.' September 2008. The final version appears in a special issue of
The Computer Journal 2009; doi: 10.1093/comjnl/bxp052 .
pdf.
Mathematical Structures in Computer Science 20, 2010, 239-265. Available from Martin Hyland's home page .