21. POPL 1994:
Portland,
Oregon
Conference Record of POPL'94:
21st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages,
Portland,
Oregon,
January 17-21,
1994. ACM Press,
New York,
1994,
ISBN 0-89791-636-0
- Amer Diwan, David Tarditi, J. Eliot B. Moss:
Memory Subsystem Performance of Programs Using Copying Garbage Collection.
1-14 BibTeX
- Norman Ramsey:
Correctness of Trap-Based Breakpoint Implementations.
15-24 BibTeX
- Hiralal Agrawal:
Dominators, Super Blocks, and Program Coverage.
25-34 BibTeX
- Jacques Garrigue, Hassan Aït-Kaci:
The Typed Polymorphic Label-Selective lambda-Calculus.
35-47 BibTeX
- Martin Odersky:
A Functional Theory of Local Names.
48-59 BibTeX
- Pierre Lescanne:
From Lambda-sigma to Lambda-upsilon a Journey Through Calculi of Explicit Substitutions.
60-69 BibTeX
- Damien Doligez, Georges Gonthier:
Portable, Unobtrusive Garbage Collection for Multiprocessor Systems.
70-83 BibTeX
- Hanne Riis Nielson, Flemming Nielson:
Higher-Order Concurrent Programs with Finite Communication Topology.
84-97 BibTeX
- Frank S. de Boer, Maurizio Gabbrielli, Elena Marchiori, Catuscia Palamidessi:
Proving Concurrent Constraint Programs Correct.
98-108 BibTeX
- Xavier Leroy:
Manifest Types, Modules, and Separate Compilation.
109-122 BibTeX
- Robert Harper, Mark Lillibridge:
A Type-Theoretic Approach to Higher-Order Modules with Sharing.
123-137 BibTeX
- Dinesh Katiyar, David C. Luckham, John C. Mitchell:
A Type System for Prototyping Languages.
138-150 BibTeX
- Giuseppe Castagna, Benjamin C. Pierce:
Decidable Bounded Quantification.
151-162 BibTeX
- Alexander Aiken, Edward L. Wimmers, T. K. Lakshman:
Soft Typing with Conditional Types.
163-173 BibTeX
- Satish Thatté:
Automated Synthesis of Interface Adapters for Reusable Classes.
174-187 BibTeX
- Mads Tofte, Jean-Pierre Talpin:
Implementation of the Typed Call-by-Value lambda-Calculus using a Stack of Regions.
188-201 BibTeX
- Chris Hankin, Daniel Le Métayer:
Deriving Algorithms From Type Inference Systems: Application to Strictness Analysis.
202-212 BibTeX
- Fritz Henglein, Jesper Jørgensen:
Formally Optimal Boxing.
213-226 BibTeX
- Agostino Cortesi, Baudouin Le Charlier, Pascal Van Hentenryck:
Combinations of Abstract Domains for Logic Programming.
227-239 BibTeX
- Kim Marriott, Maria J. García de la Banda, Manuel V. Hermenegildo:
Analyzing Logic Programs with Dynamic Scheduling.
240-253 BibTeX
- Zhenyu Qian:
Higher-Order Equational Logic Programming.
254-267 BibTeX
- Sergio Antoy, Rachid Echahed, Michael Hanus:
A Needed Narrowing Strategy.
268-279 BibTeX
- Todd A. Proebsting, Christopher W. Fraser:
Detecting Pipeline Structural Hazards Quickly.
280-286 BibTeX
- G. Ramalingam, Thomas W. Reps:
An Incremental Algorithm for Maintaining the Dominator Tree of a Reducible Flowgraph.
287-296 BibTeX
- Daniel Weise, Roger F. Crew, Michael D. Ernst, Bjarne Steensgaard:
Value Dependence Graphs: Representation without Taxation.
297-310 BibTeX
- Vadim Maslov:
Lazy Array Data-Flow Dependence Analysis.
311-325 BibTeX
- Rance Cleaveland, Daniel Yankelevich:
An Operational Framework for Value-Passing Processes.
326-338 BibTeX
- Bard Bloom:
CHOCOLATE: Calculi of Higher Order COmmunication and LAmbda TErms.
339-347 BibTeX
- Kohei Honda, Nobuko Yoshida:
Combinatory Representation of Mobile Processes.
348-360 BibTeX
- Jukka Paakki:
Multi-Pass Execution of Functional Logic Programs.
361-374 BibTeX
- John Boyland, Susan L. Graham:
Composing Tree Attributions.
375-388 BibTeX
- Robert Muller:
A Staging Calculus and its Application to the Verification of Translators.
389-396 BibTeX
- Brad Calder, Dirk Grunwald:
Reducing Indirect Function call Overhead in C++ Programs.
397-408 BibTeX
- Koenraad De Bosschere, Saumya K. Debray, David Gudeman, Sampath Kannan:
Call Forwarding: A Simple Interprocedural Optimization Technique for Dynamically Typed Languages.
409-420 BibTeX
- Lawrence Feigen, David Klappholz, Robert Casazza, Xing Xue:
The Revival Transformation.
421-434 BibTeX
- Mitchell Wand, Paul Steckler:
Selective and Lightweight Closure Conversion.
435-445 BibTeX
- Andrzej Filinski:
Representing Monads.
446-457 BibTeX
- John Hatcliff, Olivier Danvy:
A Generic Account of Continuation-Passing Styles.
458-471 BibTeX
- Guy L. Steele Jr.:
Building Interpreters by Composing Monads.
472-492 BibTeX
Copyright © Sat May 16 23:34:31 2009
by Michael Ley (ley@uni-trier.de)
