Theorem Proving in Higher Order Logics
Subtitle: 13th International Conference, TPHOLs 2000 Portland, OR, USA, August 14-18, 2000 Proceedings (Lecture Notes in Computer Science)
Contributors: Mark Aagaard (Editor); John Harrison (Editor)
Edition: 1 edition
Publisher: Springer
Published: September 6, 2000
Language: eng
Format: Paperback
Number of pages: 533
ISBN-13: 9783540678632
Subjects: Artificial intelligence; Computer architecture & logic design; Mathematical theory of computation; Programming languages; Programming - Software Development; Computers; Automata; Medical / Nursing; Programming - General; Computer Books: General; Congresses; Artificial Intelligence - General; General; Automated Deduction; Formal Methods; Hardware Verification; Higher Order Logic; Logic Design; Mathematical Logic; Mathematics / Logic; Model Checking; Computer Science; Automatic theorem proving
First sentence: Inductive type theories, as used in systems like Coq or Lego [11,14,4], provide a systematic approach to program recursive functions over inductive data-structures and to reason about these functions.
Description: 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.