Conference Record of the 16th Annual Symposium on Principles of Programming Languages
POPL, 1989.

@proceedings{POPL-1989,
	acmid         = "75277",
	address       = "Austin, Texas, USA",
	isbn          = "0-89791-294-2",
	publisher     = "{ACM Press}",
	title         = "{Conference Record of the 16th Annual Symposium on Principles of Programming Languages}",
	year          = 1989,
}

Contents (30 items)

4 ×#type system
3 ×#logic programming
3 ×#performance
3 ×#polymorphism
2 ×#analysis
2 ×#calculus
2 ×#data flow
2 ×#dependence
2 ×#graph
2 ×#ml

POPL-1989-BaxterB #dependence #graph

The Program Dependence Graph and Vectorization (WB, HRBI), pp. 1–11.

POPL-1989-Selke #dependence #graph #semantics

A Rewriting Semantics for Program Dependence Graphs (RPS), pp. 12–24.

POPL-1989-CytronFRWZ #performance

An Efficient Method of Computing Static Single Assignment Form (RC, JF, BKR, MNW, FKZ), pp. 25–35.

POPL-1989-SagivEFR #analysis #attribute grammar #data flow

Resolving Circularity in Attribute Grammars with Applications to Data Flow Analysis (SS, OE, NF, MR), pp. 36–48.

POPL-1989-CooperK #alias #analysis #interprocedural #performance

Fast Interprocedural Alias Analysis (KDC, KK), pp. 49–59.

POPL-1989-WadlerB #ad hoc #how #morphism #polymorphism

How to Make ad-hoc Polymorphism Less ad-hoc (PW, SB), pp. 60–76.

POPL-1989-Remy #ml

Typechecking Records and Variants in a Natural Extension of ML (DR), pp. 77–88.

POPL-1989-Paulin-Mohring #calculus #proving #source code

Extracting Fω’s Programs from Proofs in the Calculus of Constructions (CPM), pp. 89–104.

POPL-1989-KanellakisM #ml #polymorphism #type system #unification

Polymorphic Unification and ML Typing (PCK, JCM), pp. 105–115.

POPL-1989-YelickZ #logic programming #type system

Moded Type Systems for Logic Programming (KAY, JLZ), pp. 116–124.

POPL-1989-Hickey #abstraction #constraints

CLP* and Constraint Abstraction (TJH), pp. 125–133.

POPL-1989-GaifmanS #composition #logic programming #semantics #source code

Fully Abstract Compositional Semantics for Logic Programs (HG, EYS), pp. 134–142.

POPL-1989-Thomsen #calculus #communication #higher-order

A Calculus of Higher Order Communicating Systems (BT), pp. 143–154.

POPL-1989-Jonsson #data flow #network

A Fully Abstract Trace Model for Dataflow Networks (BJ), pp. 155–165.

POPL-1989-EmersonSS #performance #reasoning

Efficient Temporal Reasoning (EAE, TS, JS), pp. 166–178.

POPL-1989-PnueliR #on the #synthesis

On the Synthesis of a Reactive Module (AP, RR), pp. 179–190.

POPL-1989-AttieE #concurrent #process #synthesis

Synthesis of Concurrent Systems with Many Similar Sequential Processes (PCA, EAE), pp. 191–201.

POPL-1989-CardelliDJKN #type system

The Modula-3 Type System (LC, JED, MJJ, BK, GN), pp. 202–212.

POPL-1989-AbadiCPP #dynamic typing #static typing #type system

Dynamic Typing in a Statically-Typed Language (MA, LC, BCP, GDP), pp. 213–227.

POPL-1989-Meseguer #modelling #morphism #polymorphism

Relating Models of Polymorphism (JM), pp. 228–241.

POPL-1989-Monteleone

Generalized Conjunctive Types (GM), pp. 242–249.

POPL-1989-DershowitzK

Rewrite, Rewrite, Rewrite, Rewrite, Rewrite (ND, SK), pp. 250–259.

POPL-1989-Parker #partial order #programming

Partial Order Programming (DSPJ), pp. 260–266.

POPL-1989-Baudinet #logic programming

Temporal Logic Programming is Complete and Expressive (MB), pp. 267–280.

POPL-1989-KelseyH #compilation #program transformation

Realistic Compilation by Program Transformation (RK, PH), pp. 281–292.

POPL-1989-AppelJ #continuation

Continuation-Passing, Closure-Passing Style (AWA, TJ), pp. 293–302.

POPL-1989-GopinathH #functional

Copy Elimination in Functional Languages (KG, JLH), pp. 303–314.

POPL-1989-PughT #incremental

Incremental Computation via Function Caching (WP, TT), pp. 315–328.

POPL-1989-Mosses #algebra

Unified Algebras and Modules (PDM), pp. 329–343.

POPL-1989-LarsenS #bisimulation #probability #testing

Bisimulation Through Probabilistic Testing (KGL, AS), pp. 344–352.