Types for proofs and programs : International Workshop TYPES '96, Aussois, France, December 15-19, 1996 : selected papers
Author(s)
Bibliographic Information
Types for proofs and programs : International Workshop TYPES '96, Aussois, France, December 15-19, 1996 : selected papers
（Lecture notes in computer science, 1512）
Springer, c1998
Available at / 43 libraries
-
Library, Research Institute for Mathematical Sciences, Kyoto University数研
L/N||LNCS||151298051463
-
INTERNATIONAL CHRISTIAN UNIVERSITY LIBRARY図
V.1512007.6/L507/v.151205154192,
007.6/L507/v.151205154192 -
University of Tsukuba Library, Library on Library and Information Science
007.08:L-49:1512981005740
-
No Libraries matched.
- Remove all filters.
Note
Includes bibliographical references and index
Description and Table of Contents
Description
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.
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.
by "Nielsen BookData"