Download
Download eBook for Free
| Format | File Size | Notes |
|---|---|---|
| PDF file | 0.8 MB | Use Adobe Acrobat Reader version 10 or higher for the best experience. |
Purchase
Purchase Print Copy
| Format | List Price | Price | |
|---|---|---|---|
| Add to Cart | Paperback26 pages | $20.00 | $16.00 20% Web Discount |
This Note examines the assertion that programs in von Neumann languages are difficult to synthesize and develops a new supporting argument. Frequently it is necessary to express in a programming language statements of the form "each of functions f1, ..., fn are to be computed for the same entity." Since von Neumann languages contain the destructive assignment operation, it is very difficult to express such statements in them. Applicative languages such as pure Lisp or Prolog do not contain destructive assignment, so such statements can be expressed easily in them. The Note should be useful to those interested in programming languages.
This report is part of the RAND Corporation Note series. The note was a product of the RAND Corporation from 1979 to 1993 that reported other outputs of sponsored research for general distribution.
This document and trademark(s) contained herein are protected by law. This representation of RAND intellectual property is provided for noncommercial use only. Unauthorized posting of this publication online is prohibited; linking directly to this product page is encouraged. Permission is required from RAND to reproduce, or reuse in another form, any of its research documents for commercial purposes. For information on reprint and reuse permissions, please visit www.rand.org/pubs/permissions.
The RAND Corporation is a nonprofit institution that helps improve policy and decisionmaking through research and analysis. RAND's publications do not necessarily reflect the opinions of its research clients and sponsors.