Types for Proofs and Programs
% SALE
Types for Proofs and Programs
% SALE
% SALE
Beschreibung
Collection Principles in Dependent Type Theory.- Executing Higher Order Logic.- A Tour with Constructive Real Numbers.- An Implementation of Type:Type.- On the Logical Content of Computational Type Theory: A Solution to Curry's Problem.- Constructive Reals in Coq: Axioms and Categoricity.- A Constructive Proof of the Fundamental Theorem of Algebra without Using the Rationals.- A Kripke-Style Model for the Admissibility of Structural Rules.- Towards Limit Computable Mathematics.- Formalizing the Halting Problem in a Constructive Type Theory.- On the Proofs of Some Formally Unprovable Propositions and Prototype Proofs in Type Theory.- Changing Data Structures in Type Theory: A Study of Natural Numbers.- Elimination with a Motive.- Generalization in Type Theory Based Proof Assistants.- An Inductive Version of Nash-Williams' Minimal-Bad-Sequence Argument for Higman's Lemma.
Produktdetails
- Typ:
- Buch
- Einband:
- Taschenbuch
- Edition:
- 1
- Sprachen:
-
Original:
Englisch
- Seitenzahl:
-
256
- Herausgeber:
-
Springer
- Veröffentlichungsdatum:
-
2002-02-20
- ISBN / EAN:
- 9783540432876
- Gewicht:
-
394 g
- Maße:
-
16/24/2 cm
- GPSR-Herstellerreferenz:
-
[email protected]
Die gelieferte Auflage kann ggf. abweichen.
Gerade ausverkauft
Wieder da E-Mail
Auf den Merkzettel