POPL 1995

35 papers

1. A Formal Model of Procedure Calling Conventions · Mark W. Bailey, Jack W. Davidson
2. A Language with Distributed Scope · Luca Cardelli
3. A Linear Time Algorithm for Placing phi-nodes · Vugranam C. Sreedhar, Guang R. Gao
4. A Type System Equivalent to Flow Analysis · Jens Palsberg, Patrick O'Keefe
5. A Unified Treatment of Flow Analysis in Higher-Order Languages · Suresh Jagannathan, Stephen Weeks
6. An Extended Form of Must Alias Analysis for Dynamic Allocation · Rita Z. Altucher, William Landi
7. Applicative Functors and Fully Transparent Higher-Order Modules · Xavier Leroy
8. Compiling Polymorphism Using Intensional Type Analysis · Robert Harper, J. Gregory Morrisett
9. Corrigendum: Decidable Bounded Quantification · Giuseppe Castagna, Benjamin C. Pierce
10. Default Timed Concurrent Constraint Programming · Vijay A. Saraswat, Radha Jagadeesan, Vineet Gupta
11. Demand-driven Computation of Interprocedural Data Flow · Evelyn Duesterwald, Rajiv Gupta, Mary Lou Soffa
12. Generic Polymorphism · Catherine Dubois, François Rouaix, Pierre Weis
13. Higher-Order Functors with Transparent Signatures · Sandip K. Biswas
14. Isolating Side Effects in Sequential Languages · Jon G. Riecke, Ramesh Viswanathan
15. Lower Bounds on Type Inference with Subtypes · My Hoang, John C. Mitchell
16. Monad Transformers and Modular Interpreters · Sheng Liang, Paul Hudak, Mark P. Jones
17. Obtaining Sequential Efficiency for Concurrent Object-Oriented Languages · John Plevyak, Xingbin Zhang, Andrew A. Chien
18. Optimizing an ANSI C Interpreter with Superoperators · Todd A. Proebsting
19. Parametric Program Slicing · John Field, G. Ramalingam, Frank Tip
20. Positive Subtyping · Martin Hofmann, Benjamin C. Pierce
21. Precise Interprocedural Dataflow Analysis via Graph Reachability · Thomas W. Reps, Susan Horwitz, Shmuel Sagiv
22. Reasoning about Rings · E. Allen Emerson, Kedar S. Namjoshi
23. Separation Constraint Partitioning - A New Algorithm for Partitioning Non-strict Programs into Sequential Threads · Klaus E. Schauser, David E. Culler, Seth Copen Goldstein
24. Sequential Algorithms, Deterministic Parallelism, and Intensional Expressiveness · Stephen D. Brookes, Denis Dancanet
25. Structural Decidable Extensions of Bounded Quantification · Sergei G. Vorobyov
26. Structured Operational Semantics as a Specification Language · Bard Bloom
27. Structuring Depth-First Search Algorithms in Haskell · David J. King, John Launchbury
28. The Call-by-Need Lambda Calculus · Zena M. Ariola, Matthias Felleisen, John Maraist, Martin Odersky, Philip Wadler
29. The Geometry of Interaction Machine · Ian Mackie
30. The Semantics of Future and Its Use in Program Optimizations · Cormac Flanagan, Matthias Felleisen
31. Time and Space Profiling for Non-Strict Higher-Order Functional Languages · Patrick M. Sansom, Simon L. Peyton Jones
32. Total Correctness by Local Improvement in Program Transformation · David Sands
33. Unification Factoring for Efficient Execution of Logic Programs · Steven Dawson, C. R. Ramakrishnan, I. V. Ramakrishnan, Konstantinos Sagonas, Steven Skiena, Terrance Swift + 1 more
34. Using Functor Categories to Generate Intermediate Code · John C. Reynolds
35. Verifying Infinite State Processes with Sequential and Parallel Composition · Ahmed Bouajjani, Rachid Echahed, Peter Habermehl