Theoretical Computer Science, Volume 342

Volume 342, Number 1, 6 September 2005

• Eugenio Moggi:
  Applied semantics: Selected topics. 1-2
  
• Michael Abbott, Thorsten Altenkirch, Neil Ghani:
  Containers: Constructing strictly positive types. 3-27
  
• Mark R. Shinwell, Andrew M. Pitts:
  On a monadic semantics for freshness. 28-55
  
• David Cachera, Thomas P. Jensen, David Pichardie, Vlad Rusu:
  Extracting a data flow analyser in constructive logic. 56-78
  
• Sandra Alves, Mário Florido:
  Weak linearization of the lambda calculus. 79-103
  
• Philippa Gardner, Sergio Maffeis:
  Modelling dynamic web data. 104-131
  
• James Laird:
  Locally Boolean domains. 132-148
  
• Mads Sig Ager, Olivier Danvy, Jan Midtgaard:
  A functional correspondence between monadic evaluators and abstract machines for languages with computational effects. 149-172
  

Volume 342, Numbers 2-3, 7 September 2005

• Bruno Courcelle, Pascal Weil:
  The recognizability of sets of graphs is a robust property. 173-228
  
• Esfandiar Haghverdi, Paulo Tabuada, George J. Pappas:
  Bisimulation relations for dynamical, control, and hybrid systems. 229-261
  
• Frank J. Oles:
  Precedence-inclusion patterns and relational learning. 262-315
  

• Rance Cleaveland, S. Purushothaman Iyer, Murali Narasimha:
  Probabilistic temporal logics via the modal mu-calculus. 316-350
  
• Yann Loyer, Umberto Straccia:
  Any-world assumptions in logic programming. 351-381
  
• Christos Nomikos, Panos Rondogiannis, Manolis Gergatsoulis:
  Temporal stratification tests for linear and branching-time deductive databases. 382-415