Computation, Meaning and Logic
Articles dedicated to Gordon Plotkin
Edited by
Luca Cardelli, Marcelo Fiore and Glynn Winskel
Electronic Notes in Theoretical Computer Science
Preface
Luca Cardelli, Marcelo Fiore and Glynn Winskel
Access control in a core calculus of dependency
Martin Abadi
Full completeness revisited
Samson Abramsky
A Convenient Category of Domains
Ingo Battenfeld, Matthias Schröder and Alex Simpson
Conformal field theory as a nuclear functor
Richard Blute, Prakash Panangaden and Dorette Pronk
Local reasoning about data update
Cristiano Calcagno, Philippa Gardner and Uri Zarfaty
Manipulating trees with hidden labels
Luca Cardelli, Philippa Gardner and Giorgio Ghelli
The bicategory-theoretic solution of recursive domain equations
Gian Luca Catani and Marcelo P. Fiore
Nominal Equational Logic
Ranald Clouston and Andrew Pitts
Syntactic logical relations for polymorphic and recursive types
Karl Crary and Robert Harper
Definability and full abstraction
Pierre-Louis Curien
Protocol composition logic (PCL)
Anupam Datta, Ante Derrick, John C. Mitchell and Arnab Roy
Remarks on testing probabilistic processes
Yuxin Deng, Rob van Glabbeek, Matthew Hennessy, Carroll Morgan and Chenyi Zhang
A Framework for Defining Logical Frameworks,
Furio Honsell, Marina Lenisa and Luigi Liquori
The Category Theoretic Understanding of Universal Algebra: Lawvere Theories and Monads
Martin Hyland and John Power
Labelled Markov Processes as Generalized Stochastic Relations
Michael Mislove, Dusko Pavlovic and James Worrell
Structuring Operational Semantics: Simplification and Computation
Eugenio Moggi
Event structures in formal models for computational trust
Mogens Nielsen, Karl Krukow and Vladimiro Sassone
Heuristics for safety and security constraints
Flemming Nielson and Hanne Riis Nielson
Systems Modelling via Resources and Processes: Philosophy, Calculus, Semantics, and Logic
David Pym and Chris Tofts
Model-Checking Games for Typed λ-Calculi
Colin Stirling
Event Structures with Symmetry
Glynn Winskel