| ACM SIGPLAN ASIA-PEPM 2002, Asian Symposium on Partial Evaluation and Semantics-Based Program ManipulationAizu, JapanSeptember 12-14, 2002 ProgramYoshihiko Futamura, Zenjiro Konishi and Robert Glück"Automatic generation of efficient string matching algorithms by generalized partial computation" ACM Digital LibraryRobert Glück "Jones optimality, binding-time improvements, and the strength of program specializers" ACM Digital LibraryTim Sheard and Nathan Linger "Search-based binding time analysis using type-directed pruning" ACM Digital LibraryMads Sig Ager, Olivier Danvy and Henning Korsholm Rohde "On obtaining Knuth, Morris, and Pratt's string matcher by partial evaluation" ACM Digital LibraryNevin Heintze "Aliasing analysis for a million lines of C" ACM Digital LibraryReynald Affeldt, Hidehiko Masuhara, Eijiro Sumii and Akinori Yonezawa "Supporting objects in run-time bytecode specialization" ACM Digital LibraryJung Gyu Park and Myong-Soon Park "Using indexed data structures for program specialization" ACM Digital LibrarySaman P. Amarasinghe "Defying the speed of light: a spatially-aware compiler for wire-exposed architectures" ACM Digital LibraryFutoshi Iwama and Naoki Kobayashi "A new type system for JVM lock primitives" ACM Digital LibraryDana N. Xu and Siau-Cheng Khoo "Compiling real time functional reactive programming" ACM Digital LibraryPablo E. Martínez López and John Hughes "Principal type specialisation" ACM Digital LibrarySiau-Cheng Khoo and Kun Shi "Output-constraint specialization" ACM Digital LibraryHongwei Xi "Unifying object-oriented programming with typed functional programming" ACM Digital LibraryJanis Voigtländer "Using circular programs to deforest in accumulating parameters" ACM Digital LibraryAndrei P. Nemytykh "A note on elimination of simplest recursions" ACM Digital Library
Last modified: Sunday, January 22nd, 2006 5:40:14pm HTML generated using WebIt!. |