Name: Semantics of Type Theory: Correctness, Completeness and Independence Results (en Inglés)
Price: 2309.09 MXN
Availability: InStock
Author: Streicher, T.
ISBN: 9781461267577

Envío gratis

portada Semantics of Type Theory: Correctness, Completeness and Independence Results (en Inglés)

Formato

Libro Físico

Autor

T. Streicher

Editorial

Birkhauser

Idioma

Inglés

N° páginas

299

Encuadernación

Tapa Blanda

Dimensiones

23.4 x 15.6 x 1.7 cm

Peso

0.44 kg.

ISBN13

9781461267577

Categorías

Ciencia y análisis de datos
Fundamentos matemáticos
Análisis y captura de datos
Ciencias de la computación

Semantics of Type Theory: Correctness, Completeness and Independence Results (en Inglés)

T. Streicher (Autor) · Birkhauser · Tapa Blanda

Libro Nuevo

$ 2,309.09

$ 3,848.48

Ahorras: $ 1,539.39

40% descuento

Envío normal

Origen: Estados Unidos (Costos de importación incluídos en el precio)

Se enviará desde nuestra bodega entre el Lunes 29 de Julio y el Viernes 09 de Agosto.

Lo recibirás en cualquier lugar de México entre 1 y 3 días hábiles luego del envío.

Reseña del libro "Semantics of Type Theory: Correctness, Completeness and Independence Results (en Inglés)"

Typing plays an important role in software development. Types can be consid- ered as weak specifications of programs and checking that a program is of a certain type provides a verification that a program satisfies such a weak speci- fication. By translating a problem specification into a proposition in constructive logic, one can go one step further: the effectiveness and unifonnity of a con- structive proof allows us to extract a program from a proof of this proposition. Thus by the "proposition-as-types" paradigm one obtains types whose elements are considered as proofs. Each of these proofs contains a program correct w.r.t. the given problem specification. This opens the way for a coherent approach to the derivation of provably correct programs. These features have led to a "typeful" programming style where the classi- cal typing concepts such as records or (static) arrays are enhanced by polymor- phic and dependent types in such a way that the types themselves get a complex mathematical structure. Systems such as Coquand and Huet's Calculus of Con- structions are calculi for computing within extended type systems and provide a basis for a deduction oriented mathematical foundation of programming. On the other hand, the computational power and the expressive (impred- icativity !) of these systems makes it difficult to define appropriate semantics.