Theorem Proving in Higher Order Logics

17th International Conference, TPHOLs 2004, Park City, Utah, USA, September 14-17, 2004. Proceedings

  • Konrad Slind
  • Annette Bunker
  • Ganesh Gopalakrishnan
Conference proceedings TPHOLs 2004

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

Table of contents

  1. Front Matter
  2. Behzad Akbarpour, Sofiène Tahar
    Pages 1-17
  3. Penny Anderson, Frank Pfenning
    Pages 18-33
  4. David Aspinall, Lennart Beringer, Martin Hofmann, Hans-Wolfgang Loidl, Alberto Momigliano
    Pages 34-49
  5. Olivier Boite
    Pages 50-65
  6. Luís Cruz-Filipe, Freek Wiedijk
    Pages 66-81
  7. Al Davis
    Pages 82-82
  8. Lucas Dixon, Jacques Fleuriot
    Pages 83-98
  9. Ruben Gamboa, John Cowles
    Pages 99-116
  10. Jason Hickey, Aleksey Nogin
    Pages 136-151
  11. Einar Broch Johnsen, Christoph Lüth
    Pages 152-167
  12. Michael Jones, Aaron Benson, Dan Delorey
    Pages 168-183
  13. Hanbing Liu, J. Strother Moore
    Pages 184-200
  14. John Longley, Randy Pollack
    Pages 201-216
  15. Jean-François Monin
    Pages 217-224
  16. Julien Narboux
    Pages 225-240
  17. Lee Pike, Jeffrey Maddalon, Paul Miner, Alfons Geser
    Pages 257-270
  18. Tian-jun Zuo, Jun-gang Han, Ping Chen
    Pages 287-304
  19. Martin Wildmoser, Tobias Nipkow
    Pages 305-320
  20. Ting Zhang, Henny B. Sipma, Zohar Manna
    Pages 321-336
  21. Back Matter

About these proceedings


This volume constitutes the proceedings of the 17th International Conference on Theorem Proving in Higher Order Logics (TPHOLs 2004) held September 14–17, 2004 in Park City, Utah, USA. TPHOLs covers all aspects of theorem proving in higher-order logics as well as related topics in theorem proving and veri?cation. There were 42 papers submitted to TPHOLs 2004 in the full research ca- gory, each of which was refereed by at least 3 reviewers selected by the program committee. Of these submissions, 21 were accepted for presentation at the c- ference and publication in this volume. In keeping with longstanding tradition, TPHOLs 2004 also o?ered a venue for the presentation of work in progress, where researchers invited discussion by means of a brief introductory talk and then discussed their work at a poster session. A supplementary proceedings c- taining papers about in-progress work was published as a 2004 technical report of the School of Computing at the University of Utah. The organizers are grateful to Al Davis, Thomas Hales, and Ken McMillan for agreeing to give invited talks at TPHOLs 2004. The TPHOLs conference traditionally changes continents each year in order to maximize the chances that researchers from around the world can attend.


Automat Isabelle automated deduction computability logic proof theory proving theorem proving verification

Editors and affiliations

  • Konrad Slind
    • 1
  • Annette Bunker
    • 2
  • Ganesh Gopalakrishnan
    • 3
  1. 1.School of ComputingUniversity of Utah 
  2. 2.Electrical and Computer Engineering DepartmentUtah State UniversityLoganUSA
  3. 3.School of ComputingUniv. of UtahSalt Lake CityUSA

Bibliographic information

  • DOI
  • Copyright Information Springer-Verlag Berlin Heidelberg 2004
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-23017-5
  • Online ISBN 978-3-540-30142-4
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site