POPL 1994

39 papers

1. A Functional Theory of Local Names · Martin Odersky
2. A Generic Account of Continuation-Passing Styles · John Hatcliff, Olivier Danvy
3. A Needed Narrowing Strategy · Sergio Antoy, Rachid Echahed, Michael Hanus
4. A Staging Calculus and its Application to the Verification of Translators · Robert Muller
5. A Type System for Prototyping Languages · Dinesh Katiyar, David C. Luckham, John C. Mitchell
6. A Type-Theoretic Approach to Higher-Order Modules with Sharing · Robert Harper, Mark Lillibridge
7. An Incremental Algorithm for Maintaining the Dominator Tree of a Reducible Flowgraph · G. Ramalingam, Thomas W. Reps
8. An Operational Framework for Value-Passing Processes · Rance Cleaveland, Daniel Yankelevich
9. Analyzing Logic Programs with Dynamic Scheduling · Kim Marriott, Maria J. García de la Banda, Manuel V. Hermenegildo
10. Automated Synthesis of Interface Adapters for Reusable Classes · Satish Thatté
11. Building Interpreters by Composing Monads · Guy L. Steele Jr.
12. CHOCOLATE: Calculi of Higher Order COmmunication and LAmbda TErms · Bard Bloom
13. Call Forwarding: A Simple Interprocedural Optimization Technique for Dynamically Typed Languages · Koenraad De Bosschere, Saumya K. Debray, David Gudeman, Sampath Kannan
14. Combinations of Abstract Domains for Logic Programming · Agostino Cortesi, Baudouin Le Charlier, Pascal Van Hentenryck
15. Combinatory Representation of Mobile Processes · Kohei Honda, Nobuko Yoshida
16. Composing Tree Attributions · John Boyland, Susan L. Graham
17. Correctness of Trap-Based Breakpoint Implementations · Norman Ramsey
18. Decidable Bounded Quantification · Giuseppe Castagna, Benjamin C. Pierce
19. Deriving Algorithms From Type Inference Systems: Application to Strictness Analysis · Chris Hankin, Daniel Le Métayer
20. Detecting Pipeline Structural Hazards Quickly · Todd A. Proebsting, Christopher W. Fraser
21. Dominators, Super Blocks, and Program Coverage · Hiralal Agrawal
22. Formally Optimal Boxing · Fritz Henglein, Jesper Jørgensen
23. From Lambda-sigma to Lambda-upsilon a Journey Through Calculi of Explicit Substitutions · Pierre Lescanne
24. Higher-Order Concurrent Programs with Finite Communication Topology · Hanne Riis Nielson, Flemming Nielson
25. Higher-Order Equational Logic Programming · Zhenyu Qian
26. Implementation of the Typed Call-by-Value lambda-Calculus using a Stack of Regions · Mads Tofte, Jean-Pierre Talpin
27. Lazy Array Data-Flow Dependence Analysis · Vadim Maslov
28. Manifest Types, Modules, and Separate Compilation · Xavier Leroy
29. Memory Subsystem Performance of Programs Using Copying Garbage Collection · Amer Diwan, David Tarditi, J. Eliot B. Moss
30. Multi-Pass Execution of Functional Logic Programs · Jukka Paakki
31. Portable, Unobtrusive Garbage Collection for Multiprocessor Systems · Damien Doligez, Georges Gonthier
32. Proving Concurrent Constraint Programs Correct · Frank S. de Boer, Maurizio Gabbrielli, Elena Marchiori, Catuscia Palamidessi
33. Reducing Indirect Function call Overhead in C++ Programs · Brad Calder, Dirk Grunwald
34. Representing Monads · Andrzej Filinski
35. Selective and Lightweight Closure Conversion · Mitchell Wand, Paul Steckler
36. Soft Typing with Conditional Types · Alexander Aiken, Edward L. Wimmers, T. K. Lakshman
37. The Revival Transformation · Lawrence Feigen, David Klappholz, Robert Casazza, Xing Xue
38. The Typed Polymorphic Label-Selective lambda-Calculus · Jacques Garrigue, Hassan Aït-Kaci
39. Value Dependence Graphs: Representation without Taxation · Daniel Weise, Roger F. Crew, Michael D. Ernst, Bjarne Steensgaard