Lecture Notes in Computer Science

Theorem Proving in Higher Order Logics

13th International Conference, TPHOLs 2000 Portland, OR, USA, August 14-18, 2000 Proceedings

Editors: Aagaard, Mark, Harrison, John (Eds.)

Buy this book

eBook $109.00
price for USA (gross)
  • ISBN 978-3-540-44659-0
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $139.00
price for USA
  • ISBN 978-3-540-67863-2
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
About this book

This volume is the proceedings of the 13th International Conference on Theo­ rem Proving in Higher Order Logics (TPHOLs 2000) held 14-18 August 2000 in Portland, Oregon, USA. Each of the 55 papers submitted in the full rese­ arch category was refereed by at least three reviewers who were selected by the program committee. Because of the limited space available in the program and proceedings, only 29 papers were accepted for presentation and publication in this volume. In keeping with tradition, TPHOLs 2000 also offered a venue for the presen­ tation 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 supplemen­ tary proceedings containing associated papers for work in progress was published by the Oregon Graduate Institute (OGI) as technical report CSE-00-009. The organizers are grateful to Bob Colwell, Robin Milner and Larry Wos for agreeing to give invited talks. Bob Colwell was the lead architect on the Intel P6 microarchitecture, which introduced a number of innovative techniques and achieved enormous commercial success. As such, he is ideally placed to offer an industrial perspective on the challenges for formal verification. Robin Milner contributed many key ideas to computer theorem proving, and to functional programming, through his leadership of the influential Edinburgh LCF project.

Table of contents (33 chapters)

  • Fix-Point Equations for Well-Founded Recursion in Type Theory

    Balaa, Antonia (et al.)

    Pages 1-16

  • Programming and Computing in HOL

    Barras, Bruno

    Pages 17-37

  • Proof Terms for Simply Typed Higher Order Logic

    Berghofer, Stefan (et al.)

    Pages 38-52

  • Routing Information Protocol in HOL/SPIN

    Bhargavan, Karthikeyan (et al.)

    Pages 53-72

  • Recursive Families of Inductive Types

    Capretta, Venanzio

    Pages 73-89

Buy this book

eBook $109.00
price for USA (gross)
  • ISBN 978-3-540-44659-0
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $139.00
price for USA
  • ISBN 978-3-540-67863-2
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Loading...

Recommended for you

Loading...

Bibliographic Information

Bibliographic Information
Book Title
Theorem Proving in Higher Order Logics
Book Subtitle
13th International Conference, TPHOLs 2000 Portland, OR, USA, August 14-18, 2000 Proceedings
Editors
  • Mark Aagaard
  • John Harrison
Series Title
Lecture Notes in Computer Science
Series Volume
1869
Copyright
2000
Publisher
Springer-Verlag Berlin Heidelberg
Copyright Holder
Springer-Verlag Berlin Heidelberg
eBook ISBN
978-3-540-44659-0
DOI
10.1007/3-540-44659-1
Softcover ISBN
978-3-540-67863-2
Series ISSN
0302-9743
Edition Number
1
Number of Pages
IX, 539
Topics