Logout succeed
Logout succeed. See you again!

Theoretical Computer Science 1991: Vol 89 Index PDF
Preview Theoretical Computer Science 1991: Vol 89 Index
Theoretical Computer Science 89 (1991) 345 Elsevier Author Index Volume 89 (1991) (The issue number is given in front of the page numbers) Brinksma, E., see C.A. Vissers (1) 179-206 Diaz, J. and F. Orejas, Editorial to the Special Issue on the 2nd Joint Conference on Theory and Practice of Software Development (TAPSOFT ’89) (1) 1 Ganzinger, H., Order-sorted completion: the many-sorted way (1) 3- 32 Habel, A., H.-J. Kreowski and W. Vogler, Decidable boundedness problems for sets of graphs generated by hyperedge-replacement (1) 33- 62 Hanus, M., Horn clause programs with polymorphic types: semantics and resolution (1) 63-106 Harper, R. and R. Pollack, Type checking with universes (1) 107-136 Kreowski, H.-J., see A. Habel (1) 33- 62 Krob, D., Complete systems of %-rational identities (Fundamental Study) (2) 207-343 Lee, P., see F. Pfenning (1) 137-159 Orejas, F. see J. Diaz (1) 1 Pfenning, F. and P. Lee, Metacircularity in the polymorphic A-calculus (1) 137-159 Pollack, R., see R. Harper (1) 107-136 Scollo, G., see C.A. Vissers (1) 179-206 Stirling, C. and D. Walker, Local model checking in the modal mu-calculus (1) 161-177 Van Sinderen, M., see C.A. Vissers (1) 179-206 Vissers, C.A., G. Scollo, M. van Sinderen and E. Brinksma, Specification styles in distributed systems design and verification (1) 179-206 Vogler, W., see A. Habel (1) 33- 62 Walker, D., see C. Stirling (1) 161-177 Elsevier Science Publishers B.V.