## Ron K. Cytron, Peter Lee

*Conference Record of the 22nd Symposium on Principles of Programming Languages*

POPL, 1995.

@proceedings{POPL-1995, acmid = "199448", address = "San Francisco, California, USA", editor = "Ron K. Cytron and Peter Lee", isbn = "0-89791-692-1", publisher = "{ACM Press}", title = "{Conference Record of the 22nd Symposium on Principles of Programming Languages}", year = 1995, }

### Contents (35 items)

- POPL-1995-RieckeV
- Isolating Side Effects in Sequential Languages (JGR, RV), pp. 1–12.
- POPL-1995-BrookesD #algorithm #parallel
- Sequential Algorithms, Deterministic Parallelism, and Intensional Expressiveness (SDB, DD), pp. 13–24.
- POPL-1995-Reynolds #category theory #using
- Using Functor Categories to Generate Intermediate Code (JCR), pp. 25–36.
- POPL-1995-DuesterwaldGS #data flow #interprocedural
- Demand-driven Computation of Interprocedural Data Flow (ED, RG, MLS), pp. 37–48.
- POPL-1995-RepsHS #analysis #data flow #graph #interprocedural #precise #reachability
- Precise Interprocedural Dataflow Analysis via Graph Reachability (TWR, SH, SS), pp. 49–61.
- POPL-1995-SreedharG #algorithm #linear
- A Linear Time Algorithm for Placing phi-nodes (VCS, GRG), pp. 62–73.
- POPL-1995-AltucherL #alias #analysis
- An Extended Form of Must Alias Analysis for Dynamic Allocation (RA, WL), pp. 74–84.
- POPL-1995-EmersonN #reasoning
- Reasoning about Rings (EAE, KSN), pp. 85–94.
- POPL-1995-BouajjaniEH #composition #infinity #parallel #process #verification
- Verifying Infinite State Processes with Sequential and Parallel Composition (AB, RE, PH), pp. 95–106.
- POPL-1995-Bloom #semantics #specification
- Structured Operational Semantics as a Specification Language (BB), pp. 107–117.
- POPL-1995-DuboisRW #morphism #polymorphism
- Generic Polymorphism (CD, FR, PW), pp. 118–129.
- POPL-1995-HarperM #analysis #compilation #morphism #polymorphism #using
- Compiling Polymorphism Using Intensional Type Analysis (RH, JGM), pp. 130–141.
- POPL-1995-Leroy #higher-order
- Applicative Functors and Fully Transparent Higher-Order Modules (XL), pp. 142–153.
- POPL-1995-Biswas #higher-order
- Higher-Order Functors with Transparent Signatures (SKB), pp. 154–163.
- POPL-1995-Vorobyov #bound #decidability #quantifier
- Structural Decidable Extensions of Bounded Quantification (SGV), pp. 164–175.
- POPL-1995-HoangM #bound #type inference #type system
- Lower Bounds on Type Inference with Subtypes (MH, JCM), pp. 176–185.
- POPL-1995-HofmannP #type system
- Positive Subtyping (MH, BCP), pp. 186–197.
- POPL-1995-Mackie #geometry #interactive
- The Geometry of Interaction Machine (IM), pp. 198–208.
- POPL-1995-FlanaganF #optimisation #semantics
- The Semantics of Future and Its Use in Program Optimizations (CF, MF), pp. 209–220.
- POPL-1995-Sands #correctness #program transformation
- Total Correctness by Local Improvement in Program Transformation (DS), pp. 221–232.
- POPL-1995-AriolaFMOW #call-by #λ-calculus
- The Call-by-Need λ Calculus (ZMA, MF, JM, MO, PW), pp. 233–246.
- POPL-1995-DawsonRRSSSW #execution #logic programming #performance #source code #unification
- Unification Factoring for Efficient Execution of Logic Programs (SD, CRR, IVR, KFS, SS, TS, DSW), pp. 247–258.
- POPL-1995-SchauserCG #algorithm #clustering #constraints #source code #strict #thread
- Separation Constraint Partitioning — A New Algorithm for Partitioning Non-strict Programs into Sequential Threads (KES, DEC, SCG), pp. 259–271.
- POPL-1995-SaraswatJG #concurrent #constraints #programming
- Default Timed Concurrent Constraint Programming (VAS, RJ, VG), pp. 272–285.
- POPL-1995-Cardelli #distributed
- A Language with Distributed Scope (LC), pp. 286–297.
- POPL-1995-BaileyD #formal method
- A Formal Model of Procedure Calling Conventions (MWB, JWD), pp. 298–310.
- POPL-1995-PlevyakZC #concurrent #object-oriented #performance
- Obtaining Sequential Efficiency for Concurrent Object-Oriented Languages (JP, XZ, AAC), pp. 311–321.
- POPL-1995-Proebsting #c #interpreter #optimisation
- Optimizing an ANSI C Interpreter with Superoperators (TAP), pp. 322–332.
- POPL-1995-LiangHJ #composition #monad
- Monad Transformers and Modular Interpreters (SL, PH, MPJ), pp. 333–343.
- POPL-1995-KingL #algorithm #haskell
- Structuring Depth-First Search Algorithms in Haskell (DJK, JL), pp. 344–354.
- POPL-1995-SansomJ #functional #higher-order #profiling #strict
- Time and Space Profiling for Non-Strict Higher-Order Functional Languages (PMS, SLPJ), pp. 355–366.
- POPL-1995-PalsbergO #analysis #type system
- A Type System Equivalent to Flow Analysis (JP, PO), pp. 367–378.
- POPL-1995-FieldRT #parametricity #slicing
- Parametric Program Slicing (JF, GR, FT), pp. 379–392.
- POPL-1995-JagannathanW #analysis #higher-order
- A Unified Treatment of Flow Analysis in Higher-Order Languages (SJ, SW), pp. 393–407.
- POPL-1995-CastagnaP #bound #decidability #named #quantifier
- Corrigendum: Decidable Bounded Quantification (GC, BCP), p. 408.

5 ×#analysis

4 ×#algorithm

4 ×#higher-order

3 ×#bound

3 ×#type system

2 ×#composition

2 ×#concurrent

2 ×#constraints

2 ×#data flow

2 ×#decidability

4 ×#algorithm

4 ×#higher-order

3 ×#bound

3 ×#type system

2 ×#composition

2 ×#concurrent

2 ×#constraints

2 ×#data flow

2 ×#decidability