Abstract
The programming of digital computers has been a major concern of mainframe manufacturers, academicians, computer users and software product manufacturers since the first marketable computers were produced. Most often, the machine execution order has been explicit at the level at which the machine is programmed. This paper takes as a premise that source statement ordering does not have to describe machine execution order. It describes a specific procedureless programming language that requires no ordering of the source program. This language includes primitives for performing calculations on sets. In this language statements are not executable. They are rules for defining sets. The paper concludes with a discussion of the usefulness of the language for a typical programming application.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
