A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
A kernel specification formalism with higher-order parameterisation
[chapter]
1991
Lecture Notes in Computer Science
A speci cation formalism with parameterisation of an arbitrary order is presented. It is given a denotational-style semantics, accompanied by an inference system for proving that an object satis es a speci cation. The inference system incorporates, but is not limited to, a clearly identi ed type-checking component. Special e ort is made to carefully distinguish between parameterised speci cations, which denote functions yielding classes of objects, and speci cations of parameterised objects,
doi:10.1007/3-540-54496-8_15
fatcat:jbwqyr3doraw7bjksbimxt3u3q