Mathematical Structures in Computer Science, Volume 16

Volume 16, Number 1, February 2006

• Davide Sangiorgi:
  Termination of processes. 1-39
  
• Adriana B. Compagnoni, Healfdene Goguen:
  Anti-symmetry of higher-order subtyping and equality by subtyping. 41-65
  
• Max I. Kanovich, Mitsuhiro Okada, Kazushige Terui:
  Intuitionistic phase semantics is almost classical. 67-86
  
• Daniele Varacca, Glynn Winskel:
  Distributing probability over non-determinism. 87-113
  
• Anna Di Concilio, Giangiacomo Gerla:
  Quasi-metric spaces and point-free geometry. 115-137
  

Volume 16, Number 2, April 2006

• Martín Hötzel Escardó, Achim Jung, Thomas Streicher:
  Preface. 139-140
  
• Ingo Battenfeld, Matthias Schröder, Alex Simpson:
  Compactly generated domain theory. 141-161
  
• Ulrich Berger, Paulo Oliva:
  Modified bar recursion. 163-183
  
• Chantal Berline:
  Graph models of lambda-calculus at work, and variations. 185-221
  
• Gary Gruenhage, Thomas Streicher:
  Quotients of countably based spaces are not closed under sobrification. 223-229
  
• Reinhold Heckmann:
  A Cartesian closed extension of the category of locales. 231-253
  
• Michael W. Mislove:
  Monoids over domains. 255-277
  
• Dag Normann:
  On sequential functionals of type 3. 279-289
  
• Jan Paseka:
  The strength of Engeler's lemma. 291-297
  
• Gordon D. Plotkin:
  A domain-theoretic Banach-Alaoglu theorem. 299-311
  
• Bernhard Reus, Jan Schwinghammer:
  Denotational semantics for a program logic of objects. 313-358
  
• Pawel Waszkiewicz:
  Partial metrisability of continuous posets. 359-372
  

Volume 16, Number 3, June 2006

• Peter Selinger:
  Special issue on quantum programming languages. 373-374
  
• Simon J. Gay, Rajagopal Nagarajan:
  Types and typechecking for Communicating Quantum Processes. 375-406
  
• Marie Lalire:
  Relations among quantum processes: bisimilarity and congruence. 407-428
  
• Ellie D'Hondt, Prakash Panangaden:
  Quantum weakest preconditions. 429-451
  
• Juliana Kaizer Vizzotto, Thorsten Altenkirch, Amr Sabry:
  Structuring quantum effects: superoperators as arrows. 453-468
  
• Samson Abramsky, Ross Duncan:
  A categorical quantum logic. 469-489
  
• Alexandru Baltag, Sonja Smets:
  LQP: the dynamic logic of quantum information. 491-525
  
• Peter Selinger, Benoît Valiron:
  A lambda calculus for quantum computation with classical control. 527-552
  

Volume 16, Number 4, August 2006

• Maribel Fernández, Ian Mackie:
  Developments in computational models: introduction. 553-555
  
• Jean-Pierre Banâtre, Pascal Fradet, Yann Radenac:
  Generalised multisets for chemical programming. 557-580
  
• Simon J. Gay:
  Quantum programming languages: survey and bibliography. 581-600
  
• Simon Perdrix, Philippe Jorrand:
  Classically controlled quantum computation. 601-620
  
• Alessandra Di Pierro, Chris Hankin, Herbert Wiklicky:
  Reversible combinatory logic. 621-637
  
• François-Régis Sinot:
  Call-by-need in token-passing nets. 639-666
  
• Daniel J. Dougherty, Pierre Lescanne, Luigi Liquori:
  Addressed term rewriting systems: application to a typed object calculus. 667-709
  
• Ugo Dal Lago, Patrick Baillot:
  On light logics, uniform encodings and polynomial time. 713-733
  

Volume 16, Number 5, October 2006

• S. Barry Cooper, Benedikt Löwe, Dag Normann:
  Mathematics of computing at CiE 2005. 735-736
  
• Andrew E. M. Lewis, George Barmpalias:
  Random reals and Lipschitz continuity. 737-749
  
• Ulrich Berger:
  Continuous semantics for strong normalisation. 751-762
  
• Douglas A. Cenzer, Jeffrey B. Remmel:
  On the complexity of inductive definitions. 763-788
  
• Rodney G. Downey, Wolfgang Merkle, Jan Reimann:
  Schnorr dimension. 789-811
  
• Olivier Finkel:
  Borel ranks and Wadge degrees of context free omega-languages. 813-840
  
• Carl G. Jockusch Jr., Angsheng Li:
  Restricted jump interpolation in the d.c.e. degrees. 841-865
  
• Peter Koepke, Martin Koerwien:
  Ordinal computations. 867-884
  
• Thierry Coquand, Henri Lombardi:
  A logical approach to abstract algebra. 885-900
  
• Ivan N. Soskov, Bogomil Kovachev:
  Uniform regular enumerations. 901-924
  
• Andreas Weiermann:
  An extremely sharp phase transition threshold for the slow growing hierarchy. 925-946
  

Volume 16, Number 6, December 2006

• Damiano Mazza:
  Linear logic and polynomial time. 947-988
  
• James J. Leifer, Robin Milner:
  Transition systems, link graphs and Petri nets. 989-1047
  
• Richard Blute, J. Robin B. Cockett, R. A. G. Seely:
  Differential categories. 1049-1083
  
• Jirí Adámek, Stefan Milius, Jiri Velebil:
  Iterative algebras at work. 1085-1131
  
• Hartmut Ehrig, Barbara König:
  Deriving bisimulation congruences in the DPO approach to graph rewriting with borrowed contexts. 1133-1163
  
• Erratum. 1165-1165
  

Last update Fri May 24 20:41:10 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page