Logo - springer
Slogan - springer

Computer Science - Theoretical Computer Science | Theorem Proving in Higher Order Logics - 9th International Conference, TPHOLs'96, Turku, Finland,

Theorem Proving in Higher Order Logics

9th International Conference, TPHOLs'96, Turku, Finland, August 26 - 30, 1996, Proceedings

Wright, Joakim von, Grundy, Jim, Harrison, John (Eds.)

1996, VIII, 447 pp.


Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.

You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.

After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.

ISBN 978-3-540-70641-0

digitally watermarked, no DRM

The eBook version of this title will be available soon

learn more about Springer eBooks

add to marked items

This book constitutes the refereed proceedings of the 9th International Conference on Theorem Proving in Higher Order Logics, TPHOL '96, held in Turku, Finland, in August 1996.
The 27 revised full papers included together with one invited paper were carefully selected from a total of 46 submissions. The topics addressed are theorem proving technology, proof automation and decision procedures, mechanized theorem proving, extensions of higher order logics, integration of external tools, novel applications, and others. All in all, the volume is an up-to-date report on the state of the art in this increasingly active field.

Content Level » Research

Keywords » Automatisches Schließen - Extension - Formale Methoden - Höherstufige Logiken - Logikentwurf - Theorembeweisen - automated reasoning - formal methods - higher-order logics - logic design - proof - proving - theorem proving

Related subjects » Artificial Intelligence - Hardware - Mathematics - Software Engineering - Theoretical Computer Science

Table of contents 

Translating specifications in VDM-SL to PVS.- A comparison of HOL and ALF formalizations of a categorical coherence theorem.- Modeling a hardware synthesis methodology in isabelle.- Inference rules for programming languages with side effects in expressions.- Deciding cryptographic protocol adequacy with HOL: The implementation.- Proving liveness of fair transition systems.- Program derivation using the refinement calculator.- A proof tool for reasoning about functional programs.- Coq and hardware verification: A case study.- Elements of mathematical analysis in PVS.- Implementation issues about the embedding of existing high level synthesis algorithms in HOL.- Five axioms of alpha-conversion.- Set theory, higher order logic or both?.- A mizar mode for HOL.- Stålmarck’s algorithm as a HOL derived rule.- Towards applying the composition principle to verify a microkernel operating system.- A modular coding of UNITY in COQ.- Importing mathematics from HOL into Nuprl.- A structure preserving encoding of Z in isabelle/HOL.- Improving the result of high-level synthesis using interactive transformational design.- Using lattice theory in higher order logic.- Formal verification of algorithm W: The monomorphic case.- Verification of compiler correctness for the WAM.- Synthetic domain theory in type theory: Another logic of computable functions.- Function definition in higher-order logic.- Higher-order annotated terms for proof search.- A comparison of MDG and HOL for hardware verification.- A mechanisation of computability theory in HOL.

Popular Content within this publication 



Read this Book on Springerlink

Services for this book

New Book Alert

Get alerted on new Springer publications in the subject area of Mathematical Logic and Formal Languages.