Previous Page | Next Page | Expand All | Collapse All | Search (Full Text)
Journal Full Title / ISSN | Year | Author/Editor | Title | |||||
---|---|---|---|---|---|---|---|---|
| ||||||||
| ||||||||
| ||||||||
| ||||||||
| ||||||||
| ||||||||
| ||||||||
| ||||||||
| ||||||||
| ||||||||
| ||||||||
| ||||||||
Theoretical Computer Science 0304-3975 | 1998 | Ganzinger, Harald | Preface In: Theoretical Computer Science [208], 1 | |||||
Theoretical Computer Science 0304-3975 | 1998 | Krishna Rao, M. R. K. | Modular Aspects of term graph rewriting In: Theoretical Computer Science [208], 59-86 | |||||
Theoretical Computer Science 0304-3975 | 1998 | Stuber, Jürgen | Superposition theorem proving for abelian groups represented as integer modules In: Theoretical Computer Science [208], 149-177 | |||||
Theoretical Computer Science 0304-3975 | 1995 | Krishna Rao, M. R. K. | Modular Proofs for Completeness of hierarchical term rewriting systems In: Theoretical Computer Science [151], 487-512 | |||||
Theoretical Computer Science 0304-3975 | 1992 | Waldmann, Uwe | Semantics of Order-Sorted Specifications In: Theoretical Computer Science [94], 1-35 | |||||
Theoretical Computer Science 0304-3975 | 1991 | Ganzinger, Harald | Order-Sorted Completion: The Many-Sorted Way In: Theoretical Computer Science [89], 3-32 | |||||
Theoretical Computer Science 0304-3975 | 1991 | Hanus, Michael | Horn Clause Programs with Polymorphic Types: Semantics and Resolution In: Theoretical Computer Science [89], 63-106 | |||||
| ||||||||
|