Theorem Proving in Higher Order Logics

20th International Conference, TPHOLs 2007, Kaiserslautern, Germany, September 10-13, 2007. Proceedings

  • Editors
  • Klaus Schneider
  • Jens Brandt
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4732)

Table of contents

  1. Front Matter
  2. Andrew W. Appel, Sandrine Blazy
    Pages 5-21
  3. David Aspinall, Jaroslav Ševčík
    Pages 22-37
  4. Lukas Bulwahn, Alexander Krauss, Tobias Nipkow
    Pages 38-53
  5. Jeremy E. Dawson
    Pages 54-69
  6. David Delahaye, Catherine Dubois, Jean-Frédéric Étienne
    Pages 70-85
  7. Georges Gonthier, Assia Mahboubi, Laurence Rideau, Enrico Tassi, Laurent Théry
    Pages 86-101
  8. José-Antonio Alonso, Joaquín Borrego-Díaz, María-José Hidalgo, Francisco-Jesus Martín-Mateos, José-Luis Ruiz-Reina
    Pages 135-150
  9. Zhaozhong Ni, Dachuan Yu, Zhong Shao
    Pages 189-206
  10. Michael Norrish, René Vestergaard
    Pages 207-222
  11. Steven Obua
    Pages 223-231
  12. Lawrence C. Paulson, Kong Woei Susanto
    Pages 232-245

About these proceedings

Keywords

D programming language modeling programming programming language proving semantics theorem proving verification

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-540-74591-4
  • Copyright Information Springer-Verlag Berlin Heidelberg 2007
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-540-74590-7
  • Online ISBN 978-3-540-74591-4
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349