The HOL system is an LCF-style mechanized proof-assistant for conducting proofs in higher order logic. This paper discusses a proposal to extend the primitive basis of the logic un...
We propose an extension to Z whereby generic parameters may have their types partially constrained. Using this mechanism it becomes possible to dene in Z much of its own schema cal...
Samuel H. Valentine, Ian Toyn, Susan Stepney, Stev...
Homeomorphic Embedding (HEm) has proven to be very powerful for supervising termination of computations, provided that such computations are performed over a finite signature, i.e...
A model characterising strong normalisation for Klop’s extension of λ-calculus is presented. The main technical tools for this result are an inductive definition of strongly n...
The current trend in operating systems research is to allow applications to dynamically extend the kernel to improve application performance or extend functionality, but the most ...