David S. Wise
Conference Record of the 18th Annual Symposium on Principles of Programming Languages
POPL, 1991.

@proceedings{POPL-1991,
	acmid         = "99583",
	address       = "Orlando, Florida, USA",
	editor        = "David S. Wise",
	isbn          = "0-89791-419-8",
	publisher     = "{ACM Press}",
	title         = "{Conference Record of the 18th Annual Symposium on Principles of Programming Languages}",
	year          = 1991,
}

Contents (31 items)

3 ×#continuation
3 ×#type inference
3 ×#type system
3 ×#λ-calculus
2 ×#algebra
2 ×#analysis
2 ×#approach
2 ×#concurrent
2 ×#coordination
2 ×#graph

POPL-1991-SundareshH #compilation #incremental #partial evaluation

Incremental Compilation via Partial Evaluation (RSS, PH), pp. 1–13.

POPL-1991-ConselD #semantics

Static and Dynamic Semantics Processing (CC, OD), pp. 14–24.

POPL-1991-Odersky #how

How to Make Destructive Updates Less Destructive (MO), pp. 25–36.

POPL-1991-SekarMR #abstract interpretation #analysis #on the #strict

On the Power and Limitation of Strictness Analysis Based on Abstract Interpretation (RCS, PM, IVR), pp. 37–48.

POPL-1991-AbramskyJ #analysis #approach #higher-order #polymorphism #relational #strict

A Relational Approach to Strictness Analysis for Higher-Order Polymorphic Functions (SA, TPJ), pp. 49–54.

POPL-1991-ChoiCF #automation #data flow #evaluation #graph

Automatic Construction of Sparse Data Flow Evaluation Graphs (JDC, RC, JF), pp. 55–66.

POPL-1991-PingaliBJMS #algebra #approach #dependence #graph

Dependence Flow Graphs: An Algebraic Approach to Program Dependencies (KP, MB, RJ, MM, PS), pp. 67–78.

POPL-1991-PinterP #optimisation #parallel #using

Program Optimization and Parallelization Using Idioms (SSP, RYP), pp. 79–92.

POPL-1991-LandiR #alias #classification #pointer #problem

Pointer-Induced Aliasing: A Problem Classification (WL, BGR), pp. 93–103.

POPL-1991-AmadioC #recursion #type system

Subtyping Recursive Types (RMA, LC), pp. 104–118.

POPL-1991-HengleinM #complexity #higher-order #type inference #λ-calculus

The Complexity of Type Inference for Higher-Order Typed λ Calculi (FH, HGM), pp. 119–130.

POPL-1991-HarperP #calculus #symmetry

A Record Calculus Based on Symmetric Concatenation (RH, BCP), pp. 131–142.

POPL-1991-CaiP #array #quote

“Look Ma, No Hashing, And No Arrays Neither” (JC, RP), pp. 143–154.

POPL-1991-ClingerR #metaprogramming

Macros That Work (WDC, JR), pp. 155–162.

POPL-1991-DubaHM #continuation #ml #type system

Typing First-Class Continuations in ML (BFD, RH, DBM), pp. 163–173.

POPL-1991-QueinnecS #continuation

A Dynamic Extent Control Operator for Partial Continuations (CQ, BPS), pp. 174–184.

POPL-1991-SitaramF #continuation #modelling

Modeling Continuations without Continuations (DS, MF), pp. 185–196.

POPL-1991-LuccoS #coordination #parallel #programming

Parallel Programming With Coordination Structures (SL, OS), pp. 197–208.

POPL-1991-JoungS #coordination #first-order #interactive #multi

Coordinating First-Order Multiparty Interactions (YJJ, SAS), pp. 209–220.

POPL-1991-KleinmanMPS #communication #logic

Communication with Directed Logic Variables (AK, YM, AP, EYS), pp. 221–232.

POPL-1991-CrankF #λ-calculus

Parameter-Passing and the λ Calculus (EC, MF), pp. 233–244.

POPL-1991-Riecke #functional

Fully Abstract Translations between Functional Languages (JGR), pp. 245–254.

POPL-1991-Maranget #orthogonal #term rewriting #λ-calculus

Optimal Derivations in Weak λ-calculi and in Orthogonal Terms Rewriting Systems (LM), pp. 255–269.

POPL-1991-MitchellMM #inheritance #ml #standard #type system

An Extension of Standard ML Modules with Subtyping and Inheritance (JCM, SM, NM), pp. 270–278.

POPL-1991-AikenM #static typing #type inference

Static Type Inference in a Dynamically Typed Language (AA, BRM), pp. 279–290.

POPL-1991-LeroyW #polymorphism #type inference

Polymorphic Type Inference and Assignment (XL, PW), pp. 291–302.

POPL-1991-JouvelotG #algebra #re-engineering

Algebraic Reconstruction of Types and Effects (PJ, DKG), pp. 303–310.

POPL-1991-Pratt #concurrent #geometry #modelling

Modeling Concurrency with Geometry (VRP), pp. 311–322.

POPL-1991-AbadiP #composition #logic #refinement

A Logical View of Composition and Refinement (MA, GDP), pp. 323–332.

POPL-1991-SaraswatRP #concurrent #constraints #programming #semantics

Semantic Foundations of Concurrent Constraint Programming (VAS, MCR, PP), pp. 333–352.

POPL-1991-HenzingerMP #proving #realtime

Temporal Proof Methodologies for Real-time Systems (TAH, ZM, AP), pp. 353–366.