Types for Proofs and Programs

International Workshop, TYPES 2000 Durham, UK, December 8–12, 2000 Selected Papers

  • Paul Callaghan
  • Zhaohui Luo
  • James McKinna
  • Robert Pollack
  • Robert Pollack

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

Table of contents

  1. Front Matter
    Pages I-VIII
  2. Peter Aczel, Nicola Gambino
    Pages 1-23
  3. Stefan Berghofer, Tobias Nipkow
    Pages 24-40
  4. Alberto Ciaffaglione, Pietro Di Gianantonio
    Pages 41-52
  5. Thierry Coquand, Makoto Takeyama
    Pages 53-62
  6. Herman Geuvers, Milad Niqui
    Pages 79-95
  7. Herman Geuvers, Freek Wiedijk, Jan Zwanenburg
    Pages 96-111
  8. Susumu Hayashi, Masahiro Nakata
    Pages 125-144
  9. Conor McBride
    Pages 197-216
  10. Back Matter
    Pages 243-243

About these proceedings

Keywords

Formal Methods Formal Specification Formal Verification Inductive Types Lambda Calculus Natural Programming Logics Programming Theory Rewriting Systems Type Systems data structures logic proof proof theory type theory

Editors and affiliations

  • Paul Callaghan
    • 1
  • Zhaohui Luo
    • 1
  • James McKinna
    • 1
  • Robert Pollack
    • 1
  • Robert Pollack
    • 2
  1. 1.Department of Computer ScienceUniversity of DurhamDurhamUK
  2. 2.Division of Informatics Laboratory for Foundations of Computer ScienceThe University of EdinburghEdinburghScotland, UK

Bibliographic information

  • DOI https://doi.org/10.1007/3-540-45842-5
  • Copyright Information Springer-Verlag Berlin Heidelberg 2002
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-43287-6
  • Online ISBN 978-3-540-45842-5
  • Series Print ISSN 0302-9743
  • About this book