Foundations of Software Science and Computation Structures

1. Front Matter

   Pages I-XV

   PDF

2. Semantics

   1. Front Matter

      Pages 1-1

      PDF

   2. Non-angelic Concurrent Game Semantics

      • Simon Castellan, Pierre Clairambault, Jonathan Hayman, Glynn Winskel

      Pages 3-19Open Access

      PDF

   3. A Trace Semantics for System F Parametric Polymorphism

      • Guilhem Jaber, Nikos Tzevelekos

      Pages 20-38Open Access

      PDF

   4. Categorical Combinatorics for Non Deterministic Strategies on Simple Games

      • Clément Jacq, Paul-André Melliès

      Pages 39-70Open Access

      PDF

   5. A Syntactic View of Computational Adequacy

      • Marco Devesas Campos, Paul Blain Levy

      Pages 71-87Open Access

      PDF

3. Linearity

   1. Front Matter

      Pages 89-89

      PDF

   2. A New Linear Logic for Deadlock-Free Session-Typed Processes

      • Ornela Dardha, Simon J. Gay

      Pages 91-109Open Access

      PDF

   3. A Double Category Theoretic Analysis of Graded Linear Exponential Comonads

      • Shin-ya Katsumata

      Pages 110-127Open Access

      PDF

   4. Depending on Session-Typed Processes

      • Bernardo Toninho, Nobuko Yoshida

      Pages 128-145Open Access

      PDF

   5. Fabous Interoperability for ML and a Linear Language

      • Gabriel Scherer, Max New, Nick Rioux, Amal Ahmed

      Pages 146-162Open Access

      PDF

4. Concurrency

   1. Front Matter

      Pages 163-163

      PDF

   2. Automata for True Concurrency Properties

      • Paolo Baldan, Tommaso Padoan

      Pages 165-182Open Access

      PDF

   3. A Theory of Encodings and Expressiveness (Extended Abstract)

      • Rob van Glabbeek

      Pages 183-202Open Access

      PDF

   4. A Framework for Parameterized Monitorability

      • Luca Aceto, Antonis Achilleos, Adrian Francalanza, Anna Ingólfsdóttir

      Pages 203-220Open Access

      PDF

   5. Logics for Bisimulation and Divergence

      • Xinxin Liu, Tingting Yu, Wenhui Zhang

      Pages 221-237Open Access

      PDF

5. Lambda-Calculi and Types

   1. Front Matter

      Pages 239-239

      PDF

   2. Call-by-Need, Neededness and All That

      • Delia Kesner, Alejandro Ríos, Andrés Viso

      Pages 241-257Open Access

      PDF

   3. Fitch-Style Modal Lambda Calculi

      • Ranald Clouston

      Pages 258-275Open Access

      PDF

   4. Realizability Interpretation and Normalization of Typed Call-by-Need \(\lambda \)-calculus with Control

      • Étienne Miquey, Hugo Herbelin

      Pages 276-292Open Access

      PDF

This book constitutes the proceedings of the 21st International Conference on Foundations of Software Science and Computational Structures, FOSSACS 2018, which took place in Thessaloniki, Greece, in April 2018, held as part of the European Joint Conference on Theory and Practice of Software, ETAPS 2018.
The 31 papers presented in this volume were carefully reviewed and selected from 103 submissions. The papers are organized in topical sections named: semantics; linearity; concurrency; lambda-calculi and types; category theory and quantum control; quantitative models; logics and equational theories; and graphs and automata.

• artificial intelligence
• computer software selection and evaluation
• formal logic
• graph theory
• modal logic
• petri nets
• program compilers
• programming language
• semantics
• separation logic
• software engineering
• theorem proving
• type systems
• verification

• TU Dresden , Dresden, Germany

  Christel Baier

• Università di Bologna, Bologna, Italy

  Ugo Dal Lago

Policies and ethics