Previous Page | Next Page | Expand All | Collapse All | Search (Full Text)
Year | Title | BibTeX cite key | |||||
---|---|---|---|---|---|---|---|
1995 | Modular Proofs for Completeness of hierarchical term rewriting systems In: Theoretical Computer Science [151], 487-512 | KrishnaRaoTCS | |||||
1995 | Semi-completeness of Hierarchical and Super-hierarchical Combinations of Term Rewriting Systems In: Proceedings of the 6th Joint Conference on Theory and Practice of Software Development, 379-393 | KrishnaRaoTAPSOFT | |||||
| |||||||
| |||||||
| |||||||
| |||||||
| |||||||
| |||||||
| |||||||
| |||||||
| |||||||
| |||||||
| |||||||
| |||||||
| |||||||
| |||||||
| |||||||
| |||||||
| |||||||
| |||||||
| |||||||
| |||||||
| |||||||
| |||||||
| |||||||
| |||||||
| |||||||
| |||||||
| |||||||
|