Skip Navigation

The Computer Journal 1989 32(1):63-67; doi:10.1093/comjnl/32.1.63
© 1989 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 Hutchinson, A.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Inheritance and kinds of slots

A. Hutchinson *

Department of Computing, King's College London, Strand, London WC2R 2LS, UK

Kinds of slots, also called koses, were introduced previously by the author. A kos represents a binary relation. When relations are specifically portrayed thus in a data base, then novel inheritance mechanisms become feasible.

Received May 1987. revised October 1987.

* Department of Computing, King's College London, Strand, London WC2R 2LS


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.