Mathematical Structures in Computer Science, Volume 9

Volume 9, Number 1, February 1999

• Gordon D. Plotkin:
  Full abstraction, totality and PCF. 1-20
  
• Felix Cornelius, Michael Baldamus, Hartmut Ehrig, Fernando Orejas:
  Abstract and behaviour module specifications. 21-62
  
• Ferruccio Damiani, Mariangiola Dezani-Ciancaglini, Paola Giannini:
  A filter model for mobile processes. 63-101
  
• Jan von Plato:
  Order in open intervals of computable reals. 103-108
  
• Gilles Dowek:
  Collections, sets and types. 109-123
  

Volume 9, Number 2, April 1999

• Roy L. Crole, Andrew D. Gordon:
  Relating operational and denotational semantics for input/output effects. 125-158
  
• Vera Trnková, Jiri Velebil:
  On categories generalizing universal domains. 159-175
  
• Bernhard Reus, Thomas Streicher:
  General synthetic domain theory - a logical approach. 177-223
  

Volume 9, Number 3, June 1999

• Jean Paul Bahsoun, José Luiz Fiadeiro, Didier Galmiche:
  Foreword. 225-226
  
• Carlos H. C. Duarte:
  Proof-theoretic foundations for the design of actor systems. 227-252
  
• Giorgio Delzanno, Didier Galmiche, Maurizio Martelli:
  A specification logic for concurrent object-oriented programming. 253-286
  
• Joseph A. Goguen, Grant Malcolm:
  Hidden coinduction: behavioural correctness proofs for objects. 287-319
  

Volume 9, Number 4, August 1999

• Mariangiola Dezani-Ciancaglini, Giuseppe Longo, Jonathan P. Seldin:
  Preface. 321
  
• Thierry Coquand, Martin Hofmann:
  A new method for establishing conservativity of classical systems over their intuitionistic version. 323-333
  
• Herman Geuvers, Erik Barendsen:
  Some logical and syntactical observations concerning the first-order dependent type system lambda-P. 335-359
  
• Richard Statman:
  On the existence of n but not n + 1 easy combinators. 361-365
  
• Davide Sangiorgi:
  From lambda to pi; or, Rediscovering continuations. 367-401
  
• Furio Honsell, Marina Lenisa:
  Coinductive characterizations of applicative structures. 403-435
  
• Gérard Boudol, Pierre-Louis Curien, Carolina Lavatelli:
  A semantics for lambda calculi with resources. 437-482
  
• Inge Bethke, Jan Willem Klop, Roel C. de Vrijer:
  Extending partial combinatory algebras. 483-505
  
• Norman Danner, Daniel Leivant:
  Stratified polymorphism and primitive recursion. 507-522
  

Volume 9, Number 5, October 1999

• Abbas Edalat:
  Semi-pullbacks and bisimulation in categories of Markov processes. 523-543
  
• Lawrence C. Paulson:
  Final coalgebras as greatest fixed points in ZF set theory. 545-567
  
• Steven Vickers:
  Topical categories of domains. 569-616
  
• Alberto Pravato, Simona Ronchi Della Rocca, Luca Roversi:
  The call-by-value [lambda]-calculus: a semantic investigation. 617-650
  

Volume 9, Number 6, December 1999

• Jon G. Riecke, Ramesh Subrahmanyam:
  Conditions for the completeness of functional and algebraic equational reasoning. 651-685
  
• Stefano Kasangian, Anna Labella:
  Observational trees as models for concurrency. 687-718
  
• Venanzio Capretta, Silvio Valentini:
  A general method for proving the normalization theorem for first and second order typed lambda-calculi. 719-739
  

Last update Sat May 18 20:47:21 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page