TU Darmstadt / ULB / TUbiblio

Generating polynomial orderings for termination proofs

Giesl, Jürgen (1995):
Generating polynomial orderings for termination proofs.
In: International Conference on Rewriting Techniques and Applications <6, 1995, Kaiserlautern>: Proceedings. - Berlin, Heidelberg (u.a.): Springer, 1995. S. 426-431, 914, Heidelberg (u.a.), Springer, [Conference or Workshop Item]

Item Type: Conference or Workshop Item
Erschienen: 1995
Creators: Giesl, Jürgen
Title: Generating polynomial orderings for termination proofs
Language: English
Series Name: International Conference on Rewriting Techniques and Applications <6, 1995, Kaiserlautern>: Proceedings. - Berlin, Heidelberg (u.a.): Springer, 1995. S. 426-431
Volume: 914
Place of Publication: Heidelberg (u.a.)
Publisher: Springer
Divisions: 20 Department of Computer Science
Date Deposited: 19 Nov 2008 16:23
License: [undefiniert]
Export:
Suche nach Titel in: TUfind oder in Google
Send an inquiry Send an inquiry

Options (only for editors)
Show editorial Details Show editorial Details