Robert M. Graham, Michael A. Harrison, John C. Reynolds
Conference Record of the Second Symposium on Principles of Programming Languages
POPL, 1975.

@proceedings{POPL-1975,
	acmid         = "512976",
	address       = "Palo Alto, California, USA",
	editor        = "Robert M. Graham and Michael A. Harrison and John C. Reynolds",
	publisher     = "{ACM Press}",
	title         = "{Conference Record of the Second Symposium on Principles of Programming Languages}",
	year          = 1975,
}

Contents (22 items)

3 ×#algebra
2 ×#analysis
2 ×#complexity
2 ×#data type
2 ×#on the
2 ×#semantics

POPL-1975-FongKU #algebra #optimisation

Application of Lattice Algebra to Loop Optimization (ACF, JBK, JDU), pp. 1–9.

POPL-1975-Kennedy #analysis #data flow

Node Listings Applied to Data Flow Analysis (KK), pp. 10–21.

POPL-1975-GrahamW #algorithm #analysis #linear #performance

A Fast and Usually Linear Algorithm for Global Flow Analysis (SLG, MNW), pp. 22–34.

POPL-1975-Schwartz #automation #data type

Automatic Data Structure Choice in a Language of Very High Level (JTS), pp. 36–40.

POPL-1975-Ligler #approach #design

A Mathematical Approach to Language Design (GTL), pp. 41–53.

POPL-1975-Gerhart #program transformation

Correctness-Preserving Program Transformations (SLG), pp. 54–66.

POPL-1975-GreifH #semantics

Actor Semantics of Planner-73 (IG, CH), pp. 67–77.

POPL-1975-Lipton #named #process #proving #reduction

Reduction: A New Method of Proving Properties of Systems of Processes (RJL), pp. 78–86.

POPL-1975-Cohen #parallel #scheduling #semantics

A Semantic Model for Parallel Systems with Scheduling (ESC), pp. 87–94.

POPL-1975-LauerC #petri net

A Description of Path Expressions by Petri Nets (PEL, RHC), pp. 95–105.

POPL-1975-JonesM #source code

Even Simple Programs are Hard to Analyze (NDJ, SSM), pp. 106–118.

POPL-1975-JazayeriOR #attribute grammar #complexity #on the

On the Complexity of the Circularity Test for Attribute Grammars (MJ, WFO, WCR), pp. 119–129.

POPL-1975-HuntSU #complexity #lr #on the #testing

On the Complexity of LR(k) Testing (HBHI, TGS, JDU), pp. 130–136.

POPL-1975-Naur #natural language #programming language

Programming Languages, Natural Languages, and Mathematics (PN), pp. 137–148.

POPL-1975-Solomon

Modes, Values, and Expressions (MHS), pp. 149–159.

POPL-1975-CookO #data type

An Assertion Language for Data Structures (SAC, DCO), pp. 160–166.

POPL-1975-Stewart #algebra #string

An Algebraic Model for String Patterns (GFS), pp. 167–184.

POPL-1975-Lester #concurrent #execution

Program Schemas with Concurrency: Execution Time and Hangups (BPL), pp. 185–193.

POPL-1975-Symes

New Control Structures to Aid Gotolessness (DMS), pp. 194–203.

POPL-1975-Goodenough #exception

Structured Exception Handling (JBG), pp. 204–224.

POPL-1975-HallHT #algebra

An Algebra of Relations for Machine Computation (PAVH, PH, ST), pp. 225–232.

POPL-1975-Mikelsons

Computer Assisted Application Definition (MM), pp. 233–242.