Types for Proofs and Programs

International Workshop, TYPES’99 Lökeberg, Sweden, June 12–16, 1999 Selected Papers

  • Thierry Coquand
  • Peter Dybjer
  • Bengt Nordström
  • Jan Smith
Conference proceedings TYPES 1999

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

Table of contents

  1. Front Matter
    Pages I-VI
  2. Steffen van Bakel, Franco Barbanera, Maribel Fernández
    Pages 41-60
  3. Gertrud Bauer, Markus Wenzel
    Pages 61-76
  4. Gustavo Betarte, Cristina Cornes, Nora Szasz, Alvaro Tasistro
    Pages 77-93
  5. Paul Callaghan, Zhaohui Luo
    Pages 94-113
  6. Alberto Ciaffaglione, Pietro Di Gianantonio
    Pages 114-130
  7. Healfdene Goguen, Richard Brooksby, Rod Burstall
    Pages 148-161
  8. Micaela Mayero
    Pages 162-173
  9. Qiao Haiyan
    Pages 174-193
  10. Back Matter
    Pages 195-195

About these proceedings

Keywords

Coq Formal Methods Formal Specification Formal Verification Inductive Types Lambda Calculus Program Semantics Programming Logics Programming Theory Rewriting Systems Type Systems Types programming proof theory verification

Editors and affiliations

  • Thierry Coquand
    • 1
  • Peter Dybjer
    • 1
  • Bengt Nordström
    • 1
  • Jan Smith
    • 1
  1. 1.Department of Computing ScienceChalmers University of Technology and University of GöteborgGöteborgSweden

Bibliographic information

  • DOI https://doi.org/10.1007/3-540-44557-9
  • Copyright Information Springer-Verlag Berlin Heidelberg 2000
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-41517-6
  • Online ISBN 978-3-540-44557-9
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book