Cantitate/Preț
Produs

Types for Proofs and Programs: International Workshop TYPES'96, Aussois, France, December 15-19, 1996 Selected Papers: Lecture Notes in Computer Science, cartea 1512

Editat de Eduardo Gimenez, Christine Paulin-Mohring
en Limba Engleză Paperback – 7 oct 1998
This book constitutes the thoroughly revised post-workshop proceedings of the first annual workshop held under the auspices of the ESPRIT Working Group 21900 TYPES in Aussois, France in December 1996.
The 18 revised full papers presented in the book were carefully reviewed and selected from the 30 papers accepted for presentation at the workshop. All current aspects of type theory and type systems and their applications to program verification and theorem proving are addressed; the proof systems and theorem provers dealt with include Coq, LEGO, and Isabelle/HOL.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 33686 lei

Preț vechi: 42108 lei
-20% Nou

Puncte Express: 505

Preț estimativ în valută:
6447 6706$ 5403£

Carte tipărită la comandă

Livrare economică 13-27 martie

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540651376
ISBN-10: 3540651373
Pagini: 388
Ilustrații: VIII, 380 p.
Dimensiuni: 155 x 235 x 20 mm
Greutate: 0.54 kg
Ediția:1998
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

Coercion synthesis in computer implementations of type-theoretic frameworks.- Verification of the interface of a small proof system in coq.- An implementation of the Heine-Borel covering theorem in type theory.- Detecting and removing dead-code using rank 2 intersection.- A type-free formalization of mathematics where proofs are objects.- Higman's lemma in type theory.- A proof of weak termination of typed ??-calculi.- Proof style.- Some algorithmic and proof-theoretical aspects of coercive subtyping.- Semantical BNF.- The internal type theory of a Heyting pretopos.- Inverting inductively defined relations in LEGO.- A generic normalisation proof for pure type systems.- Proving a real time algorithm for ATM in Coq.- Dependent types with explicit substitutions: A meta-theoretical development.- Type inference verified: Algorithm W in Isabelle/HOL.- Continuous lattices in formal topology.- Abstract insertion sort in an extension of type theory with record types and subtyping.