1.1 The Elements of Programming\u00a0<\/b><\/p>\n
A powerful programming language<\/a> is more than just a means for instructing a computer to perform tasks. The language also serves as a framework within which we organize our ideas about processes. Thus, when we describe a language, we should pay particular attention to the means that the language provides for combining simple ideas to form more complex ideas. Every powerful language has three mechanisms for accomplishing this:<\/p>\n In programming, we deal with two kinds of elements: procedures and data. (Later we will discover that they are really not so distinct.) Informally, data is \u201cstuff\u201d that we want to manipulate, and procedures are descriptions of the rules for manipulating the data<\/a>. Thus, any powerful programming language should be able to describe primitive data and primitive procedures and should have methods for combining and abstracting procedures and data.<\/p>\n In this chapter we will deal only with simple numerical data so that we can focus on the rules for building procedures. In later chapters we will see that these same rules allow us to build procedures tomanipulate compound data as well.<\/p>\n 1.1.1 Expressions\u00a0<\/b><\/p>\n One easy way to get started at programming is to examine some typical interactions with an interpreter for the Scheme<\/a> dialect of Lisp. Imagine that you are sitting at a computer terminal. You type an expression<\/i>, and the interpreter responds by displaying the result of its\u00a0evaluating\u00a0<\/i>that expression.<\/p>\n One kind of primitive expression you might type is a number. (More precisely, the expression that you type consists of the numerals that represent the number in base 10.) If you present Lisp<\/a> with a number<\/p>\n 486<\/p>\n the interpreter will respond by printing<\/p>\n 486<\/em><\/p>\n Expressions representing numbers may be combined with an expression representing a primitive procedure (such as + or *) to form a com- pound expression that represents the application of the procedure to those numbers. For example: (+ 137 349) 486<\/i><\/p>\n (- 1000 334) (* 5 99) (\/ 10 5) (+ 2.7 10) Expressions such as these, formed by delimiting a list of expressions within parentheses in order to denote procedure application, are called\u00a0combinations<\/i>. The leftmost element in the list is called the operator<\/i>, and the other elements are called\u00a0operands<\/i><\/a>. The value of a combination is obtained by applying the procedure specified by the operator to the arguments <\/i>that are the values of the operands.<\/p>\n The convention of placing the operator to the left of the operands is known as prefix notation<\/i>, and it may be somewhat confusing at first because it departs significantly from the customary mathematical convention. Prefix notation has several advantages, however. One of them is that it can accommodate procedures that may take an arbitrary number of arguments, as in the following examples:<\/p>\n (+ 21 35 12 7) (* 25 4 12)\n
\n666<\/i><\/p>\n
\n495<\/i><\/p>\n
\n2<\/i><\/p>\n
\n12.7<\/i><\/p>\n
\n75<\/i><\/p>\n
\n1200<\/i><\/p>\n