6. ESOP 1996: Linköping, Sweden

Invited Papers

• Cliff B. Jones:
  Some Practical Problems and Their Influence on Semantics. 1-17
  
• Simon L. Peyton Jones:
  Compiling Haskell by Program Transformation: A Report from the Trenches. 18-44
  

Contributed Papers

• María Alpuente, Moreno Falaschi, Germán Vidal:
  Narrowing-Driven Partial Evaluation of Functional Logic Programs. 45-61
  
• Roberto Barbuti, Paolo Mancarella:
  A Multiple-Valued Logical Semantics for Prolog. 62-76
  
• Denis Béchet:
  Removing Value Encoding Using Alternative Values in Partial Evaluation of Strongly-Typed Languages. 77-91
  
• Jan A. Bergstra, T. B. Dinesh, John Field, Jan Heering:
  A Complete Transformational Toolkit for Compilers. 92-107
  
• Francisco Bueno, Daniel Cabeza Gras, Manuel V. Hermenegildo, Germán Puebla:
  Global Analysis of Standard Prolog Programs. 108-124
  
• Pascal Fradet, Ronan Caugne, Daniel Le Métayer:
  Static Detection of Pointer Errors: An Axiomatisation and a Checking Algorithm. 125-140
  
• Roberto Giacobazzi, Francesco Ranzato:
  Compositional Optimization of Disjunctive Abstract Interpretations. 141-155
  
• Juan Carlos González Moreno, Maria Teresa Hortalá-González, Francisco Javier López-Fraguas, Mario Rodríguez-Artalejo:
  A Rewriting Logic for Declarative Programming. 156-172
  
• Eric Goubault:
  Durations for Truly-Concurrent Transitions. 173-187
  
• Thomas P. Jensen, Ian Mackie:
  Flow Analysis in the Geometry of Interaction. 188-203
  
• John Launchbury, Ross Paterson:
  Parametricity and Unboxing with Unpointed Types. 204-218
  
• Sheng Liang, Paul Hudak:
  Modular Denotational Semantics for Compiler Construction. 219-234
  
• Florence Maraninchi, Nicolas Halbwachs:
  Compositional Semantics of Non-Deterministic Synchronous Languages. 235-249
  
• Stephan Melzer, Javier Esparza:
  Checking System Properties via Integer Programming. 250-264
  
• Ugo Montanari, Marco Pistore, Daniel Yankelevich:
  Efficient Minimization up to Location Equivalence. 265-279
  
• Jens Palsberg, Boaz Patt-Shamir, Karl J. Lieberherr:
  A New Approach to Compiling Adaptive Programs. 280-295
  
• Ekkehard Rohwedder, Frank Pfenning:
  Mode and Termination Checking for Higher-Order Logic Programs. 296-310
  
• Eva Rose:
  Linear Time Hierarchies for a Functional Language Machine Model. 311-325
  
• Helmut Seidl:
  Integer Constraints to Stop Deforestation. 326-340
  
• Geoffrey Smith, Dennis M. Volpano:
  Towards an ML-Style Polymorphic Type System for C. 341-355
  
• Ketil Stølen:
  Assumption/Commitment Rules for Dataflow Networks - With an Emphasis on Completeness. 356-372
  
• Michael Thuné, Krister Åhlander:
  Towards an Expressive Language for PDE Solvers. 373-386
  
• Steffen van Bakel, Franco Barbanera, Maribel Fernández:
  Rewrite Systems with Abstraction and beta-Rule: Types, Approximants and Normalization. 387-403