Skip to main content
  • Conference proceedings
  • © 1998

Types for Proofs and Programs

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

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 1512)

Conference series link(s): TYPES: International Workshop on Types for Proofs and Programs

Conference proceedings info: TYPES 1996.

Buying options

eBook USD 84.99
Price excludes VAT (USA)
  • ISBN: 978-3-540-49562-8
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book USD 109.00
Price excludes VAT (USA)

This is a preview of subscription content, access via your institution.

Table of contents (19 papers)

  1. Front Matter

  2. Introduction

    Pages 1-8
  3. Detecting and removing dead-code using rank 2 intersection

    • Ferruccio Damiani, Frédéric Prost
    Pages 66-87
  4. Higman's lemma in type theory

    • Daniel Fridlender
    Pages 112-133
  5. A proof of weak termination of typed λσ-calculi

    • Jean Goubault-Larrecq
    Pages 134-153
  6. Proof style

    • John Harrison
    Pages 154-172
  7. Some algorithmic and proof-theoretical aspects of coercive subtyping

    • Alex Jones, Zhaohui Luo, Sergei Soloviev
    Pages 173-195
  8. Semantical BNF

    • Petri Mäenpää
    Pages 196-215
  9. The internal type theory of a Heyting pretopos

    • Maria Emilia Maietti
    Pages 216-235
  10. A generic normalisation proof for pure type systems

    • Paul-André Melliès, Benjamin Werner
    Pages 254-276
  11. Proving a real time algorithm for ATM in Coq

    • Jean-François Monin
    Pages 277-293
  12. Type inference verified: Algorithm W in Isabelle/HOL

    • Wolfgang Naraschewski, Tobias Nipkow
    Pages 317-332
  13. Continuous lattices in formal topology

    • Sara Negri
    Pages 333-353

Other Volumes

  1. Types for Proofs and Programs

    International Workshop TYPES’96 Aussois, France, December 15–19, 1996 Selected Papers

About this book

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.

Keywords

  • Coq
  • Isabelle
  • Type theory
  • algorithm
  • algorithms
  • program verification
  • proof systems
  • proving
  • theorem proving
  • type systems
  • verification

Bibliographic Information

Buying options

eBook USD 84.99
Price excludes VAT (USA)
  • ISBN: 978-3-540-49562-8
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book USD 109.00
Price excludes VAT (USA)