Interactive theorem proving and program development : Coq'Art: the calculus of inductive constructions
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISBN
-
9783540208549
3540208542
- Dimensions
-
24 cm
- Extent
-
XXV, 469 S.
- Language
-
Englisch
- Notes
-
Literaturverz. S. 453 - 457
- Classification
-
Mathematik
Informatik
- Keyword
-
Automatisches Beweisverfahren
Programmverifikation
Automatisches Beweisverfahren
- Event
-
Veröffentlichung
- (where)
-
Berlin, Heidelberg, New York, Hong Kong, London, Milan, Paris, Tokyo
- (who)
-
Springer
- (when)
-
2004
- Creator
-
Bertot, Yves
Castéran, Pierre
- Table of contents
- Rights
-
Bei diesem Objekt liegt nur das Inhaltsverzeichnis digital vor. Der Zugriff darauf ist unbeschränkt möglich.
- Last update
-
11.06.2025, 1:42 PM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Bertot, Yves
- Castéran, Pierre
- Springer
Time of origin
- 2004
Other Objects (12)
Inductive theorem proving for design specifications
Mechanizing inductive theorem proving in conditional theories
Inductive theorem proving for algebraic specifications : TIP system user's manual
PLATIN - A Planning System for Inductive Theorem Proving Implementation and Experiences
Inductive theorem proving in theories specified by positive, negative-conditional equations
Flexible heuristic control for combining automation and user-interaction in inductive theorem proving
Conditional Equational Specifications of Data Types with Partial Operations for Inductive Theorem Proving
Generalized inductive definitions : : the μ-calculus [my-calculus] and Π12-comprehension [Pi 1 2-comprehension]
Formal meta-programming in the calculus of constructions
On basis constructions in finite element exterior calculus
Positive negative conditional equations : a constructor-based framework for specification and inductive theorem proving
CPE: a calculus for proving equivalence of expressions in a non-strict functional language
Inductive theorem proving for design specifications
Mechanizing inductive theorem proving in conditional theories
Inductive theorem proving for algebraic specifications : TIP system user's manual
PLATIN - A Planning System for Inductive Theorem Proving Implementation and Experiences
Inductive theorem proving in theories specified by positive, negative-conditional equations
Flexible heuristic control for combining automation and user-interaction in inductive theorem proving
Conditional Equational Specifications of Data Types with Partial Operations for Inductive Theorem Proving
Generalized inductive definitions : : the μ-calculus [my-calculus] and Π12-comprehension [Pi 1 2-comprehension]
Formal meta-programming in the calculus of constructions
On basis constructions in finite element exterior calculus
Positive negative conditional equations : a constructor-based framework for specification and inductive theorem proving
CPE: a calculus for proving equivalence of expressions in a non-strict functional language
Inductive theorem proving for design specifications
Mechanizing inductive theorem proving in conditional theories
Inductive theorem proving for algebraic specifications : TIP system user's manual
PLATIN - A Planning System for Inductive Theorem Proving Implementation and Experiences
Inductive theorem proving in theories specified by positive, negative-conditional equations
Flexible heuristic control for combining automation and user-interaction in inductive theorem proving
Conditional Equational Specifications of Data Types with Partial Operations for Inductive Theorem Proving
Generalized inductive definitions : : the μ-calculus [my-calculus] and Π12-comprehension [Pi 1 2-comprehension]
Formal meta-programming in the calculus of constructions
On basis constructions in finite element exterior calculus
Positive negative conditional equations : a constructor-based framework for specification and inductive theorem proving