Skip Navigation

The Computer Journal 1982 25(2):176-182; doi:10.1093/comjnl/25.2.176
© 1982 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 Lee, G.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

DOPLs: A New Style of Programming

G. Lee *

Department of Computer Science, University of Western Australia, Nedlands, Australia

A new and completely different type of general-purpose programming language, called an operand-Description Oriented Programming Language is discussed. Using this type of language, methods of formulating algorithms in as transparent, natural and high-level a way as possible are advocated. These methods are illustrated by presenting a DOPL program for the Sieve of Eratosthenes prime-number-generation algorithm that captures its very essence, and that is closely related to an informal explanation of the algorithm. This program, although procedural, uses no variables or conventional control and data structures. Instead of such facilities, the DOPL program uses a new, and more transparent, programming-language construct known as an operand description, one purpose of which is to describe the entire sequence of operands to which an operator is to be applied. The DOPL program is compared with Pascal and SETL versions which are less transparent. The reasons for the differences in transparency relate to the different ways in which operand information is given, and to the limitations imposed on transparency when the sole operand-description facilities available are identifiers and names for individual operands.

Received August 1980.

* Department of Computer Science, University of Western Australia, Nedlands W.A. 6009, Australia


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.