Theoretical Computer Science, Volume 56

Volume 56, 1988

• Dieter Armbruster: A Polynomial Determination of the Most-Recent Property in Pascal-Like Programs. 3-15
• Chris Hankin, Geoffrey L. Burn, Simon L. Peyton Jones: A Safe Approach to Parallel Combinator Reduction. 17-36
• Stéphane Kaplan: Rewriting with a Nondeterministic Choice Operator. 37-57
• Flemming Nielson, Hanne Riis Nielson: Two-Level Semantics and Code Generation. 59-133
• Eugene W. Stark: Proving Entailment Between Conceptual State Specifications. 135-154
• Emanuela Fachini, Margherita Napoli: C-Tree Systolic Automata. 155-186
• V. Wiktor Marek: A Natural Semantics for Modal Logic Over Databases. 187-209
• Costas S. Iliopoulos: On the Computational Complexity of the Abelian Permutation Group Structure, Membership and Intersection Problems. 211-222
• Shoji Sekimoto, Sachio Hirokawa: One-Step Recurrent Terms in lambda-beta-Calculus. 223-231
• Arturo Carpi: Multidimensional Unrepetitive Configurations. 233-241
• Jeanleah Mohrherr: A Remark on the Length Problem. 243-248
• Carol Tretkoff: Complexity, Combinatorial Group Theory and the Language of Palutators. 253-275
• John Staples: Delaying Unification Algorithms for Lambda Calculi. 277-288
• Erich Grädel: Subclasses of Presburger Arithmetic and the Polynomial-Time Hierarchy. 289-301
• André Martino: A Quantitative Interpretation of Girard's System F. 303-320
• R. Boonyavatana, Giora Slutzki: The Interchange or Pump (Di)Lemmas for Context-Free Languages. 321-338
• Véronique Bruyère: An Answer to a Question about Finite Maximal Prefix Sets of Words. 339-344
• Franz Baader, Wolfram Büttner: Unification in Commutative Idempotent Monoids. 345-353