Mathematical Structures in Computer Science, Volume 26

Volume 26, Number 1, January 2016

Introduction

• 
  Thorsten Altenkirch, Conor McBride:
  Selected papers from Dependently Typed Programming 2010 - Overview. 1-2

Paper

• 
  Benedikt Ahrens:
  Modules over relative monads for syntax and semantics. 3-37
• 
  Ana Bove, Alexander Krauss, Matthieu Sozeau:
  Partiality and recursion in interactive theorem provers - an overview. 38-88
• 
  Neil Ghani, Peter Hancock:
  Containers, monads and induction recursion. 89-113
• 
  Cezar Ionescu:
  Vulnerability modelling with functional programming and dependent types. 114-128
• 
  Karim Kanso, Anton Setzer:
  A light-weight integration of automated and interactive theorem proving. 129-153

Volume 26, Number 2, February 2016

Editorial Preface

• 
  Simon J. Gay, António Ravara:
  Preface to special issue: behavioural types. 154-155

Paper

• 
  Sara Capecchi, Elena Giachino, Nobuko Yoshida:
  Global escape in multiparty sessions. 156-205
• 
  Marco Giunti, Vasco Thudichum Vasconcelos:
  Linearity, session types and the Pi calculus. 206-237
• 
  Mario Coppo, Mariangiola Dezani-Ciancaglini, Nobuko Yoshida, Luca Padovani:
  Global progress for dynamically interleaved multiparty sessions. 238-302
• 
  Dimitrios Kouzapas, Nobuko Yoshida, Raymond Hu, Kohei Honda:
  On asynchronous eventful session semantics. 303-364

Volume 26, Number 3, March 2016

Editorial Preface

• 
  Simon J. Gay, António Ravara:
  Preface to special issue: behavioural types. 365-366

Paper

• 
  Luís Caires, Frank Pfenning, Bernardo Toninho:
  Linear logic propositions as session types. 367-423
• 
  Luca Padovani:
  Fair subtyping for multi-party session types. 424-464
• 
  Matthew A. Goto, Radha Jagadeesan, Alan Jeffrey, Corin Pitcher, James Riely:
  An extensible approach to session polymorphism. 465-509
• 
  Giovanni Tito Bernardi, Matthew Hennessy:
  Modelling session types using contracts. 510-560
• 
  Erika Ábrahám, Thi Mai Thuong Tran, Martin Steffen:
  Observable interface behaviour and inheritance. 561-605

Volume 26, Number 4, May 2016

Paper

• 
  Clément Aubert, Thomas Seiller:
  Characterizing co-NL by a group action. 606-638
• 
  Daniele Gorla, Uwe Nestmann:
  Full abstraction for expressiveness: history, myths and facts. 639-654
• 
  Joachim Parrow:
  General conditions for full abstraction. 655-657
• 
  Roberto Giacobazzi, Isabella Mastroeni:
  Making abstract models complete. 658-701
• 
  Paul Ruet:
  Local cycles and dynamical properties of Boolean networks. 702-718

Volume 26, Number 5, June 2016

Paper

• 
  Max I. Kanovich:
  The undecidability theorem for the Horn-like fragment of linear logic (Revisited). 719-744
• 
  Razvan Diaconescu, Alexandre Madeira:
  Encoding hybridized institutions into first-order logic. 745-788
• 
  Willem Heijltjes, Lutz Straßburger:
  Proof nets and semi-star-autonomous categories. 789-828
• 
  Marco Gaboardi, Luca Paolini, Mauro Piccolo:
  On the reification of semantic linearity. 829-867
• 
  Yuxin Deng, Robert J. Simmons, Iliano Cervesato:
  Relating reasoning methodologies in linear logic and process algebra. 868-906

Volume 26, Number 6, September 2016

Editorial Preface

• 
  Sibylle B. Fröschle, Frank D. Valencia:
  Preface to special issue: EXPRESS 2010. 907

Paper

• 
  Konstantinos Chatzikokolakis, Catuscia Palamidessi, Christelle Braun:
  Compositional methods for information-hiding. 908-932
• 
  Jos C. M. Baeten, Bas Luttik, Tim Muller, Paul van Tilburg:
  Expressiveness modulo bisimilarity of regular expressions with parallel composition. 933-968
• 
  Ugo Dal Lago, Simone Martini, Davide Sangiorgi:
  Light logics and higher-order processes. 969-992
• 
  Diego Figueira, Piotr Hofman, Slawomir Lasota:
  Relating timed and register automata. 993-1021
• 
  Gavin Lowe:
  Models for CSP with availability information. 1022-1053
• 
  Kirstin Peters, Uwe Nestmann:
  Breaking symmetries. 1054-1106

Volume 26, Number 7, October 2016

Paper

• 
  Margherita Zorzi:
  On quantum lambda calculi: a foundational perspective. 1107-1195
• 
  Sylvie Boldo, Catherine Lelay, Guillaume Melquiond:
  Formalization of real analysis: a survey of proof assistants and libraries. 1196-1233
• 
  Filippo Bonchi, Marcello M. Bonsangue, Georgiana Caltais, Jan Rutten, Alexandra Silva:
  A coalgebraic view on decorated traces. 1234-1268
• 
  Mauricio Guillermo, Alexandre Miquel:
  Specifying Peirce's law in classical realizability. 1269-1303
• 
  Sylvain Salvati, Igor Walukiewicz:
  Simply typed fixpoint calculus and collapsible pushdown automata. 1304-1350

Volume 26, Number 8, December 2016

Editorial Preface

• 
  Bas Luttik, Frank D. Valencia:
  Preface to special issue: EXPRESS 2011. 1351

Paper

• 
  Sara Capecchi, Ilaria Castellani, Mariangiola Dezani-Ciancaglini:
  Information flow safety in multiparty sessions. 1352-1394
• 
  Ioana Cristescu, Daniel Hirschkoff:
  Termination in a π-calculus with subtyping. 1395-1432
• 
  Ugo Dal Lago, Paolo Di Giamberardino:
  On session types and polynomial time. 1433-1458
• 
  Kirstin Peters, Jens-Wolfhard Schicke-Uffmann, Ursula Goltz, Uwe Nestmann:
  Synchrony versus causality in distributed systems. 1459-1498