Theoretical Computer Science, Volume 59

Volume 59, 1988

• Pier Giorgio Bosco, Elio Giovannetti, Corrado Moiso: Narrowing vs. SLD-Resolution. 3-23 BibTeX
• Gérard Boudol, Ilaria Castellani: Concurrency and Atomicity. 25-84 BibTeX
• Val Tannen, Thierry Coquand: Extensional Models for Polymorphism. 85-114 BibTeX
• Michael C. Browne, Edmund M. Clarke, Orna Grumberg: Characterizing Finite Kripke Structures in Propositional Temporal Logic. 115-131 BibTeX
• Wlodzimierz Drabent, Jan Maluszynski: Inductive Assertion Method for Logic Programs. 133-155 BibTeX
• Yves Lafont: The Linear Abstract Machine. 157-180 BibTeX
• Simona Ronchi Della Rocca: Principal Type Scheme and Unification for Intersection Type Discipline. 181-209 BibTeX
• Wim H. Hesselink: Interpretations of Recursion under Unbounded Nondeterminacy. 211-234 BibTeX
• Wim H. Hesselink: Deadlock and Fairness in Morphisms of Transition Systems. 235-257 BibTeX
• A. Scottedward Hodel, Michael C. Loui: Optimal Dynamic Embedding of X-Trees Into Arrays. 259-276 BibTeX
• K. Kalorkoti: The Trace Invariant and Matrix Inversion. 277-286 BibTeX
• Manfred Schmidt-Schauß: Implication of Clauses is Undecidable. 287-296 BibTeX
• Wojciech Rytter: On Efficient Parallel Computations for some Dynamic Programming Problems. 297-307 BibTeX
• Joost Engelfriet, George Leih: Nonterminal Bounded NLC Graph Grammars. 309-315 BibTeX
• Allen Stoughton: Substitution Revisited. 317-325 BibTeX