Hochschulschrift
Implementation of combinator specifications : notions and proving techniques
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISBN
-
9783826512537
3826512537
- Maße
-
21 cm
- Umfang
-
II, 247 S.
- Ausgabe
-
Als Ms. gedr.
- Sprache
-
Englisch
- Anmerkungen
-
Zugl.: München, Univ., Diss., 1995
- Schlagwort
-
Algebraische Spezifikation
Automatisches Beweisverfahren
Logischer Schluss
- Inhaltsverzeichnis
- Rechteinformation
-
Bei diesem Objekt liegt nur das Inhaltsverzeichnis digital vor. Der Zugriff darauf ist unbeschränkt möglich.
- Letzte Aktualisierung
-
11.06.2025, 13:34 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
- Mehlich, Michael
- Shaker
Entstanden
- 1996
Ähnliche Objekte (12)
Theorem Proving in Hierarchical Clausal Specifications
Inductive theorem proving for design specifications
Inductive theorem proving for algebraic specifications : TIP system user's manual
Première partie. Notions techniques.
Efficient Implementation of Estelle Specifications
Executable specifications for language implementation
Conditional Equational Specifications of Data Types with Partial Operations for Inductive Theorem Proving
Decomposition Techniques and their Applications in Automated Theorem Proving
Informatique pour professions techniques, [...]. Notions de base
An algorithm for transforming LOTOS specifications for implementation
Visual Proving
PLATIN - A Planning System for Inductive Theorem Proving Implementation and Experiences
Theorem Proving in Hierarchical Clausal Specifications
Inductive theorem proving for design specifications
Inductive theorem proving for algebraic specifications : TIP system user's manual
Première partie. Notions techniques.
Efficient Implementation of Estelle Specifications
Executable specifications for language implementation
Conditional Equational Specifications of Data Types with Partial Operations for Inductive Theorem Proving
Decomposition Techniques and their Applications in Automated Theorem Proving
Informatique pour professions techniques, [...]. Notions de base
An algorithm for transforming LOTOS specifications for implementation
Visual Proving
PLATIN - A Planning System for Inductive Theorem Proving Implementation and Experiences
Theorem Proving in Hierarchical Clausal Specifications
Inductive theorem proving for design specifications
Inductive theorem proving for algebraic specifications : TIP system user's manual
Première partie. Notions techniques.
Efficient Implementation of Estelle Specifications
Executable specifications for language implementation
Conditional Equational Specifications of Data Types with Partial Operations for Inductive Theorem Proving
Decomposition Techniques and their Applications in Automated Theorem Proving
Informatique pour professions techniques, [...]. Notions de base
An algorithm for transforming LOTOS specifications for implementation
Visual Proving