- Philipp Weis, Neil Immerman:
Structure Theorem and Strict Alternation Hierarchy for FO2 on Words. Log. Methods Comput. Sci. 5(3) (2009) - Sylvain Lebresne:
A Type System For Call-By-Name Exceptions. Log. Methods Comput. Sci. 5(4) (2009) - Colin Stirling:
Decidability of higher-order matching. Log. Methods Comput. Sci. 5(3) (2009) - Nikos Tzevelekos:
Full abstraction for nominal general references. Log. Methods Comput. Sci. 5(3) (2009) - Dexter Kozen, Nicholas Ruozzi:
Applications of Metric Coinduction. Log. Methods Comput. Sci. 5(3) (2009) - Dag Normann:
A rich hierarchy of functionals of finite types. Log. Methods Comput. Sci. 5(3) (2009) - Olivier Finkel:
The Complexity of Infinite Computations In Models of Set Theory. Log. Methods Comput. Sci. 5(4) (2009) - Jeroen Ketema, Jakob Grue Simonsen:
Infinitary Combinatory Reduction Systems: Confluence. Log. Methods Comput. Sci. 5(4) (2009) - Rob J. van Glabbeek, Bas Luttik, Nikola Trcka:
Computation Tree Logic with Deadlock Detection. Log. Methods Comput. Sci. 5(4) (2009) - Guillaume Bonfante, Yves Guiraud:
Programs as polygraphs: computability and complexity. 5(2) (2009)