Paper #10: A Note on Elimination of Simplest Recursions Andrei P. Nemytykh (Wuhan University and PSI, Russian Academy of Science)

Paper #13: A New Type System for JVM Lock Primitives Futoshi Iwama (University of Tokyo) Naoki Kobayashi (Tokyo Institute of Technology)

Paper #16: Using Circular Programs to Deforest in Accumulating Parameters Janis Voigtlaender (Dresden University of Technology)

Paper #19: Using indexed data structures for program specialization Jung Gyu Park (Korea University) Myong-Soon Park (Korea University)

Paper #20: Principal Type Specialisation Pablo E. Martínez López (Universidad Nacional de La Plata) John Hughes (Chalmers University)

Paper #21: Search-Based Binding Time Analysis using Type-Directed Pruning Tim Sheard (Oregon Health & Science University) Nathan Linger (Oregon Health & Science University)

Paper #24: Supporting Objects in Run-time Bytecode Specialization Reynald Affeldt (University of Tokyo) Hidehiko Masuhara (University of Tokyo) Eijiro Sumii (University of Tokyo) Akinori Yonezawa (University of Tokyo)

Paper #25: Jones Optimality, Binding-Time Improvements, and the Strength of Program Spezializers Robert Glück (PRESTO, JST & Waseda University)

Paper #26: Output-Constraint Specialization Siau-Cheng Khoo (National University of Singapore) Kun Shi (National University of Singapore)

Paper #27: Compiling Real Time Functional Reactive Programming to Automata Dana N. Xu (National University of Singapore) Siau-Cheng Khoo (National University of Singapore)

Paper #28: On Obtaining the KMP String Matcher by Partial Evaluation Mads Sig Ager (University of Aarhus) Olivier Danvy (University of Aarhus) Henning Korsholm Rohde (University of Aarhus)