default search action
ASIA-PEPM 2002: Aizu, Japan
- Kenichi Asai, Wei-Ngan Chin:
Proceedings of the ACM SIGPLAN ASIA-PEPM 2002, Asian Symposium on Partial Evaluation and Semantics-Based Program Manipulation, Aizu, Japan, September 12-14, 2002. ACM 2002, ISBN 1-58113-458-4
Sponsored by ACM SIGPLAN, supported by The University of Aizu.
- Yoshihiko Futamura, Zenjiro Konishi, Robert Glück:
Automatic generation of efficient string matching algorithms by generalized partial computation. 1-8 - Robert Glück:
Jones optimality, binding-time improvements, and the strength of program specializers. 9-19 - Tim Sheard, Nathan Linger:
Search-based binding time analysis using type-directed pruning. 20-31 - Mads Sig Ager, Olivier Danvy, Henning Korsholm Rohde:
On obtaining Knuth, Morris, and Pratt's string matcher by partial evaluation. 32-46 - Nevin Heintze:
Aliasing analysis for a million lines of C. 47-49 - Reynald Affeldt, Hidehiko Masuhara, Eijiro Sumii, Akinori Yonezawa:
Supporting objects in run-time bytecode specialization. 50-60 - Jung Gyu Park, Myong-Soon Park:
Using indexed data structures for program specialization. 61-69 - Saman P. Amarasinghe:
Defying the speed of light: : a spatially-aware compiler for wire-exposed architectures. 70 - Futoshi Iwama, Naoki Kobayashi:
A new type system for JVM lock primitives. 71-82 - Dana N. Xu, Siau-Cheng Khoo:
Compiling real time functional reactive programming. 83-93 - Pablo E. Martínez López, John Hughes:
Principal type specialisation. 94-105 - Siau-Cheng Khoo, Kun Shi:
Output-constraint specialization. 106-116 - Hongwei Xi:
Unifying object-oriented programming with typed functional programming. 117-125 - Janis Voigtländer:
Using circular programs to deforest in accumulating parameters. 126-137 - Andrei P. Nemytykh:
A note on elimination of simplest recursions. 138-146
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.