Christopher P. Wadsworth

Learn More
Introduction LCF (Icqic for Caqmtable Functions) is a prcof generating system mnsisting of an interactive programing language MG (MetaLmguage) for mnducting prcofs in PPA (Polynmrphic Predicate A-calculus) , a deductive calculus suitable for the formalisation of reasoning almut recursively defined functions, in particular about the syntax, semantics and(More)
This paper demonstrates the utility of typed shared data abstractions as an effective high-level means of structuring and coordinating parallel programs. Access to data shared by concurrent processes is expressed through operations of shared abstract data types (SADTs). SADTs abstract low-level concerns of communication and synchronization. The exposition(More)
We have developed a theory of sharing which captures the behaviour of programs with respect to shared data into the framework of process algebra. The core theory can describe programs performing read and write access to unitary pieces of shared data. Extensions allow shared data to be decomposed and atomic copies to be made, reflecting the common operations(More)
I am grateful to Andy Pitts for discussions about extending the set-theoretic semantics of HOL, and to the reviewers for helpful comments on the presentation. I have found Andrews' book 1] invaluable in working out many of the technical details of the extension to HOL proposed here. This work was carried out at the University of Cambridge under SERC grant(More)
  • 1