default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID21st MFPS 2005: Birmingham, UK
- Martín Hötzel Escardó, Achim Jung, Michael W. Mislove:
Proceedings of the 21st Annual Conference on Mathematical Foundations of Programming Semantics, MFPS 2005, Birmingham, UK, May 18-21, 2005. Electronic Notes in Theoretical Computer Science 155, Elsevier 2006 - Martín Hötzel Escardó
, Achim Jung, Michael W. Mislove:
Preface. 1-3 - Andrej Bauer:
First Steps in Synthetic Computability Theory. 5-31 - Catuscia Palamidessi:
Probabilistic and Nondeterministic Aspects of Anonymity. 33-42 - Cliff B. Jones:
An Approach to Splitting Atoms Safely: Extended Abstract. 43-60 - Luca Viganò:
Automated Security Protocol Analysis With the AVISPA Tool. 61-86 - Jirí Adámek, Stefan Milius, Jirí Velebil:
Elgot Algebras: (Extended Abstract). 87-109 - Michael Backes:
Real-or-random Key Secrecy of the Otway-Rees Protocol via a Symbolic Security Proof. 111-145 - Emmanuel Beffara:
A Concurrent Model for Linear Logic. 147-168 - Malgorzata Biernacka, Olivier Danvy, Kristian Støvring:
Program Extraction From Proofs of Weak Head Normalization. 169-189 - Lars Birkedal, Rasmus Ejlers Møgelberg, Rasmus Lerchedahl Petersen:
Parametric Domain-theoretic Models of Polymorphic Intuitionistic / Linear Lambda Calculus. 191-217 - Rasmus Ejlers Møgelberg, Lars Birkedal, Giuseppe Rosolini:
Synthetic Domain Theory and Models of Linear Abadi & Plotkin Logic. 219-245 - Richard Bornat, Cristiano Calcagno, Hongseok Yang:
Variables as Resource in Separation Logic. 247-276 - Stephen Brookes:
A Grainless Semantics for Parallel Programs with Shared Mutable Data. 277-307 - Peter Buchlovsky, Hayo Thielecke:
A Type-theoretic Reconstruction of the Visitor Pattern. 309-329 - Bob Coecke:
Strongly Compact Closed Semantics. 331-340 - Ewen Denney, John Power, Konstantinos Tourlas:
Hiproofs: A Hierarchical Notion of Proof Tree. 341-359 - Jeffrey M. Egger:
A Quillen Model Structure for Chu Spaces. 361-377 - Reinhold Heckmann:
Injective Convergence Spaces and Equilogical Spaces via Pretopological Spaces. 379-399 - Altaf Hussain, Michael Huth:
Automata Games for Multiple-model Checking. 401-421 - Klaus Keimel:
Topological Cones: Foundations for a Domain Theoretical Semantics Combining Probability and Nondeterminism. 423-443 - Søren B. Lassen:
Normal Form Simulation for McCarthy's Amb. 445-465 - Paul Blain Levy:
Infinite Trace Equivalence. 467-496 - Gavin Lowe, Joël Ouaknine:
On Timed Models and Full Abstraction. 497-519 - Yevgeniy Makarov:
Practical Program Extraction from Classical Proofs. 521-542 - Dale Miller, Alexis Saurin:
A Game Semantics for Proof Search: Preliminary Results. 543-563 - Abbas Edalat, Dirk Pattinson:
Domain Theoretic Solutions of Initial Value Problems for Unbounded Vector Fields. 565-581 - E. Kleiner, A. W. Roscoe:
On the Relationship Between Web Services Security and Traditional Protocols. 583-603 - Matthias Schröder, Alex Simpson:
Probabilistic Observations and Valuations: (Extended Abstract). 605-615 - Isar Stubbe:
Towards "Dynamic Domains": Totally Continuous Cocomplete Q-categories. 617-634
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.
last updated on 2025-11-14 22:41 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
