3. ESOP 1990: Copenhagen, Denmark

• Henk Barendregt, Kees Hemerik:
  Types in Lambda Calculi and Programming Languages. 1-35
  
• Robert Paige:
  Symbolic Finite Differencing - Part I. 36-56
  
• Yves Bertot:
  Implementation of an Interpreter for a Parallel Language in Centaur. 57-69
  
• Anders Bondorf:
  Automatic Autoprojection of Higher Order Recursive Equations. 70-87
  
• Charles Consel, Olivier Danvy:
  From Interpreting to Compiling Binding Times. 88-105
  
• Danny De Schreye, Dirk Pollet, Johan Ronsyn, Maurice Bruynooghe:
  Implementing Finite-domain Constraint Logic Programming on Top of a Prolog-System with Delay-mechanism. 106-117
  
• Susan Even, David A. Schmidt:
  Type Inference for Action Semantics. 118-133
  
• Matthias Felleisen:
  On the Expressive Power of Programming Languages. 134-151
  
• Benjamin Goldberg, Young Gil Park:
  Higher Order Escape Analysis: Optimizing Stack Allocation in Functional Program Implementations. 152-160
  
• E. Pascal Gribomont:
  Development of Concurrent Systems by Incremental Transformations. 161-176
  
• Reinhold Heckmann:
  Set Domains. 177-196
  
• Leen Helmink:
  Resolution and Type Theory. 197-211
  
• Stanley Jefferson, Shinn-Der Lee, Daniel P. Friedman:
  A Syntactic Theory of Transparent Parameterization. 212-226
  
• Thomas P. Jensen, Torben Æ. Mogensen:
  A Backwards Analysis for Compile-time Garbage Collection. 227-239
  
• Martin Jourdan, Didier Parigot:
  Techniques for Improving Grammar Flow Analysis. 240-255
  
• Richard Kennaway:
  The Specificity Rule for Lazy Pattern-Matching in Ambiguous Term Rewrite Systems. 256-270
  
• Herbert Kuchen, Rita Loogen, Juan José Moreno-Navarro, Mario Rodríguez-Artalejo:
  Graph-based Implementation of a Functional Logic Langugage. 271-290
  
• Hanne Riis Nielson, Flemming Nielson:
  Eureka Definitions for Free! or Disagreement Points for Fold/Unford Transformations. 291-305
  
• Maurizio Proietti, Alberto Pettorossi:
  Synthesis of Eureka Predicates for Developing Logic Programs. 306-325
  
• Thomas W. Reps:
  Algebraic Properties of Program Integration. 326-340
  
• Sergei A. Romanenko:
  Arity Raiser and its Use in Program Specialization. 341-360
  
• David Sands:
  Complexity Analysis for a Lazy Higher-Order Language. 361-376
  
• Ph. Schnoebelen, Sophie Pinchinat:
  On the Weak Adequacy of Branching-Time Remporal Logic. 377-388
  
• Bernhard Steffen, Jens Knoop, Oliver Rüthing:
  The Value Flow Graph: A Program Representation for Optimal Program Transformations. 389-405
  
• Satish Thatte:
  Type Inference and Implicit Scaling. 406-420
  
• Andrei Voronkov:
  Towards the Theory of Programming in Constructive Logic. 421-435