Theorem Proving in Higher Order Logics

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

Editors:

ISBN: 978-3-540-42525-0 (Print) 978-3-540-44755-9 (Online)

Table of contents (26 chapters)

previous Page of 2
  1. Invited Talks

    1. No Access

      Book Chapter

      Pages 1-3

      JavaCard Program Verification

    2. No Access

      Book Chapter

      Pages 4-4

      View from the Fringe of the Fringe

    3. No Access

      Book Chapter

      Pages 5-26

      Using Decision Procedures with a Higher-Order Logic

  2. Regular Contributions

    1. No Access

      Book Chapter

      Pages 27-42

      Computer Algebra Meets Automated Theorem Proving: Integrating Maple and PVS

    2. No Access

      Book Chapter

      Pages 43-58

      An Irrational Construction of ℝ from ℤ

    3. No Access

      Book Chapter

      Pages 59-74

      HELM and the Semantic Math-Web

    4. No Access

      Book Chapter

      Pages 75-90

      Calculational Reasoning Revisited An Isabelle/Isar Experience

    5. No Access

      Book Chapter

      Pages 91-104

      Mechanical Proofs about a Non-repudiation Protocol

    6. No Access

      Book Chapter

      Pages 105-120

      Proving Hybrid Protocols Correct

    7. No Access

      Book Chapter

      Pages 121-125

      Nested General Recursion and Partiality in Type Theory

    8. No Access

      Book Chapter

      Pages 136-153

      A Higher-Order Calculus for Categories

    9. No Access

      Book Chapter

      Pages 154-168

      Certifying the Fast Fourier Transform with Coq

    10. No Access

      Book Chapter

      Pages 169-184

      A Generic Library for Floating-Point Numbers and Its Application to Exact Computing

    11. No Access

      Book Chapter

      Pages 185-200

      Ordinal Arithmetic: A Case Study for Rippling in a Higher Order Domain

    12. No Access

      Book Chapter

      Pages 201-216

      Abstraction and Refinement in Higher Order Logic

    13. No Access

      Book Chapter

      Pages 217-232

      A Framework for the Formalisation of Pi Calculus Type Systems in Isabelle/HOL

    14. No Access

      Book Chapter

      Pages 233-248

      Representing Hierarchical Automata in Interactive Theorem Provers

    15. No Access

      Book Chapter

      Pages 249-260

      Refinement Calculus for Logic Programming in Isabelle/HOL

    16. No Access

      Book Chapter

      Pages 265-280

      Predicate Subtyping with Predicate Sets

    17. No Access

      Book Chapter

      Pages 281-296

      A Structural Embedding of Ocsid in PVS

previous Page of 2