Higher-Order and Symbolic Computation, 19(4)

The present issue is composed of three contributed articles.

In "Expressing Combinatory Reduction Systems Derivations in the Rewriting Calculus", Clara Bertolissi, Horatiu Cirstea and Claude Kirchner show the compatibility of the notions of reduction in Klop's Combinatory Reduction Systems and in the authors' rho-calculus. They then show that matching in a CRS is reducible to higher-order pattern matching in the lambda-calculus.

In "Call-by-push-value: decomposing call-by-value and call-by-name", Paul Blain Levy presents a metalanguage subsuming conventional call-by-value and call-by-name evaluation (with a PCF-like observation model) in the presence of computational effects. The metalanguage is given both a direct, stack-based operational interpretation, and a simple denotational model in terms of monad algebras.

In "Deriving escape analysis by abstract interpretation", Patricia M. Hill and Fausto Spoto present two successive program analyses as abstract interpretations of a given state-based semantics. They exhibit Galois insertions for these two analyses that make it possible to derive abstract semantic transformers that are optimal by construction, and implement the second analysis within the Java byte-code analysis framework JULIA.

Finally, we would like to heartily welcome four new associate editors: Philippe de Groote, Andy King, Oege de Moor, and Paola Quaglia. Like the other associate editors, they can both identify relevant papers and manage the reviewing process. This freedom and this responsability are parts of what makes HOSC both a scholarly and collegial forum.

We would also like to welcome Tetsuo Ida to the advisory board, and to express our condolences to the families of Gilles Kahn and Alain Deutsch. Both Gilles and Alain were affiliated with INRIA. Gilles served on the advisory board all the way back to the beginning of LISP and Symbolic Computation in 1988, and we used to consult Alain as a reviewer for HOSC.