+612 9045 4394
 
CHECKOUT
Types for Proofs and Programs : International Workshop Types'96, Aussois, France, December 15-19, 1996 Selected Papers - Eduardo Gimenez

Types for Proofs and Programs

International Workshop Types'96, Aussois, France, December 15-19, 1996 Selected Papers

By: Eduardo Gimenez (Editor), Christine Paulin-Mohring (Editor)

Paperback Published: 7th October 1998
ISBN: 9783540651376
Number Of Pages: 380

Share This Book:

Paperback

$135.50
or 4 easy payments of $33.88 with Learn more
Ships in 5 to 9 business days

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.

Introductionp. 1
Coercion Synthesis in Computer Implementations of Type-Theoretic Frameworksp. 9
Verification of the Interface of a Small Proof System in Coqp. 28
An Implementation of the Heine-Borel Covering Theorem in Type Theoryp. 46
Detecting and Removing Dead-Code using Rank 2 Intersectionp. 66
A Type-Free Formalization of Mathematics where Proofs are Objectsp. 88
Higman's Lemma in Type Theoryp. 112
A Proof of Weak Termination of Typed [lambda][sigma]-Calculip. 134
Proof Stylep. 154
Some Algorithmic and Proof-Theoretical Aspects of Coercive Subtypingp. 173
Semantical BNFp. 196
The Internal Type Theory of a Heyting Pretoposp. 216
Inverting Inductively Defined Relations in LEGOp. 236
A Generic Normalisation Proof for Pure Type Systemsp. 254
Proving a Real Time Algorithm for ATM in Coqp. 277
Dependent Types with Explicit Subtitutions: A Meta-Theoreticical Developmentp. 294
Type Inference Verified: Algorithm W in Isabelle/HOLp. 317
Continuous Lattices in Formal Topologyp. 333
Abstract Insertion Sort in an Extension of Type Theory with Record Types and Subtypingp. 354
Author Indexp. 373
Table of Contents provided by Blackwell. All Rights Reserved.

ISBN: 9783540651376
ISBN-10: 3540651373
Series: Lecture Notes in Computer Science
Audience: General
Format: Paperback
Language: English
Number Of Pages: 380
Published: 7th October 1998
Publisher: Springer-Verlag Berlin and Heidelberg Gmbh & Co. Kg
Country of Publication: DE
Dimensions (cm): 23.39 x 15.6  x 2.03
Weight (kg): 0.54