5. POPL 1978:
Tucson,
Arizona
Conference Record of the Fifth Annual ACM Symposium on Principles of Programming Languages,
Tucson, Arizona, January 1978.
- Leonidas J. Guibas, Douglas K. Wyatt:
Compilation and Delayed Evaluation in APL.
1-8 BibTeX
- Daniel Ingalls:
The Smalltalk-76 Programming System.
9-16 BibTeX
- Edward A. Ashcroft, William W. Wadge:
Clauses: Scope Structures and Defined Functions in Lucid.
17-22 BibTeX
- Alan J. Demers, James E. Donahue, Glenn Skinner:
Data Types as Values: Polymorphism, Type-Checking, Encapsulation.
23-30 BibTeX
- Marvin H. Solomon:
Type Definitions with Parameters.
31-38 BibTeX
- John C. Reynolds:
Syntactic Control of Interference.
39-46 BibTeX
- Barry K. Rosen:
Monoids for Rapid Data Flow Analysis.
47-59 BibTeX
- Marc A. Kaplan, Jeffrey D. Ullman:
A General Scheme for the Automatic Inference of Variable Types.
60-75 BibTeX
- John H. Reif:
Symbolic Programming Analysis in Almost Linear Time.
76-83 BibTeX
- Patrick Cousot, Nicolas Halbwachs:
Automatic Discovery of Linear Restraints Among Variables of a Program.
84-96 BibTeX
- Stephen C. Johnson:
A Portable Compiler: Theory and Practice.
97-104 BibTeX
- Steven M. German:
Automating Proofs of the Absence of Common Runtime Errors.
105-118 BibTeX
- Michael J. C. Gordon, Robin Milner, L. Morris, Malcolm C. Newey, Christopher P. Wadsworth:
A Metalanguage for Interactive Proof in LCF.
119-130 BibTeX
- Robert Cartwright, Derek C. Oppen:
Unrestricted Procedure Calls in Hoare's Logic.
131-140 BibTeX
- Charles G. Nelson, Derek C. Oppen:
A Simplifier Based on Efficient Decision Algorithms.
141-150 BibTeX
- Derek C. Oppen:
Reasoning about Recursively Defined Data Structures.
151-157 BibTeX
- Peter J. Downey, Hanan Samet, Ravi Sethi:
Off-Line and On-Line Algorithms for Deducing Equalities.
158-170 BibTeX
- David W. Mizell:
Verification and Design Aspects of ``True'' Concurrency.
171-175 BibTeX
- Karel Culík:
Almost Control-Free (Indeterministic) Parallel Computation on Permit Schemes.
176-184 BibTeX
- William F. Ogden, William E. Riddle, William C. Rounds:
Complexity of Expressions Allowing Concurrency.
185-194 BibTeX
- Anders Haraldsson:
A Partial Evaluator, Its Use for Compiling Iterative Statements in Lisp.
195-202 BibTeX
- David Harel, Vaughan R. Pratt:
Nondeterminism in Logics of Programs.
203-213 BibTeX
- Paul R. Kosinki:
A Straightforward Denotational Semantics for Non-Determinant Data Flow Programs.
214-221 BibTeX
- Bhaskaram Prabhala, Ravi Sethi:
Efficient Computation of Expressions with Common Subexpressions.
222-230 BibTeX
- R. Steven Glanville, Susan L. Graham:
A New Method for Compiler Code Generation.
231-240 BibTeX
- Thomas J. Pennello, Frank DeRemer:
A Forward Move Algorithm for LR Error Recovery.
241-254 BibTeX
- Aravind K. Joshi, Leon S. Levy, Kang Yueh:
Local Constraints in the Syntax and Semantics of Programming Languages.
255-264 BibTeX
Copyright © Sat May 16 23:34:36 2009
by Michael Ley (ley@uni-trier.de)
