03692nmm a2200409 u 4500001001200000003002700012005001700039007002400056008004100080020001800121100003300139245021600172250001700388260006300405300003300468505158800501653001702089653004402106653002502150653002302175653002502198653002802223653003902251653002802290653001702318653003602335653001902371700002602390700002902416710003402445041001902479989003802498490003802536856006502574082001202639520063102651EB000659810EBX0100000000000000051289200000000000000.0cr|||||||||||||||||||||140122 ||| eng a97835407064101 aWright, Joakim vone[editor]00aTheorem Proving in Higher Order LogicshElektronische Ressourceb9th International Conference, TPHOLs'96, Turku, Finland, August 26 - 30, 1996, Proceedingscedited by Joakim von Wright, Jim Grundy, John Harrison a1st ed. 1996 aBerlin, HeidelbergbSpringer Berlin Heidelbergc1996, 1996 aVIII, 447 pbonline resource0 aTranslating 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. aLogic Design aMathematical Logic and Formal Languages aSoftware engineering aMathematical logic aSoftware Engineering aArtificial Intelligence aMathematical Logic and Foundations aArtificial intelligence aLogic design aLogics and Meanings of Programs aComputer logic1 aGrundy, Jime[editor]1 aHarrison, Johne[editor]2 aSpringerLink (Online service)07aeng2ISO 639-2 bSBAaSpringer Book Archives -20040 aLecture Notes in Computer Science uhttps://doi.org/10.1007/BFb0105392?nosfx=yxVerlag3Volltext0 a005.131 aThis 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