Theoretical Computer Science, Volume 142

Volume 142, Number 1, 1 May 1995

• Annika Aasa:
  Precedences in Specifications and Implementations of Programming Languages. 3-26
  Electronic Edition (link) BibTeX , preliminary version: PLILP 1991: 183-194
• María Alpuente, Moreno Falaschi, Giorgio Levi:
  Incremental Constraint Satisfaction for Equational Logic Programming. 27-57
  Electronic Edition (link) BibTeX , preliminary version: PLILP 1991: 111-122
• Rita Loogen, Stephan Winkler:
  Dynamic Detection of Determinism in Functional Languages. 59-87
  Electronic Edition (link) BibTeX , preliminary version: PLILP 1991: 335-346
• Maurizio Proietti, Alberto Pettorossi:
  Unfolding - Definition - Folding, in this Order, for Avaoiding Unnecessary Variables in Logic Programs. 89-124
  Electronic Edition (link) BibTeX , preliminary version: PLILP 1991: 347-358
• Ulf Nilsson:
  Abstract Interpretation: A Kind of Magic. 125-139
  Electronic Edition (link) BibTeX , preliminary version: PLILP 1991: 299-309

Volume 142, Number 2, 15 May 1995

• Claude Kirchner:
  Editorial. 139-140
  Electronic Edition (link) BibTeX
• Christopher Lynch, Wayne Snyder:
  Redundancy Criteria for Constrained Completion. 141-177
  Electronic Edition (link) BibTeX
• Nachum Dershowitz, Charles Hoot:
  Natural Termination. 179-207
  Electronic Edition (link) BibTeX
• Albert Rubio, Robert Nieuwenhuis:
  A Total AC-Compatible Ordering Based on RPO. 209-227
  Electronic Edition (link) BibTeX
• Franz Baader, Klaus U. Schulz:
  Combination Techniques and Decision Problems for Disunification. 229-255
  Electronic Edition (link) BibTeX
• Géraud Sénizergues:
  Some Undecidable Termination Problems for Semi-Thue Systems. 257-276
  Electronic Edition (link) BibTeX
• Andrea Asperti, Cosimo Laneve:
  Paths, Computations and Labels in the lambda-Calculus. 277-297
  Electronic Edition (link) BibTeX
• Jean H. Gallier:
  Proving Properties of Typed lambda-Terms Using Realizability, Covers, and Sheaves. 299-368
  Electronic Edition (link) BibTeX