Theoretical Computer Science, Volume 212

Volume 212, Numbers 1-2, 6 February 1999

• Marcin Benke:
  Some Complexity Bounds for Subtype Inequalities. 3-27
  Electronic Edition (link) BibTeX
• Alessandro Berarducci, Mariangiola Dezani-Ciancaglini:
  Infinite lambda-Calculus and Types. 29-75
  Electronic Edition (link) BibTeX
• Harold Boley:
  Functional-Logic Integration via Minimal Reciprocal Extensions. 77-99
  Electronic Edition (link) BibTeX
• Viviana Bono, Michele Bugliesi:
  Matching for the lambda Calculus of Objects. 101-140
  Electronic Edition (link) BibTeX
• Roy Dyckhoff, Luis Pinto:
  Permutability of Proofs in Intuitionistic Sequent Calculi. 141-155
  Electronic Edition (link) BibTeX
• Martin Emms, Hans Leiß:
  Extending the Type Checker of Standard ML by Polymorphic Recursion. 157-181
  Electronic Edition (link) BibTeX
• Furio Honsell, Marina Lenisa:
  Semantical Analysis of Perpetual Strategies in lambda-Calculus. 183-209
  Electronic Edition (link) BibTeX
• Benedetto Intrigila, Marisa Venturini Zilli:
  Orders, Reduction Graphs and Spectra. 211-231
  Electronic Edition (link) BibTeX
• Adolfo Piperno:
  An Algebraic View of the Böhm-Out Technique. 233-246
  Electronic Edition (link) BibTeX
• Helmut Schwichtenberg:
  Termination of Permutative Conversions in Intuitionistic Gentzen Calculi. 247-260
  Electronic Edition (link) BibTeX
• Dieter Spreen:
  On Functions Preserving Levels of Approximation: A Refined Model Construction for Various lambda Calculi. 261-303
  Electronic Edition (link) BibTeX