Hochschulschrift
Programming, specification and interactive theorem proving : towards a unified language based on equational logic, rewriting logic and type theory
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Maße
-
30 cm
- Umfang
-
589 S.
- Sprache
-
Englisch
- Anmerkungen
-
graph. Darst.
Hamburg, Univ., Diss., 2002 (Nicht für den Austausch)
- Schlagwort
-
Termersetzungssystem
Gleichungstheorie
Typentheorie
Automatisches Beweisverfahren
Petri-Netz
- Urheber
-
Stehr, Mark-Oliver
- 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:24 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
- Stehr, Mark-Oliver
Ähnliche Objekte (12)
Programming, specification and interactive theorem proving : towards a unified language based on equational logic, rewriting logic and type theory
Proving Linearizability with Temporal Logic
Horn logic and rewriting for functional and logic program design
First order logic and automated theorem proving
First order logic and automated theorem proving
mj-Reduction for Proving in Predicate Logic
From logic design to logic programming : theorem proving techniques and P-functions
Taclets vs. rewriting logic - relating semantics of Java
Proving Theorems of Higher-Order Logic with SMT Solvers
Proving theorems of higher-order logic with SMT solvers
Semantics of UML 2.2 State Machines in Rewriting Logic
Interactive relational database design : a logic programming implementation
Programming, specification and interactive theorem proving : towards a unified language based on equational logic, rewriting logic and type theory
Proving Linearizability with Temporal Logic
Horn logic and rewriting for functional and logic program design
First order logic and automated theorem proving
First order logic and automated theorem proving
mj-Reduction for Proving in Predicate Logic
From logic design to logic programming : theorem proving techniques and P-functions
Taclets vs. rewriting logic - relating semantics of Java
Proving Theorems of Higher-Order Logic with SMT Solvers
Proving theorems of higher-order logic with SMT solvers
Semantics of UML 2.2 State Machines in Rewriting Logic
Interactive relational database design : a logic programming implementation
Programming, specification and interactive theorem proving : towards a unified language based on equational logic, rewriting logic and type theory
Proving Linearizability with Temporal Logic
Horn logic and rewriting for functional and logic program design
First order logic and automated theorem proving
First order logic and automated theorem proving
mj-Reduction for Proving in Predicate Logic
From logic design to logic programming : theorem proving techniques and P-functions
Taclets vs. rewriting logic - relating semantics of Java
Proving Theorems of Higher-Order Logic with SMT Solvers
Proving theorems of higher-order logic with SMT solvers
Semantics of UML 2.2 State Machines in Rewriting Logic