9. TPHOLs 1996:
Turku, Finland
Stephen H. Brackin:
Deciding Cryptographic Protocol Adequacy with HOL: The Implementation. 61-76
Holger Busch:
Proving Liveness of Fair Transition Systems. 77-92
Graham Collins:
A Proof Tool for Reasoning About Functional Programs. 109-124
John Harrison:
Stålmarck's Algorithm as a HOL Derived Rule. 221-234
Cornelia Pusch:
Verification of Compiler Correctness for the WAM. 347-361
Bernhard Reus:
Synthetic Domain Theory in Type Theory: Another Logic of Computable Functions. 365-380
Konrad Slind:
Function Definition in Higher-Order Logic. 381-397
Vincent Zammit:
A Mechanisation of Computability Theory in HOL. 431-446