17. POPL 1990:
San Francisco,
California
Conference Record of the Seventeenth Annual ACM Symposium on Principles of Programming Languages,
San Francisco, California, January 1990.
- John Field:
On Laziness and Optimality in Lambda Interpreters: Tools for Specification and Analysis.
1-15
- John Lamping:
An Algorithm for Optimal Lambda Calculus Reduction.
16-30
- Martín Abadi, Luca Cardelli, Pierre-Louis Curien, Jean-Jacques Lévy:
Explicit Substitutions.
31-46
- Timothy Griffin:
A Formulae-as-Types Notion of Control.
47-58
- Andrea Asperti, Gian Luigi Ferrari, Roberto Gorrieri:
Implicative Formulae in the ``Proofs as Computations'' Analogy.
59-71
- Yiannis N. Moschovakis:
Computable processes.
72-80
- Gérard Berry, Gérard Boudol:
The Chemical Abstract Machine.
81-94
- Yves Lafont:
Interaction Nets.
95-108
- John C. Mitchell:
Toward a Typed Foundation for Method Specialization and Inheritance.
109-124
- William R. Cook, Walter L. Hill, Peter S. Canning:
Inheritance Is Not Subtyping.
125-135
- Justin O. Graver, Ralph E. Johnson:
A Type System for Smalltalk.
136-150
- Geoffrey L. Burn:
A Relationship Between Abstract Interpretation and Projection Analysis.
151-156
- Alain Deutsch:
On Determining Lifetime and Aliasing of Dynamically Allocated Data in Higher-Order Functional Specifications.
157-168
- R. C. Sekar, Shaunak Pawagi, I. V. Ramakrishnan:
Small Domains Spell Fast Strictness Analysis.
169-183
- Thomas J. Marlowe, Barbara G. Ryder:
An Efficient Hybrid Algorithm for Incremental Data Flow Analysis.
184-196
- Nevin Heintze, Joxan Jaffar:
A Finite Presentation Theorem for Approximating Logic Programs.
197-209
- Alexander Aiken, John H. Williams, Edward L. Wimmers:
Program Transformation in the Presence of Errors.
210-217
- Guy L. Steele Jr.:
Making Asynchronous Parallelism Safe for the World.
218-231
- Vijay A. Saraswat, Martin C. Rinard:
Concurrent Constraint Programming.
232-245
- Raghu Ramakrishnan:
Parallelism in Logic Programs.
246-260
- Alan J. Demers, Mark Weiser, Barry Hayes, Hans-Juergen Boehm, Daniel G. Bobrow, Scott Shenker:
Combining Generational and Conservative Garbage Collection: Framework and Implementations.
261-269
- Krishna V. Palem, Barbara B. Simons:
Scheduling Time-Critical Instructions on RISC Machines.
270-280
- R. Ramesh, I. V. Ramakrishnan, David Scott Warren:
Automata-Driven Indexing of Prolog Clauses.
281-291
- Paul C. Attie, Nissim Francez, Orna Grumberg:
Fairness and Hyperfairness in Multi-Party Interactions.
292-305
- Carl A. Gunter:
Relating Total and Partial Correctness Interpretations of Non-Deterministic Programs.
306-319
- James R. Russell:
On Oraclizable Networks and Kahn's Principle.
320-328
- Eugene W. Stark:
On the Relations Computable by a Class of Concurrent Automata.
329-340
- Robert Harper, John C. Mitchell, Eugenio Moggi:
Higher-Order Modules and the Phase Distinction.
341-354
- François Rouaix:
Safe Run-time Overloading.
355-366
- Satish R. Thatte:
Quasi-Static Typing.
367-381
- Harry G. Mairson:
Deciding ML Typability is Complete for Deterministic Exponential Time.
382-401
Copyright © Tue Nov 10 00:05:49 2009
by Michael Ley (ley@uni-trier.de)
