Theoretical Computer Science, Volume 89

Volume 89, Number 1, 1991

Selected Papers of the 2nd International Joint Conference on Theory and Practice of Software Development (TAPSOFT'89), Barcelona, Spain, March 13-17, 1989

Harald Ganzinger:
Order-Sorted Completion: The Many-Sorted Way. 3-32
Annegret Habel, Hans-Jörg Kreowski, Walter Vogler:
Decidable Boundedness Problems for Sets of Graphs Generated by Hyperedge-Replacement. 33-62
Michael Hanus:
Horn Clause Programs with Polymorphic Types: Semantics and Resolution. 63-106
Robert Harper, Robert Pollack:
Type Checking with Universes. 107-136
Frank Pfenning, Peter Lee:
Metacircularity in the Polymorphic lambda-Calculus. 137-159
Colin Stirling, David Walker:
Local Model Checking in the Modal mu-Calculus. 161-177
Chris A. Vissers, Giuseppe Scollo, Marten van Sinderen, Ed Brinksma:
Specification Styles in Distributed Systems Design and Verification. 179-206

Volume 89, Number 2, 1991

Daniel Krob:
Complete Systems of B-Rational Identities. 207-343

Last update Tue May 21 19:43:46 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page