24. POPL 1997: Paris, France

Peter Lee, Fritz Henglein, Neil D. Jones (Eds.): Conference Record of POPL'97: The 24th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Papers Presented at the Symposium, Paris, France, 15-17 January 1997. ACM Press 1997, ISBN 0-89791-853-3

Session 1

Marc Shapiro, Susan Horwitz:
Fast and Accurate Flow-Insensitive Points-To Analysis. 1-14
Erik Ruf:
Partitioning Dataflow Analyses Using Types. 15-26
Pascal Fradet, Daniel Le Métayer:
Shape Types. 27-39
Didier Rémy, Jerome Vouillon:
Objective ML: A Simple Object-Oriented Extension of ML. 40-53

Session 2

Chih-Ping Chen, Paul Hudak:
Rolling Your Own MADT - A Connection Between Linear Types and Monads. 54-66
Krzysztof R. Apt, Andrea Schaerf:
Search and Imperative Programming. 67-79
Michael Hanus:
A Unified Computation Model for Functional and Logic Programming. 80-93
Aart Middeldorp:
Call by Need Computations to Root-Stable Form. 94-105

Session 3

George C. Necula:
Proof-Carrying Code. 106-119
Michael P. Plezbert, Ron Cytron:
Is "Just in Time" = "Better Late than Never"? 120-131
Andrew C. Myers, Joseph A. Bank, Barbara Liskov:
Parameterized Types for Java. 132-145
Martin Odersky, Philip Wadler:
Pizza into Java: Translating Theory into Practice. 146-159

Session 4

Karin Högstedt, Larry Carter, Jeanne Ferrante:
Determining the Idle Time of a Tiling. 160-173
Patrice Godefroid:
Model Checking for Programming Languages using Verisoft. 174-186
Pedro C. Diniz, Martin C. Rinard:
Synchronization Transformations for Parallel Computing. 187-200
Amy W. Lim, Monica S. Lam:
Maximizing Parallelism and Minimizing Synchronization with Affine Transforms. 201-214

Session 5

C.-H. Luke Ong, Charles A. Stewart:
A Curry-Howard Foundation for Functional Computation with Control. 215-227
Gérard Boudol:
The Pi-calculus in Direct Style. 228-241
Benjamin C. Pierce, Davide Sangiorgi:
Behavioral Equivalence in the Polymorphic Pi-calculus. 242-255
Catuscia Palamidessi:
Comparing the Expressive Power of the Synchronous and the Asynchronous pi-calculus. 256-265

Session 6

Luca Cardelli:
Program Fragments, Linking, and Modularization. 266-277
Jakob Rehof:
Minimal Typings in Atomic Subtyping. 278-291
Amokrane Saïbi:
Typing Algorithm in Type Theory with Inheritance. 292-301
François Bourdoncle, Stephan Merz:
Type-Checking Higher-Order Polymorphic Multi-Methods. 302-315

Invited Talk

Patrick Cousot:
Types as Abstract Interpretations. 316-331

Session 7

Hanne Riis Nielson, Flemming Nielson:
Infinitary Control Flow Analysis: a Collecting Semantics for Closure Analysis. 332-345
David Lesens, Nicolas Halbwachs, Pascal Raymond:
Automatic Verification of Parameterized Linear Networks of Processes. 346-357
Alain Deutsch:
On the Complexity of Escape Analysis. 358-371
Sandip K. Biswas:
A Demand-Driven Set-Based Analysis. 372-385

Session 8

Mitchell Wand, Gregory T. Sullivan:
Denotational Semantics Using an Operationally-Based Term Model. 386-399
Helmut Seidl, Morten Heine Sørensen:
Constraints to Stop Higher-Order Deforestation. 400-413
Alberto Pettorossi, Maurizio Proietti, Sophie Renault:
Reducing Nondeterminism while Specializing Logic Programs. 414-427
David Sands:
From SOS Rules to Proof Principles: An Operational Metatheory for Functional Languages. 428-441

Session 9

Andrew Kennedy:
Relational Parametricity and Units of Measure. 442-455
Robert Paige, Zhe Yang:
High Level Reading and Data Structure Compilation. 456-469
Patrik Jansson, Johan Jeuring:
Polyp - A Polytypic Programming Language. 470-482
Mark P. Jones:
First-class Polymorphism with Type Inference. 483-496

Last update Thu May 23 17:50:40 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page