Types For Proofs And Programs: International Workshop Types'96, Aussois, France, December 15-19, 1996 Selected Papers: Internation by Eduardo GimenezTypes For Proofs And Programs: International Workshop Types'96, Aussois, France, December 15-19, 1996 Selected Papers: Internation by Eduardo Gimenez

Types For Proofs And Programs: International Workshop Types'96, Aussois, France, December 15-19…

byEduardo GimenezEditorChristine Paulin-Mohring

Paperback

Pricing and Purchase Info

$125.55 online 
$150.50 list price save 16%
Earn 628 plum® points

Prices and offers may vary in store

Quantity:

In stock online

Ships free on orders over $25

Not available in stores

about

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.
Title:Types For Proofs And Programs: International Workshop Types'96, Aussois, France, December 15-19…Format:PaperbackDimensions:380 pages, 23.5 × 15.5 × 0.1 in

The following ISBNs are associated with this title:

ISBN - 10:3540651373

ISBN - 13:9783540651376

Look for similar items by category:

Reviews

Table of Contents

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.