15. WoLLIC 2008: Edinburgh, UK

Tutorials and Invited Lectures

• Olivier Danvy, Jacob Johannsen:
  Inter-deriving Semantic Artifacts for Object-Oriented Programming. 1-16
  
• Anuj Dawar:
  On the Descriptive Complexity of Linear Algebra. 17-25
  
• Samuel J. Lomonaco:
  Talks on Quantum Computing. 26-27
  
• Ilya Mezhirov, Nikolai K. Vereshchagin:
  On Game Semantics of the Affine and Intuitionistic Logics. 28-42
  
• Mark Steedman:
  The Grammar of Scope. 43
  

Contributed Papers

• Tamar Aizikowitz, Michael Kaminski:
  Conjunctive Grammars and Alternating Pushdown Automata. 44-55
  
• Carlos Areces, Diego Figueira, Santiago Figueira, Sergio Mera:
  Expressive Power and Decidability for Memory Logics. 56-68
  
• Ofer Arieli, Anna Zamansky:
  Reasoning with Uncertainty by Nmatrix-Metric Semantics. 69-82
  
• Mario R. F. Benevides, L. Menasché Schechter:
  A Propositional Dynamic Logic for CCS Programs. 83-97
  
• Alan Bundy, Michael Chan:
  Towards Ontology Evolution in Physics. 98-110
  
• Christophe Calvès, Maribel Fernández:
  Nominal Matching and Alpha-Equivalence. 111-122
  
• Graçaliz Pereira Dimuro, Benjamín C. Bedregal, Renata Hax Sander Reiser, Regivan H. Nunes Santiago:
  Interval Additive Generators of Interval T-Norms. 123-135
  
• Jan van Eijck, Yanjing Wang:
  Propositional Dynamic Logic as a Logic of Belief Revision. 136-148
  
• Amin Farjudian, Michal Konecný:
  Time Complexity and Convergence Analysis of Domain Theoretic Picard Method. 149-163
  
• Santiago Figueira, Daniel Gorín, Rafael Grimson:
  On the Formal Semantics of IF-Like Logics. 164-178
  
• Murdoch Gabbay, Dominic P. Mulligan:
  One-and-a-Halfth Order Terms: Curry-Howard and Incomplete Derivations. 179-193
  
• Didier Galmiche, Y. Salhi:
  Labelled Calculi for Lukasiewicz Logics. 194-207
  
• Edward A. Hirsch, Dmitry Itsykson:
  An Infinitely-Often One-Way Function Based on an Average-Case Assumption. 208-217
  
• Shingo Ibuka, Makoto Kikuchi, Hirotaka Kikyo:
  On Characteristic Constants of Theories Defined by Kolmogorov Complexity. 218-225
  
• Pascal Koiran, Jürgen Landes, Natacha Portier, Penghui Yao:
  Adversary Lower Bounds for Nonadaptive Quantum Algorithms. 226-237
  
• Juha Kontinen, Heribert Vollmer:
  On Second-Order Monadic Groupoidal Quantifiers. 238-248
  
• J. B. Paris, S. R. Rad:
  Inference Processes for Quantified Predicate Knowledge. 249-259
  
• Silvio do Lago Pereira, Leliane Nunes de Barros:
  Using alpha-ctl to Specify Complex Planning Goals. 260-271
  
• Carl Pollard:
  Hyperintensional Questions. 272-285
  
• Livio Robaldo:
  Skolem Theory and Generalized Quantifiers. 286-297
  
• Renata P. de Freitas, Paulo A. S. Veloso, Sheila R. M. Veloso, Jorge Petrúcio Viana:
  On a Graph Calculus for Algebras of Relations. 298-312