22. POPL 1995: San Francisco, California

Conference Record of POPL'95: 22nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, San Francisco, California, January 23-25, 1995. ACM Press, New York, 1995, ISBN 0-89791-692-1

Held along with two workshops on January 22:
IR'95 Workshop on Intermediate Representations
SIPL'95 Workshop on State in Programming Languages

POPL 95 Server in Seattle

Session 1

Jon G. Riecke, Ramesh Viswanathan: Isolating Side Effects in Sequential Languages. 1-12
Stephen D. Brookes, Denis Dancanet: Sequential Algorithms, Deterministic Parallelism, and Intensional Expressiveness. 13-24
John C. Reynolds: Using Functor Categories to Generate Intermediate Code. 25-36

Session 2

Evelyn Duesterwald, Rajiv Gupta, Mary Lou Soffa: Demand-driven Computation of Interprocedural Data Flow. 37-48
Thomas W. Reps, Susan Horwitz, Shmuel Sagiv: Precise Interprocedural Dataflow Analysis via Graph Reachability. 49-61
Vugranam C. Sreedhar, Guang R. Gao: A Linear Time Algorithm for Placing phi-nodes. 62-73
Rita Altucher, William Landi: An Extended Form of Must Alias Analysis for Dynamic Allocation. 74-84

Session 3

E. Allen Emerson, Kedar S. Namjoshi: Reasoning about Rings. 85-94
Ahmed Bouajjani, Rachid Echahed, Peter Habermehl: Verifying Infinite State Processes with Sequential and Parallel Composition. 95-106
Bard Bloom: Structured Operational Semantics as a Specification Language. 107-117

Session 4

Catherine Dubois, François Rouaix, Pierre Weis: Generic Polymorphism. 118-129
Robert Harper, J. Gregory Morrisett: Compiling Polymorphism Using Intensional Type Analysis. 130-141
Xavier Leroy: Applicative Functors and Fully Transparent Higher-Order Modules. 142-153
Sandip K. Biswas: Higher-Order Functors with Transparent Signatures. 154-163

Session 5

Sergei G. Vorobyov: Structural Decidable Extensions of Bounded Quantification. 164-175
My Hoang, John C. Mitchell: Lower Bounds on Type Inference with Subtypes. 176-185
Martin Hofmann, Benjamin C. Pierce: Positive Subtyping. 186-197

Session 6

Ian Mackie: The Geometry of Interaction Machine. 198-208
Cormac Flanagan, Matthias Felleisen: The Semantics of Future and Its Use in Program Optimizations. 209-220
David Sands: Total Correctness by Local Improvement in Program Transformation. 221-232 , long version: ACM Trans. Program. Lang. Syst. 18(2): 175-234(1996)
Zena M. Ariola, Matthias Felleisen, John Maraist, Martin Odersky, Philip Wadler: The Call-by-Need Lambda Calculus. 233-246

Session 7

Steven Dawson, C. R. Ramakrishnan, I. V. Ramakrishnan, Konstantinos F. Sagonas, Steven Skiena, Terrance Swift, David Scott Warren: Unification Factoring for Efficient Execution of Logic Programs. 247-258
Klaus E. Schauser, David E. Culler, Seth Copen Goldstein: Separation Constraint Partitioning - A New Algorithm for Partitioning Non-strict Programs into Sequential Threads. 259-271
Vijay A. Saraswat, Radha Jagadeesan, Vineet Gupta: Default Timed Concurrent Constraint Programming. 272-285

Session 8

Luca Cardelli: A Language with Distributed Scope. 286-297
Mark W. Bailey, Jack W. Davidson: A Formal Model of Procedure Calling Conventions. 298-310
John Plevyak, Xingbin Zhang, Andrew A. Chien: Obtaining Sequential Efficiency for Concurrent Object-Oriented Languages. 311-321
Todd A. Proebsting: Optimizing an ANSI C Interpreter with Superoperators. 322-332

Session 9

Sheng Liang, Paul Hudak, Mark P. Jones: Monad Transformers and Modular Interpreters. 333-343
David J. King, John Launchbury: Structuring Depth-First Search Algorithms in Haskell. 344-354
Patrick M. Sansom, Simon L. Peyton Jones: Time and Space Profiling for Non-Strict Higher-Order Functional Languages. 355-366

Session 10

Jens Palsberg, Patrick O'Keefe: A Type System Equivalent to Flow Analysis. 367-378 , long version: TOPLAS 17(4): 576-599 (1995)
John Field, G. Ramalingam, Frank Tip: Parametric Program Slicing. 379-392
Suresh Jagannathan, Stephen Weeks: A Unified Treatment of Flow Analysis in Higher-Order Languages. 393-407

Corrigendum

Giuseppe Castagna, Benjamin C. Pierce: Corrigendum: Decidable Bounded Quantification. 408