default search action
31st MFPS 2015: Nijmegen, The Netherlands
- Dan R. Ghica:
The 31st Conference on the Mathematical Foundations of Programming Semantics, MFPS 2015, Nijmegen, The Netherlands, June 22-25, 2015. Electronic Notes in Theoretical Computer Science 319, Elsevier 2015 - Dan R. Ghica:
Preface. 1-2 - Pedro da Rocha Pinto, Thomas Dinsdale-Young, Philippa Gardner:
Steps in Modular Specifications for Concurrent Modules (Invited Tutorial Paper). 3-18 - Matija Pretnar:
An Introduction to Algebraic Effects and Handlers. Invited tutorial paper. 19-35 - Marc Bagnol:
Representation of Partial Traces. 37-49 - Harsh Beohar, Pieter J. L. Cuijpers:
Open Maps in Concrete Categories and Branching Bisimulation for Prefix Orders. 51-66 - Jean-Philippe Bernardy, Thierry Coquand, Guilhem Moulin:
A Presheaf Model of Parametric Type Theory. 67-82 - Ales Bizjak, Rasmus Ejlers Møgelberg:
A Model of Guarded Recursion With Clock Synchronisation. 83-101 - Taus Brock-Nannestad, Nicolas Guenot:
Focused Linear Logic and the λ-calculus. 103-119 - Apiwat Chantawibul, Pawel Sobocinski:
Towards Compositional Graph Theory. 121-136 - Vincent Danos, Ilias Garnier:
Dirichlet is Natural. 137-164 - Neil Ghani, Patricia Johann, Fredrik Nordvall Forsberg, Federico Orsanigo, Tim Revell:
Bifibrational Functorial Semantics of Parametric Polymorphism. 165-181 - Sergey Goncharov, Christoph Rauch, Lutz Schröder:
Unguarded Recursion on Coinductive Resumptions. 183-198 - Nils Jansen, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Federico Olmedo, Friedrich Gretz, Annabelle McIver:
Conditioning in Probabilistic Programming. 199-216 - Chris Heunen, Martti Karvonen:
Reversible Monadic Computing. 217-237 - Bart Jacobs, Bram Westerbaan:
An Effect-Theoretic Account of Lebesgue Integration. 239-253 - Klaus Keimel:
Healthiness Conditions for Predicate Transformers. 255-270 - James Laird:
Sequential Algorithms for Unbounded Nondeterminism. 271-287 - Kim G. Larsen, Radu Mardare, Bingtian Xue:
Alternation-Free Weighted Mu-Calculus: Decidability and Completeness. 289-313 - Dirk Pattinson, Lutz Schröder:
Sound and Complete Equational Reasoning over Comodels. 315-331 - Marco Paviotti, Rasmus Ejlers Møgelberg, Lars Birkedal:
A Model of PCF in Guarded Type Theory. 333-349 - Robert Rand, Steve Zdancewic:
VPHL: A Verified Partial-Correctness Logic for Probabilistic Programs. 351-367 - Mathys Rennela, Sam Staton:
Complete Positivity and Natural Representation of Quantum Computations. 369-385 - A. W. Roscoe:
The Expressiveness of CSP With Priority. 387-401 - Tarmo Uustalu:
Stateful Runners of Effectful Computations. 403-421
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.