Volume 1, Number 1, January 1991

• 
  F. Warren Burton: Encapsulating Non-Determinacy in an Abstract Data Type with Determinate Semantics. 3-20
• 
  Carsten K. Gomard, Neil D. Jones: A Partial Evaluator for the Untyped lambda-Calculus. 21-69
• 
  Mikael Rittri: Using Types as Search Keys in Function Libraries. 71-89
• 
  Sebastian Hunt, Chris Hankin: Fixed Points and Frontiers: A New Perspective. 91-120

Functional Pearls

• 
  Richard S. Bird: The Minout Problem. 121-124

Volume 1, Number 2, April 1991

• 
  Henk Barendregt: Introduction to Generalized Type Systems. 125-154
• 
  Herman Geuvers, Mark-Jan Nederhof: Modular Proof of Strong Normalization for the Calculus of Constructions. 155-189
• 
  Colin Runciman, Ian Toyn: Retrieving Reusable Software Components by Polymorphic Type. 191-211
• 
  François Major, Guy Lapalme, Robert Cedergren: Domain Generating Functions for Solving Constraint Satisfaction Problems. 213-227

Theoretical Pearls

• 
  Henk Barendregt: Self-Interpretations in lambda Calculus. 229-233

Functional Pearls

• 
  Richard S. Bird: On Removing Duplicates. 235-243

Volume 1, Number 3, July 1991

• 
  John C. Mitchell: Type Inference With Simple Subtypes. 245-285
• 
  Ian A. Mason, Carolyn L. Talcott: Equivalence in Functional Languages with Effects. 287-327
• 
  Geoffrey L. Burn: Implementing the Evaluation Transformer Model of Reduction on Parallel Machines. 329-366

Theoretical Pearls

• 
  Erik Barendsen: An Unsolvable Numeral System in lambda Calculus. 367-372

Volume 1, Number 4, October 1991

• 
  Martín Abadi, Luca Cardelli, Pierre-Louis Curien, Jean-Jacques Lévy: Explicit Substitutions. 375-416
• 
  Luca Cardelli, Giuseppe Longo: A Semantic Basis for Quest. 417-458
• 
  Hanne Riis Nielson, Flemming Nielson: Using Transformations in the Implementations of Higher-Order Functions. 459-494