|Home||Online Resources||Table of Contents|
Journal of Logic and Computation, Volume 8, Issue 1: February 1998.
S-H Mirian-Hosseinabadi1 and R Turner2
1Department of Computer Science, University of Essex, Wivenhoe Park, Colchester, C04 3SQ, UK. E-mail: email@example.com, 2Department of Computer Science, University of Essex, Wivenhoe Park, Colchester, C04 3SQ, UK. E-mail: firstname.lastname@example.org
An approach to Z-style program specification is developed based upon a constructive version of Zermelo-Fraenkel set theory without replacement. The idea of obligation schema, an extension of Z-schema. is introduced, and an implementation of this notion presented which facilitates the abstraction of programs.
Keywords: Z, specification, type-theory, constructive, schema.