Logical Methods in Computer Science

1.	Are there Hilbert-style Pure Type Systems?
	Martin W. Bunder and Wil J.M. Dekkers


2.	Lambda-RBAC: Programming with Role-Based Access Control
	Radha Jagadeesan, Alan Jeffrey, Corin Pitcher and James Riely


3.	Call-by-value Termination in the Untyped λ-calculus
	Neil D. Jones and Nina Bohr


4.	Generative Unbinding of Names
	Andrew M. Pitts and Mark R. Shinwell


5.	Lower Bounds for Complementation of omega-Automata Via the Full Automata Technique
	Qiqi Yan


6.	Independence and concurrent separation logic
	Jonathan Mark Hayman and Glynn Winskel


7.	Algebraic Pattern Matching in Join Calculus
	Qin Ma and Luc Maranget


8.	An Application of the Feferman-Vaught Theorem to Automata and Logics for Words over an Infinite Alphabet
	Alexis Bès


9.	Normalisation Control in Deep Inference via Atomic Flows
	Alessio Guglielmi and Tom Gundersen