Skip Navigation

The Computer Journal 1981 24(4):374-377; doi:10.1093/comjnl/24.4.374
© 1981 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 Sklenár, I.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Affine slices

I. Sklenár *

Institute of Physics, Czechoslovak Academy of Sciences, Na Slovance 2, Prague, Czechoslovakia

Affine slices are extensions of the ALGOL 68 notion of slice. Like ALGOL 68 slices, they permit the implementation of multiple values in a simple manner (using run-time descriptors) and also the addressing of a multiple value element by a linear expression. However, they also provide more general slicing possibilities such as the diagonal of a matrix, the reverse of a vector, transpose of a matrix and so on. A theorem is proved which makes possible the verification of the correctness of a particular affine slices. Syntax for affine slices is also discussed.

Received November 1979.

* Institute of Physics, Czechoslovak Academy of Sciences, Na Slovance 2, 180 40 Prague 8, Czechoslovakia


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.