Skip Navigation

Journal of Logic and Computation 1998 8(1):49-70; doi:10.1093/logcom/8.1.49
© 1998 by Oxford University Press
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by MIRIAN-HOSSEINABADI, S.-H.
Right arrow Articles by TURNER, R.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Original Articles

Constructive Z

SEYED-HASSAN MIRIAN-HOSSEINABADI and RAYMOND TURNER

Department of Computer Science, University of Essex Wivenhoe Park, Colchester, CO4 3SQ, UK E-mail: seymh{at}essex.ac.uk
Department of Computer Science, University of Essex Wivenhoe Park, Colchester, CO4 3SQ, UK E-mail: turnr{at}essex.ac.uk

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


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.