Skip Navigation

The Computer Journal 1987 30(1):27-36; doi:10.1093/comjnl/30.1.27
© 1987 by British Computer Society
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 Similar articles in ISI Web of Science
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 Backhouse, R.
Right arrow Articles by Khamiss, A.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

A While-rule in Martin-Löf's Theory of Types

R. Backhouse * and A. Khamiss

Department of Computer Science, University of Essex, Colchester CO4 3SQ, UK

The use of invariant properties and bound functions is a sound and well-documented methodology for this design of loop structures. We show how to formulate the methodology as a proposition in the intuitionistic theory of types developed by Per Martin-Löf. By proving the validity of this proposition we effectively obtain a method of writing while-statements in Type Theory. Two simple and well-known examples are given to illustrate the method.

Received July 1985.

* To whom correspondence should be addressed.

§ Department of Computer Science, University of Essex, Colchester CO4 3SQ


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.