Theorem Proving in Higher Order Logics

14th International Conference, TPHOLs 2001 Edinburgh, Scotland, UK, September 3–6, 2001 Proceedings

  • Richard J. Boulton
  • Paul B. Jackson
Conference proceedings TPHOLs 2001

DOI: 10.1007/3-540-44755-5

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

Table of contents (26 papers)

  1. Front Matter
    Pages I-X
  2. Invited Talks

    1. JavaCard Program Verification
      Bart Jacobs
      Pages 1-3
    2. View from the Fringe of the Fringe
      Steven D. Johnson
      Pages 4-4
  3. Regular Contributions

    1. Computer Algebra Meets Automated Theorem Proving: Integrating Maple and PVS
      Andrew Adams, Martin Dunstan, Hanne Gottliebsen, Tom Kelsey, Ursula Martin, Sam Owre
      Pages 27-42
    2. An Irrational Construction of ℝ from ℤ
      Rob D. Arthan
      Pages 43-58
    3. HELM and the Semantic Math-Web
      Andrea Asperti, Luca Padovani, Claudio Sacerdoti Coen, Irene Schena
      Pages 59-74
    4. Calculational Reasoning Revisited An Isabelle/Isar Experience
      Gertrud Bauer, Markus Wenzel
      Pages 75-90
    5. Mechanical Proofs about a Non-repudiation Protocol
      Giampaolo Bella, Lawrence C. Paulson
      Pages 91-104
    6. Proving Hybrid Protocols Correct
      Mark Bickford, Christoph Kreitz, Robbert van Renesse, Xiaoming Liu
      Pages 105-120
    7. Nested General Recursion and Partiality in Type Theory
      Ana Bove, Venanzio Capretta
      Pages 121-125
    8. A Higher-Order Calculus for Categories
      Mario Cáccamo, Glynn Winskel
      Pages 136-153
    9. Certifying the Fast Fourier Transform with Coq
      Venanzio Capretta
      Pages 154-168
    10. A Generic Library for Floating-Point Numbers and Its Application to Exact Computing
      Marc Daumas, Laurence Rideau, Laurent Théry
      Pages 169-184
    11. Abstraction and Refinement in Higher Order Logic
      Matt Fairtlough, Michael Mendler, Xiaochun Cheng
      Pages 201-216
    12. Representing Hierarchical Automata in Interactive Theorem Provers
      Steffen Helke, Florian Kammüller
      Pages 233-248
    13. Refinement Calculus for Logic Programming in Isabelle/HOL
      David Hemer, Ian Hayes, Paul Strooper
      Pages 249-260

About these proceedings


This volume constitutes the proceedings of the 14th International Conference on Theorem Proving in Higher Order Logics (TPHOLs 2001) held 3–6 September 2001 in Edinburgh, Scotland. TPHOLs covers all aspects of theorem proving in higher order logics, as well as related topics in theorem proving and veri?cation. TPHOLs 2001 was collocated with the 11th Advanced Research Working Conference on Correct Hardware Design and Veri?cation Methods (CHARME 2001). This was held 4–7 September 2001 in nearby Livingston, Scotland at the Institute for System Level Integration, and a joint half-day session of talks was arranged for the 5th September in Edinburgh. An excursion to Traquair House and a banquet in the Playfair Library of Old College, University of Edinburgh were also jointly organized. The proceedings of CHARME 2001 have been p- lished as volume 2144 of Springer-Verlag’s Lecture Notes in Computer Science series, with Tiziana Margaria and Tom Melham as editors. Each of the 47 papers submitted in the full research category was refereed by at least 3 reviewers who were selected by the Program Committee. Of these submissions, 23 were accepted for presentation at the conference and publication in this volume. In keeping with tradition, TPHOLs 2001 also o?ered a venue for the presentation of work in progress, where researchers invite discussion by means of a brief preliminary talk and then discuss their work at a poster session. A supplementary proceedings containing associated papers for work in progress was published by the Division of Informatics at the University of Edinburgh.


Coq Isabelle Theorem priving formal verification hardware verification logic design mathematical logic model checking pi calculus proof theory proving theorem provers theorem proving type theory verification

Editors and affiliations

  • Richard J. Boulton
    • 1
  • Paul B. Jackson
    • 2
  1. 1.Department of Computing ScienceUniversity of GlasgowGlasgowScotland, UK
  2. 2.Division of InformaticsUniversity of EdinburghEdinburghScotland, UK

Bibliographic information

  • Copyright Information Springer-Verlag Berlin Heidelberg 2001
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-42525-0
  • Online ISBN 978-3-540-44755-9
  • Series Print ISSN 0302-9743