External Links

    Journal: Higher-Order and Symbolic Computation

    Volume 19, Issue 4

    343 -- 344Olivier Danvy, Andrzej Filinski, Jean-Louis Giavitto, Andy King, Pierre-Etienne Moreau, Carolyn L. Talcott. Editorial
    345 -- 376Clara Bertolissi, Horatiu Cirstea, Claude Kirchner. Expressing combinatory reduction systems derivations in the rewriting calculus
    377 -- 414Paul Blain Levy. Call-by-push-value: Decomposing call-by-value and call-by-name
    415 -- 463Patricia M. Hill, Fausto Spoto. Deriving escape analysis by abstract interpretation

    Volume 19, Issue 2-3

    167 -- 168Furio Honsell, Carolyn L. Talcott. Editorial
    169 -- 195Michael Norrish. Mechanising lambda-calculus using a classical first order theory of terms with permutations
    197 -- 230Jason Hickey, Aleksey Nogin. Formal compiler construction in a logical framework
    231 -- 262Makoto Hamana. An initial algebra approach to term rewriting systems with variable binders
    263 -- 282Neil Ghani, Tarmo Uustalu, Makoto Hamana. Explicit substitutions and higher-order syntax
    283 -- 304Fabio Gadducci, Marino Miculan, Ugo Montanari. About permutation algebras, (pre)sheaves and named sets
    305 -- 337Miki Tanaka, John Power. Pseudo-distributive laws and axiomatics for variable binding

    Volume 19, Issue 1

    5 -- 0Olivier Danvy, Oege de Moor, Julian A. Padget, Peter Thiemann. Editorial
    7 -- 30Matthieu Martel. Semantics of roundoff error propagation in finite precision calculations
    31 -- 100Antoine Miné. The octagon abstract domain
    101 -- 124V. Krishna Nandivada, Suresh Jagannathan. Dynamic state restoration using versioning exceptions
    125 -- 162François Pottier, Nadji Gauthier. Polymorphic typed defunctionalization and concretization
    runs on