- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Maße
-
30 cm
- Umfang
-
III, 143 S.
- Sprache
-
Deutsch
- Anmerkungen
-
Zugl.: Karlsruhe, Univ., Habil.-Schr., 1990
- Erschienen in
-
Interner Bericht / Universität Karlsruhe (TH) ; 88,17
- Ereignis
-
Veröffentlichung
- (wo)
-
Karlsruhe
- (wer)
-
Univ., Fak. für Informatik
- (wann)
-
1988
- Urheber
- Inhaltsverzeichnis
- Rechteinformation
-
Bei diesem Objekt liegt nur das Inhaltsverzeichnis digital vor. Der Zugriff darauf ist unbeschränkt möglich.
- Letzte Aktualisierung
-
11.06.2025, 14:22 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Objekttyp
- Hochschulschrift
Beteiligte
- Walther, Christoph
- Univ., Fak. für Informatik
Entstanden
- 1988
Ähnliche Objekte (12)
Termination proofs for logic programs
Termination proofs for logic programs
Continuous semantics for termination proofs
Termination Proofs of Rewriting Systems
Automating recursive definitions and termination proofs in higher-order logic
A Region Graph Based Approach to Termination Proofs
A region graph based approach to termination proofs
Termination proofs and derivation lengths in term rewriting systems
Automated methods for formal proofs in simple arithmetics and algebra
Automated termination analysis of C programs
A calculus for modular loop acceleration and non-termination proofs
Termination proofs for a lazy functional language by abstract reduction : (draft)
Termination proofs for logic programs
Termination proofs for logic programs
Continuous semantics for termination proofs
Termination Proofs of Rewriting Systems
Automating recursive definitions and termination proofs in higher-order logic
A Region Graph Based Approach to Termination Proofs
A region graph based approach to termination proofs
Termination proofs and derivation lengths in term rewriting systems
Automated methods for formal proofs in simple arithmetics and algebra
Automated termination analysis of C programs
A calculus for modular loop acceleration and non-termination proofs
Termination proofs for a lazy functional language by abstract reduction : (draft)
Termination proofs for logic programs
Termination proofs for logic programs
Continuous semantics for termination proofs
Termination Proofs of Rewriting Systems
Automating recursive definitions and termination proofs in higher-order logic
A Region Graph Based Approach to Termination Proofs
A region graph based approach to termination proofs
Termination proofs and derivation lengths in term rewriting systems
Automated methods for formal proofs in simple arithmetics and algebra
Automated termination analysis of C programs
A calculus for modular loop acceleration and non-termination proofs