PEPM 1991: New Haven, Connecticut, USA

Session 1

• Akihiko Takano:
  Generalized Partial Computation for a Lazy Functional Language. 1-11
  
• Alexander Romanenko:
  Inversion and Metacomputation. 12-22
  
• Dan Sahlin:
  Determinacy Analysis for Full Prolog. 23-30
  

Session 2

• Björn Lisper:
  Detecting Static Algorithms by Partial Evaluation. 31-42
  
• Timothy J. Hickey, Donald A. Smith:
  Toward the Partial Evaluation of CLP Languages. 43-51
  
• Agostino Cortesi, Gilberto Filé:
  Abstract Interpretation of Logic Programs: An Abstract Domain for Groundness, Sharing, Freeness and Compoundness Analysis. 52-61
  

Session 3

• Donald A. Smith:
  Partial Evaluation of Pattern Matching in Constraint Logic Programming Languages. 62-71
  
• David Sherman, Robert Strandh, Irène Durand:
  Optimization of Equational Programs Using Partial Evaluation. 72-82
  
• R. S. Sundaresh:
  Building Incremental Programs using Partial Evaluation. 83-93
  

Session 4

• Uwe Meyer:
  Techniques for Partial Evaluation of Imperative Languages. 94-105
  
• Timothy S. McNerney:
  Verifying the Correctness of Compiler Transformations on Basic Blocks using Abstract Interpretation. 106-115
  
• Zena M. Ariola, Arvind:
  A Syntactic Approach to Program Transformations. 116-129
  

Session 5

• John Hannan:
  Staging Transformations for Abstract Machines. 130-141
  
• Anne De Niel, Eddy Bevers, Karel De Vlaminck:
  Program Bifurcation for a Polymorphic Typed Functional Language. 142-153
  
• Sebastian Hunt, David Sands:
  Binding Time Analysis: A New PERspective. 154-165
  

Session 6

• Carsten K. Gomard, Peter Sestoft:
  Globalization and Live Variables. 166-177
  
• Young Gil Park, Benjamin Goldberg:
  Reference Escape Analysis: Optimizing Reference Counting based on the Lifetime of References. 178-189
  
• Olin Shivers:
  The Semantics of Scheme Control-Flow Analysis. 190-198
  

Session 7

• Andrei V. Klimov:
  Dynamic Specialization in Extended Functional Language with Monotone Objects. 199-210
  
• Siau-Cheng Khoo, R. S. Sundaresh:
  Compiling Inheritance using Partial Evaluation. 211-222
  
• Carsten Kehler Holst, Carsten K. Gomard:
  Partial Evaluation is Fuller Laziness. 223-233
  

Session 8

• Robert Muller:
  M-LISP: Its Natural Semantics and Equational Logic (Extended Abstract). 234-242
  
• Torben Amtoft Hansen:
  Properties of Unfolding-based Meta-level Systems. 243-254
  
• Philip Wadler:
  Is There a Use for Linear Logic? 255-273
  

Session 9

• Maurizio Proietti, Alberto Pettorossi:
  Semantics Preserving Transformation Rules for Prolog. 274-284
  
• Spiro Michaylov, Frank Pfenning:
  Compiling the Polymorphic Lambda-Calculus. 285-296
  
• Ian A. Mason, Carolyn L. Talcott:
  Program Transformations for Configuring Components. 297-308
  

Session 10

• Robert Glück:
  Towards Multiple Self-Application. 309-320
  
• Erik Ruf, Daniel Weise:
  Using Types to Avoid Redundant Specialization. 321-333
  

Last update Fri May 25 08:31:48 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page