Logical Methods in Computer Science

1.	A Theory of Explicit Substitutions with Safe and Full Composition
	Delia Kesner


2.	Decidability of higher-order matching
	Colin Stirling


3.	Lindström theorems for fragments of first-order logic
	Johan Van Benthem, Balder Ten Cate and Jouko Väänänen


4.	Structure Theorem and Strict Alternation Hierarchy for FO² on Words
	Philipp Weis and Neil Immerman


5.	Two-Way Unary Temporal Logic over Trees
	Mikołaj Bojańczyk


6.	RPO, Second-order Contexts, and Lambda-calculus
	Pietro Di Gianantonio, Furio Honsell and Marina Lenisa


7.	Relational Parametricity for Computational Effects
	Rasmus Ejlers Møgelberg and Alex Simpson


8.	Full abstraction for nominal general references
	Nikos Tzevelekos


9.	Representations of Stream Processors Using Nested Fixed Points
	Peter G Hancock, Neil Ghani and Dirk Pattinson


10.	Applications of Metric Coinduction
	Dexter Kozen and Nicholas Ruozzi


11.	A rich hierarchy of functionals of finite types
	Dag Normann