Copyright © 1996 by The Massachusetts Institute of Technology
Structure and Interpretation of Computer Programs
second edition
Harold Abelson and Gerald Jay Sussman
with Julie Sussman
foreword by Alan J. Perlis
The MIT Press
Cambridge, Massachusetts
London, England
McGraw-Hill Book Company
New York, St. Louis, San Francisco
Montreal, Toronto
This book is one of a series of texts written by faculty of the Electrical Engineering and Computer Science Department at the Massachusetts Institute of Technology. It was edited and produced by The MIT Press under a joint production-distribution arrangement with the McGraw-Hill Book Company.
Unofficial Texinfo Format 2.neilvandyke4 (January 10, 2007)
[ << ] | [ < ] | [ Up ] | [ > ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
This book is dedicated, in respect and admiration, to the spirit that lives in the computer.
“I think that it’s extraordinarily important that we in computer science keep fun in computing. When it started out, it was an awful lot of fun. Of course, the paying customers got shafted every now and then, and after a while we began to take their complaints seriously. We began to feel as if we really were responsible for the successful, error-free perfect use of these machines. I don’t think we are. I think we’re responsible for stretching them, setting them off in new directions, and keeping fun in the house. I hope the field of computer science never loses its sense of fun. Above all, I hope we don’t become missionaries. Don’t feel as if you’re Bible salesmen. The world has too many of those already. What you know about computing other people will learn. Don’t feel as if the key to successful computing is only in your hands. What’s in your hands, I think and hope, is intelligence: the ability to see the machine as more than when you were first led up to it, that you can make it more.”
—Alan J. Perlis (April 1, 1922 February 7, 1990)
[ << ] | [ < ] | [ Up ] | [ > ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
Educators, generals, dieticians, psychologists, and parents program. Armies, students, and some societies are programmed. An assault on large problems employs a succession of programs, most of which spring into existence en route. These programs are rife with issues that appear to be particular to the problem at hand. To appreciate programming as an intellectual activity in its own right you must turn to computer programming; you must read and write computer programs—many of them. It doesn’t matter much what the programs are about or what applications they serve. What does matter is how well they perform and how smoothly they fit with other programs in the creation of still greater programs. The programmer must seek both perfection of part and adequacy of collection. In this book the use of “program” is focused on the creation, execution, and study of programs written in a dialect of Lisp for execution on a digital computer. Using Lisp we restrict or limit not what we may program, but only the notation for our program descriptions.
Our traffic with the subject matter of this book involves us with three foci of phenomena: the human mind, collections of computer programs, and the computer. Every computer program is a model, hatched in the mind, of a real or mental process. These processes, arising from human experience and thought, are huge in number, intricate in detail, and at any time only partially understood. They are modeled to our permanent satisfaction rarely by our computer programs. Thus even though our programs are carefully handcrafted discrete collections of symbols, mosaics of interlocking functions, they continually evolve: we change them as our perception of the model deepens, enlarges, generalizes until the model ultimately attains a metastable place within still another model with which we struggle. The source of the exhilaration associated with computer programming is the continual unfolding within the mind and on the computer of mechanisms expressed as programs and the explosion of perception they generate. If art interprets our dreams, the computer executes them in the guise of programs!
For all its power, the computer is a harsh taskmaster. Its programs must be correct, and what we wish to say must be said accurately in every detail. As in every other symbolic activity, we become convinced of program truth through argument. Lisp itself can be assigned a semantics (another model, by the way), and if a program’s function can be specified, say, in the predicate calculus, the proof methods of logic can be used to make an acceptable correctness argument. Unfortunately, as programs get large and complicated, as they almost always do, the adequacy, consistency, and correctness of the specifications themselves become open to doubt, so that complete formal arguments of correctness seldom accompany large programs. Since large programs grow from small ones, it is crucial that we develop an arsenal of standard program structures of whose correctness we have become sure—we call them idioms—and learn to combine them into larger structures using organizational techniques of proven value. These techniques are treated at length in this book, and understanding them is essential to participation in the Promethean enterprise called programming. More than anything else, the uncovering and mastery of powerful organizational techniques accelerates our ability to create large, significant programs. Conversely, since writing large programs is very taxing, we are stimulated to invent new methods of reducing the mass of function and detail to be fitted into large programs.
Unlike programs, computers must obey the laws of physics. If they wish to perform rapidly—a few nanoseconds per state change—they must transmit electrons only small distances (at most 11 over 2 feet). The heat generated by the huge number of devices so concentrated in space has to be removed. An exquisite engineering art has been developed balancing between multiplicity of function and density of devices. In any event, hardware always operates at a level more primitive than that at which we care to program. The processes that transform our Lisp programs to “machine” programs are themselves abstract models which we program. Their study and creation give a great deal of insight into the organizational programs associated with programming arbitrary models. Of course the computer itself can be so modeled. Think of it: the behavior of the smallest physical switching element is modeled by quantum mechanics described by differential equations whose detailed behavior is captured by numerical approximations represented in computer programs executing on computers composed of …!
It is not merely a matter of tactical convenience to separately identify the three foci. Even though, as they say, it’s all in the head, this logical separation induces an acceleration of symbolic traffic between these foci whose richness, vitality, and potential is exceeded in human experience only by the evolution of life itself. At best, relationships between the foci are metastable. The computers are never large enough or fast enough. Each breakthrough in hardware technology leads to more massive programming enterprises, new organizational principles, and an enrichment of abstract models. Every reader should ask himself periodically “Toward what end, toward what end?”—but do not ask it too often lest you pass up the fun of programming for the constipation of bittersweet philosophy.
Among the programs we write, some (but never enough) perform a precise mathematical function such as sorting or finding the maximum of a sequence of numbers, determining primality, or finding the square root. We call such programs algorithms, and a great deal is known of their optimal behavior, particularly with respect to the two important parameters of execution time and data storage requirements. A programmer should acquire good algorithms and idioms. Even though some programs resist precise specifications, it is the responsibility of the programmer to estimate, and always to attempt to improve, their performance.
Lisp is a survivor, having been in use for about a quarter of a century. Among the active programming languages only Fortran has had a longer life. Both languages have supported the programming needs of important areas of application, Fortran for scientific and engineering computation and Lisp for artificial intelligence. These two areas continue to be important, and their programmers are so devoted to these two languages that Lisp and Fortran may well continue in active use for at least another quarter-century.
Lisp changes. The Scheme dialect used in this text has evolved from the original Lisp and differs from the latter in several important ways, including static scoping for variable binding and permitting functions to yield functions as values. In its semantic structure Scheme is as closely akin to Algol 60 as to early Lisps. Algol 60, never to be an active language again, lives on in the genes of Scheme and Pascal. It would be difficult to find two languages that are the communicating coin of two more different cultures than those gathered around these two languages. Pascal is for building pyramids—imposing, breathtaking, static structures built by armies pushing heavy blocks into place. Lisp is for building organisms—imposing, breathtaking, dynamic structures built by squads fitting fluctuating myriads of simpler organisms into place. The organizing principles used are the same in both cases, except for one extraordinarily important difference: The discretionary exportable functionality entrusted to the individual Lisp programmer is more than an order of magnitude greater than that to be found within Pascal enterprises. Lisp programs inflate libraries with functions whose utility transcends the application that produced them. The list, Lisp’s native data structure, is largely responsible for such growth of utility. The simple structure and natural applicability of lists are reflected in functions that are amazingly nonidiosyncratic. In Pascal the plethora of declarable data structures induces a specialization within functions that inhibits and penalizes casual cooperation. It is better to have 100 functions operate on one data structure than to have 10 functions operate on 10 data structures. As a result the pyramid must stand unchanged for a millennium; the organism must evolve or perish.
To illustrate this difference, compare the treatment of material and exercises within this book with that in any first-course text using Pascal. Do not labor under the illusion that this is a text digestible at MIT only, peculiar to the breed found there. It is precisely what a serious book on programming Lisp must be, no matter who the student is or where it is used.
Note that this is a text about programming, unlike most Lisp books, which are used as a preparation for work in artificial intelligence. After all, the critical programming concerns of software engineering and artificial intelligence tend to coalesce as the systems under investigation become larger. This explains why there is such growing interest in Lisp outside of artificial intelligence.
As one would expect from its goals, artificial intelligence research generates many significant programming problems. In other programming cultures this spate of problems spawns new languages. Indeed, in any very large programming task a useful organizing principle is to control and isolate traffic within the task modules via the invention of language. These languages tend to become less primitive as one approaches the boundaries of the system where we humans interact most often. As a result, such systems contain complex language-processing functions replicated many times. Lisp has such a simple syntax and semantics that parsing can be treated as an elementary task. Thus parsing technology plays almost no role in Lisp programs, and the construction of language processors is rarely an impediment to the rate of growth and change of large Lisp systems. Finally, it is this very simplicity of syntax and semantics that is responsible for the burden and freedom borne by all Lisp programmers. No Lisp program of any size beyond a few lines can be written without being saturated with discretionary functions. Invent and fit; have fits and reinvent! We toast the Lisp programmer who pens his thoughts within nests of parentheses.
Alan J. Perlis
New Haven, Connecticut
[ << ] | [ < ] | [ Up ] | [ > ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
Is it possible that software is not like anything else, that it is meant to be discarded: that the whole point is to always see it as a soap bubble?
—Alan J. Perlis
The material in this book has been the basis of MIT’s entry-level computer science subject since 1980. We had been teaching this material for four years when the first edition was published, and twelve more years have elapsed until the appearance of this second edition. We are pleased that our work has been widely adopted and incorporated into other texts. We have seen our students take the ideas and programs in this book and build them in as the core of new computer systems and languages. In literal realization of an ancient Talmudic pun, our students have become our builders. We are lucky to have such capable students and such accomplished builders.
In preparing this edition, we have incorporated hundreds of clarifications suggested by our own teaching experience and the comments of colleagues at MIT and elsewhere. We have redesigned most of the major programming systems in the book, including the generic-arithmetic system, the interpreters, the register-machine simulator, and the compiler; and we have rewritten all the program examples to ensure that any Scheme implementation conforming to the IEEE Scheme standard (IEEE 1990) will be able to run the code.
This edition emphasizes several new themes. The most important of these is the central role played by different approaches to dealing with time in computational models: objects with state, concurrent programming, functional programming, lazy evaluation, and nondeterministic programming. We have included new sections on concurrency and nondeterminism, and we have tried to integrate this theme throughout the book.
The first edition of the book closely followed the syllabus of our MIT one-semester subject. With all the new material in the second edition, it will not be possible to cover everything in a single semester, so the instructor will have to pick and choose. In our own teaching, we sometimes skip the section on logic programming (section Logic Programming), we have students use the register-machine simulator but we do not cover its implementation (section A Register-Machine Simulator), and we give only a cursory overview of the compiler (section Compilation). Even so, this is still an intense course. Some instructors may wish to cover only the first three or four chapters, leaving the other material for subsequent courses.
The World-Wide-Web site http://www-mitpress.mit.edu/sicp/ provides support for users of this book. This includes programs from the book, sample programming assignments, supplementary materials, and downloadable implementations of the Scheme dialect of Lisp.
[ << ] | [ < ] | [ Up ] | [ > ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
A computer is like a violin. You can imagine a novice trying first a phonograph and then a violin. The latter, he says, sounds terrible. That is the argument we have heard from our humanists and most of our computer scientists. Computer programs are good, they say, for particular purposes, but they aren’t flexible. Neither is a violin, or a typewriter, until you learn how to use it.
—Marvin Minsky, “Why Programming Is a Good Medium for Expressing Poorly-Understood and Sloppily-Formulated Ideas”
“The Structure and Interpretation of Computer Programs” is the entry-level subject in computer science at the Massachusetts Institute of Technology. It is required of all students at MIT who major in electrical engineering or in computer science, as one-fourth of the “common core curriculum,” which also includes two subjects on circuits and linear systems and a subject on the design of digital systems. We have been involved in the development of this subject since 1978, and we have taught this material in its present form since the fall of 1980 to between 600 and 700 students each year. Most of these students have had little or no prior formal training in computation, although many have played with computers a bit and a few have had extensive programming or hardware-design experience.
Our design of this introductory computer-science subject reflects two major concerns. First, we want to establish the idea that a computer language is not just a way of getting a computer to perform operations but rather that it is a novel formal medium for expressing ideas about methodology. Thus, programs must be written for people to read, and only incidentally for machines to execute. Second, we believe that the essential material to be addressed by a subject at this level is not the syntax of particular programming-language constructs, nor clever algorithms for computing particular functions efficiently, nor even the mathematical analysis of algorithms and the foundations of computing, but rather the techniques used to control the intellectual complexity of large software systems.
Our goal is that students who complete this subject should have a good feel for the elements of style and the aesthetics of programming. They should have command of the major techniques for controlling complexity in a large system. They should be capable of reading a 50-page-long program, if it is written in an exemplary style. They should know what not to read, and what they need not understand at any moment. They should feel secure about modifying a program, retaining the spirit and style of the original author.
These skills are by no means unique to computer programming. The techniques we teach and draw upon are common to all of engineering design. We control complexity by building abstractions that hide details when appropriate. We control complexity by establishing conventional interfaces that enable us to construct systems by combining standard, well-understood pieces in a “mix and match” way. We control complexity by establishing new languages for describing a design, each of which emphasizes particular aspects of the design and deemphasizes others.
Underlying our approach to this subject is our conviction that “computer science” is not a science and that its significance has little to do with computers. The computer revolution is a revolution in the way we think and in the way we express what we think. The essence of this change is the emergence of what might best be called procedural epistemology—the study of the structure of knowledge from an imperative point of view, as opposed to the more declarative point of view taken by classical mathematical subjects. Mathematics provides a framework for dealing precisely with notions of “what is.” Computation provides a framework for dealing precisely with notions of “how to.”
In teaching our material we use a dialect of the programming language Lisp. We never formally teach the language, because we don’t have to. We just use it, and students pick it up in a few days. This is one great advantage of Lisp-like languages: They have very few ways of forming compound expressions, and almost no syntactic structure. All of the formal properties can be covered in an hour, like the rules of chess. After a short time we forget about syntactic details of the language (because there are none) and get on with the real issues—figuring out what we want to compute, how we will decompose problems into manageable parts, and how we will work on the parts. Another advantage of Lisp is that it supports (but does not enforce) more of the large-scale strategies for modular decomposition of programs than any other language we know. We can make procedural and data abstractions, we can use higher-order functions to capture common patterns of usage, we can model local state using assignment and data mutation, we can link parts of a program with streams and delayed evaluation, and we can easily implement embedded languages. All of this is embedded in an interactive environment with excellent support for incremental program design, construction, testing, and debugging. We thank all the generations of Lisp wizards, starting with John McCarthy, who have fashioned a fine tool of unprecedented power and elegance.
Scheme, the dialect of Lisp that we use, is an attempt to bring together the power and elegance of Lisp and Algol. From Lisp we take the metalinguistic power that derives from the simple syntax, the uniform representation of programs as data objects, and the garbage-collected heap-allocated data. From Algol we take lexical scoping and block structure, which are gifts from the pioneers of programming-language design who were on the Algol committee. We wish to cite John Reynolds and Peter Landin for their insights into the relationship of Church’s [lambda] calculus to the structure of programming languages. We also recognize our debt to the mathematicians who scouted out this territory decades before computers appeared on the scene. These pioneers include Alonzo Church, Barkley Rosser, Stephen Kleene, and Haskell Curry.
[ << ] | [ < ] | [ Up ] | [ > ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
We would like to thank the many people who have helped us develop this book and this curriculum.
Our subject is a clear intellectual descendant of “6.231,” a wonderful subject on programming linguistics and the [lambda] calculus taught at MIT in the late 1960s by Jack Wozencraft and Arthur Evans, Jr.
We owe a great debt to Robert Fano, who reorganized MIT’s introductory curriculum in electrical engineering and computer science to emphasize the principles of engineering design. He led us in starting out on this enterprise and wrote the first set of subject notes from which this book evolved.
Much of the style and aesthetics of programming that we try to teach were developed in conjunction with Guy Lewis Steele Jr., who collaborated with Gerald Jay Sussman in the initial development of the Scheme language. In addition, David Turner, Peter Henderson, Dan Friedman, David Wise, and Will Clinger have taught us many of the techniques of the functional programming community that appear in this book.
Joel Moses taught us about structuring large systems. His experience with the Macsyma system for symbolic computation provided the insight that one should avoid complexities of control and concentrate on organizing the data to reflect the real structure of the world being modeled.
Marvin Minsky and Seymour Papert formed many of our attitudes about programming and its place in our intellectual lives. To them we owe the understanding that computation provides a means of expression for exploring ideas that would otherwise be too complex to deal with precisely. They emphasize that a student’s ability to write and modify programs provides a powerful medium in which exploring becomes a natural activity.
We also strongly agree with Alan Perlis that programming is lots of fun and we had better be careful to support the joy of programming. Part of this joy derives from observing great masters at work. We are fortunate to have been apprentice programmers at the feet of Bill Gosper and Richard Greenblatt.
It is difficult to identify all the people who have contributed to the development of our curriculum. We thank all the lecturers, recitation instructors, and tutors who have worked with us over the past fifteen years and put in many extra hours on our subject, especially Bill Siebert, Albert Meyer, Joe Stoy, Randy Davis, Louis Braida, Eric Grimson, Rod Brooks, Lynn Stein, and Peter Szolovits. We would like to specially acknowledge the outstanding teaching contributions of Franklyn Turbak, now at Wellesley; his work in undergraduate instruction set a standard that we can all aspire to. We are grateful to Jerry Saltzer and Jim Miller for helping us grapple with the mysteries of concurrency, and to Peter Szolovits and David McAllester for their contributions to the exposition of nondeterministic evaluation in Metalinguistic Abstraction.
Many people have put in significant effort presenting this material at other universities. Some of the people we have worked closely with are Jacob Katzenelson at the Technion, Hardy Mayer at the University of California at Irvine, Joe Stoy at Oxford, Elisha Sacks at Purdue, and Jan Komorowski at the Norwegian University of Science and Technology. We are exceptionally proud of our colleagues who have received major teaching awards for their adaptations of this subject at other universities, including Kenneth Yip at Yale, Brian Harvey at the University of California at Berkeley, and Dan Huttenlocher at Cornell.
Al Moyé arranged for us to teach this material to engineers at Hewlett-Packard, and for the production of videotapes of these lectures. We would like to thank the talented instructors—in particular Jim Miller, Bill Siebert, and Mike Eisenberg—who have designed continuing education courses incorporating these tapes and taught them at universities and industry all over the world.
Many educators in other countries have put in significant work translating the first edition. Michel Briand, Pierre Chamard, and André Pic produced a French edition; Susanne Daniels-Herold produced a German edition; and Fumio Motoyoshi produced a Japanese edition. We do not know who produced the Chinese edition, but we consider it an honor to have been selected as the subject of an “unauthorized” translation.
It is hard to enumerate all the people who have made technical contributions to the development of the Scheme systems we use for instructional purposes. In addition to Guy Steele, principal wizards have included Chris Hanson, Joe Bowbeer, Jim Miller, Guillermo Rozas, and Stephen Adams. Others who have put in significant time are Richard Stallman, Alan Bawden, Kent Pitman, Jon Taft, Neil Mayle, John Lamping, Gwyn Osnos, Tracy Larrabee, George Carrette, Soma Chaudhuri, Bill Chiarchiaro, Steven Kirsch, Leigh Klotz, Wayne Noss, Todd Cass, Patrick O’Donnell, Kevin Theobald, Daniel Weise, Kenneth Sinclair, Anthony Courtemanche, Henry M. Wu, Andrew Berlin, and Ruth Shyu.
Beyond the MIT implementation, we would like to thank the many people who worked on the IEEE Scheme standard, including William Clinger and Jonathan Rees, who edited the R^4RS, and Chris Haynes, David Bartley, Chris Hanson, and Jim Miller, who prepared the IEEE standard.
Dan Friedman has been a long-time leader of the Scheme community. The community’s broader work goes beyond issues of language design to encompass significant educational innovations, such as the high-school curriculum based on EdScheme by Schemer’s Inc., and the wonderful books by Mike Eisenberg and by Brian Harvey and Matthew Wright.
We appreciate the work of those who contributed to making this a real book, especially Terry Ehling, Larry Cohen, and Paul Bethge at the MIT Press. Ella Mazel found the wonderful cover image. For the second edition we are particularly grateful to Bernard and Ella Mazel for help with the book design, and to David Jones, TeX wizard extraordinaire. We also are indebted to those readers who made penetrating comments on the new draft: Jacob Katzenelson, Hardy Mayer, Jim Miller, and especially Brian Harvey, who did unto this book as Julie did unto his book Simply Scheme.
Finally, we would like to acknowledge the support of the organizations that have encouraged this work over the years, including suppport from Hewlett-Packard, made possible by Ira Goldstein and Joel Birnbaum, and support from DARPA, made possible by Bob Kahn.
[ << ] | [ < ] | [ Up ] | [ > ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
The acts of the mind, wherein it exerts its power over simple ideas, are chiefly these three: 1. Combining several simple ideas into one compound one, and thus all complex ideas are made. 2. The second is bringing two ideas, whether simple or complex, together, and setting them by one another so as to take a view of them at once, without uniting them into one, by which it gets all its ideas of relations. 3. The third is separating them from all other ideas that accompany them in their real existence: this is called abstraction, and thus all its general ideas are made.
—John Locke, An Essay Concerning Human Understanding (1690)
We are about to study the idea of a computational process. Computational processes are abstract beings that inhabit computers. As they evolve, processes manipulate other abstract things called data. The evolution of a process is directed by a pattern of rules called a program. People create programs to direct processes. In effect, we conjure the spirits of the computer with our spells.
A computational process is indeed much like a sorcerer’s idea of a spirit. It cannot be seen or touched. It is not composed of matter at all. However, it is very real. It can perform intellectual work. It can answer questions. It can affect the world by disbursing money at a bank or by controlling a robot arm in a factory. The programs we use to conjure processes are like a sorcerer’s spells. They are carefully composed from symbolic expressions in arcane and esoteric programming languages that prescribe the tasks we want our processes to perform.
A computational process, in a correctly working computer, executes programs precisely and accurately. Thus, like the sorcerer’s apprentice, novice programmers must learn to understand and to anticipate the consequences of their conjuring. Even small errors (usually called bugs or glitches) in programs can have complex and unanticipated consequences.
Fortunately, learning to program is considerably less dangerous than learning sorcery, because the spirits we deal with are conveniently contained in a secure way. Real-world programming, however, requires care, expertise, and wisdom. A small bug in a computer-aided design program, for example, can lead to the catastrophic collapse of an airplane or a dam or the self-destruction of an industrial robot.
Master software engineers have the ability to organize programs so that they can be reasonably sure that the resulting processes will perform the tasks intended. They can visualize the behavior of their systems in advance. They know how to structure programs so that unanticipated problems do not lead to catastrophic consequences, and when problems do arise, they can debug their programs. Well-designed computational systems, like well-designed automobiles or nuclear reactors, are designed in a modular manner, so that the parts can be constructed, replaced, and debugged separately.
We need an appropriate language for describing processes, and we will use for this purpose the programming language Lisp. Just as our everyday thoughts are usually expressed in our natural language (such as English, French, or Japanese), and descriptions of quantitative phenomena are expressed with mathematical notations, our procedural thoughts will be expressed in Lisp. Lisp was invented in the late 1950s as a formalism for reasoning about the use of certain kinds of logical expressions, called recursion equations, as a model for computation. The language was conceived by John McCarthy and is based on his paper “Recursive Functions of Symbolic Expressions and Their Computation by Machine” (McCarthy 1960).
Despite its inception as a mathematical formalism, Lisp is a practical programming language. A Lisp interpreter is a machine that carries out processes described in the Lisp language. The first Lisp interpreter was implemented by McCarthy with the help of colleagues and students in the Artificial Intelligence Group of the MIT Research Laboratory of Electronics and in the MIT Computation Center.(1) Lisp, whose name is an acronym for LISt Processing, was designed to provide symbol-manipulating capabilities for attacking programming problems such as the symbolic differentiation and integration of algebraic expressions. It included for this purpose new data objects known as atoms and lists, which most strikingly set it apart from all other languages of the period.
Lisp was not the product of a concerted design effort. Instead, it evolved informally in an experimental manner in response to users’ needs and to pragmatic implementation considerations. Lisp’s informal evolution has continued through the years, and the community of Lisp users has traditionally resisted attempts to promulgate any “official” definition of the language. This evolution, together with the flexibility and elegance of the initial conception, has enabled Lisp, which is the second oldest language in widespread use today (only Fortran is older), to continually adapt to encompass the most modern ideas about program design. Thus, Lisp is by now a family of dialects, which, while sharing most of the original features, may differ from one another in significant ways. The dialect of Lisp used in this book is called Scheme.(2)
Because of its experimental character and its emphasis on symbol manipulation, Lisp was at first very inefficient for numerical computations, at least in comparison with Fortran. Over the years, however, Lisp compilers have been developed that translate programs into machine code that can perform numerical computations reasonably efficiently. And for special applications, Lisp has been used with great effectiveness.(3) Although Lisp has not yet overcome its old reputation as hopelessly inefficient, Lisp is now used in many applications where efficiency is not the central concern. For example, Lisp has become a language of choice for operating-system shell languages and for extension languages for editors and computer-aided design systems.
If Lisp is not a mainstream language, why are we using it as the framework for our discussion of programming? Because the language possesses unique features that make it an excellent medium for studying important programming constructs and data structures and for relating them to the linguistic features that support them. The most significant of these features is the fact that Lisp descriptions of processes, called procedures, can themselves be represented and manipulated as Lisp data. The importance of this is that there are powerful program-design techniques that rely on the ability to blur the traditional distinction between “passive” data and “active” processes. As we shall discover, Lisp’s flexibility in handling procedures as data makes it one of the most convenient languages in existence for exploring these techniques. The ability to represent procedures as data also makes Lisp an excellent language for writing programs that must manipulate other programs as data, such as the interpreters and compilers that support computer languages. Above and beyond these considerations, programming in Lisp is great fun.
1.1 The Elements of Programming | ||
1.2 Procedures and the Processes They Generate | ||
1.3 Formulating Abstractions with Higher-Order Procedures |
[ << ] | [ < ] | [ Up ] | [ > ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
A powerful programming language 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:
which represent the simplest entities the language is concerned with,
by which compound elements are built from simpler ones, and
by which compound elements can be named and manipulated as units.
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 “stuff” that we want to manipulate, and procedures are descriptions of the rules for manipulating the data. 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.
In this chapter we will deal only with simple numerical data so that we can focus on the rules for building procedures.(4) In later chapters we will see that these same rules allow us to build procedures to manipulate compound data as well.
[ << ] | [ < ] | [ Up ] | [ > ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
One easy way to get started at programming is to examine some typical interactions with an interpreter for the Scheme dialect of Lisp. Imagine that you are sitting at a computer terminal. You type an expression, and the interpreter responds by displaying the result of its evaluating that expression.
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 with a number
486
the interpreter will respond by printing (5)
486
Expressions representing numbers may be combined with an expression
representing a primitive procedure (such as +
or *
) to form a
compound expression that represents the application of the procedure to those
numbers. For example:
(+ 137 349) 486 (- 1000 334) 666 (* 5 99) 495 (/ 10 5) 2 (+ 2.7 10) 12.7
Expressions such as these, formed by delimiting a list of expressions within parentheses in order to denote procedure application, are called combinations. The leftmost element in the list is called the operator, and the other elements are called operands. The value of a combination is obtained by applying the procedure specified by the operator to the arguments that are the values of the operands.
The convention of placing the operator to the left of the operands is known as prefix notation, 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:
(+ 21 35 12 7) 75 (* 25 4 12) 1200
No ambiguity can arise, because the operator is always the leftmost element and the entire combination is delimited by the parentheses.
A second advantage of prefix notation is that it extends in a straightforward way to allow combinations to be nested, that is, to have combinations whose elements are themselves combinations:
(+ (* 3 5) (- 10 6)) 19
There is no limit (in principle) to the depth of such nesting and to the overall complexity of the expressions that the Lisp interpreter can evaluate. It is we humans who get confused by still relatively simple expressions such as
(+ (* 3 (+ (* 2 4) (+ 3 5))) (+ (- 10 7) 6))
which the interpreter would readily evaluate to be 57. We can help ourselves by writing such an expression in the form
(+ (* 3 (+ (* 2 4) (+ 3 5))) (+ (- 10 7) 6))
following a formatting convention known as pretty-printing, in which each long combination is written so that the operands are aligned vertically. The resulting indentations display clearly the structure of the expression.(6)
Even with complex expressions, the interpreter always operates in the same basic cycle: It reads an expression from the terminal, evaluates the expression, and prints the result. This mode of operation is often expressed by saying that the interpreter runs in a read-eval-print loop. Observe in particular that it is not necessary to explicitly instruct the interpreter to print the value of the expression.(7)
[ << ] | [ < ] | [ Up ] | [ > ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
A critical aspect of a programming language is the means it provides for using names to refer to computational objects. We say that the name identifies a variable whose value is the object.
In the Scheme dialect of Lisp, we name things with define
. Typing
(define size 2)
causes the interpreter to associate the value 2 with the name
size
.(8) Once
the name size
has been associated with the number 2, we can refer to the
value 2 by name:
size 2 (* 5 size) 10
Here are further examples of the use of define
:
(define pi 3.14159) (define radius 10) (* pi (* radius radius)) 314.159 (define circumference (* 2 pi radius)) circumference 62.8318
Define
is our language’s simplest means of abstraction, for it allows us
to use simple names to refer to the results of compound operations, such as the
circumference
computed above. In general, computational objects may
have very complex structures, and it would be extremely inconvenient to have to
remember and repeat their details each time we want to use them. Indeed,
complex programs are constructed by building, step by step, computational
objects of increasing complexity. The interpreter makes this step-by-step
program construction particularly convenient because name-object associations
can be created incrementally in successive interactions. This feature
encourages the incremental development and testing of programs and is largely
responsible for the fact that a Lisp program usually consists of a large number
of relatively simple procedures.
It should be clear that the possibility of associating values with symbols and later retrieving them means that the interpreter must maintain some sort of memory that keeps track of the name-object pairs. This memory is called the environment (more precisely the global environment, since we will see later that a computation may involve a number of different environments).(9)
[ << ] | [ < ] | [ Up ] | [ > ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
One of our goals in this chapter is to isolate issues about thinking procedurally. As a case in point, let us consider that, in evaluating combinations, the interpreter is itself following a procedure.
To evaluate a combination, do the following:
- Evaluate the subexpressions of the combination.
- Apply the procedure that is the value of the leftmost subexpression (the operator) to the arguments that are the values of the other subexpressions (the operands).
Even this simple rule illustrates some important points about processes in general. First, observe that the first step dictates that in order to accomplish the evaluation process for a combination we must first perform the evaluation process on each element of the combination. Thus, the evaluation rule is recursive in nature; that is, it includes, as one of its steps, the need to invoke the rule itself.(10)
Notice how succinctly the idea of recursion can be used to express what, in the case of a deeply nested combination, would otherwise be viewed as a rather complicated process. For example, evaluating
(* (+ 2 (* 4 6)) (+ 3 5 7))
requires that the evaluation rule be applied to four different combinations. We can obtain a picture of this process by representing the combination in the form of a tree, as shown in Figure 1-1. Each combination is represented by a node with branches corresponding to the operator and the operands of the combination stemming from it. The terminal nodes (that is, nodes with no branches stemming from them) represent either operators or numbers. Viewing evaluation in terms of the tree, we can imagine that the values of the operands percolate upward, starting from the terminal nodes and then combining at higher and higher levels. In general, we shall see that recursion is a very powerful technique for dealing with hierarchical, treelike objects. In fact, the “percolate values upward” form of the evaluation rule is an example of a general kind of process known as tree accumulation.
Figure 1.1: Tree representation, showing the value of each subcombination.
390 /|\____________ / | \ * 26 15 /|\ | / | \ // \\ + 2 24 / | | \ /|\ + 3 5 7 / | \ * 4 6
Next, observe that the repeated application of the first step brings us to the point where we need to evaluate, not combinations, but primitive expressions such as numerals, built-in operators, or other names. We take care of the primitive cases by stipulating that
We may regard the second rule as a special case of the third one by stipulating
that symbols such as +
and *
are also included in the global
environment, and are associated with the sequences of machine instructions that
are their “values.” The key point to notice is the role of the environment
in determining the meaning of the symbols in expressions. In an interactive
language such as Lisp, it is meaningless to speak of the value of an expression
such as (+ x 1)
without specifying any information about the environment
that would provide a meaning for the symbol x
(or even for the symbol
+
). As we shall see in Modularity, Objects, and State, the general notion of the
environment as providing a context in which evaluation takes place will play an
important role in our understanding of program execution.
Notice that the evaluation rule given above does not handle definitions. For
instance, evaluating (define x 3)
does not apply define
to two
arguments, one of which is the value of the symbol x
and the other of
which is 3, since the purpose of the define
is precisely to associate
x
with a value. (That is, (define x 3)
is not a combination.)
Such exceptions to the general evaluation rule are called
forms
special
forms. Define
is the only example of a special form that we have seen
so far, but we will meet others shortly. Each special form has its own
evaluation rule. The various kinds of expressions (each with its associated
evaluation rule) constitute the syntax of the programming language. In
comparison with most other programming languages, Lisp has a very simple
syntax; that is, the evaluation rule for expressions can be described by a
simple general rule together with specialized rules for a small number of
special forms.(11)
[ << ] | [ < ] | [ Up ] | [ > ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
We have identified in Lisp some of the elements that must appear in any powerful programming language:
Now we will learn about procedure definitions, a much more powerful abstraction technique by which a compound operation can be given a name and then referred to as a unit.
We begin by examining how to express the idea of “squaring.” We might say, “To square something, multiply it by itself.” This is expressed in our language as
(define (square x) (* x x))
We can understand this in the following way:
(define (square x) (* x x)) | | | | | | To square something, multiply it by itself.
We have here a
compound procedure, which has been given the name
square
. The procedure represents the operation of multiplying something
by itself. The thing to be multiplied is given a local name, x
, which
plays the same role that a pronoun plays in natural language. Evaluating the
definition creates this compound procedure and associates it with the name
square
.(12)
The general form of a procedure definition is
(define (<name> <formal parameters>) <body>)
The <name> is a symbol to be associated with the procedure definition in the environment.(13) The <formal parameters> are the names used within the body of the procedure to refer to the corresponding arguments of the procedure. The <body> is an expression that will yield the value of the procedure application when the formal parameters are replaced by the actual arguments to which the procedure is applied.(14) The <name> and the <formal parameters> are grouped within parentheses, just as they would be in an actual call to the procedure being defined.
Having defined square
, we can now use it:
(square 21) 441 (square (+ 2 5)) 49 (square (square 3)) 81
We can also use square
as a building block in defining other procedures.
For example, x^2 + y^2 can be expressed as
(+ (square x) (square y))
We can easily define a procedure sum-of-squares
that, given any two
numbers as arguments, produces the sum of their squares:
(define (sum-of-squares x y) (+ (square x) (square y))) (sum-of-squares 3 4) 25
Now we can use sum-of-squares
as a building block in constructing
further procedures:
(define (f a) (sum-of-squares (+ a 1) (* a 2))) (f 5) 136
Compound procedures are used in exactly the same way as primitive procedures.
Indeed, one could not tell by looking at the definition of
sum-of-squares
given above whether square
was built into the
interpreter, like +
and *
, or defined as a compound procedure.
[ << ] | [ < ] | [ Up ] | [ > ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
To evaluate a combination whose operator names a compound procedure, the interpreter follows much the same process as for combinations whose operators name primitive procedures, which we described in section Evaluating Combinations. That is, the interpreter evaluates the elements of the combination and applies the procedure (which is the value of the operator of the combination) to the arguments (which are the values of the operands of the combination).
We can assume that the mechanism for applying primitive procedures to arguments is built into the interpreter. For compound procedures, the application process is as follows:
To apply a compound procedure to arguments, evaluate the body of the procedure with each formal parameter replaced by the corresponding argument.
To illustrate this process, let’s evaluate the combination
(f 5)
where f
is the procedure defined in section Compound Procedures. We begin by
retrieving the body of f
:
(sum-of-squares (+ a 1) (* a 2))
Then we replace the formal parameter a
by the argument 5:
(sum-of-squares (+ 5 1) (* 5 2))
Thus the problem reduces to the evaluation of a combination with two operands
and an operator sum-of-squares
. Evaluating this combination involves
three subproblems. We must evaluate the operator to get the procedure to be
applied, and we must evaluate the operands to get the arguments. Now (+
5 1)
produces 6 and (* 5 2)
produces 10, so we must apply the
sum-of-squares
procedure to 6 and 10. These values are substituted for
the formal parameters x
and y
in the body of
sum-of-squares
, reducing the expression to
(+ (square 6) (square 10))
If we use the definition of square
, this reduces to
(+ (* 6 6) (* 10 10))
which reduces by multiplication to
(+ 36 100)
and finally to
136
The process we have just described is called the substitution model for procedure application. It can be taken as a model that determines the “meaning” of procedure application, insofar as the procedures in this chapter are concerned. However, there are two points that should be stressed:
According to the description of evaluation given in section Evaluating Combinations, the
interpreter first evaluates the operator and operands and then applies the
resulting procedure to the resulting arguments. This is not the only way to
perform evaluation. An alternative evaluation model would not evaluate the
operands until their values were needed. Instead it would first substitute
operand expressions for parameters until it obtained an expression involving
only primitive operators, and would then perform the evaluation. If we used
this method, the evaluation of (f 5)
would proceed according to the
sequence of expansions
(sum-of-squares (+ 5 1) (* 5 2)) (+ (square (+ 5 1)) (square (* 5 2)) ) (+ (* (+ 5 1) (+ 5 1)) (* (* 5 2) (* 5 2)))
followed by the reductions
(+ (* 6 6) (* 10 10)) (+ 36 100) 136
This gives the same answer as our previous evaluation model, but the process is
different. In particular, the evaluations of (+ 5 1)
and (* 5 2)
are each performed twice here, corresponding to the reduction of the expression
(* x x)
with x
replaced respectively by (+ 5 1)
and
(* 5 2)
.
This alternative “fully expand and then reduce” evaluation method is known as normal-order evaluation, in contrast to the “evaluate the arguments and then apply” method that the interpreter actually uses, which is called applicative-order evaluation. It can be shown that, for procedure applications that can be modeled using substitution (including all the procedures in the first two chapters of this book) and that yield legitimate values, normal-order and applicative-order evaluation produce the same value. (See Exercise 1-5 for an instance of an “illegitimate” value where normal-order and applicative-order evaluation do not give the same result.)
Lisp uses applicative-order evaluation, partly because of the additional
efficiency obtained from avoiding multiple evaluations of expressions such as
those illustrated with (+ 5 1)
and (* 5 2)
above and, more
significantly, because normal-order evaluation becomes much more complicated to
deal with when we leave the realm of procedures that can be modeled by
substitution. On the other hand, normal-order evaluation can be an extremely
valuable tool, and we will investigate some of its implications in Modularity, Objects, and State and Metalinguistic Abstraction.(16)
[ << ] | [ < ] | [ Up ] | [ > ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
The expressive power of the class of procedures that we can define at this point is very limited, because we have no way to make tests and to perform different operations depending on the result of a test. For instance, we cannot define a procedure that computes the absolute value of a number by testing whether the number is positive, negative, or zero and taking different actions in the different cases according to the rule
/ | x if x > 0 |x| = < 0 if x = 0 | -x if x < 0 \
This construct is called a
case analysis, and there is a special form
in Lisp for notating such a case analysis. It is called cond
(which
stands for “conditional”), and it is used as follows:
(define (abs x) (cond ((> x 0) x) ((= x 0) 0) ((< x 0) (- x))))
The general form of a conditional expression is
(cond (<p1> <e1>) (<p2> <e2>) … (<pn> <en>))
consisting of the symbol cond
followed by parenthesized pairs of
expressions
(<p> <e>)
called clauses. The first expression in each pair is a predicate—that is, an expression whose value is interpreted as either true or false.(17)
Conditional expressions are evaluated as follows. The predicate <p1> is
evaluated first. If its value is false, then <p2> is evaluated. If
<p2>’s value is also false, then <p3> is evaluated. This process
continues until a predicate is found whose value is true, in which case the
interpreter returns the value of the corresponding
expression
consequent
expression <e> of the clause as the value of the conditional expression.
If none of the <p>’s is found to be true, the value of the cond
is
undefined.
The word
predicate is used for procedures that return true or false,
as well as for expressions that evaluate to true or false. The absolute-value
procedure abs
makes use of the primitive predicates >
, <
,
and =
.(18) These take two numbers as arguments and test whether the first
number is, respectively, greater than, less than, or equal to the second
number, returning true or false accordingly.
Another way to write the absolute-value procedure is
(define (abs x) (cond ((< x 0) (- x)) (else x)))
which could be expressed in English as “If x is less than zero return -
x; otherwise return x.” Else
is a special symbol that can be
used in place of the <p> in the final clause of a cond
. This
causes the cond
to return as its value the value of the corresponding
<e> whenever all previous clauses have been bypassed. In fact, any
expression that always evaluates to a true value could be used as the <p>
here.
Here is yet another way to write the absolute-value procedure:
(define (abs x) (if (< x 0) (- x) x))
This uses the special form if
, a restricted type of conditional that can
be used when there are precisely two cases in the case analysis. The general
form of an if
expression is
(if <predicate> <consequent> <alternative>)
To evaluate an if
expression, the interpreter starts by evaluating the
<predicate> part of the expression. If the <predicate> evaluates
to a true value, the interpreter then evaluates the <consequent> and
returns its value. Otherwise it evaluates the <alternative> and returns
its value.(19)
In addition to primitive predicates such as <
, =
, and >
,
there are logical composition operations, which enable us to construct compound
predicates. The three most frequently used are these:
(and <e1> … <en>)
The interpreter evaluates the expressions <e> one at a time, in
left-to-right order. If any <e> evaluates to false, the value of the
and
expression is false, and the rest of the <e>’s are not
evaluated. If all <e>’s evaluate to true values, the value of the
and
expression is the value of the last one.
(or <e1> … <en>)
The interpreter evaluates the expressions <e> one at a time, in
left-to-right order. If any <e> evaluates to a true value, that value is
returned as the value of the or
expression, and the rest of the
<e>’s are not evaluated. If all <e>’s evaluate to false, the value
of the or
expression is false.
(not <e>)
The value of a not
expression is true when the expression <e>
evaluates to false, and false otherwise.
Notice that and
and or
are special forms, not procedures, because
the subexpressions are not necessarily all evaluated. Not
is an
ordinary procedure.
As an example of how these are used, the condition that a number x be in the range 5 < x < 10 may be expressed as
(and (> x 5) (< x 10))
As another example, we can define a predicate to test whether one number is greater than or equal to another as
(define (>= x y) (or (> x y) (= x y)))
or alternatively as
(define (>= x y) (not (< x y)))
Exercise 1.1: Below is a sequence of expressions. What is the result printed by the interpreter in response to each expression? Assume that the sequence is to be evaluated in the order in which it is presented.
10 (+ 5 3 4) (- 9 1) (/ 6 2) (+ (* 2 4) (- 4 6)) (define a 3) (define b (+ a 1)) (+ a b (* a b)) (= a b) (if (and (> b a) (< b (* a b))) b a) (cond ((= a 4) 6) ((= b 4) (+ 6 7 a)) (else 25)) (+ 2 (if (> b a) b a)) (* (cond ((> a b) a) ((< a b) b) (else -1)) (+ a 1))
Exercise 1.2: Translate the following expression into prefix form.
5 + 4 + (2 - (3 - (6 + 4/5))) ----------------------------- 3(6 - 2)(2 - 7)
Exercise 1.3: Define a procedure that takes three numbers as arguments and returns the sum of the squares of the two larger numbers.
Exercise 1.4: Observe that our model of evaluation allows for combinations whose operators are compound expressions. Use this observation to describe the behavior of the following procedure:
(define (a-plus-abs-b a b) ((if (> b 0) + -) a b))
Exercise 1.5: Ben Bitdiddle has invented a test to determine whether the interpreter he is faced with is using applicative-order evaluation or normal-order evaluation. He defines the following two procedures:
(define (p) (p)) (define (test x y) (if (= x 0) 0 y))Then he evaluates the expression
(test 0 (p))What behavior will Ben observe with an interpreter that uses applicative-order evaluation? What behavior will he observe with an interpreter that uses normal-order evaluation? Explain your answer. (Assume that the evaluation rule for the special form
if
is the same whether the interpreter is using normal or applicative order: The predicate expression is evaluated first, and the result determines whether to evaluate the consequent or the alternative expression.)
[ << ] | [ < ] | [ Up ] | [ > ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
Procedures, as introduced above, are much like ordinary mathematical functions. They specify a value that is determined by one or more parameters. But there is an important difference between mathematical functions and computer procedures. Procedures must be effective.
As a case in point, consider the problem of computing square roots. We can define the square-root function as
sqrt(x) = the y such that y >= 0 and y^2 = x
This describes a perfectly legitimate mathematical function. We could use it to recognize whether one number is the square root of another, or to derive facts about square roots in general. On the other hand, the definition does not describe a procedure. Indeed, it tells us almost nothing about how to actually find the square root of a given number. It will not help matters to rephrase this definition in pseudo-Lisp:
(define (sqrt x) (the y (and (>= y 0) (= (square y) x))))
This only begs the question.
The contrast between function and procedure is a reflection of the general distinction between describing properties of things and describing how to do things, or, as it is sometimes referred to, the distinction between declarative knowledge and imperative knowledge. In mathematics we are usually concerned with declarative (what is) descriptions, whereas in computer science we are usually concerned with imperative (how to) descriptions.(20)
How does one compute square roots? The most common way is to use Newton’s method of successive approximations, which says that whenever we have a guess y for the value of the square root of a number x, we can perform a simple manipulation to get a better guess (one closer to the actual square root) by averaging y with x/y.(21) For example, we can compute the square root of 2 as follows. Suppose our initial guess is 1:
Guess Quotient Average 1 (2/1) = 2 ((2 + 1)/2) = 1.5 1.5 (2/1.5) = 1.3333 ((1.3333 + 1.5)/2) = 1.4167 1.4167 (2/1.4167) = 1.4118 ((1.4167 + 1.4118)/2) = 1.4142 1.4142 ... ...
Continuing this process, we obtain better and better approximations to the square root.
Now let’s formalize the process in terms of procedures. We start with a value for the radicand (the number whose square root we are trying to compute) and a value for the guess. If the guess is good enough for our purposes, we are done; if not, we must repeat the process with an improved guess. We write this basic strategy as a procedure:
(define (sqrt-iter guess x) (if (good-enough? guess x) guess (sqrt-iter (improve guess x) x)))
A guess is improved by averaging it with the quotient of the radicand and the old guess:
(define (improve guess x) (average guess (/ x guess)))
where
(define (average x y) (/ (+ x y) 2))
We also have to say what we mean by “good enough.” The following will do for illustration, but it is not really a very good test. (See exercise Exercise 1-7.) The idea is to improve the answer until it is close enough so that its square differs from the radicand by less than a predetermined tolerance (here 0.001):(22)
(define (good-enough? guess x) (< (abs (- (square guess) x)) 0.001))
Finally, we need a way to get started. For instance, we can always guess that the square root of any number is 1:(23)
(define (sqrt x) (sqrt-iter 1.0 x))
If we type these definitions to the interpreter, we can use sqrt
just as
we can use any procedure:
(sqrt 9) 3.00009155413138 (sqrt (+ 100 37)) 11.704699917758145 (sqrt (+ (sqrt 2) (sqrt 3))) 1.7739279023207892 (square (sqrt 1000)) 1000.000369924366
The sqrt
program also illustrates that the simple procedural language we
have introduced so far is sufficient for writing any purely numerical program
that one could write in, say, C or Pascal. This might seem surprising, since
we have not included in our language any iterative (looping) constructs that
direct the computer to do something over and over again. Sqrt-iter
, on
the other hand, demonstrates how iteration can be accomplished using no special
construct other than the ordinary ability to call a procedure.(24)
Exercise 1.6: Alyssa P. Hacker doesn’t see why
if
needs to be provided as a special form. “Why can’t I just define it as an ordinary procedure in terms ofcond
?” she asks. Alyssa’s friend Eva Lu Ator claims this can indeed be done, and she defines a new version ofif
:(define (new-if predicate then-clause else-clause) (cond (predicate then-clause) (else else-clause)))Eva demonstrates the program for Alyssa:
(new-if (= 2 3) 0 5) 5 (new-if (= 1 1) 0 5) 0Delighted, Alyssa uses
new-if
to rewrite the square-root program:(define (sqrt-iter guess x) (new-if (good-enough? guess x) guess (sqrt-iter (improve guess x) x)))What happens when Alyssa attempts to use this to compute square roots? Explain.
Exercise 1.7: The
good-enough?
test used in computing square roots will not be very effective for finding the square roots of very small numbers. Also, in real computers, arithmetic operations are almost always performed with limited precision. This makes our test inadequate for very large numbers. Explain these statements, with examples showing how the test fails for small and large numbers. An alternative strategy for implementinggood-enough?
is to watch howguess
changes from one iteration to the next and to stop when the change is a very small fraction of the guess. Design a square-root procedure that uses this kind of end test. Does this work better for small and large numbers?
Exercise 1.8: Newton’s method for cube roots is based on the fact that if y is an approximation to the cube root of x, then a better approximation is given by the value
x/y^2 + 2y ---------- 3Use this formula to implement a cube-root procedure analogous to the square-root procedure. (In section Procedures as Returned Values we will see how to implement Newton’s method in general as an abstraction of these square-root and cube-root procedures.)
[ << ] | [ < ] | [ Up ] | [ > ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
Sqrt
is our first example of a process defined by a set of mutually
defined procedures. Notice that the definition of sqrt-iter
is
recursive; that is, the procedure is defined in terms of itself. The
idea of being able to define a procedure in terms of itself may be disturbing;
it may seem unclear how such a “circular” definition could make sense at all,
much less specify a well-defined process to be carried out by a computer. This
will be addressed more carefully in section Procedures and the Processes They Generate. But first let’s
consider some other important points illustrated by the sqrt
example.
Observe that the problem of computing square roots breaks up naturally into a
number of subproblems: how to tell whether a guess is good enough, how to
improve a guess, and so on. Each of these tasks is accomplished by a separate
procedure. The entire sqrt
program can be viewed as a cluster of
procedures (shown in Figure 1-2) that mirrors the decomposition of the
problem into subproblems.
Figure 1.2: Procedural decomposition of the
sqrt
program.sqrt | sqrt-iter / \ good-enough improve / \ | square abs average
The importance of this decomposition strategy is not simply that one is
dividing the program into parts. After all, we could take any large program
and divide it into parts—the first ten lines, the next ten lines, the next
ten lines, and so on. Rather, it is crucial that each procedure accomplishes
an identifiable task that can be used as a module in defining other procedures.
For example, when we define the good-enough?
procedure in terms of
square
, we are able to regard the square
procedure as a “black
box.” We are not at that moment concerned with how the procedure
computes its result, only with the fact that it computes the square. The
details of how the square is computed can be suppressed, to be considered at a
later time. Indeed, as far as the good-enough?
procedure is concerned,
square
is not quite a procedure but rather an abstraction of a
procedure, a so-called
procedural abstraction. At this level of
abstraction, any procedure that computes the square is equally good.
Thus, considering only the values they return, the following two procedures for squaring a number should be indistinguishable. Each takes a numerical argument and produces the square of that number as the value.(25)
(define (square x) (* x x)) (define (square x) (exp (double (log x)))) (define (double x) (+ x x))
So a procedure definition should be able to suppress detail. The users of the procedure may not have written the procedure themselves, but may have obtained it from another programmer as a black box. A user should not need to know how the procedure is implemented in order to use it.
One detail of a procedure’s implementation that should not matter to the user of the procedure is the implementer’s choice of names for the procedure’s formal parameters. Thus, the following procedures should not be distinguishable:
(define (square x) (* x x)) (define (square y) (* y y))
This principle—that the meaning of a procedure should be independent of the
parameter names used by its author—seems on the surface to be self-evident,
but its consequences are profound. The simplest consequence is that the
parameter names of a procedure must be local to the body of the procedure. For
example, we used square
in the definition of good-enough?
in our
square-root procedure:
(define (good-enough? guess x) (< (abs (- (square guess) x)) 0.001))
The intention of the author of good-enough?
is to determine if the
square of the first argument is within a given tolerance of the second
argument. We see that the author of good-enough?
used the name
guess
to refer to the first argument and x
to refer to the second
argument. The argument of square
is guess
. If the author of
square
used x
(as above) to refer to that argument, we see that
the x
in good-enough?
must be a different x
than the one
in square
. Running the procedure square
must not affect the
value of x
that is used by good-enough?
, because that value of
x
may be needed by good-enough?
after square
is done
computing.
If the parameters were not local to the bodies of their respective procedures,
then the parameter x
in square
could be confused with the
parameter x
in good-enough?
, and the behavior of
good-enough?
would depend upon which version of square
we used.
Thus, square
would not be the black box we desired.
A formal parameter of a procedure has a very special role in the procedure definition, in that it doesn’t matter what name the formal parameter has. Such a name is called a bound variable, and we say that the procedure definition binds its formal parameters. The meaning of a procedure definition is unchanged if a bound variable is consistently renamed throughout the definition.(26) If a variable is not bound, we say that it is free. The set of expressions for which a binding defines a name is called the scope of that name. In a procedure definition, the bound variables declared as the formal parameters of the procedure have the body of the procedure as their scope.
In the definition of good-enough?
above, guess
and x
are
bound variables but <
, -
, abs
, and square
are free.
The meaning of good-enough?
should be independent of the names we choose
for guess
and x
so long as they are distinct and different from
<
, -
, abs
, and square
. (If we renamed guess
to abs
we would have introduced a bug by
capturing the
variable abs
. It would have changed from free to bound.) The meaning
of good-enough?
is not independent of the names of its free variables,
however. It surely depends upon the fact (external to this definition) that
the symbol abs
names a procedure for computing the absolute value of a
number. Good-enough?
will compute a different function if we substitute
cos
for abs
in its definition.
We have one kind of name isolation available to us so far: The formal parameters of a procedure are local to the body of the procedure. The square-root program illustrates another way in which we would like to control the use of names. The existing program consists of separate procedures:
(define (sqrt x) (sqrt-iter 1.0 x)) (define (sqrt-iter guess x) (if (good-enough? guess x) guess (sqrt-iter (improve guess x) x))) (define (good-enough? guess x) (< (abs (- (square guess) x)) 0.001)) (define (improve guess x) (average guess (/ x guess)))
The problem with this program is that the only procedure that is important to
users of sqrt
is sqrt
. The other procedures (sqrt-iter
,
good-enough?
, and improve
) only clutter up their minds. They may
not define any other procedure called good-enough?
as part of another
program to work together with the square-root program, because sqrt
needs it. The problem is especially severe in the construction of large
systems by many separate programmers. For example, in the construction of a
large library of numerical procedures, many numerical functions are computed as
successive approximations and thus might have procedures named
good-enough?
and improve
as auxiliary procedures. We would like
to localize the subprocedures, hiding them inside sqrt
so that
sqrt
could coexist with other successive approximations, each having its
own private good-enough?
procedure. To make this possible, we allow a
procedure to have internal definitions that are local to that procedure. For
example, in the square-root problem we can write
(define (sqrt x) (define (good-enough? guess x) (< (abs (- (square guess) x)) 0.001)) (define (improve guess x) (average guess (/ x guess))) (define (sqrt-iter guess x) (if (good-enough? guess x) guess (sqrt-iter (improve guess x) x))) (sqrt-iter 1.0 x))
Such nesting of definitions, called
block structure, is basically the
right solution to the simplest name-packaging problem. But there is a better
idea lurking here. In addition to internalizing the definitions of the
auxiliary procedures, we can simplify them. Since x
is bound in the
definition of sqrt
, the procedures good-enough?
, improve
,
and sqrt-iter
, which are defined internally to sqrt
, are in the
scope of x
. Thus, it is not necessary to pass x
explicitly to
each of these procedures. Instead, we allow x
to be a free variable in
the internal definitions, as shown below. Then x
gets its value from the
argument with which the enclosing procedure sqrt
is called. This
discipline is called
lexical scoping.(27)
(define (sqrt x) (define (good-enough? guess) (< (abs (- (square guess) x)) 0.001)) (define (improve guess) (average guess (/ x guess))) (define (sqrt-iter guess) (if (good-enough? guess) guess (sqrt-iter (improve guess)))) (sqrt-iter 1.0))
We will use block structure extensively to help us break up large programs into tractable pieces.(28) The idea of block structure originated with the programming language Algol 60. It appears in most advanced programming languages and is an important tool for helping to organize the construction of large programs.
[ << ] | [ < ] | [ Up ] | [ > ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
We have now considered the elements of programming: We have used primitive arithmetic operations, we have combined these operations, and we have abstracted these composite operations by defining them as compound procedures. But that is not enough to enable us to say that we know how to program. Our situation is analogous to that of someone who has learned the rules for how the pieces move in chess but knows nothing of typical openings, tactics, or strategy. Like the novice chess player, we don’t yet know the common patterns of usage in the domain. We lack the knowledge of which moves are worth making (which procedures are worth defining). We lack the experience to predict the consequences of making a move (executing a procedure).
The ability to visualize the consequences of the actions under consideration is crucial to becoming an expert programmer, just as it is in any synthetic, creative activity. In becoming an expert photographer, for example, one must learn how to look at a scene and know how dark each region will appear on a print for each possible choice of exposure and development conditions. Only then can one reason backward, planning framing, lighting, exposure, and development to obtain the desired effects. So it is with programming, where we are planning the course of action to be taken by a process and where we control the process by means of a program. To become experts, we must learn to visualize the processes generated by various types of procedures. Only after we have developed such a skill can we learn to reliably construct programs that exhibit the desired behavior.
A procedure is a pattern for the local evolution of a computational process. It specifies how each stage of the process is built upon the previous stage. We would like to be able to make statements about the overall, or global, behavior of a process whose local evolution has been specified by a procedure. This is very difficult to do in general, but we can at least try to describe some typical patterns of process evolution.
In this section we will examine some common “shapes” for processes generated by simple procedures. We will also investigate the rates at which these processes consume the important computational resources of time and space. The procedures we will consider are very simple. Their role is like that played by test patterns in photography: as oversimplified prototypical patterns, rather than practical examples in their own right.
1.2.1 Linear Recursion and Iteration | ||
1.2.2 Tree Recursion | ||
1.2.3 Orders of Growth | ||
1.2.4 Exponentiation | ||
1.2.5 Greatest Common Divisors | ||
1.2.6 Example: Testing for Primality |
[ << ] | [ < ] | [ Up ] | [ > ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
Figure 1.3: A linear recursive process for computing 6!.
(factorial 6) ------------------------. (* 6 (factorial 5)) | (* 6 (* 5 (factorial 4))) | (* 6 (* 5 (* 4 (factorial 3)))) | (* 6 (* 5 (* 4 (* 3 (factorial 2))))) | (* 6 (* 5 (* 4 (* 3 (* 2 (factorial 1)))))) | (* 6 (* 5 (* 4 (* 3 (* 2 1))))) | (* 6 (* 5 (* 4 (* 3 2)))) | (* 6 (* 5 (* 4 6))) | (* 6 (* 5 24)) | (* 6 120) | 720 <-------------------------------'
We begin by considering the factorial function, defined by
n! = n * (n - 1) * (n - 2) ... 3 * 2 * 1
There are many ways to compute factorials. One way is to make use of the observation that n! is equal to n times (n - 1)! for any positive integer n:
n! = n * [(n - 1) * (n - 2) ... 3 * 2 * 1] = n * (n - 1)!
Thus, we can compute n! by computing (n - 1)! and multiplying the result by n. If we add the stipulation that 1! is equal to 1, this observation translates directly into a procedure:
(define (factorial n) (if (= n 1) 1 (* n (factorial (- n 1)))))
We can use the substitution model of section The Substitution Model for Procedure Application to watch this procedure in action computing 6!, as shown in Figure 1-3.
Now let’s take a different perspective on computing factorials. We could describe a rule for computing n! by specifying that we first multiply 1 by 2, then multiply the result by 3, then by 4, and so on until we reach n. More formally, we maintain a running product, together with a counter that counts from 1 up to n. We can describe the computation by saying that the counter and the product simultaneously change from one step to the next according to the rule
product <- counter ... product counter <- counter + 1
and stipulating that n! is the value of the product when the counter exceeds n.
Figure 1.4: A linear iterative process for computing 6!.
(factorial 6) -----. (fact-iter 1 1 6) | (fact-iter 1 2 6) | (fact-iter 2 3 6) | (fact-iter 6 4 6) | (fact-iter 24 5 6) | (fact-iter 120 6 6) | (fact-iter 720 7 6) V 720
Once again, we can recast our description as a procedure for computing factorials:(29)
(define (factorial n) (fact-iter 1 1 n)) (define (fact-iter product counter max-count) (if (> counter max-count) product (fact-iter (* counter product) (+ counter 1) max-count)))
As before, we can use the substitution model to visualize the process of computing 6!, as shown in Figure 1-4.
Compare the two processes. From one point of view, they seem hardly different at all. Both compute the same mathematical function on the same domain, and each requires a number of steps proportional to n to compute n!. Indeed, both processes even carry out the same sequence of multiplications, obtaining the same sequence of partial products. On the other hand, when we consider the “shapes” of the two processes, we find that they evolve quite differently.
Consider the first process. The substitution model reveals a shape of expansion followed by contraction, indicated by the arrow in Figure 1-3. The expansion occurs as the process builds up a chain of operations deferred operations (in this case, a chain of multiplications). The contraction occurs as the operations are actually performed. This type of process, characterized by a chain of deferred operations, is called a recursive process. Carrying out this process requires that the interpreter keep track of the operations to be performed later on. In the computation of n!, the length of the chain of deferred multiplications, and hence the amount of information needed to keep track of it, grows linearly with n (is proportional to n), just like the number of steps. Such a process is called a linear recursive process.
By contrast, the second process does not grow and shrink. At each step, all we
need to keep track of, for any n, are the current values of the variables
product
, counter
, and max-count
. We call this an
iterative process. In general, an iterative process is one whose
state can be summarized by a fixed number of
state variables,
together with a fixed rule that describes how the state variables should be
updated as the process moves from state to state and an (optional) end test
that specifies conditions under which the process should terminate. In
computing n!, the number of steps required grows linearly with n. Such
a process is called a
linear iterative process.
The contrast between the two processes can be seen in another way. In the iterative case, the program variables provide a complete description of the state of the process at any point. If we stopped the computation between steps, all we would need to do to resume the computation is to supply the interpreter with the values of the three program variables. Not so with the recursive process. In this case there is some additional “hidden” information, maintained by the interpreter and not contained in the program variables, which indicates “where the process is” in negotiating the chain of deferred operations. The longer the chain, the more information must be maintained.(30)
In contrasting iteration and recursion, we must be careful not to confuse the
notion of a recursive
process with the notion of a recursive
procedure. When we describe a procedure as recursive, we are
referring to the syntactic fact that the procedure definition refers (either
directly or indirectly) to the procedure itself. But when we describe a
process as following a pattern that is, say, linearly recursive, we are
speaking about how the process evolves, not about the syntax of how a procedure
is written. It may seem disturbing that we refer to a recursive procedure such
as fact-iter
as generating an iterative process. However, the process
really is iterative: Its state is captured completely by its three state
variables, and an interpreter need keep track of only three variables in order
to execute the process.
One reason that the distinction between process and procedure may be confusing
is that most implementations of common languages (including Ada, Pascal, and C)
are designed in such a way that the interpretation of any recursive procedure
consumes an amount of memory that grows with the number of procedure calls,
even when the process described is, in principle, iterative. As a consequence,
these languages can describe iterative processes only by resorting to
special-purpose “looping constructs” such as do
, repeat
,
until
, for
, and while
. The implementation of Scheme we
shall consider in Computing with Register Machines does not share this defect. It will execute
an iterative process in constant space, even if the iterative process is
described by a recursive procedure. An implementation with this property is
called
tail-recursive. With a tail-recursive implementation,
iteration can be expressed using the ordinary procedure call mechanism, so that
special iteration constructs are useful only as syntactic sugar.(31)
Exercise 1.9: Each of the following two procedures defines a method for adding two positive integers in terms of the procedures
inc
, which increments its argument by 1, anddec
, which decrements its argument by 1.(define (+ a b) (if (= a 0) b (inc (+ (dec a) b)))) (define (+ a b) (if (= a 0) b (+ (dec a) (inc b))))Using the substitution model, illustrate the process generated by each procedure in evaluating
(+ 4 5)
. Are these processes iterative or recursive?
Exercise 1.10: The following procedure computes a mathematical function called Ackermann’s function.
(define (A x y) (cond ((= y 0) 0) ((= x 0) (* 2 y)) ((= y 1) 2) (else (A (- x 1) (A x (- y 1))))))What are the values of the following expressions?
(A 1 10) (A 2 4) (A 3 3)Consider the following procedures, where
A
is the procedure defined above:(define (f n) (A 0 n)) (define (g n) (A 1 n)) (define (h n) (A 2 n)) (define (k n) (* 5 n n))Give concise mathematical definitions for the functions computed by the procedures
f
,g
, andh
for positive integer values of n. For example,(k n)
computes 5n^2.
[ << ] | [ < ] | [ Up ] | [ > ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
Another common pattern of computation is called tree recursion. As an example, consider computing the sequence of Fibonacci numbers, in which each number is the sum of the preceding two:
0, 1, 1, 2, 3, 4, 8, 13, 21, …
In general, the Fibonacci numbers can be defined by the rule
/ | 0 if n = 0 Fib(n) = < 1 if n = 1 | Fib(n - 1) + Fib(n - 2) otherwise \
We can immediately translate this definition into a recursive procedure for computing Fibonacci numbers:
(define (fib n) (cond ((= n 0) 0) ((= n 1) 1) (else (+ (fib (- n 1)) (fib (- n 2))))))
Figure 1.5: The tree-recursive process generated in computing
(fib 5)
...<............ fib5 <.......... ... ___________/ \___________ . ... / . ..... \ . .. fib4 . . . . . fib3 . .. ____/. \____ .. . __/ \__ . .. / . . .. \ . .. / . . \ . .. fib3 . . fib2 . . fib2 . . fib1 . .. / . \ . . / \ . . / \ ... . | . .. / . . \ . . / . \ . . / . \ . . 1 . . fib2 . . fib1. .fib1 . fib0 . .fib1. . fib0 . . . . / \ . . | . . | . . | . . | . . | . .> V / . \ . 1 . . 1 . . 0 . . 1 . . 0 .. . fib1 .. fib0.. . . . . . V . .. . . | . . | . .> .>. . . ..>. .> . 1 . . 0 . . . . . .>. ..
Consider the pattern of this computation. To compute (fib 5)
, we
compute (fib 4)
and (fib 3)
. To compute (fib 4)
, we
compute (fib 3)
and (fib 2)
. In general, the evolved process
looks like a tree, as shown in Figure 1-5. Notice that the branches
split into two at each level (except at the bottom); this reflects the fact
that the fib
procedure calls itself twice each time it is invoked.
This procedure is instructive as a prototypical tree recursion, but it is a
terrible way to compute Fibonacci numbers because it does so much redundant
computation. Notice in Figure 1-5 that the entire computation of
(fib 3)
—almost half the work—is duplicated. In fact, it is not hard
to show that the number of times the procedure will compute (fib 1)
or
(fib 0)
(the number of leaves in the above tree, in general) is
precisely Fib(n + 1). To get an idea of how bad this is, one can
show that the value of Fib(n) grows exponentially with n. More
precisely (see Exercise 1-13), Fib(n) is the closest integer
to [phi]^n /[sqrt](5), where
[phi] = (1 + [sqrt]5)/2 ~= 1.6180
is the golden ratio, which satisfies the equation
[phi]^2 = [phi] + 1
Thus, the process uses a number of steps that grows exponentially with the input. On the other hand, the space required grows only linearly with the input, because we need keep track only of which nodes are above us in the tree at any point in the computation. In general, the number of steps required by a tree-recursive process will be proportional to the number of nodes in the tree, while the space required will be proportional to the maximum depth of the tree.
We can also formulate an iterative process for computing the Fibonacci numbers. The idea is to use a pair of integers a and b, initialized to Fib(1) = 1 and Fib(0) = 0, and to repeatedly apply the simultaneous transformations
a <- a + b b <- a
It is not hard to show that, after applying this transformation n times, a and b will be equal, respectively, to Fib(n + 1) and Fib(n). Thus, we can compute Fibonacci numbers iteratively using the procedure
(define (fib n) (fib-iter 1 0 n)) (define (fib-iter a b count) (if (= count 0) b (fib-iter (+ a b) a (- count 1))))
This second method for computing Fib(n) is a linear iteration. The difference in number of steps required by the two methods—one linear in n, one growing as fast as Fib(n) itself—is enormous, even for small inputs.
One should not conclude from this that tree-recursive processes are useless.
When we consider processes that operate on hierarchically structured data
rather than numbers, we will find that tree recursion is a natural and powerful
tool.(32) But
even in numerical operations, tree-recursive processes can be useful in helping
us to understand and design programs. For instance, although the first
fib
procedure is much less efficient than the second one, it is more
straightforward, being little more than a translation into Lisp of the
definition of the Fibonacci sequence. To formulate the iterative algorithm
required noticing that the computation could be recast as an iteration with
three state variables.
It takes only a bit of cleverness to come up with the iterative Fibonacci algorithm. In contrast, consider the following problem: How many different ways can we make change of $ 1.00, given half-dollars, quarters, dimes, nickels, and pennies? More generally, can we write a procedure to compute the number of ways to change any given amount of money?
This problem has a simple solution as a recursive procedure. Suppose we think of the types of coins available as arranged in some order. Then the following relation holds:
The number of ways to change amount a using n kinds of coins equals
To see why this is true, observe that the ways to make change can be divided into two groups: those that do not use any of the first kind of coin, and those that do. Therefore, the total number of ways to make change for some amount is equal to the number of ways to make change for the amount without using any of the first kind of coin, plus the number of ways to make change assuming that we do use the first kind of coin. But the latter number is equal to the number of ways to make change for the amount that remains after using a coin of the first kind.
Thus, we can recursively reduce the problem of changing a given amount to the problem of changing smaller amounts using fewer kinds of coins. Consider this reduction rule carefully, and convince yourself that we can use it to describe an algorithm if we specify the following degenerate cases:(33)
We can easily translate this description into a recursive procedure:
(define (count-change amount) (cc amount 5)) (define (cc amount kinds-of-coins) (cond ((= amount 0) 1) ((or (< amount 0) (= kinds-of-coins 0)) 0) (else (+ (cc amount (- kinds-of-coins 1)) (cc (- amount (first-denomination kinds-of-coins)) kinds-of-coins))))) (define (first-denomination kinds-of-coins) (cond ((= kinds-of-coins 1) 1) ((= kinds-of-coins 2) 5) ((= kinds-of-coins 3) 10) ((= kinds-of-coins 4) 25) ((= kinds-of-coins 5) 50)))
(The first-denomination
procedure takes as input the number of kinds of
coins available and returns the denomination of the first kind. Here we are
thinking of the coins as arranged in order from largest to smallest, but any
order would do as well.) We can now answer our original question about
changing a dollar:
(count-change 100) 292
Count-change
generates a tree-recursive process with redundancies
similar to those in our first implementation of fib
. (It will take
quite a while for that 292 to be computed.) On the other hand, it is not
obvious how to design a better algorithm for computing the result, and we leave
this problem as a challenge. The observation that a tree-recursive process may
be highly inefficient but often easy to specify and understand has led people
to propose that one could get the best of both worlds by designing a “smart
compiler” that could transform tree-recursive procedures into more efficient
procedures that compute the same result.(34)
Exercise 1.11: A function f is defined by the rule that f(n) = n if n<3 and f(n) = f(n - 1) + 2f(n - 2) + 3f(n - 3) if n>= 3. Write a procedure that computes f by means of a recursive process. Write a procedure that computes f by means of an iterative process.
Exercise 1.12: The following pattern of numbers is called Pascal’s triangle.
1 1 1 1 2 1 1 3 3 1 1 4 6 4 1The numbers at the edge of the triangle are all 1, and each number inside the triangle is the sum of the two numbers above it.(35) Write a procedure that computes elements of Pascal’s triangle by means of a recursive process.
Exercise 1.13: Prove that Fib(n) is the closest integer to [phi]^n/[sqrt](5), where [phi] = (1 + [sqrt](5))/2. Hint: Let [illegiblesymbol] = (1 - [sqrt](5))/2. Use induction and the definition of the Fibonacci numbers (see section Tree Recursion) to prove that Fib(n) = ([phi]^n - [illegiblesymbol]^n)/[sqrt](5).
[ << ] | [ < ] | [ Up ] | [ > ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
The previous examples illustrate that processes can differ considerably in the rates at which they consume computational resources. One convenient way to describe this difference is to use the notion of order of growth to obtain a gross measure of the resources required by a process as the inputs become larger.
Let n be a parameter that measures the size of the problem, and let R(n) be the amount of resources the process requires for a problem of size n. In our previous examples we took n to be the number for which a given function is to be computed, but there are other possibilities. For instance, if our goal is to compute an approximation to the square root of a number, we might take n to be the number of digits accuracy required. For matrix multiplication we might take n to be the number of rows in the matrices. In general there are a number of properties of the problem with respect to which it will be desirable to analyze a given process. Similarly, R(n) might measure the number of internal storage registers used, the number of elementary machine operations performed, and so on. In computers that do only a fixed number of operations at a time, the time required will be proportional to the number of elementary machine operations performed.
We say that R(n) has order of growth [theta](f(n)), written R(n) = [theta](f(n)) (pronounced “theta of f(n)”), if there are positive constants k_1 and k_2 independent of n such that
k_1 f(n) <= R(n) <= k_2 f(n)
for any sufficiently large value of n. (In other words, for large n, the value R(n) is sandwiched between k_1f(n) and k_2f(n).)
For instance, with the linear recursive process for computing factorial described in section Linear Recursion and Iteration the number of steps grows proportionally to the input n. Thus, the steps required for this process grows as [theta](n). We also saw that the space required grows as [theta](n). For the iterative factorial, the number of steps is still [theta](n) but the space is [theta](1)—that is, constant.(36) The tree-recursive Fibonacci computation requires [theta]([phi]^n) steps and space [theta](n), where [phi] is the golden ratio described in section Tree Recursion.
Orders of growth provide only a crude description of the behavior of a process. For example, a process requiring n^2 steps and a process requiring 1000n^2 steps and a process requiring 3n^2 + 10n + 17 steps all have [theta](n^2) order of growth. On the other hand, order of growth provides a useful indication of how we may expect the behavior of the process to change as we change the size of the problem. For a [theta](n) (linear) process, doubling the size will roughly double the amount of resources used. For an exponential process, each increment in problem size will multiply the resource utilization by a constant factor. In the remainder of section Procedures and the Processes They Generate we will examine two algorithms whose order of growth is logarithmic, so that doubling the problem size increases the resource requirement by a constant amount.
Exercise 1.14: Draw the tree illustrating the process generated by the
count-change
procedure of section Tree Recursion in making change for 11 cents. What are the orders of growth of the space and number of steps used by this process as the amount to be changed increases?
Exercise 1.15: The sine of an angle (specified in radians) can be computed by making use of the approximation
sin
xapprox x if x is sufficiently small, and the trigonometric identityx x sin x = 3 sin --- - 4 sin^3 --- 3 3to reduce the size of the argument of
sin
. (For purposes of this exercise an angle is considered “sufficiently small” if its magnitude is not greater than 0.1 radians.) These ideas are incorporated in the following procedures:(define (cube x) (* x x x)) (define (p x) (- (* 3 x) (* 4 (cube x)))) (define (sine angle) (if (not (> (abs angle) 0.1)) angle (p (sine (/ angle 3.0)))))
- How many times is the procedure
p
applied when(sine 12.15)
is evaluated?- What is the order of growth in space and number of steps (as a function of a) used by the process generated by the
sine
procedure when(sine a)
is evaluated?
[ << ] | [ < ] | [ Up ] | [ > ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
Consider the problem of computing the exponential of a given number. We would like a procedure that takes as arguments a base b and a positive integer exponent n and computes b^n. One way to do this is via the recursive definition
b^n = b * b^(n - 1) b^0 = 1
which translates readily into the procedure
(define (expt b n) (if (= n 0) 1 (* b (expt b (- n 1)))))
This is a linear recursive process, which requires [theta](n) steps and [theta](n) space. Just as with factorial, we can readily formulate an equivalent linear iteration:
(define (expt b n) (expt-iter b n 1)) (define (expt-iter b counter product) (if (= counter 0) product (expt-iter b (- counter 1) (* b product))))
This version requires [theta](n) steps and [theta](1) space.
We can compute exponentials in fewer steps by using successive squaring. For instance, rather than computing b^8 as
b * (b * (b * (b * (b * (b * (b * b))))))
we can compute it using three multiplications:
b^2 = b * b b^4 = b^2 * b^2 b^8 = b^4 * b^4
This method works fine for exponents that are powers of 2. We can also take advantage of successive squaring in computing exponentials in general if we use the rule
b^n = (b^(b/2))^2 if n is even b^n = b * b^(n - 1) if n is odd
We can express this method as a procedure:
(define (fast-expt b n) (cond ((= n 0) 1) ((even? n) (square (fast-expt b (/ n 2)))) (else (* b (fast-expt b (- n 1))))))
where the predicate to test whether an integer is even is defined in terms of
the primitive procedure remainder
by
(define (even? n) (= (remainder n 2) 0))
The process evolved by fast-expt
grows logarithmically with n in
both space and number of steps. To see this, observe that computing
b^(2n) using fast-expt
requires only one more multiplication
than computing b^n. The size of the exponent we can compute therefore
doubles (approximately) with every new multiplication we are allowed. Thus,
the number of multiplications required for an exponent of n grows about as
fast as the logarithm of n to the base 2. The process has
[theta](log
n) growth.(37)
The difference between [theta](log
n) growth and
[theta](n) growth becomes striking as n becomes large. For
example, fast-expt
for n = 1000 requires only 14
multiplications.(38) It is also possible to
use the idea of successive squaring to devise an iterative algorithm that
computes exponentials with a logarithmic number of steps (see Exercise 1-16), although, as is often the case with iterative algorithms, this is not
written down so straightforwardly as the recursive algorithm.(39)
Exercise 1.16: Design a procedure that evolves an iterative exponentiation process that uses successive squaring and uses a logarithmic number of steps, as does
fast-expt
. (Hint: Using the observation that (b^(n/2))^2 = (b^2)^(n/2), keep, along with the exponent n and the base b, an additional state variable a, and define the state transformation in such a way that the product a b^n is unchanged from state to state. At the beginning of the process a is taken to be 1, and the answer is given by the value of a at the end of the process. In general, the technique of defining an invariant quantity that remains unchanged from state to state is a powerful way to think about the design of iterative algorithms.)
Exercise 1.17: The exponentiation algorithms in this section are based on performing exponentiation by means of repeated multiplication. In a similar way, one can perform integer multiplication by means of repeated addition. The following multiplication procedure (in which it is assumed that our language can only add, not multiply) is analogous to the
expt
procedure:(define (* a b) (if (= b 0) 0 (+ a (* a (- b 1)))))This algorithm takes a number of steps that is linear in
b
. Now suppose we include, together with addition, operationsdouble
, which doubles an integer, andhalve
, which divides an (even) integer by 2. Using these, design a multiplication procedure analogous tofast-expt
that uses a logarithmic number of steps.
Exercise 1.18: Using the results of Exercise 1-16 and Exercise 1-17, devise a procedure that generates an iterative process for multiplying two integers in terms of adding, doubling, and halving and uses a logarithmic number of steps.(40)
Exercise 1.19: There is a clever algorithm for computing the Fibonacci numbers in a logarithmic number of steps. Recall the transformation of the state variables a and b in the
fib-iter
process of section Tree Recursion: a <- a + b and b <- a. Call this transformation T, and observe that applying T over and over again n times, starting with 1 and 0, produces the pair Fib(n + 1) and Fib(n). In other words, the Fibonacci numbers are produced by applying T^n, the nth power of the transformation T, starting with the pair (1,0). Now consider T to be the special case of p = 0 and q = 1 in a family of transformations T_(pq), where T_(pq) transforms the pair (a,b) according to a <- bq + aq + ap and b <- bp + aq. Show that if we apply such a transformation T_(pq) twice, the effect is the same as using a single transformation T_(p’q’) of the same form, and compute p’ and q’ in terms of p and q. This gives us an explicit way to square these transformations, and thus we can compute T^n using successive squaring, as in thefast-expt
procedure. Put this all together to complete the following procedure, which runs in a logarithmic number of steps:(41)(define (fib n) (fib-iter 1 0 0 1 n)) (define (fib-iter a b p q count) (cond ((= count 0) b) ((even? count) (fib-iter a b <??> ; compute p' <??> ; compute q' (/ count 2))) (else (fib-iter (+ (* b q) (* a q) (* a p)) (+ (* b p) (* a q)) p q (- count 1)))))
[ << ] | [ < ] | [ Up ] | [ > ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
The greatest common divisor (GCD) of two integers a and b is defined to be the largest integer that divides both a and b with no remainder. For example, the GCD of 16 and 28 is 4. In Building Abstractions with Data, when we investigate how to implement rational-number arithmetic, we will need to be able to compute GCDs in order to reduce rational numbers to lowest terms. (To reduce a rational number to lowest terms, we must divide both the numerator and the denominator by their GCD. For example, 16/28 reduces to 4/7.) One way to find the GCD of two integers is to factor them and search for common factors, but there is a famous algorithm that is much more efficient.
The idea of the algorithm is based on the observation that, if r is the remainder when a is divided by b, then the common divisors of a and b are precisely the same as the common divisors of b and r. Thus, we can use the equation
GCD(a,b) = GCD(b,r)
to successively reduce the problem of computing a GCD to the problem of computing the GCD of smaller and smaller pairs of integers. For example,
GCD(206,40) = GCD(40,6) = GCD(6,4) = GCD(4,2) = GCD(2,0) = 2
reduces GCD(206,40) to GCD(2,0), which is 2. It is possible to show that starting with any two positive integers and performing repeated reductions will always eventually produce a pair where the second number is 0. Then the GCD is the other number in the pair. This method for computing the GCD is known as Algorithm Euclid’s Algorithm.(42)
It is easy to express Euclid’s Algorithm as a procedure:
(define (gcd a b) (if (= b 0) a (gcd b (remainder a b))))
This generates an iterative process, whose number of steps grows as the logarithm of the numbers involved.
The fact that the number of steps required by Euclid’s Algorithm has logarithmic growth bears an interesting relation to the Fibonacci numbers:
Lamé’s Theorem: If Euclid’s Algorithm requires k steps to compute the GCD of some pair, then the smaller number in the pair must be greater than or equal to the kth Fibonacci number.(43)
We can use this theorem to get an order-of-growth estimate for Euclid’s
Algorithm. Let n be the smaller of the two inputs to the procedure. If
the process takes k steps, then we must have n>= Fib(k)
approx [phi]^k/[sqrt](5). Therefore the number of steps k
grows as the logarithm (to the base [phi]) of n. Hence, the order of
growth is [theta](log
n).
Exercise 1.20: The process that a procedure generates is of course dependent on the rules used by the interpreter. As an example, consider the iterative
gcd
procedure given above. Suppose we were to interpret this procedure using normal-order evaluation, as discussed in section The Substitution Model for Procedure Application. (The normal-order-evaluation rule forif
is described in Exercise 1-5.) Using the substitution method (for normal order), illustrate the process generated in evaluating(gcd 206 40)
and indicate theremainder
operations that are actually performed. How manyremainder
operations are actually performed in the normal-order evaluation of(gcd 206 40)
? In the applicative-order evaluation?
[ << ] | [ < ] | [ Up ] | [ > ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
This section describes two methods for checking the primality of an integer
n, one with order of growth [theta]([sqrt](n)), and a
“probabilistic” algorithm with order of growth [theta](log
n).
The exercises at the end of this section suggest programming projects based on
these algorithms.
Since ancient times, mathematicians have been fascinated by problems concerning prime numbers, and many people have worked on the problem of determining ways to test if numbers are prime. One way to test if a number is prime is to find the number’s divisors. The following program finds the smallest integral divisor (greater than 1) of a given number n. It does this in a straightforward way, by testing n for divisibility by successive integers starting with 2.
(define (smallest-divisor n) (find-divisor n 2)) (define (find-divisor n test-divisor) (cond ((> (square test-divisor) n) n) ((divides? test-divisor n) test-divisor) (else (find-divisor n (+ test-divisor 1))))) (define (divides? a b) (= (remainder b a) 0))
We can test whether a number is prime as follows: n is prime if and only if n is its own smallest divisor.
(define (prime? n) (= n (smallest-divisor n)))
The end test for find-divisor
is based on the fact that if n is not
prime it must have a divisor less than or equal to
[sqrt](n).(44) This means that the algorithm need only test divisors
between 1 and [sqrt](n). Consequently, the number of steps required
to identify n as prime will have order of growth
[theta]([sqrt](n)).
The [theta](log
n) primality test is based on a result from
number theory known as Fermat’s Little Theorem.(45)
Fermat’s Little Theorem: If n is a prime number and a is any positive integer less than n, then a raised to the nth power is congruent to a modulo n.
(Two numbers are said to be congruent modulo n if they both have the same remainder when divided by n. The remainder of a number a when divided by n is also referred to as the remainder of a modulo n, or simply as a modulo n.)
If n is not prime, then, in general, most of the numbers a< n will not satisfy the above relation. This leads to the following algorithm for testing primality: Given a number n, pick a random number a < n and compute the remainder of a^n modulo n. If the result is not equal to a, then n is certainly not prime. If it is a, then chances are good that n is prime. Now pick another random number a and test it with the same method. If it also satisfies the equation, then we can be even more confident that n is prime. By trying more and more values of a, we can increase our confidence in the result. This algorithm is known as the Fermat test.
To implement the Fermat test, we need a procedure that computes the exponential of a number modulo another number:
(define (expmod base exp m) (cond ((= exp 0) 1) ((even? exp) (remainder (square (expmod base (/ exp 2) m)) m)) (else (remainder (* base (expmod base (- exp 1) m)) m))))
This is very similar to the fast-expt
procedure of section Exponentiation.
It uses successive squaring, so that the number of steps grows logarithmically
with the exponent.(46)
The Fermat test is performed by choosing at random a number a between 1 and
n - 1 inclusive and checking whether the remainder modulo n of the
nth power of a is equal to a. The random number a is chosen
using the procedure random
, which we assume is included as a primitive
in Scheme. Random
returns a nonnegative integer less than its integer
input. Hence, to obtain a random number between 1 and n - 1, we call
random
with an input of n - 1 and add 1 to the result:
(define (fermat-test n) (define (try-it a) (= (expmod a n n) a)) (try-it (+ 1 (random (- n 1)))))
The following procedure runs the test a given number of times, as specified by a parameter. Its value is true if the test succeeds every time, and false otherwise.
(define (fast-prime? n times) (cond ((= times 0) true) ((fermat-test n) (fast-prime? n (- times 1))) (else false)))
The Fermat test differs in character from most familiar algorithms, in which one computes an answer that is guaranteed to be correct. Here, the answer obtained is only probably correct. More precisely, if n ever fails the Fermat test, we can be certain that n is not prime. But the fact that n passes the test, while an extremely strong indication, is still not a guarantee that n is prime. What we would like to say is that for any number n, if we perform the test enough times and find that n always passes the test, then the probability of error in our primality test can be made as small as we like.
Unfortunately, this assertion is not quite correct. There do exist numbers that fool the Fermat test: numbers n that are not prime and yet have the property that a^n is congruent to a modulo n for all integers a < n. Such numbers are extremely rare, so the Fermat test is quite reliable in practice.(47)
There are variations of the Fermat test that cannot be fooled. In these tests, as with the Fermat method, one tests the primality of an integer n by choosing a random integer a<n and checking some condition that depends upon n and a. (See Exercise 1-28 for an example of such a test.) On the other hand, in contrast to the Fermat test, one can prove that, for any n, the condition does not hold for most of the integers a<n unless n is prime. Thus, if n passes the test for some random choice of a, the chances are better than even that n is prime. If n passes the test for two random choices of a, the chances are better than 3 out of 4 that n is prime. By running the test with more and more randomly chosen values of a we can make the probability of error as small as we like.
The existence of tests for which one can prove that the chance of error becomes arbitrarily small has sparked interest in algorithms of this type, which have come to be known as probabilistic algorithms. There is a great deal of research activity in this area, and probabilistic algorithms have been fruitfully applied to many fields.(48)
Exercise 1.21: Use the
smallest-divisor
procedure to find the smallest divisor of each of the following numbers: 199, 1999, 19999.
Exercise 1.22: Most Lisp implementations include a primitive called
runtime
that returns an integer that specifies the amount of time the system has been running (measured, for example, in microseconds). The followingtimed-prime-test
procedure, when called with an integer n, prints n and checks to see if n is prime. If n is prime, the procedure prints three asterisks followed by the amount of time used in performing the test.(define (timed-prime-test n) (newline) (display n) (start-prime-test n (runtime))) (define (start-prime-test n start-time) (if (prime? n) (report-prime (- (runtime) start-time)))) (define (report-prime elapsed-time) (display " *** ") (display elapsed-time))Using this procedure, write a procedure
search-for-primes
that checks the primality of consecutive odd integers in a specified range. Use your procedure to find the three smallest primes larger than 1000; larger than 10,000; larger than 100,000; larger than 1,000,000. Note the time needed to test each prime. Since the testing algorithm has order of growth of [theta]([sqrt](n)), you should expect that testing for primes around 10,000 should take about [sqrt](10) times as long as testing for primes around 1000. Do your timing data bear this out? How well do the data for 100,000 and 1,000,000 support the [sqrt](n) prediction? Is your result compatible with the notion that programs on your machine run in time proportional to the number of steps required for the computation?
Exercise 1.23: The
smallest-divisor
procedure shown at the start of this section does lots of needless testing: After it checks to see if the number is divisible by 2 there is no point in checking to see if it is divisible by any larger even numbers. This suggests that the values used fortest-divisor
should not be 2, 3, 4, 5, 6, …, but rather 2, 3, 5, 7, 9, …. To implement this change, define a procedurenext
that returns 3 if its input is equal to 2 and otherwise returns its input plus 2. Modify thesmallest-divisor
procedure to use(next test-divisor)
instead of(+ test-divisor 1)
. Withtimed-prime-test
incorporating this modified version ofsmallest-divisor
, run the test for each of the 12 primes found in Exercise 1-22. Since this modification halves the number of test steps, you should expect it to run about twice as fast. Is this expectation confirmed? If not, what is the observed ratio of the speeds of the two algorithms, and how do you explain the fact that it is different from 2?
Exercise 1.24: Modify the
timed-prime-test
procedure of Exercise 1-22 to usefast-prime?
(the Fermat method), and test each of the 12 primes you found in that exercise. Since the Fermat test has [theta](log
n) growth, how would you expect the time to test primes near 1,000,000 to compare with the time needed to test primes near 1000? Do your data bear this out? Can you explain any discrepancy you find?
Exercise 1.25: Alyssa P. Hacker complains that we went to a lot of extra work in writing
expmod
. After all, she says, since we already know how to compute exponentials, we could have simply written(define (expmod base exp m) (remainder (fast-expt base exp) m))Is she correct? Would this procedure serve as well for our fast prime tester? Explain.
Exercise 1.26: Louis Reasoner is having great difficulty doing Exercise 1-24. His
fast-prime?
test seems to run more slowly than hisprime?
test. Louis calls his friend Eva Lu Ator over to help. When they examine Louis’s code, they find that he has rewritten theexpmod
procedure to use an explicit multiplication, rather than callingsquare
:(define (expmod base exp m) (cond ((= exp 0) 1) ((even? exp) (remainder (* (expmod base (/ exp 2) m) (expmod base (/ exp 2) m)) m)) (else (remainder (* base (expmod base (- exp 1) m)) m))))“I don’t see what difference that could make,” says Louis. “I do.” says Eva. “By writing the procedure like that, you have transformed the [theta](
log
n) process into a [theta](n) process.” Explain.
Exercise 1.27: Demonstrate that the Carmichael numbers listed in Footnote 1-47 really do fool the Fermat test. That is, write a procedure that takes an integer n and tests whether a^n is congruent to a modulo n for every a<n, and try your procedure on the given Carmichael numbers.
Exercise 1.28: One variant of the Fermat test that cannot be fooled is called the Miller-Rabin test (Miller 1976; Rabin 1980). This starts from an alternate form of Fermat’s Little Theorem, which states that if n is a prime number and a is any positive integer less than n, then a raised to the (n - 1)st power is congruent to 1 modulo n. To test the primality of a number n by the Miller-Rabin test, we pick a random number a<n and raise a to the (n - 1)st power modulo n using the
expmod
procedure. However, whenever we perform the squaring step inexpmod
, we check to see if we have discovered a “nontrivial square root of 1 modulo n,” that is, a number not equal to 1 or n - 1 whose square is equal to 1 modulo n. It is possible to prove that if such a nontrivial square root of 1 exists, then n is not prime. It is also possible to prove that if n is an odd number that is not prime, then, for at least half the numbers a<n, computing a^(n-1) in this way will reveal a nontrivial square root of 1 modulo n. (This is why the Miller-Rabin test cannot be fooled.) Modify theexpmod
procedure to signal if it discovers a nontrivial square root of 1, and use this to implement the Miller-Rabin test with a procedure analogous tofermat-test
. Check your procedure by testing various known primes and non-primes. Hint: One convenient way to makeexpmod
signal is to have it return 0.
[ << ] | [ < ] | [ Up ] | [ > ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
We have seen that procedures are, in effect, abstractions that describe compound operations on numbers independent of the particular numbers. For example, when we
(define (cube x) (* x x x))
we are not talking about the cube of a particular number, but rather about a method for obtaining the cube of any number. Of course we could get along without ever defining this procedure, by always writing expressions such as
(* 3 3 3) (* x x x) (* y y y)
and never mentioning cube
explicitly. This would place us at a serious
disadvantage, forcing us to work always at the level of the particular
operations that happen to be primitives in the language (multiplication, in
this case) rather than in terms of higher-level operations. Our programs would
be able to compute cubes, but our language would lack the ability to express
the concept of cubing. One of the things we should demand from a powerful
programming language is the ability to build abstractions by assigning names to
common patterns and then to work in terms of the abstractions directly.
Procedures provide this ability. This is why all but the most primitive
programming languages include mechanisms for defining procedures.
Yet even in numerical processing we will be severely limited in our ability to create abstractions if we are restricted to procedures whose parameters must be numbers. Often the same programming pattern will be used with a number of different procedures. To express such patterns as concepts, we will need to construct procedures that can accept procedures as arguments or return procedures as values. Procedures that manipulate procedures are called higher-order procedures. This section shows how higher-order procedures can serve as powerful abstraction mechanisms, vastly increasing the expressive power of our language.
1.3.1 Procedures as Arguments | ||
1.3.2 Constructing Procedures Using Lambda | ||
1.3.3 Procedures as General Methods | ||
1.3.4 Procedures as Returned Values |
[ << ] | [ < ] | [ Up ] | [ > ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
Consider the following three procedures. The first computes the sum of the
integers from a
through b
:
(define (sum-integers a b) (if (> a b) 0 (+ a (sum-integers (+ a 1) b))))
The second computes the sum of the cubes of the integers in the given range:
(define (sum-cubes a b) (if (> a b) 0 (+ (cube a) (sum-cubes (+ a 1) b))))
The third computes the sum of a sequence of terms in the series
1 1 1 ----- + ----- + ------ + ... 1 * 3 5 * 7 9 * 11
which converges to [pi]/8 (very slowly):(49)
(define (pi-sum a b) (if (> a b) 0 (+ (/ 1.0 (* a (+ a 2))) (pi-sum (+ a 4) b))))
These three procedures clearly share a common underlying pattern. They are for
the most part identical, differing only in the name of the procedure, the
function of a
used to compute the term to be added, and the function
that provides the next value of a
. We could generate each of the
procedures by filling in slots in the same template:
(define (<name> a b) (if (> a b) 0 (+ (<term> a) (<name> (<next> a) b))))
The presence of such a common pattern is strong evidence that there is a useful abstraction waiting to be brought to the surface. Indeed, mathematicians long ago identified the abstraction of summation of a series and invented “sigma notation,” for example
b --- > f(n) = f(a) + ... + f(b) --- n=a
to express this concept. The power of sigma notation is that it allows mathematicians to deal with the concept of summation itself rather than only with particular sums—for example, to formulate general results about sums that are independent of the particular series being summed.
Similarly, as program designers, we would like our language to be powerful enough so that we can write a procedure that expresses the concept of summation itself rather than only procedures that compute particular sums. We can do so readily in our procedural language by taking the common template shown above and transforming the “slots” into formal parameters:
(define (sum term a next b) (if (> a b) 0 (+ (term a) (sum term (next a) next b))))
Notice that sum
takes as its arguments the lower and upper bounds
a
and b
together with the procedures term
and next
.
We can use sum
just as we would any procedure. For example, we can use
it (along with a procedure inc
that increments its argument by 1) to
define sum-cubes
:
(define (inc n) (+ n 1)) (define (sum-cubes a b) (sum cube a inc b))
Using this, we can compute the sum of the cubes of the integers from 1 to 10:
(sum-cubes 1 10) 3025
With the aid of an identity procedure to compute the term, we can define
sum-integers
in terms of sum
:
(define (identity x) x) (define (sum-integers a b) (sum identity a inc b))
Then we can add up the integers from 1 to 10:
(sum-integers 1 10) 55
We can also define pi-sum
in the same way:(50)
(define (pi-sum a b) (define (pi-term x) (/ 1.0 (* x (+ x 2)))) (define (pi-next x) (+ x 4)) (sum pi-term a pi-next b))
Using these procedures, we can compute an approximation to [pi]:
(* 8 (pi-sum 1 1000)) 3.139592655589783
Once we have sum
, we can use it as a building block in formulating
further concepts. For instance, the definite integral of a function f
between the limits a and b can be approximated numerically using the
formula
/b / / dx \ / dx \ / dx \ \ | f = | f| a + -- | + f| a + dx + -- | + f| a + 2dx + -- | + ...| dx /a \ \ 2 / \ 2 / \ 2 / /
for small values of dx. We can express this directly as a procedure:
(define (integral f a b dx) (define (add-dx x) (+ x dx)) (* (sum f (+ a (/ dx 2.0)) add-dx b) dx)) (integral cube 0 1 0.01) .24998750000000042 (integral cube 0 1 0.001) .249999875000001
(The exact value of the integral of cube
between 0 and 1 is 1/4.)
Exercise 1.29: Simpson’s Rule is a more accurate method of numerical integration than the method illustrated above. Using Simpson’s Rule, the integral of a function f between a and b is approximated as
h - (y_0 + 4y_1 + 2y_2 + 4y_3 + 2y_4 + ... + 2y_(n-2) + 4y_(n-1) + y_n) 3where h = (b - a)/n, for some even integer n, and y_k = f(a + kh). (Increasing n increases the accuracy of the approximation.) Define a procedure that takes as arguments f, a, b, and n and returns the value of the integral, computed using Simpson’s Rule. Use your procedure to integrate
cube
between 0 and 1 (with n = 100 and n = 1000), and compare the results to those of theintegral
procedure shown above.
Exercise 1.30: The
sum
procedure above generates a linear recursion. The procedure can be rewritten so that the sum is performed iteratively. Show how to do this by filling in the missing expressions in the following definition:(define (sum term a next b) (define (iter a result) (if <??> <??> (iter <??> <??>))) (iter <??> <??>))
- The
sum
procedure is only the simplest of a vast number of similar abstractions that can be captured as higher-order procedures.(51) Write an analogous procedure calledproduct
that returns the product of the values of a function at points over a given range. Show how to definefactorial
in terms ofproduct
. Also useproduct
to compute approximations to [pi] using the formula(52)pi 2 * 4 * 4 * 6 * 6 * 8 ... -- = ------------------------- 4 3 * 3 * 5 * 5 * 7 * 7 ...- If your
product
procedure generates a recursive process, write one that generates an iterative process. If it generates an iterative process, write one that generates a recursive process.
- Show that
sum
andproduct
(Exercise 1-31) are both special cases of a still more general notion calledaccumulate
that combines a collection of terms, using some general accumulation function:(accumulate combiner null-value term a next b)
Accumulate
takes as arguments the same term and range specifications assum
andproduct
, together with acombiner
procedure (of two arguments) that specifies how the current term is to be combined with the accumulation of the preceding terms and anull-value
that specifies what base value to use when the terms run out. Writeaccumulate
and show howsum
andproduct
can both be defined as simple calls toaccumulate
.- If your
accumulate
procedure generates a recursive process, write one that generates an iterative process. If it generates an iterative process, write one that generates a recursive process.
Exercise 1.33: You can obtain an even more general version of
accumulate
(Exercise 1-32) by introducing the notion of a filter on the terms to be combined. That is, combine only those terms derived from values in the range that satisfy a specified condition. The resultingfiltered-accumulate
abstraction takes the same arguments as accumulate, together with an additional predicate of one argument that specifies the filter. Writefiltered-accumulate
as a procedure. Show how to express the following usingfiltered-accumulate
:
- the sum of the squares of the prime numbers in the interval a to b (assuming that you have a
prime?
predicate already written)- the product of all the positive integers less than n that are relatively prime to n (i.e., all positive integers i < n such that GCD(i,n) = 1).
[ << ] | [ < ] | [ Up ] | [ > ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
Lambda
In using sum
as in section Procedures as Arguments, it seems terribly awkward to
have to define trivial procedures such as pi-term
and pi-next
just so we can use them as arguments to our higher-order procedure. Rather
than define pi-next
and pi-term
, it would be more convenient to
have a way to directly specify “the procedure that returns its input
incremented by 4” and “the procedure that returns the reciprocal of its input
times its input plus 2.” We can do this by introducing the special form
lambda
, which creates procedures. Using lambda
we can describe
what we want as
(lambda (x) (+ x 4))
and
(lambda (x) (/ 1.0 (* x (+ x 2))))
Then our pi-sum
procedure can be expressed without defining any
auxiliary procedures as
(define (pi-sum a b) (sum (lambda (x) (/ 1.0 (* x (+ x 2)))) a (lambda (x) (+ x 4)) b))
Again using lambda
, we can write the integral
procedure without
having to define the auxiliary procedure add-dx
:
(define (integral f a b dx) (* (sum f (+ a (/ dx 2.0)) (lambda (x) (+ x dx)) b) dx))
In general, lambda
is used to create procedures in the same way as
define
, except that no name is specified for the procedure:
(lambda (<formal-parameters>) <body>)
The resulting procedure is just as much a procedure as one that is created
using define
. The only difference is that it has not been associated
with any name in the environment. In fact,
(define (plus4 x) (+ x 4))
is equivalent to
(define plus4 (lambda (x) (+ x 4)))
We can read a lambda
expression as follows:
(lambda (x) (+ x 4)) | | | | | the procedure of an argument x that adds x and 4
Like any expression that has a procedure as its value, a lambda
expression can be used as the operator in a combination such as
((lambda (x y z) (+ x y (square z))) 1 2 3) 12
or, more generally, in any context where we would normally use a procedure name.(53)
let
to create local variablesAnother use of lambda
is in creating local variables. We often need
local variables in our procedures other than those that have been bound as
formal parameters. For example, suppose we wish to compute the function
f(x,y) = x(1 + xy)^2 + y(1 - y) + (1 + xy)(1 - y)
which we could also express as
a = 1 + xy b = 1 - y f(x,y) = xa^2 + yb + ab
In writing a procedure to compute f, we would like to include as local variables not only x and y but also the names of intermediate quantities like a and b. One way to accomplish this is to use an auxiliary procedure to bind the local variables:
(define (f x y) (define (f-helper a b) (+ (* x (square a)) (* y b) (* a b))) (f-helper (+ 1 (* x y)) (- 1 y)))
Of course, we could use a lambda
expression to specify an anonymous
procedure for binding our local variables. The body of f
then becomes a
single call to that procedure:
(define (f x y) ((lambda (a b) (+ (* x (square a)) (* y b) (* a b))) (+ 1 (* x y)) (- 1 y)))
This construct is so useful that there is a special form called let
to
make its use more convenient. Using let
, the f
procedure could
be written as
(define (f x y) (let ((a (+ 1 (* x y))) (b (- 1 y))) (+ (* x (square a)) (* y b) (* a b))))
The general form of a let
expression is
(let ((<var1> <exp1>) (<var2> <exp2>) … (<varN> <varN>)) <body>)
which can be thought of as saying
let <var_1> have the value <exp_1> and <var_2> have the value <exp_2> and … <var_n> have the value <exp_n> in <body>
The first part of the let
expression is a list of name-expression pairs.
When the let
is evaluated, each name is associated with the value of the
corresponding expression. The body of the let
is evaluated with these
names bound as local variables. The way this happens is that the let
expression is interpreted as an alternate syntax for
((lambda (<var_1> … <var_n>) <body>) <exp_1> … <exp_n>)
No new mechanism is required in the interpreter in order to provide local
variables. A let
expression is simply syntactic sugar for the
underlying lambda
application.
We can see from this equivalence that the scope of a variable specified by a
let
expression is the body of the let
. This implies that:
Let
allows one to bind variables as locally as possible to where they
are to be used. For example, if the value of x
is 5, the value of the
expression
(+ (let ((x 3)) (+ x (* x 10))) x)
is 38. Here, the x
in the body of the let
is 3, so the value of
the let
expression is 33. On the other hand, the x
that is the
second argument to the outermost +
is still 5.
let
. This matters when
the expressions that provide the values for the local variables depend upon
variables having the same names as the local variables themselves. For
example, if the value of x
is 2, the expression
(let ((x 3) (y (+ x 2))) (* x y))
will have the value 12 because, inside the body of the let
, x
will be 3 and y
will be 4 (which is the outer x
plus 2).
Sometimes we can use internal definitions to get the same effect as with
let
. For example, we could have defined the procedure f
above as
(define (f x y) (define a (+ 1 (* x y))) (define b (- 1 y)) (+ (* x (square a)) (* y b) (* a b)))
We prefer, however, to use let
in situations like this and to use
internal define
only for internal procedures.(54)
Exercise 1.34: Suppose we define the procedure
(define (f g) (g 2))Then we have
(f square) 4 (f (lambda (z) (* z (+ z 1)))) 6What happens if we (perversely) ask the interpreter to evaluate the combination
(f f)
? Explain.
[ << ] | [ < ] | [ Up ] | [ > ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
We introduced compound procedures in section Compound Procedures as a mechanism for
abstracting patterns of numerical operations so as to make them independent of
the particular numbers involved. With higher-order procedures, such as the
integral
procedure of section Procedures as Arguments, we began to see a more
powerful kind of abstraction: procedures used to express general methods of
computation, independent of the particular functions involved. In this section
we discuss two more elaborate examples—general methods for finding zeros and
fixed points of functions—and show how these methods can be expressed
directly as procedures.
The
half-interval method is a simple but powerful technique for
finding roots of an equation f(x) = 0, where f is a continuous
function. The idea is that, if we are given points a and b such that
f(a) < 0 < f(b), then f must have at least one zero between
a and b. To locate a zero, let x be the average of a and b
and compute f(x). If f(x) > 0, then f must have a zero
between a and x. If f(x) < 0, then f must have a zero
between x and b. Continuing in this way, we can identify smaller and
smaller intervals on which f must have a zero. When we reach a point where
the interval is small enough, the process stops. Since the interval of
uncertainty is reduced by half at each step of the process, the number of steps
required grows as [theta](log
( L/T)), where L is the
length of the original interval and T is the error tolerance (that is, the
size of the interval we will consider “small enough”). Here is a procedure
that implements this strategy:
(define (search f neg-point pos-point) (let ((midpoint (average neg-point pos-point))) (if (close-enough? neg-point pos-point) midpoint (let ((test-value (f midpoint))) (cond ((positive? test-value) (search f neg-point midpoint)) ((negative? test-value) (search f midpoint pos-point)) (else midpoint))))))
We assume that we are initially given the function f together with points at which its values are negative and positive. We first compute the midpoint of the two given points. Next we check to see if the given interval is small enough, and if so we simply return the midpoint as our answer. Otherwise, we compute as a test value the value of f at the midpoint. If the test value is positive, then we continue the process with a new interval running from the original negative point to the midpoint. If the test value is negative, we continue with the interval from the midpoint to the positive point. Finally, there is the possibility that the test value is 0, in which case the midpoint is itself the root we are searching for.
To test whether the endpoints are “close enough” we can use a procedure similar to the one used in section Example: Square Roots by Newton’s Method for computing square roots:(55)
(define (close-enough? x y) (< (abs (- x y)) 0.001))
Search
is awkward to use directly, because we can accidentally give it
points at which f’s values do not have the required sign, in which case we
get a wrong answer. Instead we will use search
via the following
procedure, which checks to see which of the endpoints has a negative function
value and which has a positive value, and calls the search
procedure
accordingly. If the function has the same sign on the two given points, the
half-interval method cannot be used, in which case the procedure signals an
error.(56)
(define (half-interval-method f a b) (let ((a-value (f a)) (b-value (f b))) (cond ((and (negative? a-value) (positive? b-value)) (search f a b)) ((and (negative? b-value) (positive? a-value)) (search f b a)) (else (error "Values are not of opposite sign" a b)))))
The following example uses the half-interval method to approximate [pi] as
the root between 2 and 4 of sin
x = 0:
(half-interval-method sin 2.0 4.0) 3.14111328125
Here is another example, using the half-interval method to search for a root of the equation x^3 - 2x - 3 = 0 between 1 and 2:
(half-interval-method (lambda (x) (- (* x x x) (* 2 x) 3)) 1.0 2.0) 1.89306640625
A number x is called a fixed point of a function f if x satisfies the equation f(x) = x. For some functions f we can locate a fixed point by beginning with an initial guess and applying f repeatedly,
f(x), f(f(x), (f(f(f(x))))
until the value does not change very much. Using this idea, we can devise a
procedure fixed-point
that takes as inputs a function and an initial
guess and produces an approximation to a fixed point of the function. We apply
the function repeatedly until we find two successive values whose difference is
less than some prescribed tolerance:
(define tolerance 0.00001) (define (fixed-point f first-guess) (define (close-enough? v1 v2) (< (abs (- v1 v2)) tolerance)) (define (try guess) (let ((next (f guess))) (if (close-enough? guess next) next (try next)))) (try first-guess))
For example, we can use this method to approximate the fixed point of the cosine function, starting with 1 as an initial approximation:(57)
(fixed-point cos 1.0) .7390822985224023
Similarly, we can find a solution to the equation y = sin
y + cos
y:
(fixed-point (lambda (y) (+ (sin y) (cos y))) 1.0) 1.2587315962971173
The fixed-point process is reminiscent of the process we used for finding square roots in section Example: Square Roots by Newton’s Method. Both are based on the idea of repeatedly improving a guess until the result satisfies some criterion. In fact, we can readily formulate the square-root computation as a fixed-point search. Computing the square root of some number x requires finding a y such that y^2 = x. Putting this equation into the equivalent form y = x/y, we recognize that we are looking for a fixed point of the function(58) y |-> x/y, and we can therefore try to compute square roots as
(define (sqrt x) (fixed-point (lambda (y) (/ x y)) 1.0))
Unfortunately, this fixed-point search does not converge. Consider an initial guess y_1. The next guess is y_2 = x/y_1 and the next guess is y_3 = x/y_2 = x/(x/y_1) = y_1. This results in an infinite loop in which the two guesses y_1 and y_2 repeat over and over, oscillating about the answer.
One way to control such oscillations is to prevent the guesses from changing so much. Since the answer is always between our guess y and x/y, we can make a new guess that is not as far from y as x/y by averaging y with x/y, so that the next guess after y is (1/2)(y + x/y) instead of x/y. The process of making such a sequence of guesses is simply the process of looking for a fixed point of y |-> (1/2)(y + x/y):
(define (sqrt x) (fixed-point (lambda (y) (average y (/ x y))) 1.0))
(Note that y = (1/2)(y + x/y) is a simple transformation of the equation y = x/y; to derive it, add y to both sides of the equation and divide by 2.)
With this modification, the square-root procedure works. In fact, if we unravel the definitions, we can see that the sequence of approximations to the square root generated here is precisely the same as the one generated by our original square-root procedure of section Example: Square Roots by Newton’s Method. This approach of averaging successive approximations to a solution, a technique we that we call average damping, often aids the convergence of fixed-point searches.
Exercise 1.35: Show that the golden ratio [phi] (section Tree Recursion) is a fixed point of the transformation x |-> 1 + 1/x, and use this fact to compute [phi] by means of the
fixed-point
procedure.
Exercise 1.36: Modify
fixed-point
so that it prints the sequence of approximations it generates, using thenewline
anddisplay
primitives shown in Exercise 1-22. Then find a solution to x^x = 1000 by finding a fixed point of x |->log
(1000)/log
(x). (Use Scheme’s primitivelog
procedure, which computes natural logarithms.) Compare the number of steps this takes with and without average damping. (Note that you cannot startfixed-point
with a guess of 1, as this would cause division bylog
(1) = 0.)
- An infinite continued fraction is an expression of the form
N_1 f = --------------------- N_2 D_1 + --------------- N_3 D_2 + --------- D_3 + ...As an example, one can show that the infinite continued fraction expansion with the n_i and the D_i all equal to 1 produces 1/[phi], where [phi] is the golden ratio (described in section Tree Recursion). One way to approximate an infinite continued fraction is to truncate the expansion after a given number of terms. Such a truncation—a so-called finite continued fraction k-term finite continued fraction—has the form
N_1 ----------------- N_2 D_1 + ----------- ... N_K + ----- D_KSuppose that
n
andd
are procedures of one argument (the term index i) that return the n_i and D_i of the terms of the continued fraction. Define a procedurecont-frac
such that evaluating(cont-frac n d k)
computes the value of the k-term finite continued fraction. Check your procedure by approximating 1/[phi] using(cont-frac (lambda (i) 1.0) (lambda (i) 1.0) k)for successive values of
k
. How large must you makek
in order to get an approximation that is accurate to 4 decimal places?- If your
cont-frac
procedure generates a recursive process, write one that generates an iterative process. If it generates an iterative process, write one that generates a recursive process.
Exercise 1.38: In 1737, the Swiss mathematician Leonhard Euler published a memoir De Fractionibus Continuis, which included a continued fraction expansion for e - 2, where e is the base of the natural logarithms. In this fraction, the n_i are all 1, and the D_i are successively 1, 2, 1, 1, 4, 1, 1, 6, 1, 1, 8, …. Write a program that uses your
cont-frac
procedure from Exercise 1-37 to approximate e, based on Euler’s expansion.
Exercise 1.39: A continued fraction representation of the tangent function was published in 1770 by the German mathematician J.H. Lambert:
x tan x = --------------- x^2 1 - ----------- x^2 3 - ------- 5 - ...where x is in radians. Define a procedure
(tan-cf x k)
that computes an approximation to the tangent function based on Lambert’s formula.K
specifies the number of terms to compute, as in Exercise 1-37.
[ << ] | [ < ] | [ Up ] | [ > ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
The above examples demonstrate how the ability to pass procedures as arguments significantly enhances the expressive power of our programming language. We can achieve even more expressive power by creating procedures whose returned values are themselves procedures.
We can illustrate this idea by looking again at the fixed-point example described at the end of section Procedures as General Methods. We formulated a new version of the square-root procedure as a fixed-point search, starting with the observation that [sqrt]x is a fixed-point of the function y |-> x/y. Then we used average damping to make the approximations converge. Average damping is a useful general technique in itself. Namely, given a function f, we consider the function whose value at x is equal to the average of x and f(x).
We can express the idea of average damping by means of the following procedure:
(define (average-damp f) (lambda (x) (average x (f x))))
Average-damp
is a procedure that takes as its argument a procedure
f
and returns as its value a procedure (produced by the lambda
)
that, when applied to a number x
, produces the average of x
and
(f x)
. For example, applying average-damp
to the square
procedure produces a procedure whose value at some number x is the average
of x and x^2. Applying this resulting procedure to 10 returns the
average of 10 and 100, or 55:(59)
((average-damp square) 10) 55
Using average-damp
, we can reformulate the square-root procedure as
follows:
(define (sqrt x) (fixed-point (average-damp (lambda (y) (/ x y))) 1.0))
Notice how this formulation makes explicit the three ideas in the method: fixed-point search, average damping, and the function y |-> x/y. It is instructive to compare this formulation of the square-root method with the original version given in section Example: Square Roots by Newton’s Method. Bear in mind that these procedures express the same process, and notice how much clearer the idea becomes when we express the process in terms of these abstractions. In general, there are many ways to formulate a process as a procedure. Experienced programmers know how to choose procedural formulations that are particularly perspicuous, and where useful elements of the process are exposed as separate entities that can be reused in other applications. As a simple example of reuse, notice that the cube root of x is a fixed point of the function y |-> x/y^2, so we can immediately generalize our square-root procedure to one that extracts cube roots:(60)
(define (cube-root x) (fixed-point (average-damp (lambda (y) (/ x (square y)))) 1.0))
When we first introduced the square-root procedure, in section Example: Square Roots by Newton’s Method, we mentioned that this was a special case of Newton’s method. If x |-> g(x) is a differentiable function, then a solution of the equation g(x) = 0 is a fixed point of the function x |-> f(x) where
g(x) f(x) = x - ----- Dg(x)
and Dg(x) is the derivative of g evaluated at x. Newton’s method is the use of the fixed-point method we saw above to approximate a solution of the equation by finding a fixed point of the function f.(61)
For many functions g and for sufficiently good initial guesses for x, Newton’s method converges very rapidly to a solution of g(x) = 0.(62)
In order to implement Newton’s method as a procedure, we must first express the idea of derivative. Note that “derivative,” like average damping, is something that transforms a function into another function. For instance, the derivative of the function x |-> x^3 is the function x |-> 3x^2. In general, if g is a function and dx is a small number, then the derivative Dg of g is the function whose value at any number x is given (in the limit of small dx) by
g(x + dx) - g(x) Dg(c) = ---------------- dx
Thus, we can express the idea of derivative (taking dx to be, say, 0.00001) as the procedure
(define (deriv g) (lambda (x) (/ (- (g (+ x dx)) (g x)) dx)))
along with the definition
(define dx 0.00001)
Like average-damp
, deriv
is a procedure that takes a procedure as
argument and returns a procedure as value. For example, to approximate the
derivative of x |-> x^3 at 5 (whose exact value is 75) we can evaluate
(define (cube x) (* x x x)) ((deriv cube) 5) 75.00014999664018
With the aid of deriv
, we can express Newton’s method as a fixed-point
process:
(define (newton-transform g) (lambda (x) (- x (/ (g x) ((deriv g) x))))) (define (newtons-method g guess) (fixed-point (newton-transform g) guess))
The newton-transform
procedure expresses the formula at the beginning of
this section, and newtons-method
is readily defined in terms of this.
It takes as arguments a procedure that computes the function for which we want
to find a zero, together with an initial guess. For instance, to find the
square root of x, we can use Newton’s method to find a zero of the function
y |-> y^2 - x starting with an initial guess of 1.(63)
This provides yet another form of the square-root procedure:
(define (sqrt x) (newtons-method (lambda (y) (- (square y) x)) 1.0))
We’ve seen two ways to express the square-root computation as an instance of a more general method, once as a fixed-point search and once using Newton’s method. Since Newton’s method was itself expressed as a fixed-point process, we actually saw two ways to compute square roots as fixed points. Each method begins with a function and finds a fixed point of some transformation of the function. We can express this general idea itself as a procedure:
(define (fixed-point-of-transform g transform guess) (fixed-point (transform g) guess))
This very general procedure takes as its arguments a procedure g
that
computes some function, a procedure that transforms g
, and an initial
guess. The returned result is a fixed point of the transformed function.
Using this abstraction, we can recast the first square-root computation from this section (where we look for a fixed point of the average-damped version of y |-> x/y) as an instance of this general method:
(define (sqrt x) (fixed-point-of-transform (lambda (y) (/ x y)) average-damp 1.0))
Similarly, we can express the second square-root computation from this section (an instance of Newton’s method that finds a fixed point of the Newton transform of y |-> y^2 - x) as
(define (sqrt x) (fixed-point-of-transform (lambda (y) (- (square y) x)) newton-transform 1.0))
We began section Formulating Abstractions with Higher-Order Procedures with the observation that compound procedures are a crucial abstraction mechanism, because they permit us to express general methods of computing as explicit elements in our programming language. Now we’ve seen how higher-order procedures permit us to manipulate these general methods to create further abstractions.
As programmers, we should be alert to opportunities to identify the underlying abstractions in our programs and to build upon them and generalize them to create more powerful abstractions. This is not to say that one should always write programs in the most abstract way possible; expert programmers know how to choose the level of abstraction appropriate to their task. But it is important to be able to think in terms of these abstractions, so that we can be ready to apply them in new contexts. The significance of higher-order procedures is that they enable us to represent these abstractions explicitly as elements in our programming language, so that they can be handled just like other computational elements.
In general, programming languages impose restrictions on the ways in which computational elements can be manipulated. Elements with the fewest restrictions are said to have first-class status. Some of the “rights and privileges” of first-class elements are:(64)
Lisp, unlike other common programming languages, awards procedures full first-class status. This poses challenges for efficient implementation, but the resulting gain in expressive power is enormous.(66)
Exercise 1.40: Define a procedure
cubic
that can be used together with thenewtons-method
procedure in expressions of the form(newtons-method (cubic a b c) 1)to approximate zeros of the cubic x^3 + ax^2 + bx + c.
Exercise 1.41: Define a procedure
double
that takes a procedure of one argument as argument and returns a procedure that applies the original procedure twice. For example, ifinc
is a procedure that adds 1 to its argument, then(double inc)
should be a procedure that adds 2. What value is returned by(((double (double double)) inc) 5)
Exercise 1.42: Let f and g be two one-argument functions. The composition f after g is defined to be the function x |-> f(g(x)). Define a procedure
compose
that implements composition. For example, ifinc
is a procedure that adds 1 to its argument,((compose square inc) 6) 49
Exercise 1.43: If f is a numerical function and n is a positive integer, then we can form the nth repeated application of f, which is defined to be the function whose value at x is f(f(…(f(x))…)). For example, if f is the function x |-> x + 1, then the nth repeated application of f is the function x |-> x + n. If f is the operation of squaring a number, then the nth repeated application of f is the function that raises its argument to the 2^nth power. Write a procedure that takes as inputs a procedure that computes f and a positive integer n and returns the procedure that computes the nth repeated application of f. Your procedure should be able to be used as follows:
((repeated square 2) 5) 625Hint: You may find it convenient to use
compose
from Exercise 1-42.
Exercise 1.44: The idea of smoothing a function is an important concept in signal processing. If f is a function and dx is some small number, then the smoothed version of f is the function whose value at a point x is the average of f(x - dx), f(x), and f(x + dx). Write a procedure
smooth
that takes as input a procedure that computes f and returns a procedure that computes the smoothed f. It is sometimes valuable to repeatedly smooth a function (that is, smooth the smoothed function, and so on) to obtained the n-fold smoothed function. Show how to generate the n-fold smoothed function of any given function usingsmooth
andrepeated
from Exercise 1-43.
Exercise 1.45: We saw in section Procedures as General Methods that attempting to compute square roots by naively finding a fixed point of y |-> x/y does not converge, and that this can be fixed by average damping. The same method works for finding cube roots as fixed points of the average-damped y |-> x/y^2. Unfortunately, the process does not work for fourth roots—a single average damp is not enough to make a fixed-point search for y |-> x/y^3 converge. On the other hand, if we average damp twice (i.e., use the average damp of the average damp of y |-> x/y^3) the fixed-point search does converge. Do some experiments to determine how many average damps are required to compute nth roots as a fixed-point search based upon repeated average damping of y |-> x/y^(n-1). Use this to implement a simple procedure for computing nth roots using
fixed-point
,average-damp
, and therepeated
procedure of Exercise 1-43. Assume that any arithmetic operations you need are available as primitives.
Exercise 1.46: Several of the numerical methods described in this chapter are instances of an extremely general computational strategy known as iterative improvement. Iterative improvement says that, to compute something, we start with an initial guess for the answer, test if the guess is good enough, and otherwise improve the guess and continue the process using the improved guess as the new guess. Write a procedure
iterative-improve
that takes two procedures as arguments: a method for telling whether a guess is good enough and a method for improving a guess.Iterative-improve
should return as its value a procedure that takes a guess as argument and keeps improving the guess until it is good enough. Rewrite thesqrt
procedure of section Example: Square Roots by Newton’s Method and thefixed-point
procedure of section Procedures as General Methods in terms ofiterative-improve
.
[ << ] | [ < ] | [ Up ] | [ > ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
We now come to the decisive step of mathematical abstraction: we forget about what the symbols stand for. …[The mathematician] need not be idle; there are many operations which he may carry out with these symbols, without ever having to look at the things they stand for.
—Hermann Weyl, The Mathematical Way of Thinking
We concentrated in Building Abstractions with Procedures on computational processes and on the role
of procedures in program design. We saw how to use primitive data (numbers)
and primitive operations (arithmetic operations), how to combine procedures to
form compound procedures through composition, conditionals, and the use of
parameters, and how to abstract procedures by using define
. We saw that
a procedure can be regarded as a pattern for the local evolution of a process,
and we classified, reasoned about, and performed simple algorithmic analyses of
some common patterns for processes as embodied in procedures. We also saw that
higher-order procedures enhance the power of our language by enabling us to
manipulate, and thereby to reason in terms of, general methods of computation.
This is much of the essence of programming.
In this chapter we are going to look at more complex data. All the procedures in Building Abstractions with Procedures operate on simple numerical data, and simple data are not sufficient for many of the problems we wish to address using computation. Programs are typically designed to model complex phenomena, and more often than not one must construct computational objects that have several parts in order to model real-world phenomena that have several aspects. Thus, whereas our focus in Building Abstractions with Procedures was on building abstractions by combining procedures to form compound procedures, we turn in this chapter to another key aspect of any programming language: the means it provides for building abstractions by combining data objects to form compound data.
Why do we want compound data in a programming language? For the same reasons that we want compound procedures: to elevate the conceptual level at which we can design our programs, to increase the modularity of our designs, and to enhance the expressive power of our language. Just as the ability to define procedures enables us to deal with processes at a higher conceptual level than that of the primitive operations of the language, the ability to construct compound data objects enables us to deal with data at a higher conceptual level than that of the primitive data objects of the language.
Consider the task of designing a system to perform arithmetic with rational
numbers. We could imagine an operation add-rat
that takes two rational
numbers and produces their sum. In terms of simple data, a rational number can
be thought of as two integers: a numerator and a denominator. Thus, we could
design a program in which each rational number would be represented by two
integers (a numerator and a denominator) and where add-rat
would be
implemented by two procedures (one producing the numerator of the sum and one
producing the denominator). But this would be awkward, because we would then
need to explicitly keep track of which numerators corresponded to which
denominators. In a system intended to perform many operations on many rational
numbers, such bookkeeping details would clutter the programs substantially, to
say nothing of what they would do to our minds. It would be much better if we
could “glue together” a numerator and denominator to form a pair—a
compound data object—that our programs could manipulate in a way
that would be consistent with regarding a rational number as a single
conceptual unit.
The use of compound data also enables us to increase the modularity of our programs. If we can manipulate rational numbers directly as objects in their own right, then we can separate the part of our program that deals with rational numbers per se from the details of how rational numbers may be represented as pairs of integers. The general technique of isolating the parts of a program that deal with how data objects are represented from the parts of a program that deal with how data objects are used is a powerful design methodology called data abstraction. We will see how data abstraction makes programs much easier to design, maintain, and modify.
The use of compound data leads to a real increase in the expressive power of our programming language. Consider the idea of forming a “linear combination” ax + by. We might like to write a procedure that would accept a, b, x, and y as arguments and return the value of ax + by. This presents no difficulty if the arguments are to be numbers, because we can readily define the procedure
(define (linear-combination a b x y) (+ (* a x) (* b y)))
But suppose we are not concerned only with numbers. Suppose we would like to express, in procedural terms, the idea that one can form linear combinations whenever addition and multiplication are defined—for rational numbers, complex numbers, polynomials, or whatever. We could express this as a procedure of the form
(define (linear-combination a b x y) (add (mul a x) (mul b y)))
where add
and mul
are not the primitive procedures +
and
*
but rather more complex things that will perform the appropriate
operations for whatever kinds of data we pass in as the arguments a
,
b
, x
, and y
. The key point is that the only thing
linear-combination
should need to know about a
, b
,
x
, and y
is that the procedures add
and mul
will
perform the appropriate manipulations. From the perspective of the procedure
linear-combination
, it is irrelevant what a
, b
, x
,
and y
are and even more irrelevant how they might happen to be
represented in terms of more primitive data. This same example shows why it is
important that our programming language provide the ability to manipulate
compound objects directly: Without this, there is no way for a procedure such
as linear-combination
to pass its arguments along to add
and
mul
without having to know their detailed structure.(67)
We begin this chapter by implementing the rational-number arithmetic system mentioned above. This will form the background for our discussion of compound data and data abstraction. As with compound procedures, the main issue to be addressed is that of abstraction as a technique for coping with complexity, and we will see how data abstraction enables us to erect suitable abstraction barriers between different parts of a program.
We will see that the key to forming compound data is that a programming language should provide some kind of “glue” so that data objects can be combined to form more complex data objects. There are many possible kinds of glue. Indeed, we will discover how to form compound data using no special “data” operations at all, only procedures. This will further blur the distinction between “procedure” and “data,” which was already becoming tenuous toward the end of Building Abstractions with Procedures. We will also explore some conventional techniques for representing sequences and trees. One key idea in dealing with compound data is the notion of closure—that the glue we use for combining data objects should allow us to combine not only primitive data objects, but compound data objects as well. Another key idea is that compound data objects can serve as conventional interfaces for combining program modules in mix-and-match ways. We illustrate some of these ideas by presenting a simple graphics language that exploits closure.
We will then augment the representational power of our language by introducing symbolic expressions—data whose elementary parts can be arbitrary symbols rather than only numbers. We explore various alternatives for representing sets of objects. We will find that, just as a given numerical function can be computed by many different computational processes, there are many ways in which a given data structure can be represented in terms of simpler objects, and the choice of representation can have significant impact on the time and space requirements of processes that manipulate the data. We will investigate these ideas in the context of symbolic differentiation, the representation of sets, and the encoding of information.
Next we will take up the problem of working with data that may be represented differently by different parts of a program. This leads to the need to implement generic operations, which must handle many different types of data. Maintaining modularity in the presence of generic operations requires more powerful abstraction barriers than can be erected with simple data abstraction alone. In particular, we introduce programming data-directed programming as a technique that allows individual data representations to be designed in isolation and then combined additively (i.e., without modification). To illustrate the power of this approach to system design, we close the chapter by applying what we have learned to the implementation of a package for performing symbolic arithmetic on polynomials, in which the coefficients of the polynomials can be integers, rational numbers, complex numbers, and even other polynomials.
2.1 Introduction to Data Abstraction | ||
2.2 Hierarchical Data and the Closure Property | ||
2.3 Symbolic Data | ||
2.4 Multiple Representations for Abstract Data | ||
2.5 Systems with Generic Operations |
[ << ] | [ < ] | [ Up ] | [ > ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
In section Procedures as Black-Box Abstractions, we noted that a procedure used as an element in creating a more complex procedure could be regarded not only as a collection of particular operations but also as a procedural abstraction. That is, the details of how the procedure was implemented could be suppressed, and the particular procedure itself could be replaced by any other procedure with the same overall behavior. In other words, we could make an abstraction that would separate the way the procedure would be used from the details of how the procedure would be implemented in terms of more primitive procedures. The analogous notion for compound data is called data abstraction. Data abstraction is a methodology that enables us to isolate how a compound data object is used from the details of how it is constructed from more primitive data objects.
The basic idea of data abstraction is to structure the programs that are to use compound data objects so that they operate on “abstract data.” That is, our programs should use data in such a way as to make no assumptions about the data that are not strictly necessary for performing the task at hand. At the same time, a “concrete” data representation is defined independent of the programs that use the data. The interface between these two parts of our system will be a set of procedures, called selectors and constructors, that implement the abstract data in terms of the concrete representation. To illustrate this technique, we will consider how to design a set of procedures for manipulating rational numbers.
2.1.1 Example: Arithmetic Operations for Rational Numbers | ||
2.1.2 Abstraction Barriers | ||
2.1.3 What Is Meant by Data? | ||
2.1.4 Extended Exercise: Interval Arithmetic |
[ << ] | [ < ] | [ Up ] | [ > ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
Suppose we want to do arithmetic with rational numbers. We want to be able to add, subtract, multiply, and divide them and to test whether two rational numbers are equal.
Let us begin by assuming that we already have a way of constructing a rational number from a numerator and a denominator. We also assume that, given a rational number, we have a way of extracting (or selecting) its numerator and its denominator. Let us further assume that the constructor and selectors are available as procedures:
(make-rat <n> <d>)
returns therational number whose
numerator is the integer <n>
and whose denominator is the integer
<d>
.
(numer <x>)
returns the numerator of the rational number
<x>
.
(denom <x>)
returns the denominator of the rational number
<x>
.
We are using here a powerful strategy of synthesis:
wishful thinking.
We haven’t yet said how a rational number is represented, or how the procedures
numer
, denom
, and make-rat
should be implemented. Even
so, if we did have these three procedures, we could then add, subtract,
multiply, divide, and test equality by using the following relations:
n_1 n_2 n_1 d_2 + n_2 d_1 --- + --- = ----------------- d_1 d_2 d_1 d_2 n_1 n_2 n_1 d_2 - n_2 d_1 --- - --- = ----------------- d_1 d_2 d_1 d_2 n_1 n_2 n_1 n_2 --- * --- = ------- d_1 d_2 d_1 d_2 n_1 / d_1 n_1 d_2 --------- = ------- n_2 / d_2 d_1 n_2 n_1 n_2 --- = --- if and only if n_1 d_2 = n_2 d_1 d_1 d_2
We can express these rules as procedures:
(define (add-rat x y) (make-rat (+ (* (numer x) (denom y)) (* (numer y) (denom x))) (* (denom x) (denom y)))) (define (sub-rat x y) (make-rat (- (* (numer x) (denom y)) (* (numer y) (denom x))) (* (denom x) (denom y)))) (define (mul-rat x y) (make-rat (* (numer x) (numer y)) (* (denom x) (denom y)))) (define (div-rat x y) (make-rat (* (numer x) (denom y)) (* (denom x) (numer y)))) (define (equal-rat? x y) (= (* (numer x) (denom y)) (* (numer y) (denom x))))
Now we have the operations on rational numbers defined in terms of the selector
and constructor procedures numer
, denom
, and make-rat
.
But we haven’t yet defined these. What we need is some way to glue together a
numerator and a denominator to form a rational number.
To enable us to implement the concrete level of our data abstraction, our
language provides a compound structure called a
pair, which can be
constructed with the primitive procedure cons
. This procedure takes two
arguments and returns a compound data object that contains the two arguments as
parts. Given a pair, we can extract the parts using the primitive procedures
car
and cdr
.(68) Thus, we can use cons
, car
, and
cdr
as follows:
(define x (cons 1 2)) (car x) 1 (cdr x) 2
Notice that a pair is a data object that can be given a name and manipulated,
just like a primitive data object. Moreover, cons
can be used to form
pairs whose elements are pairs, and so on:
(define x (cons 1 2)) (define y (cons 3 4)) (define z (cons x y)) (car (car z)) 1 (car (cdr z)) 3
In section Hierarchical Data and the Closure Property we will see how this ability to combine pairs means that
pairs can be used as general-purpose building blocks to create all sorts of
complex data structures. The single compound-data primitive
pair,
implemented by the procedures cons
, car
, and cdr
, is the
only glue we need. Data objects constructed from pairs are called
list-structured data.
Pairs offer a natural way to complete the rational-number system. Simply
represent a rational number as a pair of two integers: a numerator and a
denominator. Then make-rat
, numer
, and denom
are readily
implemented as follows:(69)
(define (make-rat n d) (cons n d)) (define (numer x) (car x)) (define (denom x) (cdr x))
Also, in order to display the results of our computations, we can print rational numbers by printing the numerator, a slash, and the denominator:(70)
(define (print-rat x) (newline) (display (numer x)) (display "/") (display (denom x)))
Now we can try our rational-number procedures:
(define one-half (make-rat 1 2)) (print-rat one-half) 1/2 (define one-third (make-rat 1 3)) (print-rat (add-rat one-half one-third)) 5/6 (print-rat (mul-rat one-half one-third)) 1/6 (print-rat (add-rat one-third one-third)) 6/9
As the final example shows, our rational-number implementation does not reduce
rational numbers to lowest terms. We can remedy this by changing
make-rat
. If we have a gcd
procedure like the one in section
Greatest Common Divisors that produces the greatest common divisor of two integers, we can
use gcd
to reduce the numerator and the denominator to lowest terms
before constructing the pair:
(define (make-rat n d) (let ((g (gcd n d))) (cons (/ n g) (/ d g))))
Now we have
(print-rat (add-rat one-third one-third)) 2/3
as desired. This modification was accomplished by changing the constructor
make-rat
without changing any of the procedures (such as add-rat
and mul-rat
) that implement the actual operations.
Exercise 2.1: Define a better version of
make-rat
that handles both positive and negative arguments.Make-rat
should normalize the sign so that if the rational number is positive, both the numerator and denominator are positive, and if the rational number is negative, only the numerator is negative.
[ << ] | [ < ] | [ Up ] | [ > ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
Before continuing with more examples of compound data and data abstraction, let
us consider some of the issues raised by the rational-number example. We
defined the rational-number operations in terms of a constructor
make-rat
and selectors numer
and denom
. In general, the
underlying idea of data abstraction is to identify for each type of data object
a basic set of operations in terms of which all manipulations of data objects
of that type will be expressed, and then to use only those operations in
manipulating the data.
We can envision the structure of the rational-number system as shown in figure
Figure 2-1. The horizontal lines represent
barriers
abstraction
barriers that isolate different “levels” of the system. At each level, the
barrier separates the programs (above) that use the data abstraction from the
programs (below) that implement the data abstraction. Programs that use
rational numbers manipulate them solely in terms of the procedures supplied
“for public use” by the rational-number package: add-rat
,
sub-rat
, mul-rat
, div-rat
, and equal-rat?
. These,
in turn, are implemented solely in terms of the constructor and selectors
make-rat
, numer
, and denom
, which themselves are
implemented in terms of pairs. The details of how pairs are implemented are
irrelevant to the rest of the rational-number package so long as pairs can be
manipulated by the use of cons
, car
, and cdr
. In effect,
procedures at each level are the interfaces that define the abstraction
barriers and connect the different levels.
Figure 2.1: Data-abstraction barriers in the rational-number package.
+------------------------------------+ --------| Programs that use rational numbers |-------- +------------------------------------+ Rational numbers in promblem domain +---------------------------+ ------------| add-rat sub-rat ... |------------- +---------------------------+ Rational numbers as numerators and denominators +------------------------+ --------------| make-rat numer denom |-------------- +------------------------+ Rational numbers as pairs +----------------+ ------------------| cons car cdr |------------------ +----------------+ However pairs are implemented
This simple idea has many advantages. One advantage is that it makes programs much easier to maintain and to modify. Any complex data structure can be represented in a variety of ways with the primitive data structures provided by a programming language. Of course, the choice of representation influences the programs that operate on it; thus, if the representation were to be changed at some later time, all such programs might have to be modified accordingly. This task could be time-consuming and expensive in the case of large programs unless the dependence on the representation were to be confined by design to a very few program modules.
For example, an alternate way to address the problem of reducing rational numbers to lowest terms is to perform the reduction whenever we access the parts of a rational number, rather than when we construct it. This leads to different constructor and selector procedures:
(define (make-rat n d) (cons n d)) (define (numer x) (let ((g (gcd (car x) (cdr x)))) (/ (car x) g))) (define (denom x) (let ((g (gcd (car x) (cdr x)))) (/ (cdr x) g)))
The difference between this implementation and the previous one lies in when we
compute the gcd
. If in our typical use of rational numbers we access
the numerators and denominators of the same rational numbers many times, it
would be preferable to compute the gcd
when the rational numbers are
constructed. If not, we may be better off waiting until access time to compute
the gcd
. In any case, when we change from one representation to the
other, the procedures add-rat
, sub-rat
, and so on do not have to
be modified at all.
Constraining the dependence on the representation to a few interface procedures
helps us design programs as well as modify them, because it allows us to
maintain the flexibility to consider alternate implementations. To continue
with our simple example, suppose we are designing a rational-number package and
we can’t decide initially whether to perform the gcd
at construction
time or at selection time. The data-abstraction methodology gives us a way to
defer that decision without losing the ability to make progress on the rest of
the system.
Exercise 2.2: Consider the problem of representing line segments in a plane. Each segment is represented as a pair of points: a starting point and an ending point. Define a constructor
make-segment
and selectorsstart-segment
andend-segment
that define the representation of segments in terms of points. Furthermore, a point can be represented as a pair of numbers: the x coordinate and the y coordinate. Accordingly, specify a constructormake-point
and selectorsx-point
andy-point
that define this representation. Finally, using your selectors and constructors, define a proceduremidpoint-segment
that takes a line segment as argument and returns its midpoint (the point whose coordinates are the average of the coordinates of the endpoints). To try your procedures, you’ll need a way to print points:(define (print-point p) (newline) (display "(") (display (x-point p)) (display ",") (display (y-point p)) (display ")"))
Exercise 2.3: Implement a representation for rectangles in a plane. (Hint: You may want to make use of Exercise 2-2.) In terms of your constructors and selectors, create procedures that compute the perimeter and the area of a given rectangle. Now implement a different representation for rectangles. Can you design your system with suitable abstraction barriers, so that the same perimeter and area procedures will work using either representation?
[ << ] | [ < ] | [ Up ] | [ > ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
We began the rational-number implementation in section Example: Arithmetic Operations for Rational Numbers by
implementing the rational-number operations add-rat
, sub-rat
, and
so on in terms of three unspecified procedures: make-rat
, numer
,
and denom
. At that point, we could think of the operations as being
defined in terms of data objects—numerators, denominators, and rational
numbers—whose behavior was specified by the latter three procedures.
But exactly what is meant by
data? It is not enough to say
“whatever is implemented by the given selectors and constructors.” Clearly,
not every arbitrary set of three procedures can serve as an appropriate basis
for the rational-number implementation. We need to guarantee that, if we
construct a rational number x
from a pair of integers n
and
d
, then extracting the numer
and the denom
of x
and
dividing them should yield the same result as dividing n
by d
.
In other words, make-rat
, numer
, and denom
must satisfy
the condition that, for any integer n
and any non-zero integer d
,
if x
is (make-rat n d
), then
(numer x) n --------- = --- (denom x) d
In fact, this is the only condition make-rat
, numer
, and
denom
must fulfill in order to form a suitable basis for a
rational-number representation. In general, we can think of data as defined by
some collection of selectors and constructors, together with specified
conditions that these procedures must fulfill in order to be a valid
representation.(71)
This point of view can serve to define not only “high-level” data objects,
such as rational numbers, but lower-level objects as well. Consider the notion
of a pair, which we used in order to define our rational numbers. We never
actually said what a pair was, only that the language supplied procedures
cons
, car
, and cdr
for operating on pairs. But the only
thing we need to know about these three operations is that if we glue two
objects together using cons
we can retrieve the objects using car
and cdr
. That is, the operations satisfy the condition that, for any
objects x
and y
, if z
is (cons x y)
then (car
z)
is x
and (cdr z)
is y
. Indeed, we mentioned that
these three procedures are included as primitives in our language. However,
any triple of procedures that satisfies the above condition can be used as the
basis for implementing pairs. This point is illustrated strikingly by the fact
that we could implement cons
, car
, and cdr
without using
any data structures at all but only using procedures. Here are the
definitions:
(define (cons x y) (define (dispatch m) (cond ((= m 0) x) ((= m 1) y) (else (error "Argument not 0 or 1 -- CONS" m)))) dispatch) (define (car z) (z 0)) (define (cdr z) (z 1))
This use of procedures corresponds to nothing like our intuitive notion of what data should be. Nevertheless, all we need to do to show that this is a valid way to represent pairs is to verify that these procedures satisfy the condition given above.
The subtle point to notice is that the value returned by (cons x y)
is a
procedure—namely the internally defined procedure dispatch
, which
takes one argument and returns either x
or y
depending on whether
the argument is 0 or 1. Correspondingly, (car z)
is defined to apply
z
to 0. Hence, if z
is the procedure formed by (cons x
y)
, then z
applied to 0 will yield x
. Thus, we have shown that
(car (cons x y))
yields x
, as desired. Similarly, (cdr
(cons x y))
applies the procedure returned by (cons x y)
to 1, which
returns y
. Therefore, this procedural implementation of pairs is a
valid implementation, and if we access pairs using only cons
,
car
, and cdr
we cannot distinguish this implementation from one
that uses “real” data structures.
The point of exhibiting the procedural representation of pairs is not that our language works this way (Scheme, and Lisp systems in general, implement pairs directly, for efficiency reasons) but that it could work this way. The procedural representation, although obscure, is a perfectly adequate way to represent pairs, since it fulfills the only conditions that pairs need to fulfill. This example also demonstrates that the ability to manipulate procedures as objects automatically provides the ability to represent compound data. This may seem a curiosity now, but procedural representations of data will play a central role in our programming repertoire. This style of programming is often called message passing, and we will be using it as a basic tool in Modularity, Objects, and State when we address the issues of modeling and simulation.
Exercise 2.4: Here is an alternative procedural representation of pairs. For this representation, verify that
(car (cons x y))
yieldsx
for any objectsx
andy
.(define (cons x y) (lambda (m) (m x y))) (define (car z) (z (lambda (p q) p)))What is the corresponding definition of
cdr
? (Hint: To verify that this works, make use of the substitution model of section The Substitution Model for Procedure Application.)
Exercise 2.5: Show that we can represent pairs of nonnegative integers using only numbers and arithmetic operations if we represent the pair a and b as the integer that is the product 2^a 3^b. Give the corresponding definitions of the procedures
cons
,car
, andcdr
.
Exercise 2.6: In case representing pairs as procedures wasn’t mind-boggling enough, consider that, in a language that can manipulate procedures, we can get by without numbers (at least insofar as nonnegative integers are concerned) by implementing 0 and the operation of adding 1 as
(define zero (lambda (f) (lambda (x) x))) (define (add-1 n) (lambda (f) (lambda (x) (f ((n f) x)))))This representation is known as Church numerals, after its inventor, Alonzo Church, the logician who invented the [lambda] calculus.
Define
one
andtwo
directly (not in terms ofzero
andadd-1
). (Hint: Use substitution to evaluate(add-1 zero)
). Give a direct definition of the addition procedure+
(not in terms of repeated application ofadd-1
).
[ << ] | [ < ] | [ Up ] | [ > ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
Alyssa P. Hacker is designing a system to help people solve engineering problems. One feature she wants to provide in her system is the ability to manipulate inexact quantities (such as measured parameters of physical devices) with known precision, so that when computations are done with such approximate quantities the results will be numbers of known precision.
Electrical engineers will be using Alyssa’s system to compute electrical quantities. It is sometimes necessary for them to compute the value of a parallel equivalent resistance R_p of two resistors R_1 and R_2 using the formula
1 R_p = ------------- 1/R_1 + 1/R_2
Resistance values are usually known only up to some tolerance guaranteed by the manufacturer of the resistor. For example, if you buy a resistor labeled “6.8 ohms with 10% tolerance” you can only be sure that the resistor has a resistance between 6.8 - 0.68 = 6.12 and 6.8 + 0.68 = 7.48 ohms. Thus, if you have a 6.8-ohm 10% resistor in parallel with a 4.7-ohm 5% resistor, the resistance of the combination can range from about 2.58 ohms (if the two resistors are at the lower bounds) to about 2.97 ohms (if the two resistors are at the upper bounds).
Alyssa’s idea is to implement “interval arithmetic” as a set of arithmetic operations for combining “intervals” (objects that represent the range of possible values of an inexact quantity). The result of adding, subtracting, multiplying, or dividing two intervals is itself an interval, representing the range of the result.
Alyssa postulates the existence of an abstract object called an “interval”
that has two endpoints: a lower bound and an upper bound. She also presumes
that, given the endpoints of an interval, she can construct the interval using
the data constructor make-interval
. Alyssa first writes a procedure for
adding two intervals. She reasons that the minimum value the sum could be is
the sum of the two lower bounds and the maximum value it could be is the sum of
the two upper bounds:
(define (add-interval x y) (make-interval (+ (lower-bound x) (lower-bound y)) (+ (upper-bound x) (upper-bound y))))
Alyssa also works out the product of two intervals by finding the minimum and
the maximum of the products of the bounds and using them as the bounds of the
resulting interval. (Min
and max
are primitives that find the
minimum or maximum of any number of arguments.)
(define (mul-interval x y) (let ((p1 (* (lower-bound x) (lower-bound y))) (p2 (* (lower-bound x) (upper-bound y))) (p3 (* (upper-bound x) (lower-bound y))) (p4 (* (upper-bound x) (upper-bound y)))) (make-interval (min p1 p2 p3 p4) (max p1 p2 p3 p4))))
To divide two intervals, Alyssa multiplies the first by the reciprocal of the second. Note that the bounds of the reciprocal interval are the reciprocal of the upper bound and the reciprocal of the lower bound, in that order.
(define (div-interval x y) (mul-interval x (make-interval (/ 1.0 (upper-bound y)) (/ 1.0 (lower-bound y)))))
Exercise 2.7: Alyssa’s program is incomplete because she has not specified the implementation of the interval abstraction. Here is a definition of the interval constructor:
(define (make-interval a b) (cons a b))Define selectors
upper-bound
andlower-bound
to complete the implementation.
Exercise 2.8: Using reasoning analogous to Alyssa’s, describe how the difference of two intervals may be computed. Define a corresponding subtraction procedure, called
sub-interval
.
Exercise 2.9: The width of an interval is half of the difference between its upper and lower bounds. The width is a measure of the uncertainty of the number specified by the interval. For some arithmetic operations the width of the result of combining two intervals is a function only of the widths of the argument intervals, whereas for others the width of the combination is not a function of the widths of the argument intervals. Show that the width of the sum (or difference) of two intervals is a function only of the widths of the intervals being added (or subtracted). Give examples to show that this is not true for multiplication or division.
Exercise 2.10: Ben Bitdiddle, an expert systems programmer, looks over Alyssa’s shoulder and comments that it is not clear what it means to divide by an interval that spans zero. Modify Alyssa’s code to check for this condition and to signal an error if it occurs.
Exercise 2.11: In passing, Ben also cryptically comments: “By testing the signs of the endpoints of the intervals, it is possible to break
mul-interval
into nine cases, only one of which requires more than two multiplications.” Rewrite this procedure using Ben’s suggestion.After debugging her program, Alyssa shows it to a potential user, who complains that her program solves the wrong problem. He wants a program that can deal with numbers represented as a center value and an additive tolerance; for example, he wants to work with intervals such as 3.5 +/- 0.15 rather than [3.35, 3.65]. Alyssa returns to her desk and fixes this problem by supplying an alternate constructor and alternate selectors:
(define (make-center-width c w) (make-interval (- c w) (+ c w))) (define (center i) (/ (+ (lower-bound i) (upper-bound i)) 2)) (define (width i) (/ (- (upper-bound i) (lower-bound i)) 2))Unfortunately, most of Alyssa’s users are engineers. Real engineering situations usually involve measurements with only a small uncertainty, measured as the ratio of the width of the interval to the midpoint of the interval. Engineers usually specify percentage tolerances on the parameters of devices, as in the resistor specifications given earlier.
Exercise 2.12: Define a constructor
make-center-percent
that takes a center and a percentage tolerance and produces the desired interval. You must also define a selectorpercent
that produces the percentage tolerance for a given interval. Thecenter
selector is the same as the one shown above.
Exercise 2.13: Show that under the assumption of small percentage tolerances there is a simple formula for the approximate percentage tolerance of the product of two intervals in terms of the tolerances of the factors. You may simplify the problem by assuming that all numbers are positive.
After considerable work, Alyssa P. Hacker delivers her finished system. Several years later, after she has forgotten all about it, she gets a frenzied call from an irate user, Lem E. Tweakit. It seems that Lem has noticed that the formula for parallel resistors can be written in two algebraically equivalent ways:
R_1 R_2 --------- R_1 + R_2and
1 ------------- 1/R_1 + 1/R_2He has written the following two programs, each of which computes the parallel-resistors formula differently:
(define (par1 r1 r2) (div-interval (mul-interval r1 r2) (add-interval r1 r2))) (define (par2 r1 r2) (let ((one (make-interval 1 1))) (div-interval one (add-interval (div-interval one r1) (div-interval one r2)))))Lem complains that Alyssa’s program gives different answers for the two ways of computing. This is a serious complaint.
Exercise 2.14: Demonstrate that Lem is right. Investigate the behavior of the system on a variety of arithmetic expressions. Make some intervals A and B, and use them in computing the expressions A/A and A/B. You will get the most insight by using intervals whose width is a small percentage of the center value. Examine the results of the computation in center-percent form (see Exercise 2-12).
Exercise 2.15: Eva Lu Ator, another user, has also noticed the different intervals computed by different but algebraically equivalent expressions. She says that a formula to compute with intervals using Alyssa’s system will produce tighter error bounds if it can be written in such a form that no variable that represents an uncertain number is repeated. Thus, she says,
par2
is a “better” program for parallel resistances thanpar1
. Is she right? Why?
Exercise 2.16: Explain, in general, why equivalent algebraic expressions may lead to different answers. Can you devise an interval-arithmetic package that does not have this shortcoming, or is this task impossible? (Warning: This problem is very difficult.)
[ << ] | [ < ] | [ Up ] | [ > ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
As we have seen, pairs provide a primitive “glue” that we can use to
construct compound data objects. Figure 2-2 shows a standard way to
visualize a pair—in this case, the pair formed by (cons 1 2)
. In this
representation, which is called
box-and-pointer notation, each object
is shown as a
pointer to a box. The box for a primitive object
contains a representation of the object. For example, the box for a number
contains a numeral. The box for a pair is actually a double box, the left part
containing (a pointer to) the car
of the pair and the right part
containing the cdr
.
Figure 2.2: Box-and-pointer representation of
(cons 1 2)
.+---+---+ +---+ ---->| * | *-+---->| 2 | +-|-+---+ +---+ | V +---+ | 1 | +---+
We have already seen that cons
can be used to combine not only numbers
but pairs as well. (You made use of this fact, or should have, in doing
Exercise 2-2 and Exercise 2-3.) As a consequence, pairs provide a
universal building block from which we can construct all sorts of data
structures. Figure 2-3 shows two ways to use pairs to combine the
numbers 1, 2, 3, and 4.
Figure 2.3: Two ways to combine 1, 2, 3, and 4 using pairs.
+---+---+ +---+---+ +---+---+ +---+ ---->| * | *-+---->| * | * | ---->| * | *-+---->| 4 | +-|-+---+ +-|-+-|-+ +-|-+---+ +---+ | | | | V V V V +---+---+ +---+ +---+ +---+---+ +---+---+ | * | * | | 3 | | 4 | | * | *-+---->| * | * | +-|-+-|-+ +---+ +---+ +-|-+---+ +-|-+-|-+ | | | | | V V V V V +---+ +---+ +---+ +---+ +---+ | 1 | | 2 | | 1 | | 2 | | 3 | +---+ +---+ +---+ +---+ +---+ (cons (cons 1 2) (cons (cons 1 (cons 3 4)) (cons 2 3)) 4)
The ability to create pairs whose elements are pairs is the essence of list
structure’s importance as a representational tool. We refer to this ability as
the
closure property of cons
. In general, an operation for
combining data objects satisfies the closure property if the results of
combining things with that operation can themselves be combined using the same
operation.(72) Closure
is the key to power in any means of combination because it permits us to create
hierarchical structures—structures made up of parts, which
themselves are made up of parts, and so on.
From the outset of Building Abstractions with Procedures, we’ve made essential use of closure in dealing with procedures, because all but the very simplest programs rely on the fact that the elements of a combination can themselves be combinations. In this section, we take up the consequences of closure for compound data. We describe some conventional techniques for using pairs to represent sequences and trees, and we exhibit a graphics language that illustrates closure in a vivid way.(73)
2.2.1 Representing Sequences | ||
2.2.2 Hierarchical Structures | ||
2.2.3 Sequences as Conventional Interfaces | ||
2.2.4 Example: A Picture Language |
[ << ] | [ < ] | [ Up ] | [ > ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
Figure 2.4: The sequence 1, 2, 3, 4 represented as a chain of pairs.
+---+---+ +---+---+ +---+---+ +---+---+ ---->| * | *-+---->| * | *-+---->| * | *-+---->| * | / | +-|-+---+ +-|-+---+ +-|-+---+ +-|-+---+ | | | | V V V V +---+ +---+ +---+ +---+ | 1 | | 2 | | 3 | | 4 | +---+ +---+ +---+ +---+
One of the useful structures we can build with pairs is a
sequence—an ordered collection of data objects. There are, of
course, many ways to represent sequences in terms of pairs. One particularly
straightforward representation is illustrated in Figure 2-4, where the
sequence 1, 2, 3, 4 is represented as a chain of pairs. The car
of each
pair is the corresponding item in the chain, and the cdr
of the pair is
the next pair in the chain. The cdr
of the final pair signals the end
of the sequence by pointing to a distinguished value that is not a pair,
represented in box-and-pointer diagrams as a diagonal line and in programs as
the value of the variable nil
. The entire sequence is constructed by
nested cons
operations:
(cons 1 (cons 2 (cons 3 (cons 4 nil))))
Such a sequence of pairs, formed by nested cons
es, is called a
list, and Scheme provides a primitive called list
to help in
constructing lists.(74) The above sequence could be produced by (list 1 2 3 4)
.
In general,
(list <a_1> <a_2> … <a_n>)
is equivalent to
(cons <a_1> (cons <a_2> (cons … (cons <a_n> nil) …)))
Lisp systems conventionally print lists by printing the sequence of elements,
enclosed in parentheses. Thus, the data object in Figure 2-4 is printed
as (1 2 3 4)
:
(define one-through-four (list 1 2 3 4)) one-through-four (1 2 3 4)
Be careful not to confuse the expression (list 1 2 3 4)
with the list
(1 2 3 4)
, which is the result obtained when the expression is
evaluated. Attempting to evaluate the expression (1 2 3 4)
will signal
an error when the interpreter tries to apply the procedure 1
to
arguments 2
, 3
, and 4
.
We can think of car
as selecting the first item in the list, and of
cdr
as selecting the sublist consisting of all but the first item.
Nested applications of car
and cdr
can be used to extract the
second, third, and subsequent items in the list.(75) The constructor cons
makes a list like the original one, but with an additional item at the
beginning.
(car one-through-four) 1 (cdr one-through-four) (2 3 4) (car (cdr one-through-four)) 2 (cons 10 one-through-four) (10 1 2 3 4) (cons 5 one-through-four) (5 1 2 3 4)
The value of nil
, used to terminate the chain of pairs, can be thought
of as a sequence of no elements, the
empty list. The word
nil is a contraction of the Latin word nihil, which means
“nothing.”(76)
The use of pairs to represent sequences of elements as lists is accompanied by
conventional programming techniques for manipulating lists by successively
“cdr
ing down” the lists. For example, the procedure list-ref
takes as arguments a list and a number n and returns the nth item of
the list. It is customary to number the elements of the list beginning with 0.
The method for computing list-ref
is the following:
list-ref
should return the car
of the list.
list-ref
should return the (n - 1)st item of the
cdr
of the list.
(define (list-ref items n) (if (= n 0) (car items) (list-ref (cdr items) (- n 1)))) (define squares (list 1 4 9 16 25)) (list-ref squares 3) 16
Often we cdr
down the whole list. To aid in this, Scheme includes a
primitive predicate null?
, which tests whether its argument is the empty
list. The procedure length
, which returns the number of items in a
list, illustrates this typical pattern of use:
(define (length items) (if (null? items) 0 (+ 1 (length (cdr items))))) (define odds (list 1 3 5 7)) (length odds) 4
The length
procedure implements a simple recursive plan. The reduction
step is:
length
of any list is 1 plus the length
of the cdr
of
the list.
This is applied successively until we reach the base case:
length
of the empty list is 0.
We could also compute length
in an iterative style:
(define (length items) (define (length-iter a count) (if (null? a) count (length-iter (cdr a) (+ 1 count)))) (length-iter items 0))
Another conventional programming technique is to “cons
up” an answer
list while cdr
ing down a list, as in the procedure append
, which
takes two lists as arguments and combines their elements to make a new list:
(append squares odds) (1 4 9 16 25 1 3 5 7) (append odds squares) (1 3 5 7 1 4 9 16 25)
Append
is also implemented using a recursive plan. To append
lists list1
and list2
, do the following:
list1
is the empty list, then the result is just list2
.
append
the cdr
of list1
and list2
, and
cons
the car
of list1
onto the result:
(define (append list1 list2) (if (null? list1) list2 (cons (car list1) (append (cdr list1) list2))))
Exercise 2.17: Define a procedure
last-pair
that returns the list that contains only the last element of a given (nonempty) list:(last-pair (list 23 72 149 34)) (34)
Exercise 2.18: Define a procedure
reverse
that takes a list as argument and returns a list of the same elements in reverse order:(reverse (list 1 4 9 16 25)) (25 16 9 4 1)
Exercise 2.19: Consider the change-counting program of section Tree Recursion. It would be nice to be able to easily change the currency used by the program, so that we could compute the number of ways to change a British pound, for example. As the program is written, the knowledge of the currency is distributed partly into the procedure
first-denomination
and partly into the procedurecount-change
(which knows that there are five kinds of U.S. coins). It would be nicer to be able to supply a list of coins to be used for making change.We want to rewrite the procedure
cc
so that its second argument is a list of the values of the coins to use rather than an integer specifying which coins to use. We could then have lists that defined each kind of currency:(define us-coins (list 50 25 10 5 1)) (define uk-coins (list 100 50 20 10 5 2 1 0.5))We could then call
cc
as follows:(cc 100 us-coins) 292To do this will require changing the program
cc
somewhat. It will still have the same form, but it will access its second argument differently, as follows:(define (cc amount coin-values) (cond ((= amount 0) 1) ((or (< amount 0) (no-more? coin-values)) 0) (else (+ (cc amount (except-first-denomination coin-values)) (cc (- amount (first-denomination coin-values)) coin-values)))))Define the procedures
first-denomination
,except-first-denomination
, andno-more?
in terms of primitive operations on list structures. Does the order of the listcoin-values
affect the answer produced bycc
? Why or why not?
Exercise 2.20: The procedures
+
,*
, andlist
take arbitrary numbers of arguments. One way to define such procedures is to usedefine
with notation dotted-tail notation. In a procedure definition, a parameter list that has a dot before the last parameter name indicates that, when the procedure is called, the initial parameters (if any) will have as values the initial arguments, as usual, but the final parameter’s value will be a list of any remaining arguments. For instance, given the definition(define (f x y . z) <body>)the procedure
f
can be called with two or more arguments. If we evaluate(f 1 2 3 4 5 6)then in the body of
f
,x
will be 1,y
will be 2, andz
will be the list(3 4 5 6)
. Given the definition(define (g . w) <body>)the procedure
g
can be called with zero or more arguments. If we evaluate(g 1 2 3 4 5 6)then in the body of
g
,w
will be the list(1 2 3 4 5 6)
.(77)Use this notation to write a procedure
same-parity
that takes one or more integers and returns a list of all the arguments that have the same even-odd parity as the first argument. For example,(same-parity 1 2 3 4 5 6 7) (1 3 5 7) (same-parity 2 3 4 5 6 7) (2 4 6)
One extremely useful operation is to apply some transformation to each element in a list and generate the list of results. For instance, the following procedure scales each number in a list by a given factor:
(define (scale-list items factor) (if (null? items) nil (cons (* (car items) factor) (scale-list (cdr items) factor)))) (scale-list (list 1 2 3 4 5) 10) (10 20 30 40 50)
We can abstract this general idea and capture it as a common pattern expressed
as a higher-order procedure, just as in section Formulating Abstractions with Higher-Order Procedures. The higher-order
procedure here is called map
. Map
takes as arguments a procedure
of one argument and a list, and returns a list of the results produced by
applying the procedure to each element in the list:(78)
(define (map proc items) (if (null? items) nil (cons (proc (car items)) (map proc (cdr items))))) (map abs (list -10 2.5 -11.6 17)) (10 2.5 11.6 17) (map (lambda (x) (* x x)) (list 1 2 3 4)) (1 4 9 16)
Now we can give a new definition of scale-list
in terms of map
:
(define (scale-list items factor) (map (lambda (x) (* x factor)) items))
Map
is an important construct, not only because it captures a common
pattern, but because it establishes a higher level of abstraction in dealing
with lists. In the original definition of scale-list
, the recursive
structure of the program draws attention to the element-by-element processing
of the list. Defining scale-list
in terms of map
suppresses that
level of detail and emphasizes that scaling transforms a list of elements to a
list of results. The difference between the two definitions is not that the
computer is performing a different process (it isn’t) but that we think about
the process differently. In effect, map
helps establish an abstraction
barrier that isolates the implementation of procedures that transform lists
from the details of how the elements of the list are extracted and combined.
Like the barriers shown in Figure 2-1, this abstraction gives us the
flexibility to change the low-level details of how sequences are implemented,
while preserving the conceptual framework of operations that transform
sequences to sequences. Section Sequences as Conventional Interfaces expands on this use of sequences
as a framework for organizing programs.
Exercise 2.21: The procedure
square-list
takes a list of numbers as argument and returns a list of the squares of those numbers.(square-list (list 1 2 3 4)) (1 4 9 16)Here are two different definitions of
square-list
. Complete both of them by filling in the missing expressions:(define (square-list items) (if (null? items) nil (cons <??> <??>))) (define (square-list items) (map <??> <??>))
Exercise 2.22: Louis Reasoner tries to rewrite the first
square-list
procedure of Exercise 2-21 so that it evolves an iterative process:(define (square-list items) (define (iter things answer) (if (null? things) answer (iter (cdr things) (cons (square (car things)) answer)))) (iter items nil))Unfortunately, defining
square-list
this way produces the answer list in the reverse order of the one desired. Why?Louis then tries to fix his bug by interchanging the arguments to
cons
:(define (square-list items) (define (iter things answer) (if (null? things) answer (iter (cdr things) (cons answer (square (car things)))))) (iter items nil))This doesn’t work either. Explain.
Exercise 2.23: The procedure
for-each
is similar tomap
. It takes as arguments a procedure and a list of elements. However, rather than forming a list of the results,for-each
just applies the procedure to each of the elements in turn, from left to right. The values returned by applying the procedure to the elements are not used at all—for-each
is used with procedures that perform an action, such as printing. For example,(for-each (lambda (x) (newline) (display x)) (list 57 321 88)) 57 321 88The value returned by the call to
for-each
(not illustrated above) can be something arbitrary, such as true. Give an implementation offor-each
.
[ << ] | [ < ] | [ Up ] | [ > ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
The representation of sequences in terms of lists generalizes naturally to
represent sequences whose elements may themselves be sequences. For example,
we can regard the object ((1 2) 3 4)
constructed by
(cons (list 1 2) (list 3 4))
as a list of three items, the first of which is itself a list, (1 2)
.
Indeed, this is suggested by the form in which the result is printed by the
interpreter. Figure 2-5 shows the representation of
this structure in terms of pairs.
Figure 2.5: Structure formed by
(cons (list 1 2) (list 3 4))
.(3 4) | V ((1 2) 3 4) +---+---+ +---+---+ +---+---+ ---->| * | *-+----------------->| * | *-+---->| * | / | +-|-+---+ +-|-+---+ +-|-+---+ | | | V V V (1 2) +---+---+ +---+---+ +---+ +---+ ---->| * | *-+---->| * | / | | 3 | | 4 | +-|-+---+ +-|-+---+ +---+ +---+ | | V V +---+ +---+ | 1 | | 2 | +---+ +---+
Another way to think of sequences whose elements are sequences is as trees. The elements of the sequence are the branches of the tree, and elements that are themselves sequences are subtrees. Figure 2-6 shows the structure in Figure 2-5 viewed as a tree.
Figure 2.6: The list structure in Figure 2-5 viewed as a tree.
((1 2) 3 4) /\\ / | \ (1 2) 3 4 / \ 1 2
Recursion is a natural tool for dealing with tree structures, since we can
often reduce operations on trees to operations on their branches, which reduce
in turn to operations on the branches of the branches, and so on, until we
reach the leaves of the tree. As an example, compare the length
procedure of section Representing Sequences with the count-leaves
procedure, which
returns the total number of leaves of a tree:
(define x (cons (list 1 2) (list 3 4))) (length x) 3 (count-leaves x) 4 (list x x) (((1 2) 3 4) ((1 2) 3 4)) (length (list x x)) 2 (count-leaves (list x x)) 8
To implement count-leaves
, recall the recursive plan for computing
length
:
Length
of a list x
is 1 plus length
of the
cdr
of x
.
Length
of the empty list is 0.
Count-leaves
is similar. The value for the empty list is the same:
Count-leaves
of the empty list is 0.
But in the reduction step, where we strip off the car
of the list, we
must take into account that the car
may itself be a tree whose leaves we
need to count. Thus, the appropriate reduction step is
Count-leaves
of a tree x
is count-leaves
of the car
of x
plus count-leaves
of the cdr
of x
.
Finally, by taking car
s we reach actual leaves, so we need another base
case:
Count-leaves
of a leaf is 1.
To aid in writing recursive procedures on trees, Scheme provides the primitive
predicate pair?
, which tests whether its argument is a pair. Here is
the complete procedure:(79)
(define (count-leaves x) (cond ((null? x) 0) ((not (pair? x)) 1) (else (+ (count-leaves (car x)) (count-leaves (cdr x))))))
Exercise 2.24: Suppose we evaluate the expression
(list 1 (list 2 (list 3 4)))
. Give the result printed by the interpreter, the corresponding box-and-pointer structure, and the interpretation of this as a tree (as in Figure 2-6).
Exercise 2.25: Give combinations of
car
s andcdr
s that will pick 7 from each of the following lists:(1 3 (5 7) 9) ((7)) (1 (2 (3 (4 (5 (6 7))))))
Exercise 2.26: Suppose we define
x
andy
to be two lists:(define x (list 1 2 3)) (define y (list 4 5 6))What result is printed by the interpreter in response to evaluating each of the following expressions:
(append x y) (cons x y) (list x y)
Exercise 2.27: Modify your
reverse
procedure of Exercise 2-18 to produce adeep-reverse
procedure that takes a list as argument and returns as its value the list with its elements reversed and with all sublists deep-reversed as well. For example,(define x (list (list 1 2) (list 3 4))) x ((1 2) (3 4)) (reverse x) ((3 4) (1 2)) (deep-reverse x) ((4 3) (2 1))
Exercise 2.28: Write a procedure
fringe
that takes as argument a tree (represented as a list) and returns a list whose elements are all the leaves of the tree arranged in left-to-right order. For example,(define x (list (list 1 2) (list 3 4))) (fringe x) (1 2 3 4) (fringe (list x x)) (1 2 3 4 1 2 3 4)
Exercise 2.29: A binary mobile consists of two branches, a left branch and a right branch. Each branch is a rod of a certain length, from which hangs either a weight or another binary mobile. We can represent a binary mobile using compound data by constructing it from two branches (for example, using
list
):(define (make-mobile left right) (list left right))A branch is constructed from a
length
(which must be a number) together with astructure
, which may be either a number (representing a simple weight) or another mobile:(define (make-branch length structure) (list length structure))
- Write the corresponding selectors
left-branch
andright-branch
, which return the branches of a mobile, andbranch-length
andbranch-structure
, which return the components of a branch.- Using your selectors, define a procedure
total-weight
that returns the total weight of a mobile.- A mobile is said to be balanced if the torque applied by its top-left branch is equal to that applied by its top-right branch (that is, if the length of the left rod multiplied by the weight hanging from that rod is equal to the corresponding product for the right side) and if each of the submobiles hanging off its branches is balanced. Design a predicate that tests whether a binary mobile is balanced.
- Suppose we change the representation of mobiles so that the constructors are
(define (make-mobile left right) (cons left right)) (define (make-branch length structure) (cons length structure))How much do you need to change your programs to convert to the new representation?
Just as map
is a powerful abstraction for dealing with sequences,
map
together with recursion is a powerful abstraction for dealing with
trees. For instance, the scale-tree
procedure, analogous to
scale-list
of section Representing Sequences, takes as arguments a numeric factor
and a tree whose leaves are numbers. It returns a tree of the same shape,
where each number is multiplied by the factor. The recursive plan for
scale-tree
is similar to the one for count-leaves
:
(define (scale-tree tree factor) (cond ((null? tree) nil) ((not (pair? tree)) (* tree factor)) (else (cons (scale-tree (car tree) factor) (scale-tree (cdr tree) factor))))) (scale-tree (list 1 (list 2 (list 3 4) 5) (list 6 7)) 10) (10 (20 (30 40) 50) (60 70))
Another way to implement scale-tree
is to regard the tree as a sequence
of sub-trees and use map
. We map over the sequence, scaling each
sub-tree in turn, and return the list of results. In the base case, where the
tree is a leaf, we simply multiply by the factor:
(define (scale-tree tree factor) (map (lambda (sub-tree) (if (pair? sub-tree) (scale-tree sub-tree factor) (* sub-tree factor))) tree))
Many tree operations can be implemented by similar combinations of sequence operations and recursion.
Exercise 2.30: Define a procedure
square-tree
analogous to thesquare-list
procedure of Exercise 2-21. That is,square-list
should behave as follows:(square-tree (list 1 (list 2 (list 3 4) 5) (list 6 7))) (1 (4 (9 16) 25) (36 49))Define
square-tree
both directly (i.e., without using any higher-order procedures) and also by usingmap
and recursion.
Exercise 2.31: Abstract your answer to Exercise 2-30 to produce a procedure
tree-map
with the property thatsquare-tree
could be defined as(define (square-tree tree) (tree-map square tree))
Exercise 2.32: We can represent a set as a list of distinct elements, and we can represent the set of all subsets of the set as a list of lists. For example, if the set is
(1 2 3)
, then the set of all subsets is(() (3) (2) (2 3) (1) (1 3) (1 2) (1 2 3))
. Complete the following definition of a procedure that generates the set of subsets of a set and give a clear explanation of why it works:(define (subsets s) (if (null? s) (list nil) (let ((rest (subsets (cdr s)))) (append rest (map <??> rest)))))
[ << ] | [ < ] | [ Up ] | [ > ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
In working with compound data, we’ve stressed how data abstraction permits us to design programs without becoming enmeshed in the details of data representations, and how abstraction preserves for us the flexibility to experiment with alternative representations. In this section, we introduce another powerful design principle for working with data structures—the use of conventional interfaces.
In section Formulating Abstractions with Higher-Order Procedures we saw how program abstractions, implemented as
higher-order procedures, can capture common patterns in programs that deal with
numerical data. Our ability to formulate analogous operations for working with
compound data depends crucially on the style in which we manipulate our data
structures. Consider, for example, the following procedure, analogous to the
count-leaves
procedure of section Hierarchical Structures, which takes a tree as
argument and computes the sum of the squares of the leaves that are odd:
(define (sum-odd-squares tree) (cond ((null? tree) 0) ((not (pair? tree)) (if (odd? tree) (square tree) 0)) (else (+ (sum-odd-squares (car tree)) (sum-odd-squares (cdr tree))))))
On the surface, this procedure is very different from the following one, which constructs a list of all the even Fibonacci numbers Fib(k), where k is less than or equal to a given integer n:
(define (even-fibs n) (define (next k) (if (> k n) nil (let ((f (fib k))) (if (even? f) (cons f (next (+ k 1))) (next (+ k 1)))))) (next 0))
Despite the fact that these two procedures are structurally very different, a more abstract description of the two computations reveals a great deal of similarity. The first program
+
, starting with 0.
The second program
cons
, starting with the
empty list.
A signal-processing engineer would find it natural to conceptualize these
processes in terms of signals flowing through a cascade of stages, each of
which implements part of the program plan, as shown in Figure 2-7. In
sum-odd-squares
, we begin with an
enumerator, which generates
a “signal” consisting of the leaves of a given tree. This signal is passed
through a
filter, which eliminates all but the odd elements. The
resulting signal is in turn passed through a
map, which is a
“transducer” that applies the square
procedure to each element. The
output of the map is then fed to an
accumulator, which combines the
elements using +
, starting from an initial 0. The plan for
even-fibs
is analogous.
Figure 2.7: The signal-flow plans for the procedures
sum-odd-squares
(top) andeven-fibs
(bottom) reveal the commonality between the two programs.+-------------+ +-------------+ +-------------+ +-------------+ | enumerate: |-->| filter: |-->| map: |-->| accumulate: | | tree leaves | | odd? | | square | | +, 0 | +-------------+ +-------------+ +-------------+ +-------------+ +-------------+ +-------------+ +-------------+ +-------------+ | enumerate: |-->| map: |-->| filter: |-->| accumulate: | | integers | | fib | | even? | | cons, () | +-------------+ +-------------+ +-------------+ +-------------+
Unfortunately, the two procedure definitions above fail to exhibit this
signal-flow structure. For instance, if we examine the sum-odd-squares
procedure, we find that the enumeration is implemented partly by the
null?
and pair?
tests and partly by the tree-recursive structure
of the procedure. Similarly, the accumulation is found partly in the tests and
partly in the addition used in the recursion. In general, there are no
distinct parts of either procedure that correspond to the elements in the
signal-flow description. Our two procedures decompose the computations in a
different way, spreading the enumeration over the program and mingling it with
the map, the filter, and the accumulation. If we could organize our programs
to make the signal-flow structure manifest in the procedures we write, this
would increase the conceptual clarity of the resulting code.
The key to organizing programs so as to more clearly reflect the signal-flow
structure is to concentrate on the “signals” that flow from one stage in the
process to the next. If we represent these signals as lists, then we can use
list operations to implement the processing at each of the stages. For
instance, we can implement the mapping stages of the signal-flow diagrams using
the map
procedure from section Representing Sequences:
(map square (list 1 2 3 4 5)) (1 4 9 16 25)
Filtering a sequence to select only those elements that satisfy a given predicate is accomplished by
(define (filter predicate sequence) (cond ((null? sequence) nil) ((predicate (car sequence)) (cons (car sequence) (filter predicate (cdr sequence)))) (else (filter predicate (cdr sequence)))))
For example,
(filter odd? (list 1 2 3 4 5)) (1 3 5)
Accumulations can be implemented by
(define (accumulate op initial sequence) (if (null? sequence) initial (op (car sequence) (accumulate op initial (cdr sequence))))) (accumulate + 0 (list 1 2 3 4 5)) 15 (accumulate * 1 (list 1 2 3 4 5)) 120 (accumulate cons nil (list 1 2 3 4 5)) (1 2 3 4 5)
All that remains to implement signal-flow diagrams is to enumerate the sequence
of elements to be processed. For even-fibs
, we need to generate the
sequence of integers in a given range, which we can do as follows:
(define (enumerate-interval low high) (if (> low high) nil (cons low (enumerate-interval (+ low 1) high)))) (enumerate-interval 2 7) (2 3 4 5 6 7)
To enumerate the leaves of a tree, we can use(80)
(define (enumerate-tree tree) (cond ((null? tree) nil) ((not (pair? tree)) (list tree)) (else (append (enumerate-tree (car tree)) (enumerate-tree (cdr tree)))))) (enumerate-tree (list 1 (list 2 (list 3 4)) 5)) (1 2 3 4 5)
Now we can reformulate sum-odd-squares
and even-fibs
as in the
signal-flow diagrams. For sum-odd-squares
, we enumerate the sequence of
leaves of the tree, filter this to keep only the odd numbers in the sequence,
square each element, and sum the results:
(define (sum-odd-squares tree) (accumulate + 0 (map square (filter odd? (enumerate-tree tree)))))
For even-fibs
, we enumerate the integers from 0 to n, generate the
Fibonacci number for each of these integers, filter the resulting sequence to
keep only the even elements, and accumulate the results into a list:
(define (even-fibs n) (accumulate cons nil (filter even? (map fib (enumerate-interval 0 n)))))
The value of expressing programs as sequence operations is that this helps us make program designs that are modular, that is, designs that are constructed by combining relatively independent pieces. We can encourage modular design by providing a library of standard components together with a conventional interface for connecting the components in flexible ways.
Modular construction is a powerful strategy for controlling complexity in
engineering design. In real signal-processing applications, for example,
designers regularly build systems by cascading elements selected from
standardized families of filters and transducers. Similarly, sequence
operations provide a library of standard program elements that we can mix and
match. For instance, we can reuse pieces from the sum-odd-squares
and
even-fibs
procedures in a program that constructs a list of the squares
of the first n + 1 Fibonacci numbers:
(define (list-fib-squares n) (accumulate cons nil (map square (map fib (enumerate-interval 0 n))))) (list-fib-squares 10) (0 1 1 4 9 25 64 169 441 1156 3025)
We can rearrange the pieces and use them in computing the product of the odd integers in a sequence:
(define (product-of-squares-of-odd-elements sequence) (accumulate * 1 (map square (filter odd? sequence)))) (product-of-squares-of-odd-elements (list 1 2 3 4 5)) 225
We can also formulate conventional data-processing applications in terms of
sequence operations. Suppose we have a sequence of personnel records and we
want to find the salary of the highest-paid programmer. Assume that we have a
selector salary
that returns the salary of a record, and a predicate
programmer?
that tests if a record is for a programmer. Then we can
write
(define (salary-of-highest-paid-programmer records) (accumulate max 0 (map salary (filter programmer? records))))
These examples give just a hint of the vast range of operations that can be expressed as sequence operations.(81)
Sequences, implemented here as lists, serve as a conventional interface that permits us to combine processing modules. Additionally, when we uniformly represent structures as sequences, we have localized the data-structure dependencies in our programs to a small number of sequence operations. By changing these, we can experiment with alternative representations of sequences, while leaving the overall design of our programs intact. We will exploit this capability in section Streams, when we generalize the sequence-processing paradigm to admit infinite sequences.
Exercise 2.33: Fill in the missing expressions to complete the following definitions of some basic list-manipulation operations as accumulations:
(define (map p sequence) (accumulate (lambda (x y) <??>) nil sequence)) (define (append seq1 seq2) (accumulate cons <??> <??>)) (define (length sequence) (accumulate <??> 0 sequence))
Exercise 2.34: Evaluating a polynomial in x at a given value of x can be formulated as an accumulation. We evaluate the polynomial
a_n r^n | a_(n-1) r^(n-1) + ... + a_1 r + a_0using a well-known algorithm called Horner’s rule, which structures the computation as
(... (a_n r + a_(n-1)) r + ... + a_1) r + a_0In other words, we start with a_n, multiply by x, add a_(n-1), multiply by x, and so on, until we reach a_0.(82)
Fill in the following template to produce a procedure that evaluates a polynomial using Horner’s rule. Assume that the coefficients of the polynomial are arranged in a sequence, from a_0 through a_n.
(define (horner-eval x coefficient-sequence) (accumulate (lambda (this-coeff higher-terms) <??>) 0 coefficient-sequence))For example, to compute 1 + 3x + 5x^3 + x^(5) at x = 2 you would evaluate
(horner-eval 2 (list 1 3 0 5 0 1))
Exercise 2.35: Redefine
count-leaves
from section Hierarchical Structures as an accumulation:(define (count-leaves t) (accumulate <??> <??> (map <??> <??>)))
Exercise 2.36: The procedure
accumulate-n
is similar toaccumulate
except that it takes as its third argument a sequence of sequences, which are all assumed to have the same number of elements. It applies the designated accumulation procedure to combine all the first elements of the sequences, all the second elements of the sequences, and so on, and returns a sequence of the results. For instance, ifs
is a sequence containing four sequences,((1 2 3) (4 5 6) (7 8 9) (10 11 12)),
then the value of(accumulate-n + 0 s)
should be the sequence(22 26 30)
. Fill in the missing expressions in the following definition ofaccumulate-n
:(define (accumulate-n op init seqs) (if (null? (car seqs)) nil (cons (accumulate op init <??>) (accumulate-n op init <??>))))
Suppose we represent vectors v = (v_i) as sequences of numbers, and matrices m = (m_(ij)) as sequences of vectors (the rows of the matrix). For example, the matrix
+- -+ | 1 2 3 4 | | 4 5 6 6 | | 6 7 8 9 | +- -+
is represented as the sequence ((1 2 3 4) (4 5 6 6) (6 7 8 9))
. With
this representation, we can use sequence operations to concisely express the
basic matrix and vector operations. These operations (which are described in
any book on matrix algebra) are the following:
__ (dot-product v w) returns the sum >_i v_i w_i (matrix-*-vector m v) returns the vector t, __ where t_i = >_j m_(ij) v_j (matrix-*-matrix m n) returns the matrix p, __ where p_(ij) = >_k m_(ik) n_(kj) (transpose m) returns the matrix n, where n_(ij) = m_(ji)
We can define the dot product as(83)
(define (dot-product v w) (accumulate + 0 (map * v w)))
Fill in the missing expressions in the following procedures for computing the
other matrix operations. (The procedure accumulate-n
is defined in
Exercise 2-36.)
(define (matrix-*-vector m v) (map <??> m)) (define (transpose mat) (accumulate-n <??> <??> mat)) (define (matrix-*-matrix m n) (let ((cols (transpose n))) (map <??> m)))
Exercise 2.38: The
accumulate
procedure is also known asfold-right
, because it combines the first element of the sequence with the result of combining all the elements to the right. There is also afold-left
, which is similar tofold-right
, except that it combines elements working in the opposite direction:(define (fold-left op initial sequence) (define (iter result rest) (if (null? rest) result (iter (op result (car rest)) (cdr rest)))) (iter initial sequence))What are the values of
(fold-right / 1 (list 1 2 3)) (fold-left / 1 (list 1 2 3)) (fold-right list nil (list 1 2 3)) (fold-left list nil (list 1 2 3))Give a property that
op
should satisfy to guarantee thatfold-right
andfold-left
will produce the same values for any sequence.
Exercise 2.39: Complete the following definitions of
reverse
(Exercise 2-18) in terms offold-right
andfold-left
from Exercise 2-38:(define (reverse sequence) (fold-right (lambda (x y) <??>) nil sequence)) (define (reverse sequence) (fold-left (lambda (x y) <??>) nil sequence))
We can extend the sequence paradigm to include many computations that are commonly expressed using nested loops.(84) Consider this problem: Given a positive integer n, find all ordered pairs of distinct positive integers i and j, where 1 <= j< i<= n, such that i + j is prime. For example, if n is 6, then the pairs are the following:
i | 2 3 4 4 5 6 6 j | 1 2 1 3 2 1 5 ------+--------------- i + j | 3 5 5 7 7 7 11
A natural way to organize this computation is to generate the sequence of all ordered pairs of positive integers less than or equal to n, filter to select those pairs whose sum is prime, and then, for each pair (i, j) that passes through the filter, produce the triple (i,j,i + j).
Here is a way to generate the sequence of pairs: For each integer i <=
n, enumerate the integers j<i, and for each such i and j
generate the pair (i,j). In terms of sequence operations, we map along
the sequence (enumerate-interval 1 n)
. For each i in this sequence,
we map along the sequence (enumerate-interval 1 (- i 1))
. For each
j in this latter sequence, we generate the pair (list i j)
. This
gives us a sequence of pairs for each i. Combining all the sequences for
all the i (by accumulating with append
) produces the required
sequence of pairs:(85)
(accumulate append nil (map (lambda (i) (map (lambda (j) (list i j)) (enumerate-interval 1 (- i 1)))) (enumerate-interval 1 n)))
The combination of mapping and accumulating with append
is so common in
this sort of program that we will isolate it as a separate procedure:
(define (flatmap proc seq) (accumulate append nil (map proc seq)))
Now filter this sequence of pairs to find those whose sum is prime. The filter predicate is called for each element of the sequence; its argument is a pair and it must extract the integers from the pair. Thus, the predicate to apply to each element in the sequence is
(define (prime-sum? pair) (prime? (+ (car pair) (cadr pair))))
Finally, generate the sequence of results by mapping over the filtered pairs using the following procedure, which constructs a triple consisting of the two elements of the pair along with their sum:
(define (make-pair-sum pair) (list (car pair) (cadr pair) (+ (car pair) (cadr pair))))
Combining all these steps yields the complete procedure:
(define (prime-sum-pairs n) (map make-pair-sum (filter prime-sum? (flatmap (lambda (i) (map (lambda (j) (list i j)) (enumerate-interval 1 (- i 1)))) (enumerate-interval 1 n)))))
Nested mappings are also useful for sequences other than those that enumerate intervals. Suppose we wish to generate all the permutations of a set S; that is, all the ways of ordering the items in the set. For instance, the permutations of {1,2,3} are {1,2,3}, {1,3,2}, {2,1,3}, {2,3,1}, {3,1,2}, and {3,2,1}. Here is a plan for generating the permutations of S: For each item x in S, recursively generate the sequence of permutations of S - x,(86) and adjoin x to the front of each one. This yields, for each x in S, the sequence of permutations of S that begin with x. Combining these sequences for all x gives all the permutations of S:(87)
(define (permutations s) (if (null? s) ; empty set? (list nil) ; sequence containing empty set (flatmap (lambda (x) (map (lambda (p) (cons x p)) (permutations (remove x s)))) s)))
Notice how this strategy reduces the problem of generating permutations of
S to the problem of generating the permutations of sets with fewer elements
than S. In the terminal case, we work our way down to the empty list,
which represents a set of no elements. For this, we generate (list
nil)
, which is a sequence with one item, namely the set with no elements. The
remove
procedure used in permutations
returns all the items in a
given sequence except for a given item. This can be expressed as a simple
filter:
(define (remove item sequence) (filter (lambda (x) (not (= x item))) sequence))
Exercise 2.40: Define a procedure
unique-pairs
that, given an integer n, generates the sequence of pairs (i,j) with 1 <= j< i <= n. Useunique-pairs
to simplify the definition ofprime-sum-pairs
given above.
Exercise 2.41: Write a procedure to find all ordered triples of distinct positive integers i, j, and k less than or equal to a given integer n that sum to a given integer s.
Figure 2.8: A solution to the eight-queens puzzle.
+---+---+---+---+---+---+---+---+ | | | | | | Q | | | +---+---+---+---+---+---+---+---+ | | | Q | | | | | | +---+---+---+---+---+---+---+---+ | Q | | | | | | | | +---+---+---+---+---+---+---+---+ | | | | | | | Q | | +---+---+---+---+---+---+---+---+ | | | | | Q | | | | +---+---+---+---+---+---+---+---+ | | | | | | | | Q | +---+---+---+---+---+---+---+---+ | | Q | | | | | | | +---+---+---+---+---+---+---+---+ | | | | Q | | | | | +---+---+---+---+---+---+---+---+
Exercise 2.42: The “eight-queens puzzle” asks how to place eight queens on a chessboard so that no queen is in check from any other (i.e., no two queens are in the same row, column, or diagonal). One possible solution is shown in Figure 2-8. One way to solve the puzzle is to work across the board, placing a queen in each column. Once we have placed k - 1 queens, we must place the kth queen in a position where it does not check any of the queens already on the board. We can formulate this approach recursively: Assume that we have already generated the sequence of all possible ways to place k - 1 queens in the first k - 1 columns of the board. For each of these ways, generate an extended set of positions by placing a queen in each row of the kth column. Now filter these, keeping only the positions for which the queen in the kth column is safe with respect to the other queens. This produces the sequence of all ways to place k queens in the first k columns. By continuing this process, we will produce not only one solution, but all solutions to the puzzle.
We implement this solution as a procedure
queens
, which returns a sequence of all solutions to the problem of placing n queens on an n*n chessboard.Queens
has an internal procedurequeen-cols
that returns the sequence of all ways to place queens in the first k columns of the board.(define (queens board-size) (define (queen-cols k) (if (= k 0) (list empty-board) (filter (lambda (positions) (safe? k positions)) (flatmap (lambda (rest-of-queens) (map (lambda (new-row) (adjoin-position new-row k rest-of-queens)) (enumerate-interval 1 board-size))) (queen-cols (- k 1)))))) (queen-cols board-size))In this procedure
rest-of-queens
is a way to place k - 1 queens in the first k - 1 columns, andnew-row
is a proposed row in which to place the queen for the kth column. Complete the program by implementing the representation for sets of board positions, including the procedureadjoin-position
, which adjoins a new row-column position to a set of positions, andempty-board
, which represents an empty set of positions. You must also write the proceduresafe?
, which determines for a set of positions, whether the queen in the kth column is safe with respect to the others. (Note that we need only check whether the new queen is safe—the other queens are already guaranteed safe with respect to each other.)
Exercise 2.43: Louis Reasoner is having a terrible time doing Exercise 2-42. His
queens
procedure seems to work, but it runs extremely slowly. (Louis never does manage to wait long enough for it to solve even the 6*6 case.) When Louis asks Eva Lu Ator for help, she points out that he has interchanged the order of the nested mappings in theflatmap
, writing it as(flatmap (lambda (new-row) (map (lambda (rest-of-queens) (adjoin-position new-row k rest-of-queens)) (queen-cols (- k 1)))) (enumerate-interval 1 board-size))Explain why this interchange makes the program run slowly. Estimate how long it will take Louis’s program to solve the eight-queens puzzle, assuming that the program in Exercise 2-42 solves the puzzle in time T.
[ << ] | [ < ] | [ Up ] | [ > ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
This section presents a simple language for drawing pictures that illustrates
the power of data abstraction and closure, and also exploits higher-order
procedures in an essential way. The language is designed to make it easy to
experiment with patterns such as the ones in Figure 2-9, which are
composed of repeated elements that are shifted and scaled.(88) In this language, the data
objects being combined are represented as procedures rather than as list
structure. Just as cons
, which satisfies the closure property, allowed
us to easily build arbitrarily complicated list structure, the operations in
this language, which also satisfy the closure property, allow us to easily
build arbitrarily complicated patterns.
Figure 2.9: Designs generated with the picture language.
[two graphic images not included]
When we began our study of programming in section The Elements of Programming, we emphasized the importance of describing a language by focusing on the language’s primitives, its means of combination, and its means of abstraction. We’ll follow that framework here.
Part of the elegance of this picture language is that there is only one kind of
element, called a
painter. A painter draws an image that is shifted
and scaled to fit within a designated parallelogram-shaped frame. For example,
there’s a primitive painter we’ll call wave
that makes a crude line
drawing, as shown in Figure 2-10. The actual shape of the drawing
depends on the frame—all four images in Figure 2-10 are produced by the
same wave
painter, but with respect to four different frames. Painters
can be more elaborate than this: The primitive painter called rogers
paints a picture of MIT’s founder, William Barton Rogers, as shown in
Figure 2-11.(89) The four images in Figure 2-11 are drawn with respect to the same four
frames as the wave
images in Figure 2-10.
To combine images, we use various operations that construct new painters from
given painters. For example, the beside
operation takes two painters
and produces a new, compound painter that draws the first painter’s image in
the left half of the frame and the second painter’s image in the right half of
the frame. Similarly, below
takes two painters and produces a compound
painter that draws the first painter’s image below the second painter’s image.
Some operations transform a single painter to produce a new painter. For
example, flip-vert
takes a painter and produces a painter that draws its
image upside-down, and flip-horiz
produces a painter that draws the
original painter’s image left-to-right reversed.
Figure 2.10: Images produced by the
wave
painter, with respect to four different frames. The frames, shown with dotted lines, are not part of the images.[four graphic images not included]
Figure 2.11: Images of William Barton Rogers, founder and first president of MIT, painted with respect to the same four frames as in Figure 2-10 (original image reprinted with the permission of the MIT Museum).
[four graphic images not included]
Figure 2-12 shows the drawing of a painter called
wave4
that is built up in two stages starting from wave
:
(define wave2 (beside wave (flip-vert wave))) (define wave4 (below wave2 wave2))
Figure 2.12: Creating a complex figure, starting from the
wave
painter of Figure 2-10.[two graphic images not included]
(define wave2 (define wave4 (beside wave (flip-vert wave))) (below wave2 wave2))
In building up a complex image in this manner we are exploiting the fact that
painters are closed under the language’s means of combination. The
beside
or below
of two painters is itself a painter; therefore,
we can use it as an element in making more complex painters. As with building
up list structure using cons
, the closure of our data under the means of
combination is crucial to the ability to create complex structures while using
only a few operations.
Once we can combine painters, we would like to be able to abstract typical
patterns of combining painters. We will implement the painter operations as
Scheme procedures. This means that we don’t need a special abstraction
mechanism in the picture language: Since the means of combination are ordinary
Scheme procedures, we automatically have the capability to do anything with
painter operations that we can do with procedures. For example, we can
abstract the pattern in wave4
as
(define (flipped-pairs painter) (let ((painter2 (beside painter (flip-vert painter)))) (below painter2 painter2)))
and define wave4
as an instance of this pattern:
(define wave4 (flipped-pairs wave))
We can also define recursive operations. Here’s one that makes painters split and branch towards the right as shown in figures Figure 2-13 and Figure 2-14:
(define (right-split painter n) (if (= n 0) painter (let ((smaller (right-split painter (- n 1)))) (beside painter (below smaller smaller)))))
Figure 2.13: Recursive plans for
right-split
andcorner-split
.+-------------+-------------+ +------+------+-------------+ | | | | up- | up- | | | | right-split | | split| split| corner-split| | | | | | | | | | n-1 | | n-1 | n-1 | n-1 | | | | | | | | | identity +-------------+ +------+------+-------------+ | | | | | right-split | | | right-split | | | n-1 | | | | | identity +-------------+ | | n-1 | | | right-split | | | | | | n-1 | +-------------+-------------+ +-------------+-------------+ right-split n corner-split n
We can produce balanced patterns by branching upwards as well as towards the right (see Exercise 2-44 and figures Figure 2-13 and Figure 2-14):
(define (corner-split painter n) (if (= n 0) painter (let ((up (up-split painter (- n 1))) (right (right-split painter (- n 1)))) (let ((top-left (beside up up)) (bottom-right (below right right)) (corner (corner-split painter (- n 1)))) (beside (below painter top-left) (below bottom-right corner))))))
Figure 2.14: The recursive operations
right-split
andcorner-split
applied to the painterswave
androgers
. Combining fourcorner-split
figures produces symmetricsquare-limit
designs as shown in Figure 2-9.[two graphic images not included]
(right-split wave 4) (right-split rogers 4)[two graphic images not included]
(corner-split wave 4) (corner-split rogers 4)
By placing four copies of a corner-split
appropriately, we obtain a
pattern called square-limit
, whose application to wave
and
rogers
is shown in Figure 2-9:
(define (square-limit painter n) (let ((quarter (corner-split painter n))) (let ((half (beside (flip-horiz quarter) quarter))) (below (flip-vert half) half))))
Exercise 2.44: Define the procedure
up-split
used bycorner-split
. It is similar toright-split
, except that it switches the roles ofbelow
andbeside
.
In addition to abstracting patterns of combining painters, we can work at a higher level, abstracting patterns of combining painter operations. That is, we can view the painter operations as elements to manipulate and can write means of combination for these elements—procedures that take painter operations as arguments and create new painter operations.
For example, flipped-pairs
and square-limit
each arrange four
copies of a painter’s image in a square pattern; they differ only in how they
orient the copies. One way to abstract this pattern of painter combination is
with the following procedure, which takes four one-argument painter operations
and produces a painter operation that transforms a given painter with those
four operations and arranges the results in a square. Tl
, tr
,
bl
, and br
are the transformations to apply to the top left copy,
the top right copy, the bottom left copy, and the bottom right copy,
respectively.
(define (square-of-four tl tr bl br) (lambda (painter) (let ((top (beside (tl painter) (tr painter))) (bottom (beside (bl painter) (br painter)))) (below bottom top))))
Then flipped-pairs
can be defined in terms of square-of-four
as
follows:(90)
(define (flipped-pairs painter) (let ((combine4 (square-of-four identity flip-vert identity flip-vert))) (combine4 painter)))
and square-limit
can be expressed as(91)
(define (square-limit painter n) (let ((combine4 (square-of-four flip-horiz identity rotate180 flip-vert))) (combine4 (corner-split painter n))))
Exercise 2.45:
Right-split
andup-split
can be expressed as instances of a general splitting operation. Define a proceduresplit
with the property that evaluating(define right-split (split beside below)) (define up-split (split below beside))produces procedures
right-split
andup-split
with the same behaviors as the ones already defined.
Before we can show how to implement painters and their means of combination, we must first consider frames. A frame can be described by three vectors—an origin vector and two edge vectors. The origin vector specifies the offset of the frame’s origin from some absolute origin in the plane, and the edge vectors specify the offsets of the frame’s corners from its origin. If the edges are perpendicular, the frame will be rectangular. Otherwise the frame will be a more general parallelogram.
Figure 2-15 shows a frame and its associated vectors.
In accordance with data abstraction, we need not be specific yet about how
frames are represented, other than to say that there is a constructor
make-frame
, which takes three vectors and produces a frame, and three
corresponding selectors origin-frame
, edge1-frame
, and
edge2-frame
(see Exercise 2-47).
Figure 2.15: A frame is described by three vectors – an origin and two edges.
__ __-- \ __-- \ __ __-- \ __ |\ __-- \__-| \- __-- frame \ __-- edge2 \ __-- frame vector \ __-- edge1 \_-- vector - <--+ frame | origin +-- (0,0) point vector on display screen
We will use coordinates in the unit square (0<= x,y<= 1) to specify images. With each frame, we associate a frame coordinate map, which will be used to shift and scale images to fit the frame. The map transforms the unit square into the frame by mapping the vector v = (x,y) to the vector sum
Origin(Frame) + r * Edge_1(Frame) + y * Edge_2(Frame)
For example, (0,0) is mapped to the origin of the frame, (1,1) to the vertex diagonally opposite the origin, and (0.5,0.5) to the center of the frame. We can create a frame’s coordinate map with the following procedure:(92)
(define (frame-coord-map frame) (lambda (v) (add-vect (origin-frame frame) (add-vect (scale-vect (xcor-vect v) (edge1-frame frame)) (scale-vect (ycor-vect v) (edge2-frame frame))))))
Observe that applying frame-coord-map
to a frame returns a procedure
that, given a vector, returns a vector. If the argument vector is in the unit
square, the result vector will be in the frame. For example,
((frame-coord-map a-frame) (make-vect 0 0))
returns the same vector as
(origin-frame a-frame)
Exercise 2.46: A two-dimensional vector v running from the origin to a point can be represented as a pair consisting of an x-coordinate and a y-coordinate. Implement a data abstraction for vectors by giving a constructor
make-vect
and corresponding selectorsxcor-vect
andycor-vect
. In terms of your selectors and constructor, implement proceduresadd-vect
,sub-vect
, andscale-vect
that perform the operations vector addition, vector subtraction, and multiplying a vector by a scalar:(x_1, y_1) + (x_2, y_2) = (x_1 + x_2, y_1 + y_2) (x_1, y_1) - (x_2, y_2) = (x_1 - x_2, y_1 - y_2) s * (x, y) = (sx, sy)
Exercise 2.47: Here are two possible constructors for frames:
(define (make-frame origin edge1 edge2) (list origin edge1 edge2)) (define (make-frame origin edge1 edge2) (cons origin (cons edge1 edge2)))For each constructor supply the appropriate selectors to produce an implementation for frames.
A painter is represented as a procedure that, given a frame as argument, draws
a particular image shifted and scaled to fit the frame. That is to say, if
p
is a painter and f
is a frame, then we produce p
’s image
in f
by calling p
with f
as argument.
The details of how primitive painters are implemented depend on the particular
characteristics of the graphics system and the type of image to be drawn. For
instance, suppose we have a procedure draw-line
that draws a line on the
screen between two specified points. Then we can create painters for line
drawings, such as the wave
painter in Figure 2-10, from lists of
line segments as follows:(93)
(define (segments->painter segment-list) (lambda (frame) (for-each (lambda (segment) (draw-line ((frame-coord-map frame) (start-segment segment)) ((frame-coord-map frame) (end-segment segment)))) segment-list)))
The segments are given using coordinates with respect to the unit square. For each segment in the list, the painter transforms the segment endpoints with the frame coordinate map and draws a line between the transformed points.
Representing painters as procedures erects a powerful abstraction barrier in the picture language. We can create and intermix all sorts of primitive painters, based on a variety of graphics capabilities. The details of their implementation do not matter. Any procedure can serve as a painter, provided that it takes a frame as argument and draws something scaled to fit the frame.(94)
Exercise 2.48: A directed line segment in the plane can be represented as a pair of vectors—the vector running from the origin to the start-point of the segment, and the vector running from the origin to the end-point of the segment. Use your vector representation from Exercise 2-46 to define a representation for segments with a constructor
make-segment
and selectorsstart-segment
andend-segment
.
Exercise 2.49: Use
segments->painter
to define the following primitive painters:
- The painter that draws the outline of the designated frame.
- The painter that draws an “X” by connecting opposite corners of the frame.
- The painter that draws a diamond shape by connecting the midpoints of the sides of the frame.
- The
wave
painter.
An operation on painters (such as flip-vert
or beside
) works by
creating a painter that invokes the original painters with respect to frames
derived from the argument frame. Thus, for example, flip-vert
doesn’t
have to know how a painter works in order to flip it—it just has to know how
to turn a frame upside down: The flipped painter just uses the original
painter, but in the inverted frame.
Painter operations are based on the procedure transform-painter
, which
takes as arguments a painter and information on how to transform a frame and
produces a new painter. The transformed painter, when called on a frame,
transforms the frame and calls the original painter on the transformed frame.
The arguments to transform-painter
are points (represented as vectors)
that specify the corners of the new frame: When mapped into the frame, the
first point specifies the new frame’s origin and the other two specify the ends
of its edge vectors. Thus, arguments within the unit square specify a frame
contained within the original frame.
(define (transform-painter painter origin corner1 corner2) (lambda (frame) (let ((m (frame-coord-map frame))) (let ((new-origin (m origin))) (painter (make-frame new-origin (sub-vect (m corner1) new-origin) (sub-vect (m corner2) new-origin)))))))
Here’s how to flip painter images vertically:
(define (flip-vert painter) (transform-painter painter (make-vect 0.0 1.0) ; neworigin
(make-vect 1.0 1.0) ; new end ofedge1
(make-vect 0.0 0.0))) ; new end ofedge2
Using transform-painter
, we can easily define new transformations.
For example, we can define a painter that shrinks its image to the
upper-right quarter of the frame it is given:
(define (shrink-to-upper-right painter) (transform-painter painter (make-vect 0.5 0.5) (make-vect 1.0 0.5) (make-vect 0.5 1.0)))
Other transformations rotate images counterclockwise by 90 degrees(95)
(define (rotate90 painter) (transform-painter painter (make-vect 1.0 0.0) (make-vect 1.0 1.0) (make-vect 0.0 0.0)))
or squash images towards the center of the frame:(96)
(define (squash-inwards painter) (transform-painter painter (make-vect 0.0 0.0) (make-vect 0.65 0.35) (make-vect 0.35 0.65)))
Frame transformation is also the key to defining means of combining two or more
painters. The beside
procedure, for example, takes two painters,
transforms them to paint in the left and right halves of an argument frame
respectively, and produces a new, compound painter. When the compound painter
is given a frame, it calls the first transformed painter to paint in the left
half of the frame and calls the second transformed painter to paint in the
right half of the frame:
(define (beside painter1 painter2) (let ((split-point (make-vect 0.5 0.0))) (let ((paint-left (transform-painter painter1 (make-vect 0.0 0.0) split-point (make-vect 0.0 1.0))) (paint-right (transform-painter painter2 split-point (make-vect 1.0 0.0) (make-vect 0.5 1.0)))) (lambda (frame) (paint-left frame) (paint-right frame)))))
Observe how the painter data abstraction, and in particular the representation
of painters as procedures, makes beside
easy to implement. The
beside
procedure need not know anything about the details of the
component painters other than that each painter will draw something in its
designated frame.
Exercise 2.50: Define the transformation
flip-horiz
, which flips painters horizontally, and transformations that rotate painters counterclockwise by 180 degrees and 270 degrees.
Exercise 2.51: Define the
below
operation for painters.Below
takes two painters as arguments. The resulting painter, given a frame, draws with the first painter in the bottom of the frame and with the second painter in the top. Definebelow
in two different ways—first by writing a procedure that is analogous to thebeside
procedure given above, and again in terms ofbeside
and suitable rotation operations (from Exercise 2-50).
The picture language exercises some of the critical ideas we’ve introduced about abstraction with procedures and data. The fundamental data abstractions, painters, are implemented using procedural representations, which enables the language to handle different basic drawing capabilities in a uniform way. The means of combination satisfy the closure property, which permits us to easily build up complex designs. Finally, all the tools for abstracting procedures are available to us for abstracting means of combination for painters.
We have also obtained a glimpse of another crucial idea about languages and program design. This is the approach of stratified design, the notion that a complex system should be structured as a sequence of levels that are described using a sequence of languages. Each level is constructed by combining parts that are regarded as primitive at that level, and the parts constructed at each level are used as primitives at the next level. The language used at each level of a stratified design has primitives, means of combination, and means of abstraction appropriate to that level of detail.
Stratified design pervades the engineering of complex systems. For example, in computer engineering, resistors and transistors are combined (and described using a language of analog circuits) to produce parts such as and-gates and or-gates, which form the primitives of a language for digital-circuit design.(97) These parts are combined to build processors, bus structures, and memory systems, which are in turn combined to form computers, using languages appropriate to computer architecture. Computers are combined to form distributed systems, using languages appropriate for describing network interconnections, and so on.
As a tiny example of stratification, our picture language uses primitive
elements (primitive painters) that are created using a language that specifies
points and lines to provide the lists of line segments for
segments->painter
, or the shading details for a painter like
rogers
. The bulk of our description of the picture language focused on
combining these primitives, using geometric combiners such as beside
and
below
. We also worked at a higher level, regarding beside
and
below
as primitives to be manipulated in a language whose operations,
such as square-of-four
, capture common patterns of combining geometric
combiners.
Stratified design helps make programs
robust, that is, it makes it
likely that small changes in a specification will require correspondingly small
changes in the program. For instance, suppose we wanted to change the image
based on wave
shown in Figure 2-9. We could work at the lowest
level to change the detailed appearance of the wave
element; we could
work at the middle level to change the way corner-split
replicates the
wave
; we could work at the highest level to change how
square-limit
arranges the four copies of the corner. In general, each
level of a stratified design provides a different vocabulary for expressing the
characteristics of the system, and a different kind of ability to change it.
Exercise 2.52: Make changes to the square limit of
wave
shown in Figure 2-9 by working at each of the levels described above. In particular:
- Add some segments to the primitive
wave
painter of Exercise 2-49 (to add a smile, for example).- Change the pattern constructed by
corner-split
(for example, by using only one copy of theup-split
andright-split
images instead of two).- Modify the version of
square-limit
that usessquare-of-four
so as to assemble the corners in a different pattern. (For example, you might make the big Mr. Rogers look outward from each corner of the square.)
[ << ] | [ < ] | [ Up ] | [ > ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
All the compound data objects we have used so far were constructed ultimately from numbers. In this section we extend the representational capability of our language by introducing the ability to work with arbitrary symbols as data.
2.3.1 Quotation | ||
2.3.2 Example: Symbolic Differentiation | ||
2.3.3 Example: Representing Sets | ||
2.3.4 Example: Huffman Encoding Trees |
[ << ] | [ < ] | [ Up ] | [ > ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
If we can form compound data using symbols, we can have lists such as
(a b c d) (23 45 17) ((Norah 12) (Molly 9) (Anna 7) (Lauren 6) (Charlotte 4))
Lists containing symbols can look just like the expressions of our language:
(* (+ 23 45) (+ x 9)) (define (fact n) (if (= n 1) 1 (* n (fact (- n 1)))))
In order to manipulate symbols we need a new element in our language: the
ability to
quote a data object. Suppose we want to construct the
list (a b)
. We can’t accomplish this with (list a b)
, because
this expression constructs a list of the
values of a
and
b
rather than the symbols themselves. This issue is well known in the
context of natural languages, where words and sentences may be regarded either
as semantic entities or as character strings (syntactic entities). The common
practice in natural languages is to use quotation marks to indicate that a word
or a sentence is to be treated literally as a string of characters. For
instance, the first letter of “John” is clearly “J.” If we tell somebody
“say your name aloud,” we expect to hear that person’s name. However, if we
tell somebody “say ‘your name’ aloud,” we expect to hear the words “your
name.” Note that we are forced to nest quotation marks to describe what
somebody else might say.(98)
We can follow this same practice to identify lists and symbols that are to be
treated as data objects rather than as expressions to be evaluated. However,
our format for quoting differs from that of natural languages in that we place
a quotation mark (traditionally, the single quote symbol '
) only at the
beginning of the object to be quoted. We can get away with this in Scheme
syntax because we rely on blanks and parentheses to delimit objects. Thus, the
meaning of the single quote character is to quote the next object.(99)
Now we can distinguish between symbols and their values:
(define a 1) (define b 2) (list a b) (1 2) (list 'a 'b) (a b) (list 'a b) (a 2)
Quotation also allows us to type in compound objects, using the conventional printed representation for lists:(100)
(car '(a b c)) a (cdr '(a b c)) (b c)
In keeping with this, we can obtain the empty list by evaluating '()
,
and thus dispense with the variable nil
.
One additional primitive used in manipulating symbols is eq?
, which
takes two symbols as arguments and tests whether they are the same.(101)
Using eq?
, we can implement a useful procedure called memq
. This
takes two arguments, a symbol and a list. If the symbol is not contained in
the list (i.e., is not eq?
to any item in the list), then memq
returns false. Otherwise, it returns the sublist of the list beginning with
the first occurrence of the symbol:
(define (memq item x) (cond ((null? x) false) ((eq? item (car x)) x) (else (memq item (cdr x)))))
For example, the value of
(memq 'apple '(pear banana prune))
is false, whereas the value of
(memq 'apple '(x (apple sauce) y apple pear))
is (apple pear)
.
Exercise 2.53: What would the interpreter print in response to evaluating each of the following expressions?
(list 'a 'b 'c) (list (list 'george)) (cdr '((x1 x2) (y1 y2))) (cadr '((x1 x2) (y1 y2))) (pair? (car '(a short list))) (memq 'red '((red shoes) (blue socks))) (memq 'red '(red shoes blue socks))
Exercise 2.54: Two lists are said to be
equal?
if they contain equal elements arranged in the same order. For example,(equal? '(this is a list) '(this is a list))is true, but
(equal? '(this is a list) '(this (is a) list))is false. To be more precise, we can define
equal?
recursively in terms of the basiceq?
equality of symbols by saying thata
andb
areequal?
if they are both symbols and the symbols areeq?
, or if they are both lists such that(car a)
isequal?
to(car b)
and(cdr a)
isequal?
to(cdr b)
. Using this idea, implementequal?
as a procedure.(102)
Exercise 2.55: Eva Lu Ator types to the interpreter the expression
(car ''abracadabra)To her surprise, the interpreter prints back
quote
. Explain.
[ << ] | [ < ] | [ Up ] | [ > ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
As an illustration of symbol manipulation and a further illustration of data abstraction, consider the design of a procedure that performs symbolic differentiation of algebraic expressions. We would like the procedure to take as arguments an algebraic expression and a variable and to return the derivative of the expression with respect to the variable. For example, if the arguments to the procedure are ax^2 + bx + c and x, the procedure should return 2ax + b. Symbolic differentiation is of special historical significance in Lisp. It was one of the motivating examples behind the development of a computer language for symbol manipulation. Furthermore, it marked the beginning of the line of research that led to the development of powerful systems for symbolic mathematical work, which are currently being used by a growing number of applied mathematicians and physicists.
In developing the symbolic-differentiation program, we will follow the same strategy of data abstraction that we followed in developing the rational-number system of section Example: Arithmetic Operations for Rational Numbers. That is, we will first define a differentiation algorithm that operates on abstract objects such as “sums,” “products,” and “variables” without worrying about how these are to be represented. Only afterward will we address the representation problem.
In order to keep things simple, we will consider a very simple symbolic-differentiation program that handles expressions that are built up using only the operations of addition and multiplication with two arguments. Differentiation of any such expression can be carried out by applying the following reduction rules:
dc -- = 0 for c a constant, or a variable different from x dx dx -- = 1 dx d(u + v) du dv -------- = -- + -- dx dx dx d(uv) / dv \ / du \ ----- = u | -- | + v | -- | dx \ dx / \ dx /
Observe that the latter two rules are recursive in nature. That is, to obtain the derivative of a sum we first find the derivatives of the terms and add them. Each of the terms may in turn be an expression that needs to be decomposed. Decomposing into smaller and smaller pieces will eventually produce pieces that are either constants or variables, whose derivatives will be either 0 or 1.
To embody these rules in a procedure we indulge in a little wishful thinking, as we did in designing the rational-number implementation. If we had a means for representing algebraic expressions, we should be able to tell whether an expression is a sum, a product, a constant, or a variable. We should be able to extract the parts of an expression. For a sum, for example we want to be able to extract the addend (first term) and the augend (second term). We should also be able to construct expressions from parts. Let us assume that we already have procedures to implement the following selectors, constructors, and predicates:
(variable? e) Ise
a variable? (same-variable? v1 v2) Arev1
andv2
the same variable? (sum? e) Ise
a sum? (addend e) Addend of the sume
. (augend e) Augend of the sume
. (make-sum a1 a2) Construct the sum ofa1
anda2
. (product? e) Ise
a product? (multiplier e) Multiplier of the producte
. (multiplicand e) Multiplicand of the producte
. (make-product m1 m2) Construct the product ofm1
andm2
.
Using these, and the primitive predicate number?
, which identifies
numbers, we can express the differentiation rules as the following procedure:
(define (deriv exp var) (cond ((number? exp) 0) ((variable? exp) (if (same-variable? exp var) 1 0)) ((sum? exp) (make-sum (deriv (addend exp) var) (deriv (augend exp) var))) ((product? exp) (make-sum (make-product (multiplier exp) (deriv (multiplicand exp) var)) (make-product (deriv (multiplier exp) var) (multiplicand exp)))) (else (error "unknown expression type -- DERIV" exp))))
This deriv
procedure incorporates the complete differentiation
algorithm. Since it is expressed in terms of abstract data, it will work no
matter how we choose to represent algebraic expressions, as long as we design a
proper set of selectors and constructors. This is the issue we must address
next.
We can imagine many ways to use list structure to represent algebraic
expressions. For example, we could use lists of symbols that mirror the usual
algebraic notation, representing ax + b as the list (a * x +
b)
. However, one especially straightforward choice is to use the same
parenthesized prefix notation that Lisp uses for combinations; that is, to
represent ax + b as (+ (* a x) b)
. Then our data
representation for the differentiation problem is as follows:
symbol?
:
(define (variable? x) (symbol? x))
eq?
:
(define (same-variable? v1 v2) (and (variable? v1) (variable? v2) (eq? v1 v2)))
(define (make-sum a1 a2) (list '+ a1 a2)) (define (make-product m1 m2) (list '* m1 m2))
+
:
(define (sum? x) (and (pair? x) (eq? (car x) '+)))
(define (addend s) (cadr s))
(define (augend s) (caddr s))
*
:
(define (product? x) (and (pair? x) (eq? (car x) '*)))
(define (multiplier p) (cadr p))
(define (multiplicand p) (caddr p))
Thus, we need only combine these with the algorithm as embodied by deriv
in order to have a working symbolic-differentiation program. Let us look at
some examples of its behavior:
(deriv '(+ x 3) 'x) (+ 1 0) (deriv '(* x y) 'x) (+ (* x 0) (* 1 y)) (deriv '(* (* x y) (+ x 3)) 'x) (+ (* (* x y) (+ 1 0)) (* (+ (* x 0) (* 1 y)) (+ x 3)))
The program produces answers that are correct; however, they are unsimplified. It is true that
d(xy) ----- = x * 0 + 1 * y dx
but we would like the program to know that x * 0 = 0, 1 * y = y,
and 0 + y = y. The answer for the second example should have been
simply y
. As the third example shows, this becomes a serious issue when
the expressions are complex.
Our difficulty is much like the one we encountered with the rational-number
implementation: we haven’t reduced answers to simplest form. To accomplish the
rational-number reduction, we needed to change only the constructors and the
selectors of the implementation. We can adopt a similar strategy here. We
won’t change deriv
at all. Instead, we will change make-sum
so
that if both summands are numbers, make-sum
will add them and return
their sum. Also, if one of the summands is 0, then make-sum
will return
the other summand.
(define (make-sum a1 a2) (cond ((=number? a1 0) a2) ((=number? a2 0) a1) ((and (number? a1) (number? a2)) (+ a1 a2)) (else (list '+ a1 a2))))
This uses the procedure =number?
, which checks whether an expression is
equal to a given number:
(define (=number? exp num) (and (number? exp) (= exp num)))
Similarly, we will change make-product
to build in the rules that 0
times anything is 0 and 1 times anything is the thing itself:
(define (make-product m1 m2) (cond ((or (=number? m1 0) (=number? m2 0)) 0) ((=number? m1 1) m2) ((=number? m2 1) m1) ((and (number? m1) (number? m2)) (* m1 m2)) (else (list '* m1 m2))))
Here is how this version works on our three examples:
(deriv '(+ x 3) 'x) 1 (deriv '(* x y) 'x) y (deriv '(* (* x y) (+ x 3)) 'x) (+ (* x y) (* y (+ x 3)))
Although this is quite an improvement, the third example shows that there is still a long way to go before we get a program that puts expressions into a form that we might agree is “simplest.” The problem of algebraic simplification is complex because, among other reasons, a form that may be simplest for one purpose may not be for another.
Exercise 2.56: Show how to extend the basic differentiator to handle more kinds of expressions. For instance, implement the differentiation rule
n_1 n_2 --- = --- if and only if n_1 d_2 = n_2 d_1 d_1 d_2by adding a new clause to the
deriv
program and defining appropriate proceduresexponentiation?
,base
,exponent
, andmake-exponentiation
. (You may use the symbol**
to denote exponentiation.) Build in the rules that anything raised to the power 0 is 1 and anything raised to the power 1 is the thing itself.
Exercise 2.57: Extend the differentiation program to handle sums and products of arbitrary numbers of (two or more) terms. Then the last example above could be expressed as
(deriv '(* x y (+ x 3)) 'x)Try to do this by changing only the representation for sums and products, without changing the
deriv
procedure at all. For example, theaddend
of a sum would be the first term, and theaugend
would be the sum of the rest of the terms.
Exercise 2.58: Suppose we want to modify the differentiation program so that it works with ordinary mathematical notation, in which
+
and*
are infix rather than prefix operators. Since the differentiation program is defined in terms of abstract data, we can modify it to work with different representations of expressions solely by changing the predicates, selectors, and constructors that define the representation of the algebraic expressions on which the differentiator is to operate.
- Show how to do this in order to differentiate algebraic expressions presented in infix form, such as
(x + (3 * (x + (y + 2))))
. To simplify the task, assume that+
and*
always take two arguments and that expressions are fully parenthesized.- The problem becomes substantially harder if we allow standard algebraic notation, such as
(x + 3 * (x + y + 2))
, which drops unnecessary parentheses and assumes that multiplication is done before addition. Can you design appropriate predicates, selectors, and constructors for this notation such that our derivative program still works?
[ << ] | [ < ] | [ Up ] | [ > ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
In the previous examples we built representations for two kinds of compound data objects: rational numbers and algebraic expressions. In one of these examples we had the choice of simplifying (reducing) the expressions at either construction time or selection time, but other than that the choice of a representation for these structures in terms of lists was straightforward. When we turn to the representation of sets, the choice of a representation is not so obvious. Indeed, there are a number of possible representations, and they differ significantly from one another in several ways.
Informally, a set is simply a collection of distinct objects. To give a more
precise definition we can employ the method of data abstraction. That is, we
define “set” by specifying the operations that are to be used on sets. These
are union-set
, intersection-set
, element-of-set?
, and
adjoin-set
. Element-of-set?
is a predicate that determines
whether a given element is a member of a set. Adjoin-set
takes an
object and a set as arguments and returns a set that contains the elements of
the original set and also the adjoined element. Union-set
computes the
union of two sets, which is the set containing each element that appears in
either argument. Intersection-set
computes the intersection of two
sets, which is the set containing only elements that appear in both arguments.
From the viewpoint of data abstraction, we are free to design any
representation that implements these operations in a way consistent with the
interpretations given above.(103)
One way to represent a set is as a list of its elements in which no element
appears more than once. The empty set is represented by the empty list. In
this representation, element-of-set?
is similar to the procedure
memq
of section Quotation. It uses equal?
instead of
eq?
so that the set elements need not be symbols:
(define (element-of-set? x set) (cond ((null? set) false) ((equal? x (car set)) true) (else (element-of-set? x (cdr set)))))
Using this, we can write adjoin-set
. If the object to be adjoined is
already in the set, we just return the set. Otherwise, we use cons
to
add the object to the list that represents the set:
(define (adjoin-set x set) (if (element-of-set? x set) set (cons x set)))
For intersection-set
we can use a recursive strategy. If we know how to
form the intersection of set2
and the cdr
of set1
, we only
need to decide whether to include the car
of set1
in this. But
this depends on whether (car set1)
is also in set2
. Here is the
resulting procedure:
(define (intersection-set set1 set2) (cond ((or (null? set1) (null? set2)) '()) ((element-of-set? (car set1) set2) (cons (car set1) (intersection-set (cdr set1) set2))) (else (intersection-set (cdr set1) set2))))
In designing a representation, one of the issues we should be concerned with is
efficiency. Consider the number of steps required by our set operations.
Since they all use element-of-set?
, the speed of this operation has a
major impact on the efficiency of the set implementation as a whole. Now, in
order to check whether an object is a member of a set, element-of-set?
may have to scan the entire set. (In the worst case, the object turns out not
to be in the set.) Hence, if the set has n elements,
element-of-set?
might take up to n steps. Thus, the number of
steps required grows as [theta](n). The number of steps required by
adjoin-set
, which uses this operation, also grows as [theta](n).
For intersection-set
, which does an element-of-set?
check for
each element of set1
, the number of steps required grows as the product
of the sizes of the sets involved, or [theta](n^2) for two sets of size
n. The same will be true of union-set
.
Exercise 2.59: Implement the
union-set
operation for the unordered-list representation of sets.
Exercise 2.60: We specified that a set would be represented as a list with no duplicates. Now suppose we allow duplicates. For instance, the set {1,2,3} could be represented as the list
(2 3 2 1 3 2 2)
. Design procedureselement-of-set?
,adjoin-set
,union-set
, andintersection-set
that operate on this representation. How does the efficiency of each compare with the corresponding procedure for the non-duplicate representation? Are there applications for which you would use this representation in preference to the non-duplicate one?
One way to speed up our set operations is to change the representation so that
the set elements are listed in increasing order. To do this, we need some way
to compare two objects so that we can say which is bigger. For example, we
could compare symbols lexicographically, or we could agree on some method for
assigning a unique number to an object and then compare the elements by
comparing the corresponding numbers. To keep our discussion simple, we will
consider only the case where the set elements are numbers, so that we can
compare elements using >
and <
. We will represent a set of
numbers by listing its elements in increasing order. Whereas our first
representation above allowed us to represent the set {1,3,6,10} by listing
the elements in any order, our new representation allows only the list (1
3 6 10)
.
One advantage of ordering shows up in element-of-set?
: In checking for
the presence of an item, we no longer have to scan the entire set. If we reach
a set element that is larger than the item we are looking for, then we know
that the item is not in the set:
(define (element-of-set? x set) (cond ((null? set) false) ((= x (car set)) true) ((< x (car set)) false) (else (element-of-set? x (cdr set)))))
How many steps does this save? In the worst case, the item we are looking for may be the largest one in the set, so the number of steps is the same as for the unordered representation. On the other hand, if we search for items of many different sizes we can expect that sometimes we will be able to stop searching at a point near the beginning of the list and that other times we will still need to examine most of the list. On the average we should expect to have to examine about half of the items in the set. Thus, the average number of steps required will be about n/2. This is still [theta](n) growth, but it does save us, on the average, a factor of 2 in number of steps over the previous implementation.
We obtain a more impressive speedup with intersection-set
. In the
unordered representation this operation required [theta](n^2) steps,
because we performed a complete scan of set2
for each element of
set1
. But with the ordered representation, we can use a more clever
method. Begin by comparing the initial elements, x1
and x2
, of
the two sets. If x1
equals x2
, then that gives an element of the
intersection, and the rest of the intersection is the intersection of the
cdr
s of the two sets. Suppose, however, that x1
is less than
x2
. Since x2
is the smallest element in set2
, we can
immediately conclude that x1
cannot appear anywhere in set2
and
hence is not in the intersection. Hence, the intersection is equal to the
intersection of set2
with the cdr
of set1
. Similarly, if
x2
is less than x1
, then the intersection is given by the
intersection of set1
with the cdr
of set2
. Here is the
procedure:
(define (intersection-set set1 set2) (if (or (null? set1) (null? set2)) '() (let ((x1 (car set1)) (x2 (car set2))) (cond ((= x1 x2) (cons x1 (intersection-set (cdr set1) (cdr set2)))) ((< x1 x2) (intersection-set (cdr set1) set2)) ((< x2 x1) (intersection-set set1 (cdr set2)))))))
To estimate the number of steps required by this process, observe that at each
step we reduce the intersection problem to computing intersections of smaller
sets—removing the first element from set1
or set2
or both.
Thus, the number of steps required is at most the sum of the sizes of
set1
and set2
, rather than the product of the sizes as with the
unordered representation. This is [theta](n) growth rather than
[theta](n^2)—a considerable speedup, even for sets of moderate size.
Exercise 2.61: Give an implementation of
adjoin-set
using the ordered representation. By analogy withelement-of-set?
show how to take advantage of the ordering to produce a procedure that requires on the average about half as many steps as with the unordered representation.
Exercise 2.62: Give a [theta](n) implementation of
union-set
for sets represented as ordered lists.
We can do better than the ordered-list representation by arranging the set elements in the form of a tree. Each node of the tree holds one element of the set, called the “entry” at that node, and a link to each of two other (possibly empty) nodes. The “left” link points to elements smaller than the one at the node, and the “right” link to elements greater than the one at the node. Figure 2-16 shows some trees that represent the set {1,3,5,7,9,11}. The same set may be represented by a tree in a number of different ways. The only thing we require for a valid representation is that all elements in the left subtree be smaller than the node entry and that all elements in the right subtree be larger.
Figure 2.16: Various binary trees that represent the set {1,3,5,7,9,11}.
7 3 5 /\ /\ /\ 3 9 1 7 3 9 /\ \ /\ / /\ 1 5 11 5 9 1 7 11 \ 11
The advantage of the tree representation is this: Suppose we want to check
whether a number x is contained in a set. We begin by comparing x with
the entry in the top node. If x is less than this, we know that we need
only search the left subtree; if x is greater, we need only search the
right subtree. Now, if the tree is “balanced,” each of these subtrees will
be about half the size of the original. Thus, in one step we have reduced the
problem of searching a tree of size n to searching a tree of size n/2.
Since the size of the tree is halved at each step, we should expect that the
number of steps needed to search a tree of size n grows as
[theta](log
n).(104) For large sets, this will be a
significant speedup over the previous representations.
We can represent trees by using lists. Each node will be a list of three items: the entry at the node, the left subtree, and the right subtree. A left or a right subtree of the empty list will indicate that there is no subtree connected there. We can describe this representation by the following procedures:(105)
(define (entry tree) (car tree)) (define (left-branch tree) (cadr tree)) (define (right-branch tree) (caddr tree)) (define (make-tree entry left right) (list entry left right))
Now we can write the element-of-set?
procedure using the strategy
described above:
(define (element-of-set? x set) (cond ((null? set) false) ((= x (entry set)) true) ((< x (entry set)) (element-of-set? x (left-branch set))) ((> x (entry set)) (element-of-set? x (right-branch set)))))
Adjoining an item to a set is implemented similarly and also requires
[theta](log
n) steps. To adjoin an item x
, we compare
x
with the node entry to determine whether x
should be added to
the right or to the left branch, and having adjoined x
to the
appropriate branch we piece this newly constructed branch together with the
original entry and the other branch. If x
is equal to the entry, we
just return the node. If we are asked to adjoin x
to an empty tree, we
generate a tree that has x
as the entry and empty right and left
branches. Here is the procedure:
(define (adjoin-set x set) (cond ((null? set) (make-tree x '() '())) ((= x (entry set)) set) ((< x (entry set)) (make-tree (entry set) (adjoin-set x (left-branch set)) (right-branch set))) ((> x (entry set)) (make-tree (entry set) (left-branch set) (adjoin-set x (right-branch set))))))
The above claim that searching the tree can be performed in a logarithmic
number of steps rests on the assumption that the tree is “balanced,” i.e.,
that the left and the right subtree of every tree have approximately the same
number of elements, so that each subtree contains about half the elements of
its parent. But how can we be certain that the trees we construct will be
balanced? Even if we start with a balanced tree, adding elements with
adjoin-set
may produce an unbalanced result. Since the position of a
newly adjoined element depends on how the element compares with the items
already in the set, we can expect that if we add elements “randomly” the tree
will tend to be balanced on the average. But this is not a guarantee. For
example, if we start with an empty set and adjoin the numbers 1 through 7 in
sequence we end up with the highly unbalanced tree shown in Figure 2-17.
In this tree all the left subtrees are empty, so it has no advantage over a
simple ordered list. One way to solve this problem is to define an operation
that transforms an arbitrary tree into a balanced tree with the same elements.
Then we can perform this transformation after every few adjoin-set
operations to keep our set in balance. There are also other ways to solve this
problem, most of which involve designing new data structures for which
searching and insertion both can be done in [theta](log
n)
steps.(106)
Figure 2.17: Unbalanced tree produced by adjoining 1 through 7 in sequence.
1 \ 2 \ 4 \ 5 \ 6 \ 7
Exercise 2.63: Each of the following two procedures converts a binary tree to a list.
(define (tree->list-1 tree) (if (null? tree) '() (append (tree->list-1 (left-branch tree)) (cons (entry tree) (tree->list-1 (right-branch tree)))))) (define (tree->list-2 tree) (define (copy-to-list tree result-list) (if (null? tree) result-list (copy-to-list (left-branch tree) (cons (entry tree) (copy-to-list (right-branch tree) result-list))))) (copy-to-list tree '()))
- Do the two procedures produce the same result for every tree? If not, how do the results differ? What lists do the two procedures produce for the trees in Figure 2-16?
- Do the two procedures have the same order of growth in the number of steps required to convert a balanced tree with n elements to a list? If not, which one grows more slowly?
Exercise 2.64: The following procedure
list->tree
converts an ordered list to a balanced binary tree. The helper procedurepartial-tree
takes as arguments an integer n and list of at least n elements and constructs a balanced tree containing the first n elements of the list. The result returned bypartial-tree
is a pair (formed withcons
) whosecar
is the constructed tree and whosecdr
is the list of elements not included in the tree.(define (list->tree elements) (car (partial-tree elements (length elements)))) (define (partial-tree elts n) (if (= n 0) (cons '() elts) (let ((left-size (quotient (- n 1) 2))) (let ((left-result (partial-tree elts left-size))) (let ((left-tree (car left-result)) (non-left-elts (cdr left-result)) (right-size (- n (+ left-size 1)))) (let ((this-entry (car non-left-elts)) (right-result (partial-tree (cdr non-left-elts) right-size))) (let ((right-tree (car right-result)) (remaining-elts (cdr right-result))) (cons (make-tree this-entry left-tree right-tree) remaining-elts))))))))
- Write a short paragraph explaining as clearly as you can how
partial-tree
works. Draw the tree produced bylist->tree
for the list(1 3 5 7 9 11)
.- What is the order of growth in the number of steps required by
list->tree
to convert a list of n elements?
Exercise 2.65: Use the results of Exercise 2-63 and Exercise 2-64 to give [theta](n) implementations of
union-set
andintersection-set
for sets implemented as (balanced) binary trees.(107)
We have examined options for using lists to represent sets and have seen how the choice of representation for a data object can have a large impact on the performance of the programs that use the data. Another reason for concentrating on sets is that the techniques discussed here appear again and again in applications involving information retrieval.
Consider a data base containing a large number of individual records, such as
the personnel files for a company or the transactions in an accounting system.
A typical data-management system spends a large amount of time accessing or
modifying the data in the records and therefore requires an efficient method
for accessing records. This is done by identifying a part of each record to
serve as an identifying
key. A key can be anything that uniquely
identifies the record. For a personnel file, it might be an employee’s ID
number. For an accounting system, it might be a transaction number. Whatever
the key is, when we define the record as a data structure we should include a
key
selector procedure that retrieves the key associated with a given
record.
Now we represent the data base as a set of records. To locate the record with a
given key we use a procedure lookup
, which takes as arguments a key and
a data base and which returns the record that has that key, or false if there
is no such record. Lookup
is implemented in almost the same way as
element-of-set?
. For example, if the set of records is implemented as
an unordered list, we could use
(define (lookup given-key set-of-records) (cond ((null? set-of-records) false) ((equal? given-key (key (car set-of-records))) (car set-of-records)) (else (lookup given-key (cdr set-of-records)))))
Of course, there are better ways to represent large sets than as unordered lists. Information-retrieval systems in which records have to be “randomly accessed” are typically implemented by a tree-based method, such as the binary-tree representation discussed previously. In designing such a system the methodology of data abstraction can be a great help. The designer can create an initial implementation using a simple, straightforward representation such as unordered lists. This will be unsuitable for the eventual system, but it can be useful in providing a “quick and dirty” data base with which to test the rest of the system. Later on, the data representation can be modified to be more sophisticated. If the data base is accessed in terms of abstract selectors and constructors, this change in representation will not require any changes to the rest of the system.
Exercise 2.66: Implement the
lookup
procedure for the case where the set of records is structured as a binary tree, ordered by the numerical values of the keys.
[ << ] | [ < ] | [ Up ] | [ > ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
This section provides practice in the use of list structure and data
abstraction to manipulate sets and trees. The application is to methods for
representing data as sequences of ones and zeros (bits). For example, the
ASCII standard code used to represent text in computers encodes each character
as a sequence of seven bits. Using seven bits allows us to distinguish 2^(7),
or 128, possible different characters. In general, if we want to distinguish
n different symbols, we will need to use log
_2 n bits per
symbol. If all our messages are made up of the eight symbols A, B, C, D, E, F,
G, and H, we can choose a code with three bits per character, for example
A 000 C 010 E 100 G 110 B 001 D 011 F 101 H 111
With this code, the message
BACADAEAFABBAAAGAH
is encoded as the string of 54 bits
001000010000011000100000101000001001000000000110000111
Codes such as ASCII and the A-through-H code above are known as fixed-length codes, because they represent each symbol in the message with the same number of bits. It is sometimes advantageous to use variable-length codes, in which different symbols may be represented by different numbers of bits. For example, Morse code does not use the same number of dots and dashes for each letter of the alphabet. In particular, E, the most frequent letter, is represented by a single dot. In general, if our messages are such that some symbols appear very frequently and some very rarely, we can encode data more efficiently (i.e., using fewer bits per message) if we assign shorter codes to the frequent symbols. Consider the following alternative code for the letters A through H:
A 0 C 1010 E 1100 G 1110 B 100 D 1011 F 1101 H 1111
With this code, the same message as above is encoded as the string
100010100101101100011010100100000111001111
This string contains 42 bits, so it saves more than 20% in space in comparison with the fixed-length code shown above.
One of the difficulties of using a variable-length code is knowing when you have reached the end of a symbol in reading a sequence of zeros and ones. Morse code solves this problem by using a special separator code (in this case, a pause) after the sequence of dots and dashes for each letter. Another solution is to design the code in such a way that no complete code for any symbol is the beginning (or prefix) of the code for another symbol. Such a code is called a prefix code. In the example above, A is encoded by 0 and B is encoded by 100, so no other symbol can have a code that begins with 0 or with 100.
In general, we can attain significant savings if we use variable-length prefix codes that take advantage of the relative frequencies of the symbols in the messages to be encoded. One particular scheme for doing this is called the Huffman encoding method, after its discoverer, David Huffman. A Huffman code can be represented as a binary tree whose leaves are the symbols that are encoded. At each non-leaf node of the tree there is a set containing all the symbols in the leaves that lie below the node. In addition, each symbol at a leaf is assigned a weight (which is its relative frequency), and each non-leaf node contains a weight that is the sum of all the weights of the leaves lying below it. The weights are not used in the encoding or the decoding process. We will see below how they are used to help construct the tree.
Figure 2.18: A Huffman encoding tree.
{A B C D E F G H} 17 * / \ / \ A 8 * {B C D E F G H} 9 __________/ \_____________ / \ {B C D} 5 * * {E F G H} 4 / \ ___/ \___ / \ / \ B 3 * {C D} 2 {E F} 2 * * {G H} 2 / \ / \ / \ / \ / \ / \ C 1 D 1 E 1 F 1 G 1 H 1
Figure 2-18 shows the Huffman tree for the A-through-H code given above. The weights at the leaves indicate that the tree was designed for messages in which A appears with relative frequency 8, B with relative frequency 3, and the other letters each with relative frequency 1.
Given a Huffman tree, we can find the encoding of any symbol by starting at the root and moving down until we reach the leaf that holds the symbol. Each time we move down a left branch we add a 0 to the code, and each time we move down a right branch we add a 1. (We decide which branch to follow by testing to see which branch either is the leaf node for the symbol or contains the symbol in its set.) For example, starting from the root of the tree in Figure 2-18, we arrive at the leaf for D by following a right branch, then a left branch, then a right branch, then a right branch; hence, the code for D is 1011.
To decode a bit sequence using a Huffman tree, we begin at the root and use the successive zeros and ones of the bit sequence to determine whether to move down the left or the right branch. Each time we come to a leaf, we have generated a new symbol in the message, at which point we start over from the root of the tree to find the next symbol. For example, suppose we are given the tree above and the sequence 10001010. Starting at the root, we move down the right branch, (since the first bit of the string is 1), then down the left branch (since the second bit is 0), then down the left branch (since the third bit is also 0). This brings us to the leaf for B, so the first symbol of the decoded message is B. Now we start again at the root, and we make a left move because the next bit in the string is 0. This brings us to the leaf for A. Then we start again at the root with the rest of the string 1010, so we move right, left, right, left and reach C. Thus, the entire message is BAC.
Given an “alphabet” of symbols and their relative frequencies, how do we construct the “best” code? (In other words, which tree will encode messages with the fewest bits?) Huffman gave an algorithm for doing this and showed that the resulting code is indeed the best variable-length code for messages where the relative frequency of the symbols matches the frequencies with which the code was constructed. We will not prove this optimality of Huffman codes here, but we will show how Huffman trees are constructed.(108)
The algorithm for generating a Huffman tree is very simple. The idea is to arrange the tree so that the symbols with the lowest frequency appear farthest away from the root. Begin with the set of leaf nodes, containing symbols and their frequencies, as determined by the initial data from which the code is to be constructed. Now find two leaves with the lowest weights and merge them to produce a node that has these two nodes as its left and right branches. The weight of the new node is the sum of the two weights. Remove the two leaves from the original set and replace them by this new node. Now continue this process. At each step, merge two nodes with the smallest weights, removing them from the set and replacing them with a node that has these two as its left and right branches. The process stops when there is only one node left, which is the root of the entire tree. Here is how the Huffman tree of Figure 2-18 was generated:
Initial leaves {(A 8) (B 3) (C 1) (D 1) (E 1) (F 1) (G 1) (H 1)} Merge {(A 8) (B 3) ({C D} 2) (E 1) (F 1) (G 1) (H 1)} Merge {(A 8) (B 3) ({C D} 2) ({E F} 2) (G 1) (H 1)} Merge {(A 8) (B 3) ({C D} 2) ({E F} 2) ({G H} 2)} Merge {(A 8) (B 3) ({C D} 2) ({E F G H} 4)} Merge {(A 8) ({B C D} 5) ({E F G H} 4)} Merge {(A 8) ({B C D E F G H} 9)} Final merge {({A B C D E F G H} 17)}
The algorithm does not always specify a unique tree, because there may not be unique smallest-weight nodes at each step. Also, the choice of the order in which the two nodes are merged (i.e., which will be the right branch and which will be the left branch) is arbitrary.
In the exercises below we will work with a system that uses Huffman trees to encode and decode messages and generates Huffman trees according to the algorithm outlined above. We will begin by discussing how trees are represented.
Leaves of the tree are represented by a list consisting of the symbol
leaf
, the symbol at the leaf, and the weight:
(define (make-leaf symbol weight) (list 'leaf symbol weight)) (define (leaf? object) (eq? (car object) 'leaf)) (define (symbol-leaf x) (cadr x)) (define (weight-leaf x) (caddr x))
A general tree will be a list of a left branch, a right branch, a set of
symbols, and a weight. The set of symbols will be simply a list of the
symbols, rather than some more sophisticated set representation. When we make
a tree by merging two nodes, we obtain the weight of the tree as the sum of the
weights of the nodes, and the set of symbols as the union of the sets of
symbols for the nodes. Since our symbol sets are represented as lists, we can
form the union by using the append
procedure we defined in section
Representing Sequences:
(define (make-code-tree left right) (list left right (append (symbols left) (symbols right)) (+ (weight left) (weight right))))
If we make a tree in this way, we have the following selectors:
(define (left-branch tree) (car tree)) (define (right-branch tree) (cadr tree)) (define (symbols tree) (if (leaf? tree) (list (symbol-leaf tree)) (caddr tree))) (define (weight tree) (if (leaf? tree) (weight-leaf tree) (cadddr tree)))
The procedures symbols
and weight
must do something slightly
different depending on whether they are called with a leaf or a general tree.
These are simple examples of
generic procedures (procedures that can
handle more than one kind of data), which we will have much more to say about
in sections Multiple Representations for Abstract Data and Systems with Generic Operations.
The following procedure implements the decoding algorithm. It takes as arguments a list of zeros and ones, together with a Huffman tree.
(define (decode bits tree) (define (decode-1 bits current-branch) (if (null? bits) '() (let ((next-branch (choose-branch (car bits) current-branch))) (if (leaf? next-branch) (cons (symbol-leaf next-branch) (decode-1 (cdr bits) tree)) (decode-1 (cdr bits) next-branch))))) (decode-1 bits tree)) (define (choose-branch bit branch) (cond ((= bit 0) (left-branch branch)) ((= bit 1) (right-branch branch)) (else (error "bad bit -- CHOOSE-BRANCH" bit))))
The procedure decode-1
takes two arguments: the list of remaining bits
and the current position in the tree. It keeps moving “down” the tree,
choosing a left or a right branch according to whether the next bit in the list
is a zero or a one. (This is done with the procedure choose-branch
.)
When it reaches a leaf, it returns the symbol at that leaf as the next symbol
in the message by cons
ing it onto the result of decoding the rest of the
message, starting at the root of the tree. Note the error check in the final
clause of choose-branch
, which complains if the procedure finds
something other than a zero or a one in the input data.
In our representation of trees, each non-leaf node contains a set of symbols, which we have represented as a simple list. However, the tree-generating algorithm discussed above requires that we also work with sets of leaves and trees, successively merging the two smallest items. Since we will be required to repeatedly find the smallest item in a set, it is convenient to use an ordered representation for this kind of set.
We will represent a set of leaves and trees as a list of elements, arranged in
increasing order of weight. The following adjoin-set
procedure for
constructing sets is similar to the one described in Exercise 2-61;
however, items are compared by their weights, and the element being added to
the set is never already in it.
(define (adjoin-set x set) (cond ((null? set) (list x)) ((< (weight x) (weight (car set))) (cons x set)) (else (cons (car set) (adjoin-set x (cdr set))))))
The following procedure takes a list of symbol-frequency pairs such as
((A 4) (B 2) (C 1) (D 1))
and constructs an initial ordered set of
leaves, ready to be merged according to the Huffman algorithm:
(define (make-leaf-set pairs) (if (null? pairs) '() (let ((pair (car pairs))) (adjoin-set (make-leaf (car pair) ; symbol (cadr pair)) ; frequency (make-leaf-set (cdr pairs))))))
Exercise 2.67: Define an encoding tree and a sample message:
(define sample-tree (make-code-tree (make-leaf 'A 4) (make-code-tree (make-leaf 'B 2) (make-code-tree (make-leaf 'D 1) (make-leaf 'C 1))))) (define sample-message '(0 1 1 0 0 1 0 1 0 1 1 1 0))Use the
decode
procedure to decode the message, and give the result.
Exercise 2.68: The
encode
procedure takes as arguments a message and a tree and produces the list of bits that gives the encoded message.(define (encode message tree) (if (null? message) '() (append (encode-symbol (car message) tree) (encode (cdr message) tree))))
Encode-symbol
is a procedure, which you must write, that returns the list of bits that encodes a given symbol according to a given tree. You should designencode-symbol
so that it signals an error if the symbol is not in the tree at all. Test your procedure by encoding the result you obtained in Exercise 2-67 with the sample tree and seeing whether it is the same as the original sample message.
Exercise 2.69: The following procedure takes as its argument a list of symbol-frequency pairs (where no symbol appears in more than one pair) and generates a Huffman encoding tree according to the Huffman algorithm.
(define (generate-huffman-tree pairs) (successive-merge (make-leaf-set pairs)))
Make-leaf-set
is the procedure given above that transforms the list of pairs into an ordered set of leaves.Successive-merge
is the procedure you must write, usingmake-code-tree
to successively merge the smallest-weight elements of the set until there is only one element left, which is the desired Huffman tree. (This procedure is slightly tricky, but not really complicated. If you find yourself designing a complex procedure, then you are almost certainly doing something wrong. You can take significant advantage of the fact that we are using an ordered set representation.)
Exercise 2.70: The following eight-symbol alphabet with associated relative frequencies was designed to efficiently encode the lyrics of 1950s rock songs. (Note that the “symbols” of an “alphabet” need not be individual letters.)
A 2 NA 16 BOOM 1 SHA 3 GET 2 YIP 9 JOB 2 WAH 1Use
generate-huffman-tree
(Exercise 2-69) to generate a corresponding Huffman tree, and useencode
(Exercise 2-68) to encode the following message:Get a job Sha na na na na na na na na Get a job Sha na na na na na na na na Wah yip yip yip yip yip yip yip yip yip Sha boomHow many bits are required for the encoding? What is the smallest number of bits that would be needed to encode this song if we used a fixed-length code for the eight-symbol alphabet?
Exercise 2.71: Suppose we have a Huffman tree for an alphabet of n symbols, and that the relative frequencies of the symbols are 1, 2, 4, …, 2^(n-1). Sketch the tree for n=5; for n=10. In such a tree (for general n) how may bits are required to encode the most frequent symbol? the least frequent symbol?
Exercise 2.72: Consider the encoding procedure that you designed in Exercise 2-68. What is the order of growth in the number of steps needed to encode a symbol? Be sure to include the number of steps needed to search the symbol list at each node encountered. To answer this question in general is difficult. Consider the special case where the relative frequencies of the n symbols are as described in Exercise 2-71, and give the order of growth (as a function of n) of the number of steps needed to encode the most frequent and least frequent symbols in the alphabet.
[ << ] | [ < ] | [ Up ] | [ > ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
We have introduced data abstraction, a methodology for structuring systems in
such a way that much of a program can be specified independent of the choices
involved in implementing the data objects that the program manipulates. For
example, we saw in section Example: Arithmetic Operations for Rational Numbers how to separate the task of designing a
program that uses rational numbers from the task of implementing rational
numbers in terms of the computer language’s primitive mechanisms for
constructing compound data. The key idea was to erect an abstraction barrier
– in this case, the selectors and constructors for rational numbers
(make-rat
, numer
, denom
)—that isolates the way rational
numbers are used from their underlying representation in terms of list
structure. A similar abstraction barrier isolates the details of the
procedures that perform rational arithmetic (add-rat
, sub-rat
,
mul-rat
, and div-rat
) from the “higher-level” procedures that
use rational numbers. The resulting program has the structure shown in
Figure 2-1.
These data-abstraction barriers are powerful tools for controlling complexity. By isolating the underlying representations of data objects, we can divide the task of designing a large program into smaller tasks that can be performed separately. But this kind of data abstraction is not yet powerful enough, because it may not always make sense to speak of “the underlying representation” for a data object.
For one thing, there might be more than one useful representation for a data object, and we might like to design systems that can deal with multiple representations. To take a simple example, complex numbers may be represented in two almost equivalent ways: in rectangular form (real and imaginary parts) and in polar form (magnitude and angle). Sometimes rectangular form is more appropriate and sometimes polar form is more appropriate. Indeed, it is perfectly plausible to imagine a system in which complex numbers are represented in both ways, and in which the procedures for manipulating complex numbers work with either representation.
More importantly, programming systems are often designed by many people working over extended periods of time, subject to requirements that change over time. In such an environment, it is simply not possible for everyone to agree in advance on choices of data representation. So in addition to the data-abstraction barriers that isolate representation from use, we need abstraction barriers that isolate different design choices from each other and permit different choices to coexist in a single program. Furthermore, since large programs are often created by combining pre-existing modules that were designed in isolation, we need conventions that permit programmers to incorporate modules into larger systems additively, that is, without having to redesign or reimplement these modules.
In this section, we will learn how to cope with data that may be represented in different ways by different parts of a program. This requires constructing generic procedures—procedures that can operate on data that may be represented in more than one way. Our main technique for building generic procedures will be to work in terms of data objects that have tags type tags, that is, data objects that include explicit information about how they are to be processed. We will also discuss data-directed programming, a powerful and convenient implementation strategy for additively assembling systems with generic operations.
We begin with the simple complex-number example. We will see how type tags and
data-directed style enable us to design separate rectangular and polar
representations for complex numbers while maintaining the notion of an abstract
“complex-number” data object. We will accomplish this by defining arithmetic
procedures for complex numbers (add-complex
, sub-complex
,
mul-complex
, and div-complex
) in terms of generic selectors that
access parts of a complex number independent of how the number is represented.
The resulting complex-number system, as shown in Figure 2-19, contains
two different kinds of abstraction barriers. The “horizontal” abstraction
barriers play the same role as the ones in Figure 2-1. They isolate
“higher-level” operations from “lower-level” representations. In addition,
there is a “vertical” barrier that gives us the ability to separately design
and install alternative representations.
Figure 2.19: Data-abstraction barriers in the complex-number system.
Programs that use complex numbers +-------------------------------------------------+ --| add-complex sub-complex mul-complex div-complex |-- +-------------------------------------------------+ Complex arithmetic package ---------------------------+--------------------------- Rectangular | Polar representation | representation ---------------------------+--------------------------- List structure and primitive machine arithmetic
In section Systems with Generic Operations we will show how to use type tags and data-directed style
to develop a generic arithmetic package. This provides procedures (add
,
mul
, and so on) that can be used to manipulate all sorts of “numbers”
and can be easily extended when a new kind of number is needed. In section
Example: Symbolic Algebra, we’ll show how to use generic arithmetic in a system that performs
symbolic algebra.
2.4.1 Representations for Complex Numbers | ||
2.4.2 Tagged data | ||
2.4.3 Data-Directed Programming and Additivity |
[ << ] | [ < ] | [ Up ] | [ > ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
We will develop a system that performs arithmetic operations on complex numbers as a simple but unrealistic example of a program that uses generic operations. We begin by discussing two plausible representations for complex numbers as ordered pairs: rectangular form (real part and imaginary part) and polar form (magnitude and angle).(109) Section Tagged data will show how both representations can be made to coexist in a single system through the use of type tags and generic operations.
Like rational numbers, complex numbers are naturally represented as ordered pairs. The set of complex numbers can be thought of as a two-dimensional space with two orthogonal axes, the “real” axis and the “imaginary” axis. (See Figure 2-20.) From this point of view, the complex number z = x + iy (where i^2 = - 1) can be thought of as the point in the plane whose real coordinate is x and whose imaginary coordinate is y. Addition of complex numbers reduces in this representation to addition of coordinates:
Real-part(z_1 + z_2) = Real-part(z_1) + Real-part(z_2) Imaginary-part(z_1 + z_2) = Imaginary-part(z_1) + Imaginary-part(z_2)
When multiplying complex numbers, it is more natural to think in terms of representing a complex number in polar form, as a magnitude and an angle (r and A in Figure 2-20). The product of two complex numbers is the vector obtained by stretching one complex number by the length of the other and then rotating it through the angle of the other:
Magnitude(z_1 * z_2) = Magnitude(z_1) * Magnitude(z_2) Angle(z_1 * z_2) = Angle(z_1) + Angle(z_2)
Figure 2.20: Complex numbers as points in the plane.
Imaginary ^ | y |.........................* z = x + ?y = r e^(?A) | __-- . | __-- . | r __-- . | __-- . | __-- \ . |__-- A | . ----+----------+-------------------> Real x
Thus, there are two different representations for complex numbers, which are appropriate for different operations. Yet, from the viewpoint of someone writing a program that uses complex numbers, the principle of data abstraction suggests that all the operations for manipulating complex numbers should be available regardless of which representation is used by the computer. For example, it is often useful to be able to find the magnitude of a complex number that is specified by rectangular coordinates. Similarly, it is often useful to be able to determine the real part of a complex number that is specified by polar coordinates.
To design such a system, we can follow the same data-abstraction strategy we
followed in designing the rational-number package in section Example: Arithmetic Operations for Rational Numbers.
Assume that the operations on complex numbers are implemented in terms of four
selectors: real-part
, imag-part
, magnitude
, and
angle
. Also assume that we have two procedures for constructing complex
numbers: make-from-real-imag
returns a complex number with specified
real and imaginary parts, and make-from-mag-ang
returns a complex number
with specified magnitude and angle. These procedures have the property that,
for any complex number z
, both
(make-from-real-imag (real-part z) (imag-part z))
and
(make-from-mag-ang (magnitude z) (angle z))
produce complex numbers that are equal to z
.
Using these constructors and selectors, we can implement arithmetic on complex numbers using the “abstract data” specified by the constructors and selectors, just as we did for rational numbers in section Example: Arithmetic Operations for Rational Numbers. As shown in the formulas above, we can add and subtract complex numbers in terms of real and imaginary parts while multiplying and dividing complex numbers in terms of magnitudes and angles:
(define (add-complex z1 z2) (make-from-real-imag (+ (real-part z1) (real-part z2)) (+ (imag-part z1) (imag-part z2)))) (define (sub-complex z1 z2) (make-from-real-imag (- (real-part z1) (real-part z2)) (- (imag-part z1) (imag-part z2)))) (define (mul-complex z1 z2) (make-from-mag-ang (* (magnitude z1) (magnitude z2)) (+ (angle z1) (angle z2)))) (define (div-complex z1 z2) (make-from-mag-ang (/ (magnitude z1) (magnitude z2)) (- (angle z1) (angle z2))))
To complete the complex-number package, we must choose a representation and we must implement the constructors and selectors in terms of primitive numbers and primitive list structure. There are two obvious ways to do this: We can represent a complex number in “rectangular form” as a pair (real part, imaginary part) or in “polar form” as a pair (magnitude, angle). Which shall we choose?
In order to make the different choices concrete, imagine that there are two programmers, Ben Bitdiddle and Alyssa P. Hacker, who are independently designing representations for the complex-number system. Ben chooses to represent complex numbers in rectangular form. With this choice, selecting the real and imaginary parts of a complex number is straightforward, as is constructing a complex number with given real and imaginary parts. To find the magnitude and the angle, or to construct a complex number with a given magnitude and angle, he uses the trigonometric relations
__________ x = r cos A r = ./ x^2 + y^2 y = r sin A A = arctan(y,x)
which relate the real and imaginary parts (x, y) to the magnitude and the angle (r, A).(110) Ben’s representation is therefore given by the following selectors and constructors:
(define (real-part z) (car z)) (define (imag-part z) (cdr z)) (define (magnitude z) (sqrt (+ (square (real-part z)) (square (imag-part z))))) (define (angle z) (atan (imag-part z) (real-part z))) (define (make-from-real-imag x y) (cons x y)) (define (make-from-mag-ang r a) (cons (* r (cos a)) (* r (sin a))))
Alyssa, in contrast, chooses to represent complex numbers in polar form. For her, selecting the magnitude and angle is straightforward, but she has to use the trigonometric relations to obtain the real and imaginary parts. Alyssa’s representation is:
(define (real-part z) (* (magnitude z) (cos (angle z)))) (define (imag-part z) (* (magnitude z) (sin (angle z)))) (define (magnitude z) (car z)) (define (angle z) (cdr z)) (define (make-from-real-imag x y) (cons (sqrt (+ (square x) (square y))) (atan y x))) (define (make-from-mag-ang r a) (cons r a))
The discipline of data abstraction ensures that the same implementation of
add-complex
, sub-complex
, mul-complex
, and
div-complex
will work with either Ben’s representation or Alyssa’s
representation.
[ << ] | [ < ] | [ Up ] | [ > ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
One way to view data abstraction is as an application of the “principle of least commitment.” In implementing the complex-number system in section Representations for Complex Numbers, we can use either Ben’s rectangular representation or Alyssa’s polar representation. The abstraction barrier formed by the selectors and constructors permits us to defer to the last possible moment the choice of a concrete representation for our data objects and thus retain maximum flexibility in our system design.
The principle of least commitment can be carried to even further extremes. If
we desire, we can maintain the ambiguity of representation even after we
have designed the selectors and constructors, and elect to use both Ben’s
representation and Alyssa’s representation. If both representations are
included in a single system, however, we will need some way to distinguish data
in polar form from data in rectangular form. Otherwise, if we were asked, for
instance, to find the magnitude
of the pair (3,4), we wouldn’t know
whether to answer 5 (interpreting the number in rectangular form) or 3
(interpreting the number in polar form). A straightforward way to accomplish
this distinction is to include a
type tag—the symbol
rectangular
or polar
—as part of each complex number. Then
when we need to manipulate a complex number we can use the tag to decide which
selector to apply.
In order to manipulate tagged data, we will assume that we have procedures
type-tag
and contents
that extract from a data object the tag and
the actual contents (the polar or rectangular coordinates, in the case of a
complex number). We will also postulate a procedure attach-tag
that
takes a tag and contents and produces a tagged data object. A straightforward
way to implement this is to use ordinary list structure:
(define (attach-tag type-tag contents) (cons type-tag contents)) (define (type-tag datum) (if (pair? datum) (car datum) (error "Bad tagged datum -- TYPE-TAG" datum))) (define (contents datum) (if (pair? datum) (cdr datum) (error "Bad tagged datum -- CONTENTS" datum)))
Using these procedures, we can define predicates rectangular?
and
polar?
, which recognize polar and rectangular numbers, respectively:
(define (rectangular? z) (eq? (type-tag z) 'rectangular)) (define (polar? z) (eq? (type-tag z) 'polar))
With type tags, Ben and Alyssa can now modify their code so that their two
different representations can coexist in the same system. Whenever Ben
constructs a complex number, he tags it as rectangular. Whenever Alyssa
constructs a complex number, she tags it as polar. In addition, Ben and Alyssa
must make sure that the names of their procedures do not conflict. One way to
do this is for Ben to append the suffix rectangular
to the name of each
of his representation procedures and for Alyssa to append polar
to the
names of hers. Here is Ben’s revised rectangular representation from section
Representations for Complex Numbers:
(define (real-part-rectangular z) (car z)) (define (imag-part-rectangular z) (cdr z)) (define (magnitude-rectangular z) (sqrt (+ (square (real-part-rectangular z)) (square (imag-part-rectangular z))))) (define (angle-rectangular z) (atan (imag-part-rectangular z) (real-part-rectangular z))) (define (make-from-real-imag-rectangular x y) (attach-tag 'rectangular (cons x y))) (define (make-from-mag-ang-rectangular r a) (attach-tag 'rectangular (cons (* r (cos a)) (* r (sin a)))))
and here is Alyssa’s revised polar representation:
(define (real-part-polar z) (* (magnitude-polar z) (cos (angle-polar z)))) (define (imag-part-polar z) (* (magnitude-polar z) (sin (angle-polar z)))) (define (magnitude-polar z) (car z)) (define (angle-polar z) (cdr z)) (define (make-from-real-imag-polar x y) (attach-tag 'polar (cons (sqrt (+ (square x) (square y))) (atan y x)))) (define (make-from-mag-ang-polar r a) (attach-tag 'polar (cons r a)))
Each generic selector is implemented as a procedure that checks the tag of its
argument and calls the appropriate procedure for handling data of that type.
For example, to obtain the real part of a complex number, real-part
examines the tag to determine whether to use Ben’s real-part-rectangular
or Alyssa’s real-part-polar
. In either case, we use contents
to
extract the bare, untagged datum and send this to the rectangular or polar
procedure as required:
(define (real-part z) (cond ((rectangular? z) (real-part-rectangular (contents z))) ((polar? z) (real-part-polar (contents z))) (else (error "Unknown type -- REAL-PART" z)))) (define (imag-part z) (cond ((rectangular? z) (imag-part-rectangular (contents z))) ((polar? z) (imag-part-polar (contents z))) (else (error "Unknown type -- IMAG-PART" z)))) (define (magnitude z) (cond ((rectangular? z) (magnitude-rectangular (contents z))) ((polar? z) (magnitude-polar (contents z))) (else (error "Unknown type -- MAGNITUDE" z)))) (define (angle z) (cond ((rectangular? z) (angle-rectangular (contents z))) ((polar? z) (angle-polar (contents z))) (else (error "Unknown type -- ANGLE" z))))
To implement the complex-number arithmetic operations, we can use the same
procedures add-complex
, sub-complex
, mul-complex
, and
div-complex
from section Representations for Complex Numbers, because the selectors they call
are generic, and so will work with either representation. For example, the
procedure add-complex
is still
(define (add-complex z1 z2) (make-from-real-imag (+ (real-part z1) (real-part z2)) (+ (imag-part z1) (imag-part z2))))
Finally, we must choose whether to construct complex numbers using Ben’s representation or Alyssa’s representation. One reasonable choice is to construct rectangular numbers whenever we have real and imaginary parts and to construct polar numbers whenever we have magnitudes and angles:
(define (make-from-real-imag x y) (make-from-real-imag-rectangular x y)) (define (make-from-mag-ang r a) (make-from-mag-ang-polar r a))
Figure 2.21: Structure of the generic complex-arithmetic system.
+--------------------------------------------------+ ----| add-complex sub-complex mul-complex- div-complex |---- +--------------------------------------------------+ Complex arithmetic package +-----------------------+ | real-part imag-part | -----------------| |------------------ | magnitude angle | +-----------+-----------+ Rectangular | Polar representation | representation -----------------------------+------------------------------ List structure and primitive machine arithmetic
The resulting complex-number system has the structure shown in Figure 2-21. The system has been decomposed into three relatively independent parts: the complex-number-arithmetic operations, Alyssa’s polar implementation, and Ben’s rectangular implementation. The polar and rectangular implementations could have been written by Ben and Alyssa working separately, and both of these can be used as underlying representations by a third programmer implementing the complex-arithmetic procedures in terms of the abstract constructor/selector interface.
Since each data object is tagged with its type, the selectors operate on the
data in a generic manner. That is, each selector is defined to have a behavior
that depends upon the particular type of data it is applied to. Notice the
general mechanism for interfacing the separate representations: Within a given
representation implementation (say, Alyssa’s polar package) a complex number is
an untyped pair (magnitude, angle). When a generic selector operates on a
number of polar
type, it strips off the tag and passes the contents on
to Alyssa’s code. Conversely, when Alyssa constructs a number for general use,
she tags it with a type so that it can be appropriately recognized by the
higher-level procedures. This discipline of stripping off and attaching tags
as data objects are passed from level to level can be an important
organizational strategy, as we shall see in section Systems with Generic Operations.
[ << ] | [ < ] | [ Up ] | [ > ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
The general strategy of checking the type of a datum and calling an appropriate
procedure is called
dispatching on type. This is a powerful strategy
for obtaining modularity in system design. Oh the other hand, implementing the
dispatch as in section Tagged data has two significant weaknesses. One
weakness is that the generic interface procedures (real-part
,
imag-part
, magnitude
, and angle
) must know about all the
different representations. For instance, suppose we wanted to incorporate a
new representation for complex numbers into our complex-number system. We
would need to identify this new representation with a type, and then add a
clause to each of the generic interface procedures to check for the new type
and apply the appropriate selector for that representation.
Another weakness of the technique is that even though the individual representations can be designed separately, we must guarantee that no two procedures in the entire system have the same name. This is why Ben and Alyssa had to change the names of their original procedures from section Representations for Complex Numbers.
The issue underlying both of these weaknesses is that the technique for implementing generic interfaces is not additive. The person implementing the generic selector procedures must modify those procedures each time a new representation is installed, and the people interfacing the individual representations must modify their code to avoid name conflicts. In each of these cases, the changes that must be made to the code are straightforward, but they must be made nonetheless, and this is a source of inconvenience and error. This is not much of a problem for the complex-number system as it stands, but suppose there were not two but hundreds of different representations for complex numbers. And suppose that there were many generic selectors to be maintained in the abstract-data interface. Suppose, in fact, that no one programmer knew all the interface procedures or all the representations. The problem is real and must be addressed in such programs as large-scale data-base-management systems.
What we need is a means for modularizing the system design even further. This is provided by the programming technique known as programming data-directed programming. To understand how data-directed programming works, begin with the observation that whenever we deal with a set of generic operations that are common to a set of different types we are, in effect, dealing with a two-dimensional table that contains the possible operations on one axis and the possible types on the other axis. The entries in the table are the procedures that implement each operation for each type of argument presented. In the complex-number system developed in the previous section, the correspondence between operation name, data type, and actual procedure was spread out among the various conditional clauses in the generic interface procedures. But the same information could have been organized in a table, as shown in Figure 2-22.
Data-directed programming is the technique of designing programs to work with such a table directly. Previously, we implemented the mechanism that interfaces the complex-arithmetic code with the two representation packages as a set of procedures that each perform an explicit dispatch on type. Here we will implement the interface as a single procedure that looks up the combination of the operation name and argument type in the table to find the correct procedure to apply, and then applies it to the contents of the argument. If we do this, then to add a new representation package to the system we need not change any existing procedures; we need only add new entries to the table.
Figure 2.22: Table of operations for the complex-number system.
| Types Operations | Polar | Rectangular ===========+=================+====================== real-part | real-part-polar | real-part-rectangular imag-part | imag-part-polar | imag-part-rectangular magnitude | magnitude-polar | magnitude-rectangular angle | angle-polar | angle-rectangular
To implement this plan, assume that we have two procedures, put
and
get
, for manipulating the operation-and-type table:
(put <op> <type> <item>)
installs
the <item>
in the table, indexed by the
<op>
and the <type>
.
(get <op> <type>)
looks up the
<op>
, <type>
entry in the table and
returns the item found there. If no item is found, get
returns false.
For now, we can assume that put
and get
are included in our
language. In Modularity, Objects, and State (section Representing Tables, Exercise 3-24) we
will see how to implement these and other operations for manipulating tables.
Here is how data-directed programming can be used in the complex-number system. Ben, who developed the rectangular representation, implements his code just as he did originally. He defines a collection of procedures, or a package, and interfaces these to the rest of the system by adding entries to the table that tell the system how to operate on rectangular numbers. This is accomplished by calling the following procedure:
(define (install-rectangular-package) ;; internal procedures (define (real-part z) (car z)) (define (imag-part z) (cdr z)) (define (make-from-real-imag x y) (cons x y)) (define (magnitude z) (sqrt (+ (square (real-part z)) (square (imag-part z))))) (define (angle z) (atan (imag-part z) (real-part z))) (define (make-from-mag-ang r a) (cons (* r (cos a)) (* r (sin a)))) ;; interface to the rest of the system (define (tag x) (attach-tag 'rectangular x)) (put 'real-part '(rectangular) real-part) (put 'imag-part '(rectangular) imag-part) (put 'magnitude '(rectangular) magnitude) (put 'angle '(rectangular) angle) (put 'make-from-real-imag 'rectangular (lambda (x y) (tag (make-from-real-imag x y)))) (put 'make-from-mag-ang 'rectangular (lambda (r a) (tag (make-from-mag-ang r a)))) 'done)
Notice that the internal procedures here are the same procedures from section
Representations for Complex Numbers that Ben wrote when he was working in isolation. No changes are
necessary in order to interface them to the rest of the system. Moreover,
since these procedure definitions are internal to the installation procedure,
Ben needn’t worry about name conflicts with other procedures outside the
rectangular package. To interface these to the rest of the system, Ben
installs his real-part
procedure under the operation name
real-part
and the type (rectangular)
, and similarly for the other
selectors.(111) The interface also defines the
constructors to be used by the external system.(112) These are identical to
Ben’s internally defined constructors, except that they attach the tag.
Alyssa’s polar package is analogous:
(define (install-polar-package) ;; internal procedures (define (magnitude z) (car z)) (define (angle z) (cdr z)) (define (make-from-mag-ang r a) (cons r a)) (define (real-part z) (* (magnitude z) (cos (angle z)))) (define (imag-part z) (* (magnitude z) (sin (angle z)))) (define (make-from-real-imag x y) (cons (sqrt (+ (square x) (square y))) (atan y x))) ;; interface to the rest of the system (define (tag x) (attach-tag 'polar x)) (put 'real-part '(polar) real-part) (put 'imag-part '(polar) imag-part) (put 'magnitude '(polar) magnitude) (put 'angle '(polar) angle) (put 'make-from-real-imag 'polar (lambda (x y) (tag (make-from-real-imag x y)))) (put 'make-from-mag-ang 'polar (lambda (r a) (tag (make-from-mag-ang r a)))) 'done)
Even though Ben and Alyssa both still use their original procedures defined
with the same names as each other’s (e.g., real-part
), these definitions
are now internal to different procedures (see section Procedures as Black-Box Abstractions), so there is
no name conflict.
The complex-arithmetic selectors access the table by means of a general
“operation” procedure called apply-generic
, which applies a generic
operation to some arguments. Apply-generic
looks in the table under the
name of the operation and the types of the arguments and applies the resulting
procedure if one is present:(113)
(define (apply-generic op . args) (let ((type-tags (map type-tag args))) (let ((proc (get op type-tags))) (if proc (apply proc (map contents args)) (error "No method for these types -- APPLY-GENERIC" (list op type-tags))))))
Using apply-generic
, we can define our generic selectors as follows:
(define (real-part z) (apply-generic 'real-part z)) (define (imag-part z) (apply-generic 'imag-part z)) (define (magnitude z) (apply-generic 'magnitude z)) (define (angle z) (apply-generic 'angle z))
Observe that these do not change at all if a new representation is added to the system.
We can also extract from the table the constructors to be used by the programs external to the packages in making complex numbers from real and imaginary parts and from magnitudes and angles. As in section Tagged data, we construct rectangular numbers whenever we have real and imaginary parts, and polar numbers whenever we have magnitudes and angles:
(define (make-from-real-imag x y) ((get 'make-from-real-imag 'rectangular) x y)) (define (make-from-mag-ang r a) ((get 'make-from-mag-ang 'polar) r a))
Exercise 2.73: Section Example: Symbolic Differentiation described a program that performs symbolic differentiation:
(define (deriv exp var) (cond ((number? exp) 0) ((variable? exp) (if (same-variable? exp var) 1 0)) ((sum? exp) (make-sum (deriv (addend exp) var) (deriv (augend exp) var))) ((product? exp) (make-sum (make-product (multiplier exp) (deriv (multiplicand exp) var)) (make-product (deriv (multiplier exp) var) (multiplicand exp)))) <more rules can be added here> (else (error "unknown expression type -- DERIV" exp))))We can regard this program as performing a dispatch on the type of the expression to be differentiated. In this situation the “type tag” of the datum is the algebraic operator symbol (such as
+
) and the operation being performed isderiv
. We can transform this program into data-directed style by rewriting the basic derivative procedure as(define (deriv exp var) (cond ((number? exp) 0) ((variable? exp) (if (same-variable? exp var) 1 0)) (else ((get 'deriv (operator exp)) (operands exp) var)))) (define (operator exp) (car exp)) (define (operands exp) (cdr exp))
- Explain what was done above. Why can’t we assimilate the predicates
number?
andsame-variable?
into the data-directed dispatch?- Write the procedures for derivatives of sums and products, and the auxiliary code required to install them in the table used by the program above.
- Choose any additional differentiation rule that you like, such as the one for exponents (Exercise 2-56), and install it in this data-directed system.
- In this simple algebraic manipulator the type of an expression is the algebraic operator that binds it together. Suppose, however, we indexed the procedures in the opposite way, so that the dispatch line in
deriv
looked like((get (operator exp) 'deriv) (operands exp) var)What corresponding changes to the derivative system are required?
Exercise 2.74: Insatiable Enterprises, Inc., is a highly decentralized conglomerate company consisting of a large number of independent divisions located all over the world. The company’s computer facilities have just been interconnected by means of a clever network-interfacing scheme that makes the entire network appear to any user to be a single computer. Insatiable’s president, in her first attempt to exploit the ability of the network to extract administrative information from division files, is dismayed to discover that, although all the division files have been implemented as data structures in Scheme, the particular data structure used varies from division to division. A meeting of division managers is hastily called to search for a strategy to integrate the files that will satisfy headquarters’ needs while preserving the existing autonomy of the divisions.
Show how such a strategy can be implemented with data-directed programming. As an example, suppose that each division’s personnel records consist of a single file, which contains a set of records keyed on employees’ names. The structure of the set varies from division to division. Furthermore, each employee’s record is itself a set (structured differently from division to division) that contains information keyed under identifiers such as
address
andsalary
. In particular:
- Implement for headquarters a
get-record
procedure that retrieves a specified employee’s record from a specified personnel file. The procedure should be applicable to any division’s file. Explain how the individual divisions’ files should be structured. In particular, what type information must be supplied?- Implement for headquarters a
get-salary
procedure that returns the salary information from a given employee’s record from any division’s personnel file. How should the record be structured in order to make this operation work?- Implement for headquarters a
find-employee-record
procedure. This should search all the divisions’ files for the record of a given employee and return the record. Assume that this procedure takes as arguments an employee’s name and a list of all the divisions’ files.- When Insatiable takes over a new company, what changes must be made in order to incorporate the new personnel information into the central system?
The key idea of data-directed programming is to handle generic operations in programs by dealing explicitly with operation-and-type tables, such as the table in Figure 2-22. The style of programming we used in section Tagged data organized the required dispatching on type by having each operation take care of its own dispatching. In effect, this decomposes the operation-and-type table into rows, with each generic operation procedure representing a row of the table.
An alternative implementation strategy is to decompose the table into columns
and, instead of using “intelligent operations” that dispatch on data types,
to work with “intelligent data objects” that dispatch on operation names. We
can do this by arranging things so that a data object, such as a rectangular
number, is represented as a procedure that takes as input the required
operation name and performs the operation indicated. In such a discipline,
make-from-real-imag
could be written as
(define (make-from-real-imag x y) (define (dispatch op) (cond ((eq? op 'real-part) x) ((eq? op 'imag-part) y) ((eq? op 'magnitude) (sqrt (+ (square x) (square y)))) ((eq? op 'angle) (atan y x)) (else (error "Unknown op -- MAKE-FROM-REAL-IMAG" op)))) dispatch)
The corresponding apply-generic
procedure, which applies a generic
operation to an argument, now simply feeds the operation’s name to the data
object and lets the object do the work:(114)
(define (apply-generic op arg) (arg op))
Note that the value returned by make-from-real-imag
is a procedure—the
internal dispatch
procedure. This is the procedure that is invoked when
apply-generic
requests an operation to be performed.
This style of programming is called
message passing. The name comes
from the image that a data object is an entity that receives the requested
operation name as a “message.” We have already seen an example of message
passing in section What Is Meant by Data?, where we saw how cons
, car
, and
cdr
could be defined with no data objects but only procedures. Here we
see that message passing is not a mathematical trick but a useful technique for
organizing systems with generic operations. In the remainder of this chapter
we will continue to use data-directed programming, rather than message passing,
to discuss generic arithmetic operations. In Modularity, Objects, and State we will return to
message passing, and we will see that it can be a powerful tool for structuring
simulation programs.
Exercise 2.75: Implement the constructor
make-from-mag-ang
in message-passing style. This procedure should be analogous to themake-from-real-imag
procedure given above.
Exercise 2.76: As a large system with generic operations evolves, new types of data objects or new operations may be needed. For each of the three strategies—generic operations with explicit dispatch, data-directed style, and message-passing-style—describe the changes that must be made to a system in order to add new types or new operations. Which organization would be most appropriate for a system in which new types must often be added? Which would be most appropriate for a system in which new operations must often be added?
[ << ] | [ < ] | [ Up ] | [ > ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
In the previous section, we saw how to design systems in which data objects can
be represented in more than one way. The key idea is to link the code that
specifies the data operations to the several representations by means of
generic interface procedures. Now we will see how to use this same idea not
only to define operations that are generic over different representations but
also to define operations that are generic over different kinds of arguments.
We have already seen several different packages of arithmetic operations: the
primitive arithmetic (+
, -
, *
, /
) built into our
language, the rational-number arithmetic (add-rat
, sub-rat
,
mul-rat
, div-rat
) of section Example: Arithmetic Operations for Rational Numbers, and the complex-number
arithmetic that we implemented in section Data-Directed Programming and Additivity. We will now use
data-directed techniques to construct a package of arithmetic operations that
incorporates all the arithmetic packages we have already constructed.
Figure 2-23 shows the structure of the system we shall build. Notice the
abstraction barriers. From the perspective of someone using “numbers,” there
is a single procedure add
that operates on whatever numbers are
supplied. Add
is part of a generic interface that allows the separate
ordinary-arithmetic, rational-arithmetic, and complex-arithmetic packages to be
accessed uniformly by programs that use numbers. Any individual arithmetic
package (such as the complex package) may itself be accessed through generic
procedures (such as add-complex
) that combine packages designed for
different representations (such as rectangular and polar). Moreover, the
structure of the system is additive, so that one can design the individual
arithmetic packages separately and combine them to produce a generic arithmetic
system.
Figure 2.23: Generic arithmetic system.
Programs that use numbers +-----------------+ ---------------------------| add sub mul div |------------------- +-----------------+ Generic arithmetic package +-----------------+ +-------------------------+ | add-rat sub-rat | | add-complex sub-complex | +---------+ -| |-+-| |-+-| + - * / |- | mul-rat div-rat | | | mul-complex div-complex | | +---------+ +-----------------+ | +-------------------------+ | Rational | Complex artithmetic | Ordinary arithmetic +--------------+--------------+ arithmetic | Rectangular | Polar | ---------------------+--------------+--------------+-------------
2.5.1 Generic Arithmetic Operations | ||
2.5.2 Combining Data of Different Types | ||
2.5.3 Example: Symbolic Algebra |
[ << ] | [ < ] | [ Up ] | [ > ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
The task of designing generic arithmetic operations is analogous to that of
designing the generic complex-number operations. We would like, for instance,
to have a generic addition procedure add
that acts like ordinary
primitive addition +
on ordinary numbers, like add-rat
on
rational numbers, and like add-complex
on complex numbers. We can
implement add
, and the other generic arithmetic operations, by following
the same strategy we used in section Data-Directed Programming and Additivity to implement the generic
selectors for complex numbers. We will attach a type tag to each kind of
number and cause the generic procedure to dispatch to an appropriate package
according to the data type of its arguments.
The generic arithmetic procedures are defined as follows:
(define (add x y) (apply-generic 'add x y)) (define (sub x y) (apply-generic 'sub x y)) (define (mul x y) (apply-generic 'mul x y)) (define (div x y) (apply-generic 'div x y))
We begin by installing a package for handling
ordinary numbers, that
is, the primitive numbers of our language. We will tag these with the symbol
scheme-number
. The arithmetic operations in this package are the
primitive arithmetic procedures (so there is no need to define extra procedures
to handle the untagged numbers). Since these operations each take two
arguments, they are installed in the table keyed by the list
(scheme-number scheme-number)
:
(define (install-scheme-number-package) (define (tag x) (attach-tag 'scheme-number x)) (put 'add '(scheme-number scheme-number) (lambda (x y) (tag (+ x y)))) (put 'sub '(scheme-number scheme-number) (lambda (x y) (tag (- x y)))) (put 'mul '(scheme-number scheme-number) (lambda (x y) (tag (* x y)))) (put 'div '(scheme-number scheme-number) (lambda (x y) (tag (/ x y)))) (put 'make 'scheme-number (lambda (x) (tag x))) 'done)
Users of the Scheme-number package will create (tagged) ordinary numbers by means of the procedure:
(define (make-scheme-number n) ((get 'make 'scheme-number) n))
Now that the framework of the generic arithmetic system is in place, we can readily include new kinds of numbers. Here is a package that performs rational arithmetic. Notice that, as a benefit of additivity, we can use without modification the rational-number code from section Example: Arithmetic Operations for Rational Numbers as the internal procedures in the package:
(define (install-rational-package) ;; internal procedures (define (numer x) (car x)) (define (denom x) (cdr x)) (define (make-rat n d) (let ((g (gcd n d))) (cons (/ n g) (/ d g)))) (define (add-rat x y) (make-rat (+ (* (numer x) (denom y)) (* (numer y) (denom x))) (* (denom x) (denom y)))) (define (sub-rat x y) (make-rat (- (* (numer x) (denom y)) (* (numer y) (denom x))) (* (denom x) (denom y)))) (define (mul-rat x y) (make-rat (* (numer x) (numer y)) (* (denom x) (denom y)))) (define (div-rat x y) (make-rat (* (numer x) (denom y)) (* (denom x) (numer y)))) ;; interface to rest of the system (define (tag x) (attach-tag 'rational x)) (put 'add '(rational rational) (lambda (x y) (tag (add-rat x y)))) (put 'sub '(rational rational) (lambda (x y) (tag (sub-rat x y)))) (put 'mul '(rational rational) (lambda (x y) (tag (mul-rat x y)))) (put 'div '(rational rational) (lambda (x y) (tag (div-rat x y)))) (put 'make 'rational (lambda (n d) (tag (make-rat n d)))) 'done) (define (make-rational n d) ((get 'make 'rational) n d))
We can install a similar package to handle complex numbers, using the tag
complex
. In creating the package, we extract from the table the
operations make-from-real-imag
and make-from-mag-ang
that were
defined by the rectangular and polar packages. Additivity permits us to use,
as the internal operations, the same add-complex
, sub-complex
,
mul-complex
, and div-complex
procedures from section Representations for Complex Numbers.
(define (install-complex-package) ;; imported procedures from rectangular and polar packages (define (make-from-real-imag x y) ((get 'make-from-real-imag 'rectangular) x y)) (define (make-from-mag-ang r a) ((get 'make-from-mag-ang 'polar) r a)) ;; internal procedures (define (add-complex z1 z2) (make-from-real-imag (+ (real-part z1) (real-part z2)) (+ (imag-part z1) (imag-part z2)))) (define (sub-complex z1 z2) (make-from-real-imag (- (real-part z1) (real-part z2)) (- (imag-part z1) (imag-part z2)))) (define (mul-complex z1 z2) (make-from-mag-ang (* (magnitude z1) (magnitude z2)) (+ (angle z1) (angle z2)))) (define (div-complex z1 z2) (make-from-mag-ang (/ (magnitude z1) (magnitude z2)) (- (angle z1) (angle z2)))) ;; interface to rest of the system (define (tag z) (attach-tag 'complex z)) (put 'add '(complex complex) (lambda (z1 z2) (tag (add-complex z1 z2)))) (put 'sub '(complex complex) (lambda (z1 z2) (tag (sub-complex z1 z2)))) (put 'mul '(complex complex) (lambda (z1 z2) (tag (mul-complex z1 z2)))) (put 'div '(complex complex) (lambda (z1 z2) (tag (div-complex z1 z2)))) (put 'make-from-real-imag 'complex (lambda (x y) (tag (make-from-real-imag x y)))) (put 'make-from-mag-ang 'complex (lambda (r a) (tag (make-from-mag-ang r a)))) 'done)
Programs outside the complex-number package can construct complex numbers either from real and imaginary parts or from magnitudes and angles. Notice how the underlying procedures, originally defined in the rectangular and polar packages, are exported to the complex package, and exported from there to the outside world.
(define (make-complex-from-real-imag x y) ((get 'make-from-real-imag 'complex) x y)) (define (make-complex-from-mag-ang r a) ((get 'make-from-mag-ang 'complex) r a))
What we have here is a two-level tag system. A typical complex number, such as
3 + 4i in rectangular form, would be represented as shown in Figure 2-24. The outer tag (complex
) is used to direct the number to the
complex package. Once within the complex package, the next tag
(rectangular
) is used to direct the number to the rectangular package.
In a large and complicated system there might be many levels, each interfaced
with the next by means of generic operations. As a data object is passed
“downward,” the outer tag that is used to direct it to the appropriate
package is stripped off (by applying contents
) and the next level of tag
(if any) becomes visible to be used for further dispatching.
Figure 2.24: Representation of 3 + 4i in rectangular form.
+---+---+ +---+---+ +---+---+ ---->| * | *-+---->| * | *-+---->| * | * | +-|-+---+ +-|-+---+ +-|-+-|-+ | | | | V V V V +---------+ +-------------+ +---+ +---+ | complex | | rectangular | | 3 | | 4 | +---------+ +-------------+ +---+ +---+
In the above packages, we used add-rat
, add-complex
, and the
other arithmetic procedures exactly as originally written. Once these
definitions are internal to different installation procedures, however, they no
longer need names that are distinct from each other: we could simply name them
add
, sub
, mul
, and div
in both packages.
Exercise 2.77: Louis Reasoner tries to evaluate the expression
(magnitude z)
wherez
is the object shown in Figure 2-24. To his surprise, instead of the answer 5 he gets an error message fromapply-generic
, saying there is no method for the operationmagnitude
on the types(complex)
. He shows this interaction to Alyssa P. Hacker, who says “The problem is that the complex-number selectors were never defined forcomplex
numbers, just forpolar
andrectangular
numbers. All you have to do to make this work is add the following to thecomplex
package:”(put 'real-part '(complex) real-part) (put 'imag-part '(complex) imag-part) (put 'magnitude '(complex) magnitude) (put 'angle '(complex) angle)Describe in detail why this works. As an example, trace through all the procedures called in evaluating the expression
(magnitude z)
wherez
is the object shown in Figure 2-24. In particular, how many times isapply-generic
invoked? What procedure is dispatched to in each case?
Exercise 2.78: The internal procedures in the
scheme-number
package are essentially nothing more than calls to the primitive procedures+
,-
, etc. It was not possible to use the primitives of the language directly because our type-tag system requires that each data object have a type attached to it. In fact, however, all Lisp implementations do have a type system, which they use internally. Primitive predicates such assymbol?
andnumber?
determine whether data objects have particular types. Modify the definitions oftype-tag
,contents
, andattach-tag
from section Tagged data so that our generic system takes advantage of Scheme’s internal type system. That is to say, the system should work as before except that ordinary numbers should be represented simply as Scheme numbers rather than as pairs whosecar
is the symbolscheme-number
.
Exercise 2.79: Define a generic equality predicate
equ?
that tests the equality of two numbers, and install it in the generic arithmetic package. This operation should work for ordinary numbers, rational numbers, and complex numbers.
Exercise 2.80: Define a generic predicate
=zero?
that tests if its argument is zero, and install it in the generic arithmetic package. This operation should work for ordinary numbers, rational numbers, and complex numbers.
[ << ] | [ < ] | [ Up ] | [ > ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
We have seen how to define a unified arithmetic system that encompasses ordinary numbers, complex numbers, rational numbers, and any other type of number we might decide to invent, but we have ignored an important issue. The operations we have defined so far treat the different data types as being completely independent. Thus, there are separate packages for adding, say, two ordinary numbers, or two complex numbers. What we have not yet considered is the fact that it is meaningful to define operations that cross the type boundaries, such as the addition of a complex number to an ordinary number. We have gone to great pains to introduce barriers between parts of our programs so that they can be developed and understood separately. We would like to introduce the cross-type operations in some carefully controlled way, so that we can support them without seriously violating our module boundaries.
One way to handle cross-type operations is to design a different procedure for
each possible combination of types for which the operation is valid. For
example, we could extend the complex-number package so that it provides a
procedure for adding complex numbers to ordinary numbers and installs this in
the table using the tag (complex scheme-number)
:(115)
;; to be included in the complex package
(define (add-complex-to-schemenum z x)
(make-from-real-imag (+ (real-part z) x)
(imag-part z)))
(put 'add '(complex scheme-number)
(lambda (z x) (tag (add-complex-to-schemenum z x))))
This technique works, but it is cumbersome. With such a system, the cost of introducing a new type is not just the construction of the package of procedures for that type but also the construction and installation of the procedures that implement the cross-type operations. This can easily be much more code than is needed to define the operations on the type itself. The method also undermines our ability to combine separate packages additively, or least to limit the extent to which the implementors of the individual packages need to take account of other packages. For instance, in the example above, it seems reasonable that handling mixed operations on complex numbers and ordinary numbers should be the responsibility of the complex-number package. Combining rational numbers and complex numbers, however, might be done by the complex package, by the rational package, or by some third package that uses operations extracted from these two packages. Formulating coherent policies on the division of responsibility among packages can be an overwhelming task in designing systems with many packages and many cross-type operations.
In the general situation of completely unrelated operations acting on completely unrelated types, implementing explicit cross-type operations, cumbersome though it may be, is the best that one can hope for. Fortunately, we can usually do better by taking advantage of additional structure that may be latent in our type system. Often the different data types are not completely independent, and there may be ways by which objects of one type may be viewed as being of another type. This process is called coercion. For example, if we are asked to arithmetically combine an ordinary number with a complex number, we can view the ordinary number as a complex number whose imaginary part is zero. This transforms the problem to that of combining two complex numbers, which can be handled in the ordinary way by the complex-arithmetic package.
In general, we can implement this idea by designing coercion procedures that transform an object of one type into an equivalent object of another type. Here is a typical coercion procedure, which transforms a given ordinary number to a complex number with that real part and zero imaginary part:
(define (scheme-number->complex n) (make-complex-from-real-imag (contents n) 0))
We install these coercion procedures in a special coercion table, indexed under the names of the two types:
(put-coercion 'scheme-number 'complex scheme-number->complex)
(We assume that there are put-coercion
and get-coercion
procedures available for manipulating this table.) Generally some of the slots
in the table will be empty, because it is not generally possible to coerce an
arbitrary data object of each type into all other types. For example, there is
no way to coerce an arbitrary complex number to an ordinary number, so there
will be no general complex->scheme-number
procedure included in the
table.
Once the coercion table has been set up, we can handle coercion in a uniform
manner by modifying the apply-generic
procedure of section Data-Directed Programming and Additivity.
When asked to apply an operation, we first check whether the operation is
defined for the arguments’ types, just as before. If so, we dispatch to the
procedure found in the operation-and-type table. Otherwise, we try coercion.
For simplicity, we consider only the case where there are two
arguments.(116) We check the
coercion table to see if objects of the first type can be coerced to the second
type. If so, we coerce the first argument and try the operation again. If
objects of the first type cannot in general be coerced to the second type, we
try the coercion the other way around to see if there is a way to coerce the
second argument to the type of the first argument. Finally, if there is no
known way to coerce either type to the other type, we give up. Here is the
procedure:
(define (apply-generic op . args) (let ((type-tags (map type-tag args))) (let ((proc (get op type-tags))) (if proc (apply proc (map contents args)) (if (= (length args) 2) (let ((type1 (car type-tags)) (type2 (cadr type-tags)) (a1 (car args)) (a2 (cadr args))) (let ((t1->t2 (get-coercion type1 type2)) (t2->t1 (get-coercion type2 type1))) (cond (t1->t2 (apply-generic op (t1->t2 a1) a2)) (t2->t1 (apply-generic op a1 (t2->t1 a2))) (else (error "No method for these types" (list op type-tags)))))) (error "No method for these types" (list op type-tags)))))))
This coercion scheme has many advantages over the method of defining explicit cross-type operations, as outlined above. Although we still need to write coercion procedures to relate the types (possibly n^2 procedures for a system with n types), we need to write only one procedure for each pair of types rather than a different procedure for each collection of types and each generic operation.(117) What we are counting on here is the fact that the appropriate transformation between types depends only on the types themselves, not on the operation to be applied.
On the other hand, there may be applications for which our coercion scheme is not general enough. Even when neither of the objects to be combined can be converted to the type of the other it may still be possible to perform the operation by converting both objects to a third type. In order to deal with such complexity and still preserve modularity in our programs, it is usually necessary to build systems that take advantage of still further structure in the relations among types, as we discuss next.
The coercion scheme presented above relied on the existence of natural relations between pairs of types. Often there is more “global” structure in how the different types relate to each other. For instance, suppose we are building a generic arithmetic system to handle integers, rational numbers, real numbers, and complex numbers. In such a system, it is quite natural to regard an integer as a special kind of rational number, which is in turn a special kind of real number, which is in turn a special kind of complex number. What we actually have is a so-called hierarchy of types, in which, for example, integers are a subtype of rational numbers (i.e., any operation that can be applied to a rational number can automatically be applied to an integer). Conversely, we say that rational numbers form a supertype of integers. The particular hierarchy we have here is of a very simple kind, in which each type has at most one supertype and at most one subtype. Such a structure, called a tower, is illustrated in Figure 2-25.
Figure 2.25: A tower of types.
complex ^ | real ^ | rational ^ | integer
If we have a tower structure, then we can greatly simplify the problem of
adding a new type to the hierarchy, for we need only specify how the new type
is embedded in the next supertype above it and how it is the supertype of the
type below it. For example, if we want to add an integer to a complex number,
we need not explicitly define a special coercion procedure
integer->complex
. Instead, we define how an integer can be transformed
into a rational number, how a rational number is transformed into a real
number, and how a real number is transformed into a complex number. We then
allow the system to transform the integer into a complex number through these
steps and then add the two complex numbers.
We can redesign our apply-generic
procedure in the following way: For
each type, we need to supply a raise
procedure, which “raises” objects
of that type one level in the tower. Then when the system is required to
operate on objects of different types it can successively raise the lower types
until all the objects are at the same level in the tower. (Exercise 2-83
and Exercise 2-84 concern the details of implementing such a strategy.)
Another advantage of a tower is that we can easily implement the notion that
every type “inherits” all operations defined on a supertype. For instance,
if we do not supply a special procedure for finding the real part of an
integer, we should nevertheless expect that real-part
will be defined
for integers by virtue of the fact that integers are a subtype of complex
numbers. In a tower, we can arrange for this to happen in a uniform way by
modifying apply-generic
. If the required operation is not directly
defined for the type of the object given, we raise the object to its supertype
and try again. We thus crawl up the tower, transforming our argument as we go,
until we either find a level at which the desired operation can be performed or
hit the top (in which case we give up).
Yet another advantage of a tower over a more general hierarchy is that it gives us a simple way to “lower” a data object to the simplest representation. For example, if we add 2 + 3i to 4 - 3i, it would be nice to obtain the answer as the integer 6 rather than as the complex number 6 + 0i. Exercise 2-85 discusses a way to implement such a lowering operation. (The trick is that we need a general way to distinguish those objects that can be lowered, such as 6 + 0i, from those that cannot, such as 6 + 2i.)
Figure 2.26: Relations among types of geometric figures.
polygon / \ / \ triangle quadrilateral / \ / \ / \ / \ isosceles right trapezoid kite triangle triangle | | | \ | | | | \ | | | equilateral isosceles parallelogram | triangle right | \ | triangle | \ | rectangle rhombus \ / \ / square
If the data types in our system can be naturally arranged in a tower, this
greatly simplifies the problems of dealing with generic operations on different
types, as we have seen. Unfortunately, this is usually not the case.
Figure 2-26 illustrates a more complex arrangement of mixed types, this
one showing relations among different types of geometric figures. We see that,
in general, a type may have more than one subtype. Triangles and
quadrilaterals, for instance, are both subtypes of polygons. In addition, a
type may have more than one supertype. For example, an isosceles right
triangle may be regarded either as an isosceles triangle or as a right
triangle. This multiple-supertypes issue is particularly thorny, since it
means that there is no unique way to “raise” a type in the hierarchy.
Finding the “correct” supertype in which to apply an operation to an object
may involve considerable searching through the entire type network on the part
of a procedure such as apply-generic
. Since there generally are
multiple subtypes for a type, there is a similar problem in coercing a value
“down” the type hierarchy. Dealing with large numbers of interrelated types
while still preserving modularity in the design of large systems is very
difficult, and is an area of much current research.(118)
Exercise 2.81: Louis Reasoner has noticed that
apply-generic
may try to coerce the arguments to each other’s type even if they already have the same type. Therefore, he reasons, we need to put procedures in the coercion table to coerce arguments of each type to their own type. For example, in addition to thescheme-number->complex
coercion shown above, he would do:(define (scheme-number->scheme-number n) n) (define (complex->complex z) z) (put-coercion 'scheme-number 'scheme-number scheme-number->scheme-number) (put-coercion 'complex 'complex complex->complex)
- With Louis’s coercion procedures installed, what happens if
apply-generic
is called with two arguments of typescheme-number
or two arguments of typecomplex
for an operation that is not found in the table for those types? For example, assume that we’ve defined a generic exponentiation operation:(define (exp x y) (apply-generic 'exp x y))and have put a procedure for exponentiation in the Scheme-number package but not in any other package:
;; following added to Scheme-number package (put 'exp '(scheme-number scheme-number) (lambda (x y) (tag (expt x y)))) ; using primitiveexpt
What happens if we call
exp
with two complex numbers as arguments?- Is Louis correct that something had to be done about coercion with arguments of the same type, or does
apply-generic
work correctly as is?- Modify
apply-generic
so that it doesn’t try coercion if the two arguments have the same type.
Exercise 2.82: Show how to generalize
apply-generic
to handle coercion in the general case of multiple arguments. One strategy is to attempt to coerce all the arguments to the type of the first argument, then to the type of the second argument, and so on. Give an example of a situation where this strategy (and likewise the two-argument version given above) is not sufficiently general. (Hint: Consider the case where there are some suitable mixed-type operations present in the table that will not be tried.)
Exercise 2.83: Suppose you are designing a generic arithmetic system for dealing with the tower of types shown in Figure 2-25: integer, rational, real, complex. For each type (except complex), design a procedure that raises objects of that type one level in the tower. Show how to install a generic
raise
operation that will work for each type (except complex).
Exercise 2.84: Using the
raise
operation of Exercise 2-83, modify theapply-generic
procedure so that it coerces its arguments to have the same type by the method of successive raising, as discussed in this section. You will need to devise a way to test which of two types is higher in the tower. Do this in a manner that is “compatible” with the rest of the system and will not lead to problems in adding new levels to the tower.
Exercise 2.85: This section mentioned a method for “simplifying” a data object by lowering it in the tower of types as far as possible. Design a procedure
drop
that accomplishes this for the tower described in Exercise 2-83. The key is to decide, in some general way, whether an object can be lowered. For example, the complex number 1.5 + 0i can be lowered as far asreal
, the complex number 1 + 0i can be lowered as far asinteger
, and the complex number 2 + 3i cannot be lowered at all. Here is a plan for determining whether an object can be lowered: Begin by defining a generic operationproject
that “pushes” an object down in the tower. For example, projecting a complex number would involve throwing away the imaginary part. Then a number can be dropped if, when weproject
it andraise
the result back to the type we started with, we end up with something equal to what we started with. Show how to implement this idea in detail, by writing adrop
procedure that drops an object as far as possible. You will need to design the various projection operations(119) and installproject
as a generic operation in the system. You will also need to make use of a generic equality predicate, such as described in Exercise 2-79. Finally, usedrop
to rewriteapply-generic
from Exercise 2-84 so that it “simplifies” its answers.
Exercise 2.86: Suppose we want to handle complex numbers whose real parts, imaginary parts, magnitudes, and angles can be either ordinary numbers, rational numbers, or other numbers we might wish to add to the system. Describe and implement the changes to the system needed to accommodate this. You will have to define operations such as
sine
andcosine
that are generic over ordinary numbers and rational numbers.
[ << ] | [ < ] | [ Up ] | [ > ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
The manipulation of symbolic algebraic expressions is a complex process that illustrates many of the hardest problems that occur in the design of large-scale systems. An algebraic expression, in general, can be viewed as a hierarchical structure, a tree of operators applied to operands. We can construct algebraic expressions by starting with a set of primitive objects, such as constants and variables, and combining these by means of algebraic operators, such as addition and multiplication. As in other languages, we form abstractions that enable us to refer to compound objects in simple terms. Typical abstractions in symbolic algebra are ideas such as linear combination, polynomial, rational function, or trigonometric function. We can regard these as compound “types,” which are often useful for directing the processing of expressions. For example, we could describe the expression
x^2 sin (y^2 + 1) + r cos 2y + cos(y^3 - 2y^2)
as a polynomial in x with coefficients that are trigonometric functions of polynomials in y whose coefficients are integers.
We will not attempt to develop a complete algebraic-manipulation system here. Such systems are exceedingly complex programs, embodying deep algebraic knowledge and elegant algorithms. What we will do is look at a simple but important part of algebraic manipulation: the arithmetic of polynomials. We will illustrate the kinds of decisions the designer of such a system faces, and how to apply the ideas of abstract data and generic operations to help organize this effort.
Our first task in designing a system for performing arithmetic on polynomials is to decide just what a polynomial is. Polynomials are normally defined relative to certain variables (the indeterminates of the polynomial). For simplicity, we will restrict ourselves to polynomials having just one indeterminate ( univariate polynomials).(120) We will define a polynomial to be a sum of terms, each of which is either a coefficient, a power of the indeterminate, or a product of a coefficient and a power of the indeterminate. A coefficient is defined as an algebraic expression that is not dependent upon the indeterminate of the polynomial. For example,
5x^2 + 3r + 7
is a simple polynomial in x, and
(y^2 + 1)r^3 + (2y)x + 1
is a polynomial in x whose coefficients are polynomials in y.
Already we are skirting some thorny issues. Is the first of these polynomials the same as the polynomial 5y^2 + 3y + 7, or not? A reasonable answer might be “yes, if we are considering a polynomial purely as a mathematical function, but no, if we are considering a polynomial to be a syntactic form.” The second polynomial is algebraically equivalent to a polynomial in y whose coefficients are polynomials in x. Should our system recognize this, or not? Furthermore, there are other ways to represent a polynomial—for example, as a product of factors, or (for a univariate polynomial) as the set of roots, or as a listing of the values of the polynomial at a specified set of points.(121) We can finesse these questions by deciding that in our algebraic-manipulation system a “polynomial” will be a particular syntactic form, not its underlying mathematical meaning.
Now we must consider how to go about doing arithmetic on polynomials. In this simple system, we will consider only addition and multiplication. Moreover, we will insist that two polynomials to be combined must have the same indeterminate.
We will approach the design of our system by following the familiar discipline
of data abstraction. We will represent polynomials using a data structure
called a
poly, which consists of a variable and a collection of
terms. We assume that we have selectors variable
and term-list
that extract those parts from a poly and a constructor make-poly
that
assembles a poly from a given variable and a term list. A variable will be
just a symbol, so we can use the same-variable?
procedure of section
Example: Symbolic Differentiation to compare variables. The following procedures define addition and
multiplication of polys:
(define (add-poly p1 p2) (if (same-variable? (variable p1) (variable p2)) (make-poly (variable p1) (add-terms (term-list p1) (term-list p2))) (error "Polys not in same var -- ADD-POLY" (list p1 p2)))) (define (mul-poly p1 p2) (if (same-variable? (variable p1) (variable p2)) (make-poly (variable p1) (mul-terms (term-list p1) (term-list p2))) (error "Polys not in same var -- MUL-POLY" (list p1 p2))))
To incorporate polynomials into our generic arithmetic system, we need to
supply them with type tags. We’ll use the tag polynomial
, and install
appropriate operations on tagged polynomials in the operation table. We’ll
embed all our code in an installation procedure for the polynomial package,
similar to the ones in section Generic Arithmetic Operations:
(define (install-polynomial-package) ;; internal procedures ;; representation of poly (define (make-poly variable term-list) (cons variable term-list)) (define (variable p) (car p)) (define (term-list p) (cdr p)) <proceduressame-variable?
andvariable?
from section 2.3.2> ;; representation of terms and term lists <proceduresadjoin-term
…coeff
from text below> ;; continued on next page (define (add-poly p1 p2) …) <procedures used byadd-poly
> (define (mul-poly p1 p2) …) <procedures used bymul-poly
> ;; interface to rest of the system (define (tag p) (attach-tag 'polynomial p)) (put 'add '(polynomial polynomial) (lambda (p1 p2) (tag (add-poly p1 p2)))) (put 'mul '(polynomial polynomial) (lambda (p1 p2) (tag (mul-poly p1 p2)))) (put 'make 'polynomial (lambda (var terms) (tag (make-poly var terms)))) 'done)
Polynomial addition is performed termwise. Terms of the same order (i.e., with the same power of the indeterminate) must be combined. This is done by forming a new term of the same order whose coefficient is the sum of the coefficients of the addends. Terms in one addend for which there are no terms of the same order in the other addend are simply accumulated into the sum polynomial being constructed.
In order to manipulate term lists, we will assume that we have a constructor
the-empty-termlist
that returns an empty term list and a constructor
adjoin-term
that adjoins a new term to a term list. We will also assume
that we have a predicate empty-termlist?
that tells if a given term list
is empty, a selector first-term
that extracts the highest-order term
from a term list, and a selector rest-terms
that returns all but the
highest-order term. To manipulate terms, we will suppose that we have a
constructor make-term
that constructs a term with given order and
coefficient, and selectors order
and coeff
that return,
respectively, the order and the coefficient of the term. These operations
allow us to consider both terms and term lists as data abstractions, whose
concrete representations we can worry about separately.
Here is the procedure that constructs the term list for the sum of two polynomials:(122)
(define (add-terms L1 L2) (cond ((empty-termlist? L1) L2) ((empty-termlist? L2) L1) (else (let ((t1 (first-term L1)) (t2 (first-term L2))) (cond ((> (order t1) (order t2)) (adjoin-term t1 (add-terms (rest-terms L1) L2))) ((< (order t1) (order t2)) (adjoin-term t2 (add-terms L1 (rest-terms L2)))) (else (adjoin-term (make-term (order t1) (add (coeff t1) (coeff t2))) (add-terms (rest-terms L1) (rest-terms L2)))))))))
The most important point to note here is that we used the generic addition
procedure add
to add together the coefficients of the terms being
combined. This has powerful consequences, as we will see below.
In order to multiply two term lists, we multiply each term of the first list by
all the terms of the other list, repeatedly using mul-term-by-all-terms
,
which multiplies a given term by all terms in a given term list. The resulting
term lists (one for each term of the first list) are accumulated into a sum.
Multiplying two terms forms a term whose order is the sum of the orders of the
factors and whose coefficient is the product of the coefficients of the
factors:
(define (mul-terms L1 L2) (if (empty-termlist? L1) (the-empty-termlist) (add-terms (mul-term-by-all-terms (first-term L1) L2) (mul-terms (rest-terms L1) L2)))) (define (mul-term-by-all-terms t1 L) (if (empty-termlist? L) (the-empty-termlist) (let ((t2 (first-term L))) (adjoin-term (make-term (+ (order t1) (order t2)) (mul (coeff t1) (coeff t2))) (mul-term-by-all-terms t1 (rest-terms L))))))
This is really all there is to polynomial addition and multiplication. Notice
that, since we operate on terms using the generic procedures add
and
mul
, our polynomial package is automatically able to handle any type of
coefficient that is known about by the generic arithmetic package. If we
include a coercion mechanism such as one of those discussed in section
Combining Data of Different Types, then we also are automatically able to handle operations on
polynomials of different coefficient types, such as
/ 2 \ [3x^2 + (2 + 3i)x + 7] * | x^4 + --- x^2 + (5 + 3i) | \ 3 /
Because we installed the polynomial addition and multiplication procedures
add-poly
and mul-poly
in the generic arithmetic system as the
add
and mul
operations for type polynomial
, our system is
also automatically able to handle polynomial operations such as
[(y + 1)x^2 + (y^2 + 1)x + (y - 1)] * [(y - 2)x + (y^3 + 7)]
The reason is that when the system tries to combine coefficients, it will
dispatch through add
and mul
. Since the coefficients are
themselves polynomials (in y), these will be combined using add-poly
and mul-poly
. The result is a kind of “data-directed recursion” in
which, for example, a call to mul-poly
will result in recursive calls to
mul-poly
in order to multiply the coefficients. If the coefficients of
the coefficients were themselves polynomials (as might be used to represent
polynomials in three variables), the data direction would ensure that the
system would follow through another level of recursive calls, and so on through
as many levels as the structure of the data dictates.(123)
Finally, we must confront the job of implementing a good representation for
term lists. A term list is, in effect, a set of coefficients keyed by the
order of the term. Hence, any of the methods for representing sets, as
discussed in section Example: Representing Sets, can be applied to this task. On the other
hand, our procedures add-terms
and mul-terms
always access term
lists sequentially from highest to lowest order. Thus, we will use some kind
of ordered list representation.
How should we structure the list that represents a term list? One consideration is the “density” of the polynomials we intend to manipulate. A polynomial is said to be dense if it has nonzero coefficients in terms of most orders. If it has many zero terms it is said to be sparse. For example,
A : x^5 + 2x^4 + 3x^2 - 2x - 5
is a dense polynomial, whereas
B : x^100 + 2x^2 + 1
is sparse.
The term lists of dense polynomials are most efficiently represented as lists
of the coefficients. For example, A above would be nicely represented as
(1 2 0 3 -2 -5)
. The order of a term in this representation is the
length of the sublist beginning with that term’s coefficient, decremented by
1.(124) This would be a terrible representation for
a sparse polynomial such as B: There would be a giant list of zeros
punctuated by a few lonely nonzero terms. A more reasonable representation of
the term list of a sparse polynomial is as a list of the nonzero terms, where
each term is a list containing the order of the term and the coefficient for
that order. In such a scheme, polynomial B is efficiently represented as
((100 1) (2 2) (0 1))
. As most polynomial manipulations are performed
on sparse polynomials, we will use this method. We will assume that term lists
are represented as lists of terms, arranged from highest-order to lowest-order
term. Once we have made this decision, implementing the selectors and
constructors for terms and term lists is straightforward:(125)
(define (adjoin-term term term-list) (if (=zero? (coeff term)) term-list (cons term term-list))) (define (the-empty-termlist) '()) (define (first-term term-list) (car term-list)) (define (rest-terms term-list) (cdr term-list)) (define (empty-termlist? term-list) (null? term-list)) (define (make-term order coeff) (list order coeff)) (define (order term) (car term)) (define (coeff term) (cadr term))
where =zero?
is as defined in Exercise 2-80. (See also
Exercise 2-87 below.)
Users of the polynomial package will create (tagged) polynomials by means of the procedure:
(define (make-polynomial var terms) ((get 'make 'polynomial) var terms))
Exercise 2.87: Install
=zero?
for polynomials in the generic arithmetic package. This will allowadjoin-term
to work for polynomials with coefficients that are themselves polynomials.
Exercise 2.88: Extend the polynomial system to include subtraction of polynomials. (Hint: You may find it helpful to define a generic negation operation.)
Exercise 2.89: Define procedures that implement the term-list representation described above as appropriate for dense polynomials.
Exercise 2.90: Suppose we want to have a polynomial system that is efficient for both sparse and dense polynomials. One way to do this is to allow both kinds of term-list representations in our system. The situation is analogous to the complex-number example of section Multiple Representations for Abstract Data, where we allowed both rectangular and polar representations. To do this we must distinguish different types of term lists and make the operations on term lists generic. Redesign the polynomial system to implement this generalization. This is a major effort, not a local change.
Exercise 2.91: A univariate polynomial can be divided by another one to produce a polynomial quotient and a polynomial remainder. For example,
x^5 - 1 ------- = x^3 + x, remainder x - 1 x^2 - 1Division can be performed via long division. That is, divide the highest-order term of the dividend by the highest-order term of the divisor. The result is the first term of the quotient. Next, multiply the result by the divisor, subtract that from the dividend, and produce the rest of the answer by recursively dividing the difference by the divisor. Stop when the order of the divisor exceeds the order of the dividend and declare the dividend to be the remainder. Also, if the dividend ever becomes zero, return zero as both quotient and remainder.
We can design a
div-poly
procedure on the model ofadd-poly
andmul-poly
. The procedure checks to see if the two polys have the same variable. If so,div-poly
strips off the variable and passes the problem todiv-terms
, which performs the division operation on term lists.Div-poly
finally reattaches the variable to the result supplied bydiv-terms
. It is convenient to designdiv-terms
to compute both the quotient and the remainder of a division.Div-terms
can take two term lists as arguments and return a list of the quotient term list and the remainder term list.Complete the following definition of
div-terms
by filling in the missing expressions. Use this to implementdiv-poly
, which takes two polys as arguments and returns a list of the quotient and remainder polys.(define (div-terms L1 L2) (if (empty-termlist? L1) (list (the-empty-termlist) (the-empty-termlist)) (let ((t1 (first-term L1)) (t2 (first-term L2))) (if (> (order t2) (order t1)) (list (the-empty-termlist) L1) (let ((new-c (div (coeff t1) (coeff t2))) (new-o (- (order t1) (order t2)))) (let ((rest-of-result <compute rest of result recursively> )) <form complete result> ))))))
Our polynomial system illustrates how objects of one type (polynomials) may in fact be complex objects that have objects of many different types as parts. This poses no real difficulty in defining generic operations. We need only install appropriate generic operations for performing the necessary manipulations of the parts of the compound types. In fact, we saw that polynomials form a kind of “recursive data abstraction,” in that parts of a polynomial may themselves be polynomials. Our generic operations and our data-directed programming style can handle this complication without much trouble.
On the other hand, polynomial algebra is a system for which the data types cannot be naturally arranged in a tower. For instance, it is possible to have polynomials in x whose coefficients are polynomials in y. It is also possible to have polynomials in y whose coefficients are polynomials in x. Neither of these types is “above” the other in any natural way, yet it is often necessary to add together elements from each set. There are several ways to do this. One possibility is to convert one polynomial to the type of the other by expanding and rearranging terms so that both polynomials have the same principal variable. One can impose a towerlike structure on this by ordering the variables and thus always converting any polynomial to a “canonical form” with the highest-priority variable dominant and the lower-priority variables buried in the coefficients. This strategy works fairly well, except that the conversion may expand a polynomial unnecessarily, making it hard to read and perhaps less efficient to work with. The tower strategy is certainly not natural for this domain or for any domain where the user can invent new types dynamically using old types in various combining forms, such as trigonometric functions, power series, and integrals.
It should not be surprising that controlling coercion is a serious problem in the design of large-scale algebraic-manipulation systems. Much of the complexity of such systems is concerned with relationships among diverse types. Indeed, it is fair to say that we do not yet completely understand coercion. In fact, we do not yet completely understand the concept of a data type. Nevertheless, what we know provides us with powerful structuring and modularity principles to support the design of large systems.
Exercise 2.92: By imposing an ordering on variables, extend the polynomial package so that addition and multiplication of polynomials works for polynomials in different variables. (This is not easy!)
We can extend our generic arithmetic system to include functions rational functions. These are “fractions” whose numerator and denominator are polynomials, such as
x + 1 ------- x^3 - 1
The system should be able to add, subtract, multiply, and divide rational functions, and to perform such computations as
x + 1 x x^3 + 2x^2 + 3x + 1 ------- + ------- = ------------------- x^3 - 1 x^2 - 1 x^4 + x^3 - x - 1
(Here the sum has been simplified by removing common factors. Ordinary “cross multiplication” would have produced a fourth-degree polynomial over a fifth-degree polynomial.)
If we modify our rational-arithmetic package so that it uses generic operations, then it will do what we want, except for the problem of reducing fractions to lowest terms.
Exercise 2.93: Modify the rational-arithmetic package to use generic operations, but change
make-rat
so that it does not attempt to reduce fractions to lowest terms. Test your system by callingmake-rational
on two polynomials to produce a rational function(define p1 (make-polynomial 'x '((2 1)(0 1)))) (define p2 (make-polynomial 'x '((3 1)(0 1)))) (define rf (make-rational p2 p1))Now add
rf
to itself, usingadd
. You will observe that this addition procedure does not reduce fractions to lowest terms.We can reduce polynomial fractions to lowest terms using the same idea we used with integers: modifying
make-rat
to divide both the numerator and the denominator by their greatest common divisor. The notion of “greatest common divisor” makes sense for polynomials. In fact, we can compute the GCD of two polynomials using essentially the same Euclid’s Algorithm that works for integers.(126) The integer version is(define (gcd a b) (if (= b 0) a (gcd b (remainder a b))))Using this, we could make the obvious modification to define a GCD operation that works on term lists:
(define (gcd-terms a b) (if (empty-termlist? b) a (gcd-terms b (remainder-terms a b))))where
remainder-terms
picks out the remainder component of the list returned by the term-list division operationdiv-terms
that was implemented in Exercise 2-91.
Exercise 2.94: Using
div-terms
, implement the procedureremainder-terms
and use this to definegcd-terms
as above. Now write a proceduregcd-poly
that computes the polynomial GCD of two polys. (The procedure should signal an error if the two polys are not in the same variable.) Install in the system a generic operationgreatest-common-divisor
that reduces togcd-poly
for polynomials and to ordinarygcd
for ordinary numbers. As a test, try(define p1 (make-polynomial 'x '((4 1) (3 -1) (2 -2) (1 2)))) (define p2 (make-polynomial 'x '((3 1) (1 -1)))) (greatest-common-divisor p1 p2)and check your result by hand.
Exercise 2.95: Define P_1, P_2, and P_3 to be the polynomials
P_1 : x^2 - 2x + 1 P_2 : 11x^2 + 7 P_3 : 13x + 5Now define Q_1 to be the product of P_1 and P_2 and Q_2 to be the product of P_1 and P_3, and use
greatest-common-divisor
(Exercise 2-94) to compute the GCD of Q_1 and Q_2. Note that the answer is not the same as P_1. This example introduces noninteger operations into the computation, causing difficulties with the GCD algorithm.(127) To understand what is happening, try tracinggcd-terms
while computing the GCD or try performing the division by hand.We can solve the problem exhibited in Exercise 2-95 if we use the following modification of the GCD algorithm (which really works only in the case of polynomials with integer coefficients). Before performing any polynomial division in the GCD computation, we multiply the dividend by an integer constant factor, chosen to guarantee that no fractions will arise during the division process. Our answer will thus differ from the actual GCD by an integer constant factor, but this does not matter in the case of reducing rational functions to lowest terms; the GCD will be used to divide both the numerator and denominator, so the integer constant factor will cancel out.
More precisely, if P and Q are polynomials, let O_1 be the order of P (i.e., the order of the largest term of P) and let O_2 be the order of Q. Let c be the leading coefficient of Q. Then it can be shown that, if we multiply P by the integerizing factor c^(1+O_1 -O_2), the resulting polynomial can be divided by Q by using the
div-terms
algorithm without introducing any fractions. The operation of multiplying the dividend by this constant and then dividing is sometimes called the pseudodivision of P by Q. The remainder of the division is called the pseudoremainder.
- Implement the procedure
pseudoremainder-terms
, which is just likeremainder-terms
except that it multiplies the dividend by the integerizing factor described above before callingdiv-terms
. Modifygcd-terms
to usepseudoremainder-terms
, and verify thatgreatest-common-divisor
now produces an answer with integer coefficients on the example in Exercise 2-95.- The GCD now has integer coefficients, but they are larger than those of P_1. Modify
gcd-terms
so that it removes common factors from the coefficients of the answer by dividing all the coefficients by their (integer) greatest common divisor.Thus, here is how to reduce a rational function to lowest terms:
- Compute the GCD of the numerator and denominator, using the version of
gcd-terms
from Exercise 2-96.- When you obtain the GCD, multiply both numerator and denominator by the same integerizing factor before dividing through by the GCD, so that division by the GCD will not introduce any noninteger coefficients. As the factor you can use the leading coefficient of the GCD raised to the power 1 + O_1 - O_2, where O_2 is the order of the GCD and O_1 is the maximum of the orders of the numerator and denominator. This will ensure that dividing the numerator and denominator by the GCD will not introduce any fractions.
- The result of this operation will be a numerator and denominator with integer coefficients. The coefficients will normally be very large because of all of the integerizing factors, so the last step is to remove the redundant factors by computing the (integer) greatest common divisor of all the coefficients of the numerator and the denominator and dividing through by this factor.
- Implement this algorithm as a procedure
reduce-terms
that takes two term listsn
andd
as arguments and returns a listnn
,dd
, which aren
andd
reduced to lowest terms via the algorithm given above. Also write a procedurereduce-poly
, analogous toadd-poly
, that checks to see if the two polys have the same variable. If so,reduce-poly
strips off the variable and passes the problem toreduce-terms
, then reattaches the variable to the two term lists supplied byreduce-terms
.- Define a procedure analogous to
reduce-terms
that does what the originalmake-rat
did for integers:(define (reduce-integers n d) (let ((g (gcd n d))) (list (/ n g) (/ d g))))and define
reduce
as a generic operation that callsapply-generic
to dispatch to eitherreduce-poly
(forpolynomial
arguments) orreduce-integers
(forscheme-number
arguments). You can now easily make the rational-arithmetic package reduce fractions to lowest terms by havingmake-rat
callreduce
before combining the given numerator and denominator to form a rational number. The system now handles rational expressions in either integers or polynomials. To test your program, try the example at the beginning of this extended exercise:(define p1 (make-polynomial 'x '((1 1)(0 1)))) (define p2 (make-polynomial 'x '((3 1)(0 -1)))) (define p3 (make-polynomial 'x '((1 1)))) (define p4 (make-polynomial 'x '((2 1)(0 -1)))) (define rf1 (make-rational p1 p2)) (define rf2 (make-rational p3 p4)) (add rf1 rf2)See if you get the correct answer, correctly reduced to lowest terms.
The GCD computation is at the heart of any system that does operations on rational functions. The algorithm used above, although mathematically straightforward, is extremely slow. The slowness is due partly to the large number of division operations and partly to the enormous size of the intermediate coefficients generated by the pseudodivisions. One of the active areas in the development of algebraic-manipulation systems is the design of better algorithms for computing polynomial GCDs.(128)
[ << ] | [ < ] | [ Up ] | [ > ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
[greek not included here]
(Even while it changes, it stands still.)
—Heraclitus
Plus ça change, plus c’est la me*me chose.
—Alphonse Karr
The preceding chapters introduced the basic elements from which programs are made. We saw how primitive procedures and primitive data are combined to construct compound entities, and we learned that abstraction is vital in helping us to cope with the complexity of large systems. But these tools are not sufficient for designing programs. Effective program synthesis also requires organizational principles that can guide us in formulating the overall design of a program. In particular, we need strategies to help us structure large systems so that they will be modular, that is, so that they can be divided “naturally” into coherent parts that can be separately developed and maintained.
One powerful design strategy, which is particularly appropriate to the construction of programs for modeling physical systems, is to base the structure of our programs on the structure of the system being modeled. For each object in the system, we construct a corresponding computational object. For each system action, we define a symbolic operation in our computational model. Our hope in using this strategy is that extending the model to accommodate new objects or new actions will require no strategic changes to the program, only the addition of the new symbolic analogs of those objects or actions. If we have been successful in our system organization, then to add a new feature or debug an old one we will have to work on only a localized part of the system.
To a large extent, then, the way we organize a large program is dictated by our perception of the system to be modeled. In this chapter we will investigate two prominent organizational strategies arising from two rather different “world views” of the structure of systems. The first organizational strategy concentrates on objects, viewing a large system as a collection of distinct objects whose behaviors may change over time. An alternative organizational strategy concentrates on the streams of information that flow in the system, much as an electrical engineer views a signal-processing system.
Both the object-based approach and the stream-processing approach raise significant linguistic issues in programming. With objects, we must be concerned with how a computational object can change and yet maintain its identity. This will force us to abandon our old substitution model of computation (section The Substitution Model for Procedure Application) in favor of a more mechanistic but less theoretically tractable environment model of computation. The difficulties of dealing with objects, change, and identity are a fundamental consequence of the need to grapple with time in our computational models. These difficulties become even greater when we allow the possibility of concurrent execution of programs. The stream approach can be most fully exploited when we decouple simulated time in our model from the order of the events that take place in the computer during evaluation. We will accomplish this using a technique known as delayed evaluation.
3.1 Assignment and Local State | ||
3.2 The Environment Model of Evaluation | ||
3.3 Modeling with Mutable Data | ||
3.4 Concurrency: Time Is of the Essence | ||
3.5 Streams |
[ << ] | [ < ] | [ Up ] | [ > ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
We ordinarily view the world as populated by independent objects, each of which has a state that changes over time. An object is said to “have state” if its behavior is influenced by its history. A bank account, for example, has state in that the answer to the question “Can I withdraw $100?” depends upon the history of deposit and withdrawal transactions. We can characterize an object’s state by one or more state variables, which among them maintain enough information about history to determine the object’s current behavior. In a simple banking system, we could characterize the state of an account by a current balance rather than by remembering the entire history of account transactions.
In a system composed of many objects, the objects are rarely completely independent. Each may influence the states of others through interactions, which serve to couple the state variables of one object to those of other objects. Indeed, the view that a system is composed of separate objects is most useful when the state variables of the system can be grouped into closely coupled subsystems that are only loosely coupled to other subsystems.
This view of a system can be a powerful framework for organizing computational models of the system. For such a model to be modular, it should be decomposed into computational objects that model the actual objects in the system. Each computational object must have its own local state variables describing the actual object’s state. Since the states of objects in the system being modeled change over time, the state variables of the corresponding computational objects must also change. If we choose to model the flow of time in the system by the elapsed time in the computer, then we must have a way to construct computational objects whose behaviors change as our programs run. In particular, if we wish to model state variables by ordinary symbolic names in the programming language, then the language must provide an operator assignment operator to enable us to change the value associated with a name.
3.1.1 Local State Variables | ||
3.1.2 The Benefits of Introducing Assignment | ||
3.1.3 The Costs of Introducing Assignment |
[ << ] | [ < ] | [ Up ] | [ > ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
To illustrate what we mean by having a computational object with time-varying
state, let us model the situation of withdrawing money from a bank account. We
will do this using a procedure withdraw
, which takes as argument an
amount
to be withdrawn. If there is enough money in the account to
accommodate the withdrawal, then withdraw
should return the balance
remaining after the withdrawal. Otherwise, withdraw
should return the
message Insufficient funds. For example, if we begin with $100 in the
account, we should obtain the following sequence of responses using
withdraw
:
(withdraw 25) 75 (withdraw 25) 50 (withdraw 60) "Insufficient funds" (withdraw 15) 35
Observe that the expression (withdraw 25)
, evaluated twice, yields
different values. This is a new kind of behavior for a procedure. Until now,
all our procedures could be viewed as specifications for computing mathematical
functions. A call to a procedure computed the value of the function applied to
the given arguments, and two calls to the same procedure with the same
arguments always produced the same result.(129)
To implement withdraw
, we can use a variable balance
to indicate
the balance of money in the account and define withdraw
as a procedure
that accesses balance
. The withdraw
procedure checks to see if
balance
is at least as large as the requested amount
. If so,
withdraw
decrements balance
by amount
and returns the new
value of balance
. Otherwise, withdraw
returns the
Insufficient funds message. Here are the definitions of balance
and withdraw
:
(define balance 100) (define (withdraw amount) (if (>= balance amount) (begin (set! balance (- balance amount)) balance) "Insufficient funds"))
Decrementing balance
is accomplished by the expression
(set! balance (- balance amount))
This uses the set!
special form, whose syntax is
(set! <name> <new-value>)
Here <name> is a symbol and <new-value> is any expression.
Set!
changes <name> so that its value is the result obtained by
evaluating <new-value>. In the case at hand, we are changing
balance
so that its new value will be the result of subtracting
amount
from the previous value of balance
.(130)
Withdraw
also uses the begin
special form to cause two
expressions to be evaluated in the case where the if
test is true: first
decrementing balance
and then returning the value of balance
. In
general, evaluating the expression
(begin <exp_1> <exp_2> … <exp_k>)
causes the expressions <exp_1> through <exp_k> to be evaluated
in sequence and the value of the final expression <exp_k> to be
returned as the value of the entire begin
form.(131)
Although withdraw
works as desired, the variable balance
presents
a problem. As specified above, balance
is a name defined in the global
environment and is freely accessible to be examined or modified by any
procedure. It would be much better if we could somehow make balance
internal to withdraw
, so that withdraw
would be the only
procedure that could access balance
directly and any other procedure
could access balance
only indirectly (through calls to withdraw
).
This would more accurately model the notion that balance
is a local
state variable used by withdraw
to keep track of the state of the
account.
We can make balance
internal to withdraw
by rewriting the
definition as follows:
(define new-withdraw (let ((balance 100)) (lambda (amount) (if (>= balance amount) (begin (set! balance (- balance amount)) balance) "Insufficient funds"))))
What we have done here is use let
to establish an environment with a
local variable balance
, bound to the initial value 100. Within this
local environment, we use lambda
to create a procedure that takes
amount
as an argument and behaves like our previous withdraw
procedure. This procedure—returned as the result of evaluating the
let
expression—is new-withdraw
, which behaves in precisely the
same way as withdraw
but whose variable balance
is not accessible
by any other procedure.(132)
Combining set!
with local variables is the general programming technique
we will use for constructing computational objects with local state.
Unfortunately, using this technique raises a serious problem: When we first
introduced procedures, we also introduced the substitution model of evaluation
(section The Substitution Model for Procedure Application) to provide an interpretation of what procedure
application means. We said that applying a procedure should be interpreted as
evaluating the body of the procedure with the formal parameters replaced by
their values. The trouble is that, as soon as we introduce assignment into our
language, substitution is no longer an adequate model of procedure application.
(We will see why this is so in section The Costs of Introducing Assignment.) As a consequence, we
technically have at this point no way to understand why the new-withdraw
procedure behaves as claimed above. In order to really understand a procedure
such as new-withdraw
, we will need to develop a new model of procedure
application. In section The Environment Model of Evaluation we will introduce such a model, together
with an explanation of set!
and local variables. First, however, we
examine some variations on the theme established by new-withdraw
.
The following procedure, make-withdraw
, creates “withdrawal
processors.” The formal parameter balance
in make-withdraw
specifies the initial amount of money in the account.(133)
(define (make-withdraw balance) (lambda (amount) (if (>= balance amount) (begin (set! balance (- balance amount)) balance) "Insufficient funds")))
Make-withdraw
can be used as follows to create two objects W1
and
W2
:
(define W1 (make-withdraw 100)) (define W2 (make-withdraw 100)) (W1 50) 50 (W2 70) 30 (W2 40) "Insufficient funds" (W1 40) 10
Observe that W1
and W2
are completely independent objects, each
with its own local state variable balance
. Withdrawals from one do not
affect the other.
We can also create objects that handle deposits as well as withdrawals, and thus we can represent simple bank accounts. Here is a procedure that returns a “bank-account object” with a specified initial balance:
(define (make-account balance) (define (withdraw amount) (if (>= balance amount) (begin (set! balance (- balance amount)) balance) "Insufficient funds")) (define (deposit amount) (set! balance (+ balance amount)) balance) (define (dispatch m) (cond ((eq? m 'withdraw) withdraw) ((eq? m 'deposit) deposit) (else (error "Unknown request -- MAKE-ACCOUNT" m)))) dispatch)
Each call to make-account
sets up an environment with a local state
variable balance
. Within this environment, make-account
defines
procedures deposit
and withdraw
that access balance
and an
additional procedure dispatch
that takes a “message” as input and
returns one of the two local procedures. The dispatch
procedure itself
is returned as the value that represents the bank-account object. This is
precisely the
message-passing style of programming that we saw in
section Data-Directed Programming and Additivity, although here we are using it in conjunction with the
ability to modify local variables.
Make-account
can be used as follows:
(define acc (make-account 100)) ((acc 'withdraw) 50) 50 ((acc 'withdraw) 60) "Insufficient funds" ((acc 'deposit) 40) 90 ((acc 'withdraw) 60) 30
Each call to acc
returns the locally defined deposit
or
withdraw
procedure, which is then applied to the specified
amount
. As was the case with make-withdraw
, another call to
make-account
(define acc2 (make-account 100))
will produce a completely separate account object, which maintains its own
local balance
.
Exercise 3.1: An accumulator is a procedure that is called repeatedly with a single numeric argument and accumulates its arguments into a sum. Each time it is called, it returns the currently accumulated sum. Write a procedure
make-accumulator
that generates accumulators, each maintaining an independent sum. The input tomake-accumulator
should specify the initial value of the sum; for example(define A (make-accumulator 5)) (A 10) 15 (A 10) 25
Exercise 3.2: In software-testing applications, it is useful to be able to count the number of times a given procedure is called during the course of a computation. Write a procedure
make-monitored
that takes as input a procedure,f
, that itself takes one input. The result returned bymake-monitored
is a third procedure, saymf
, that keeps track of the number of times it has been called by maintaining an internal counter. If the input tomf
is the special symbolhow-many-calls?
, thenmf
returns the value of the counter. If the input is the special symbolreset-count
, thenmf
resets the counter to zero. For any other input,mf
returns the result of callingf
on that input and increments the counter. For instance, we could make a monitored version of thesqrt
procedure:(define s (make-monitored sqrt)) (s 100) 10 (s 'how-many-calls?) 1
Exercise 3.3: Modify the
make-account
procedure so that it creates password-protected accounts. That is,make-account
should take a symbol as an additional argument, as in(define acc (make-account 100 'secret-password))The resulting account object should process a request only if it is accompanied by the password with which the account was created, and should otherwise return a complaint:
((acc 'secret-password 'withdraw) 40) 60 ((acc 'some-other-password 'deposit) 50) "Incorrect password"
Exercise 3.4: Modify the
make-account
procedure of Exercise 3-3 by adding another local state variable so that, if an account is accessed more than seven consecutive times with an incorrect password, it invokes the procedurecall-the-cops
.
[ << ] | [ < ] | [ Up ] | [ > ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
As we shall see, introducing assignment into our programming language leads us
into a thicket of difficult conceptual issues. Nevertheless, viewing systems
as collections of objects with local state is a powerful technique for
maintaining a modular design. As a simple example, consider the design of a
procedure rand
that, whenever it is called, returns an integer chosen at
random.
It is not at all clear what is meant by “chosen at random.” What we
presumably want is for successive calls to rand
to produce a sequence of
numbers that has statistical properties of uniform distribution. We will not
discuss methods for generating suitable sequences here. Rather, let us assume
that we have a procedure rand-update
that has the property that if we
start with a given number x_1 and form
x_2 = (rand-update x_1) x_3 = (rand-update x_2)
then the sequence of values x_1, x_2, x_3, …, will have the desired statistical properties.(134)
We can implement rand
as a procedure with a local state variable
x
that is initialized to some fixed value random-init
. Each call
to rand
computes rand-update
of the current value of x
,
returns this as the random number, and also stores this as the new value of
x
.
(define rand (let ((x random-init)) (lambda () (set! x (rand-update x)) x)))
Of course, we could generate the same sequence of random numbers without using
assignment by simply calling rand-update
directly. However, this would
mean that any part of our program that used random numbers would have to
explicitly remember the current value of x
to be passed as an argument
to rand-update
. To realize what an annoyance this would be, consider
using random numbers to implement a technique called
simulation
Monte Carlo
simulation.
The Monte Carlo method consists of choosing sample experiments at random from a large set and then making deductions on the basis of the probabilities estimated from tabulating the results of those experiments. For example, we can approximate [pi] using the fact that 6/[pi]^2 is the probability that two integers chosen at random will have no factors in common; that is, that their greatest common divisor will be 1.(135) To obtain the approximation to [pi], we perform a large number of experiments. In each experiment we choose two integers at random and perform a test to see if their GCD is 1. The fraction of times that the test is passed gives us our estimate of 6/[pi]^2, and from this we obtain our approximation to [pi].
The heart of our program is a procedure monte-carlo
, which takes as
arguments the number of times to try an experiment, together with the
experiment, represented as a no-argument procedure that will return either true
or false each time it is run. Monte-carlo
runs the experiment for the
designated number of trials and returns a number telling the fraction of the
trials in which the experiment was found to be true.
(define (estimate-pi trials) (sqrt (/ 6 (monte-carlo trials cesaro-test)))) (define (cesaro-test) (= (gcd (rand) (rand)) 1)) (define (monte-carlo trials experiment) (define (iter trials-remaining trials-passed) (cond ((= trials-remaining 0) (/ trials-passed trials)) ((experiment) (iter (- trials-remaining 1) (+ trials-passed 1))) (else (iter (- trials-remaining 1) trials-passed)))) (iter trials 0))
Now let us try the same computation using rand-update
directly rather
than rand
, the way we would be forced to proceed if we did not use
assignment to model local state:
(define (estimate-pi trials) (sqrt (/ 6 (random-gcd-test trials random-init)))) (define (random-gcd-test trials initial-x) (define (iter trials-remaining trials-passed x) (let ((x1 (rand-update x))) (let ((x2 (rand-update x1))) (cond ((= trials-remaining 0) (/ trials-passed trials)) ((= (gcd x1 x2) 1) (iter (- trials-remaining 1) (+ trials-passed 1) x2)) (else (iter (- trials-remaining 1) trials-passed x2)))))) (iter trials 0 initial-x))
While the program is still simple, it betrays some painful breaches of
modularity. In our first version of the program, using rand
, we can
express the Monte Carlo method directly as a general monte-carlo
procedure that takes as an argument an arbitrary experiment
procedure.
In our second version of the program, with no local state for the random-number
generator, random-gcd-test
must explicitly manipulate the random numbers
x1
and x2
and recycle x2
through the iterative loop as the
new input to rand-update
. This explicit handling of the random numbers
intertwines the structure of accumulating test results with the fact that our
particular experiment uses two random numbers, whereas other Monte Carlo
experiments might use one random number or three. Even the top-level procedure
estimate-pi
has to be concerned with supplying an initial random number.
The fact that the random-number generator’s insides are leaking out into other
parts of the program makes it difficult for us to isolate the Monte Carlo idea
so that it can be applied to other tasks. In the first version of the program,
assignment encapsulates the state of the random-number generator within the
rand
procedure, so that the details of random-number generation remain
independent of the rest of the program.
The general phenomenon illustrated by the Monte Carlo example is this: From the point of view of one part of a complex process, the other parts appear to change with time. They have hidden time-varying local state. If we wish to write computer programs whose structure reflects this decomposition, we make computational objects (such as bank accounts and random-number generators) whose behavior changes with time. We model state with local state variables, and we model the changes of state with assignments to those variables.
It is tempting to conclude this discussion by saying that, by introducing assignment and the technique of hiding state in local variables, we are able to structure systems in a more modular fashion than if all state had to be manipulated explicitly, by passing additional parameters. Unfortunately, as we shall see, the story is not so simple.
Exercise 3.5: Monte Carlo integration is a method of estimating definite integrals by means of Monte Carlo simulation. Consider computing the area of a region of space described by a predicate P(x, y) that is true for points (x, y) in the region and false for points not in the region. For example, the region contained within a circle of radius 3 centered at (5, 7) is described by the predicate that tests whether (x - 5)^2 + (y - 7)^2 <= 3^2. To estimate the area of the region described by such a predicate, begin by choosing a rectangle that contains the region. For example, a rectangle with diagonally opposite corners at (2, 4) and (8, 10) contains the circle above. The desired integral is the area of that portion of the rectangle that lies in the region. We can estimate the integral by picking, at random, points (x,y) that lie in the rectangle, and testing P(x, y) for each point to determine whether the point lies in the region. If we try this with many points, then the fraction of points that fall in the region should give an estimate of the proportion of the rectangle that lies in the region. Hence, multiplying this fraction by the area of the entire rectangle should produce an estimate of the integral.
Implement Monte Carlo integration as a procedure
estimate-integral
that takes as arguments a predicateP
, upper and lower boundsx1
,x2
,y1
, andy2
for the rectangle, and the number of trials to perform in order to produce the estimate. Your procedure should use the samemonte-carlo
procedure that was used above to estimate [pi]. Use yourestimate-integral
to produce an estimate of [pi] by measuring the area of a unit circle.You will find it useful to have a procedure that returns a number chosen at random from a given range. The following
random-in-range
procedure implements this in terms of therandom
procedure used in section Example: Testing for Primality, which returns a nonnegative number less than its input.(136)(define (random-in-range low high) (let ((range (- high low))) (+ low (random range))))
Exercise 3.6: It is useful to be able to reset a random-number generator to produce a sequence starting from a given value. Design a new
rand
procedure that is called with an argument that is either the symbolgenerate
or the symbolreset
and behaves as follows:(rand 'generate)
produces a new random number;((rand 'reset) <new-value>)
resets the internal state variable to the designated <new-value>. Thus, by resetting the state, one can generate repeatable sequences. These are very handy to have when testing and debugging programs that use random numbers.
[ << ] | [ < ] | [ Up ] | [ > ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
As we have seen, the set!
operation enables us to model objects that
have local state. However, this advantage comes at a price. Our programming
language can no longer be interpreted in terms of the substitution model of
procedure application that we introduced in section The Substitution Model for Procedure Application. Moreover, no
simple model with “nice” mathematical properties can be an adequate framework
for dealing with objects and assignment in programming languages.
So long as we do not use assignments, two evaluations of the same procedure with the same arguments will produce the same result, so that procedures can be viewed as computing mathematical functions. Programming without any use of assignments, as we did throughout the first two chapters of this book, is accordingly known as functional programming.
To understand how assignment complicates matters, consider a simplified version
of the make-withdraw
procedure of section Local State Variables that does not
bother to check for an insufficient amount:
(define (make-simplified-withdraw balance) (lambda (amount) (set! balance (- balance amount)) balance)) (define W (make-simplified-withdraw 25)) (W 20) 5 (W 10) - 5
Compare this procedure with the following make-decrementer
procedure,
which does not use set!
:
(define (make-decrementer balance) (lambda (amount) (- balance amount)))
Make-decrementer
returns a procedure that subtracts its input from a
designated amount balance
, but there is no accumulated effect over
successive calls, as with make-simplified-withdraw
:
(define D (make-decrementer 25)) (D 20) 5 (D 10) 15
We can use the substitution model to explain how make-decrementer
works.
For instance, let us analyze the evaluation of the expression
((make-decrementer 25) 20)
We first simplify the operator of the combination by substituting 25 for
balance
in the body of make-decrementer
. This reduces the
expression to
((lambda (amount) (- 25 amount)) 20)
Now we apply the operator by substituting 20 for amount
in the body of
the lambda
expression:
(- 25 20)
The final answer is 5.
Observe, however, what happens if we attempt a similar substitution analysis
with make-simplified-withdraw
:
((make-simplified-withdraw 25) 20)
We first simplify the operator by substituting 25 for balance
in the
body of make-simplified-withdraw
. This reduces the expression
to(137)
((lambda (amount) (set! balance (- 25 amount)) 25) 20)
Now we apply the operator by substituting 20 for amount
in the body of
the lambda
expression:
(set! balance (- 25 20)) 25
If we adhered to the substitution model, we would have to say that the meaning
of the procedure application is to first set balance
to 5 and then
return 25 as the value of the expression. This gets the wrong answer. In
order to get the correct answer, we would have to somehow distinguish the first
occurrence of balance
(before the effect of the set!
) from the
second occurrence of balance
(after the effect of the set!
), and
the substitution model cannot do this.
The trouble here is that substitution is based ultimately on the notion that
the symbols in our language are essentially names for values. But as soon as
we introduce set!
and the idea that the value of a variable can change,
a variable can no longer be simply a name. Now a variable somehow refers to a
place where a value can be stored, and the value stored at this place can
change. In section The Environment Model of Evaluation we will see how environments play this role of
“place” in our computational model.
The issue surfacing here is more profound than the mere breakdown of a particular model of computation. As soon as we introduce change into our computational models, many notions that were previously straightforward become problematical. Consider the concept of two things being “the same.”
Suppose we call make-decrementer
twice with the same argument to create
two procedures:
(define D1 (make-decrementer 25)) (define D2 (make-decrementer 25))
Are D1
and D2
the same? An acceptable answer is yes, because
D1
and D2
have the same computational behavior—each is a
procedure that subtracts its input from 25. In fact, D1
could be
substituted for D2
in any computation without changing the result.
Contrast this with making two calls to make-simplified-withdraw
:
(define W1 (make-simplified-withdraw 25)) (define W2 (make-simplified-withdraw 25))
Are W1
and W2
the same? Surely not, because calls to W1
and W2
have distinct effects, as shown by the following sequence of
interactions:
(W1 20) 5 (W1 20) - 15 (W2 20) 5
Even though W1
and W2
are “equal” in the sense that they are
both created by evaluating the same expression, (make-simplified-withdraw
25)
, it is not true that W1
could be substituted for W2
in any
expression without changing the result of evaluating the expression.
A language that supports the concept that “equals can be substituted for
equals” in an expresssion without changing the value of the expression is said
to be
referentially transparent. Referential transparency is
violated when we include set!
in our computer language. This makes it
tricky to determine when we can simplify expressions by substituting equivalent
expressions. Consequently, reasoning about programs that use assignment
becomes drastically more difficult.
Once we forgo referential transparency, the notion of what it means for computational objects to be “the same” becomes difficult to capture in a formal way. Indeed, the meaning of “same” in the real world that our programs model is hardly clear in itself. In general, we can determine that two apparently identical objects are indeed “the same one” only by modifying one object and then observing whether the other object has changed in the same way. But how can we tell if an object has “changed” other than by observing the “same” object twice and seeing whether some property of the object differs from one observation to the next? Thus, we cannot determine “change” without some a priori notion of “sameness,” and we cannot determine sameness without observing the effects of change.
As an example of how this issue arises in programming, consider the situation where Peter and Paul have a bank account with $100 in it. There is a substantial difference between modeling this as
(define peter-acc (make-account 100)) (define paul-acc (make-account 100))
and modeling it as
(define peter-acc (make-account 100)) (define paul-acc peter-acc)
In the first situation, the two bank accounts are distinct. Transactions made
by Peter will not affect Paul’s account, and vice versa. In the second
situation, however, we have defined paul-acc
to be the same thing
as peter-acc
. In effect, Peter and Paul now have a joint bank account,
and if Peter makes a withdrawal from peter-acc
Paul will observe less
money in paul-acc
. These two similar but distinct situations can cause
confusion in building computational models. With the shared account, in
particular, it can be especially confusing that there is one object (the bank
account) that has two different names (peter-acc
and paul-acc
);
if we are searching for all the places in our program where paul-acc
can
be changed, we must remember to look also at things that change
peter-acc
.(138)
With reference to the above remarks on “sameness” and “change,” observe that if Peter and Paul could only examine their bank balances, and could not perform operations that changed the balance, then the issue of whether the two accounts are distinct would be moot. In general, so long as we never modify data objects, we can regard a compound data object to be precisely the totality of its pieces. For example, a rational number is determined by giving its numerator and its denominator. But this view is no longer valid in the presence of change, where a compound data object has an “identity” that is something different from the pieces of which it is composed. A bank account is still “the same” bank account even if we change the balance by making a withdrawal; conversely, we could have two different bank accounts with the same state information. This complication is a consequence, not of our programming language, but of our perception of a bank account as an object. We do not, for example, ordinarily regard a rational number as a changeable object with identity, such that we could change the numerator and still have “the same” rational number.
In contrast to functional programming, programming that makes extensive use of assignment is known as imperative programming. In addition to raising complications about computational models, programs written in imperative style are susceptible to bugs that cannot occur in functional programs. For example, recall the iterative factorial program from section Linear Recursion and Iteration:
(define (factorial n) (define (iter product counter) (if (> counter n) product (iter (* counter product) (+ counter 1)))) (iter 1 1))
Instead of passing arguments in the internal iterative loop, we could adopt a
more imperative style by using explicit assignment to update the values of the
variables product
and counter
:
(define (factorial n) (let ((product 1) (counter 1)) (define (iter) (if (> counter n) product (begin (set! product (* counter product)) (set! counter (+ counter 1)) (iter)))) (iter)))
This does not change the results produced by the program, but it does introduce a subtle trap. How do we decide the order of the assignments? As it happens, the program is correct as written. But writing the assignments in the opposite order
(set! counter (+ counter 1)) (set! product (* counter product))
would have produced a different, incorrect result. In general, programming with assignment forces us to carefully consider the relative orders of the assignments to make sure that each statement is using the correct version of the variables that have been changed. This issue simply does not arise in functional programs.(139)
The complexity of imperative programs becomes even worse if we consider applications in which several processes execute concurrently. We will return to this in section Concurrency: Time Is of the Essence. First, however, we will address the issue of providing a computational model for expressions that involve assignment, and explore the uses of objects with local state in designing simulations.
Exercise 3.7: Consider the bank account objects created by
make-account
, with the password modification described in Exercise 3-3. Suppose that our banking system requires the ability to make joint accounts. Define a proceduremake-joint
that accomplishes this.Make-joint
should take three arguments. The first is a password-protected account. The second argument must match the password with which the account was defined in order for themake-joint
operation to proceed. The third argument is a new password.Make-joint
is to create an additional access to the original account using the new password. For example, ifpeter-acc
is a bank account with passwordopen-sesame
, then(define paul-acc (make-joint peter-acc 'open-sesame 'rosebud))will allow one to make transactions on
peter-acc
using the namepaul-acc
and the passwordrosebud
. You may wish to modify your solution to Exercise 3-3 to accommodate this new feature
Exercise 3.8: When we defined the evaluation model in section Evaluating Combinations, we said that the first step in evaluating an expression is to evaluate its subexpressions. But we never specified the order in which the subexpressions should be evaluated (e.g., left to right or right to left). When we introduce assignment, the order in which the arguments to a procedure are evaluated can make a difference to the result. Define a simple procedure
f
such that evaluating(+ (f 0) (f 1))
will return 0 if the arguments to+
are evaluated from left to right but will return 1 if the arguments are evaluated from right to left.
[ << ] | [ < ] | [ Up ] | [ > ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
When we introduced compound procedures in Building Abstractions with Procedures, we used the substitution model of evaluation (section The Substitution Model for Procedure Application) to define what is meant by applying a procedure to arguments:
Once we admit assignment into our programming language, such a definition is no longer adequate. In particular, section The Costs of Introducing Assignment argued that, in the presence of assignment, a variable can no longer be considered to be merely a name for a value. Rather, a variable must somehow designate a “place” in which values can be stored. In our new model of evaluation, these places will be maintained in structures called environments.
An environment is a sequence of frames. Each frame is a table (possibly empty) of bindings, which associate variable names with their corresponding values. (A single frame may contain at most one binding for any variable.) Each frame also has a pointer to its environment enclosing environment, unless, for the purposes of discussion, the frame is considered to be global. The value of a variable with respect to an environment is the value given by the binding of the variable in the first frame in the environment that contains a binding for that variable. If no frame in the sequence specifies a binding for the variable, then the variable is said to be unbound in the environment.
Figure 3.1: A simple environment structure.
+--------+ | I | | x: 3 | | y: 5 | +--------+ ^ ^ | | C | | D +---------+ | | +----------+ | II | | | | III | | z: 6 +---+ +---+ m: 1 | | x: 7 | | y: 2 | +---------+ +----------+
Figure 3-1 shows a simple environment structure consisting of three
frames, labeled I, II, and III. In the diagram, A, B, C, and D are pointers to
environments. C and D point to the same environment. The variables z
and x
are bound in frame II, while y
and x
are bound in
frame I. The value of x
in environment D is 3. The value of x
with respect to environment B is also 3. This is determined as follows: We
examine the first frame in the sequence (frame III) and do not find a binding
for x
, so we proceed to the enclosing environment D and find the binding
in frame I. On the other hand, the value of x
in environment A is 7,
because the first frame in the sequence (frame II) contains a binding of
x
to 7. With respect to environment A, the binding of x
to 7 in
frame II is said to
shadow the binding of x
to 3 in frame I.
The environment is crucial to the evaluation process, because it determines the
context in which an expression should be evaluated. Indeed, one could say that
expressions in a programming language do not, in themselves, have any meaning.
Rather, an expression acquires a meaning only with respect to some environment
in which it is evaluated. Even the interpretation of an expression as
straightforward as (+ 1 1)
depends on an understanding that one is
operating in a context in which +
is the symbol for addition. Thus, in
our model of evaluation we will always speak of evaluating an expression with
respect to some environment. To describe interactions with the interpreter, we
will suppose that there is a global environment, consisting of a single frame
(with no enclosing environment) that includes values for the symbols associated
with the primitive procedures. For example, the idea that +
is the
symbol for addition is captured by saying that the symbol +
is bound in
the global environment to the primitive addition procedure.
3.2.1 The Rules for Evaluation | ||
3.2.2 Applying Simple Procedures | ||
3.2.3 Frames as the Repository of Local State | ||
3.2.4 Internal Definitions |
[ << ] | [ < ] | [ Up ] | [ > ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
The overall specification of how the interpreter evaluates a combination remains the same as when we first introduced it in section Evaluating Combinations:
The environment model of evaluation replaces the substitution model in specifying what it means to apply a compound procedure to arguments.
In the environment model of evaluation, a procedure is always a pair consisting
of some code and a pointer to an environment. Procedures are created in one
way only: by evaluating a lambda
expression. This produces a procedure
whose code is obtained from the text of the lambda
expression and whose
environment is the environment in which the lambda
expression was
evaluated to produce the procedure. For example, consider the procedure
definition
(define (square x) (* x x))
evaluated in the global environment. The procedure definition syntax is just
syntactic sugar for an underlying implicit lambda
expression. It would
have been equivalent to have used
(define square (lambda (x) (* x x)))
which evaluates (lambda (x) (* x x))
and binds square
to the
resulting value, all in the global environment.
Figure 3-2 shows the result of evaluating this define
expression.
The procedure object is a pair whose code specifies that the procedure has one
formal parameter, namely x
, and a procedure body (* x x)
. The
environment part of the procedure is a pointer to the global environment, since
that is the environment in which the lambda
expression was evaluated to
produce the procedure. A new binding, which associates the procedure object
with the symbol square
, has been added to the global frame. In general,
define
creates definitions by adding bindings to frames.
Figure 3.2: Environment structure produced by evaluating
(define (square x) (* x x))
in the global environment.+----------------------+ | other variables | global --->| | env | square: --+ | +-----------|----------+ | ^ (define (square x) | | (* x x)) V | .---.---. | | O | O-+---+ `-|-^---' | V parameters: x body: (* x x)
Now that we have seen how procedures are created, we can describe how procedures are applied. The environment model specifies: To apply a procedure to arguments, create a new environment containing a frame that binds the parameters to the values of the arguments. The enclosing environment of this frame is the environment specified by the procedure. Now, within this new environment, evaluate the procedure body.
To show how this rule is followed, Figure 3-3 illustrates the environment
structure created by evaluating the expression (square 5)
in the global
environment, where square
is the procedure generated in Figure 3-2. Applying the procedure results in the creation of a new environment,
labeled E1 in the figure, that begins with a frame in which x
, the
formal parameter for the procedure, is bound to the argument 5. The pointer
leading upward from this frame shows that the frame’s enclosing environment is
the global environment. The global environment is chosen here, because this is
the environment that is indicated as part of the square
procedure
object. Within E1, we evaluate the body of the procedure, (* x x)
.
Since the value of x
in E1 is 5, the result is (* 5 5)
, or 25.
Figure 3.3: Environment created by evaluating
(square 5)
in the global environment.+------------------------------------+ | other variables | global -->| | env | square: --+ | +-----------|---------------------+--+ | ^ ^ (square 5) | | | V | | .---.---. | +---+--+ | O | O-+---+ E1 -->| x: 5 | `-|-^---' +------+ | V parameters: x body: (* x x)
The environment model of procedure application can be summarized by two rules:
lambda
expression relative to a
given environment. The resulting procedure object is a pair consisting of the
text of the lambda
expression and a pointer to the environment in which
the procedure was created.
We also specify that defining a symbol using define
creates a binding in
the current environment frame and assigns to the symbol the indicated
value.(141) Finally, we
specify the behavior of set!
, the operation that forced us to introduce
the environment model in the first place. Evaluating the expression
(set! <variable> <value>)
in some environment locates the
binding of the variable in the environment and changes that binding to indicate
the new value. That is, one finds the first frame in the environment that
contains a binding for the variable and modifies that frame. If the variable
is unbound in the environment, then set!
signals an error.
These evaluation rules, though considerably more complex than the substitution model, are still reasonably straightforward. Moreover, the evaluation model, though abstract, provides a correct description of how the interpreter evaluates expressions. In Metalinguistic Abstraction we shall see how this model can serve as a blueprint for implementing a working interpreter. The following sections elaborate the details of the model by analyzing some illustrative programs.
[ << ] | [ < ] | [ Up ] | [ > ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
When we introduced the substitution model in section The Substitution Model for Procedure Application we showed how
the combination (f 5)
evaluates to 136, given the following procedure
definitions:
(define (square x) (* x x)) (define (sum-of-squares x y) (+ (square x) (square y))) (define (f a) (sum-of-squares (+ a 1) (* a 2)))
We can analyze the same example using the environment model. Figure 3-4
shows the three procedure objects created by evaluating the definitions of
f
, square
, and sum-of-squares
in the global environment.
Each procedure object consists of some code, together with a pointer to the
global environment.
Figure 3.4: Procedure objects in the global frame.
+--------------------------------------------+ | sum-of-squares: | global -->| square: | env | f: --+ | +------|--------------+--------------+-------+ | ^ | ^ | ^ | | | | | | V | V | V | .---.---. | .---.---. | .---.---. | | O | O-+-+ | O | O-+-+ | O | O-+-+ `-|-^---' `-|-^---' `-|-^---' | | | V V V parameters: a parameters: x parameters: x, y body: (sum-of-squares body: (* x x) body: (+ (square x) (+ a 1) (square y)) (* a 2))
In Figure 3-5 we see the environment structure created by evaluating the
expression (f 5)
. The call to f
creates a new environment E1
beginning with a frame in which a
, the formal parameter of f
, is
bound to the argument 5. In E1, we evaluate the body of f
:
(sum-of-squares (+ a 1) (* a 2))
Figure 3.5: Environments created by evaluating
(f 5)
using the procedures in Figure 3-4.+-----------------------------------------------------+ global -->| | env +-----------------------------------------------------+ ^ ^ ^ ^ (f 5) | | | | +------+ +-------+ +------+ +-------+ E1 -->| a: 5 | E2 ->| x: 6 | E3 -->| x: 6 | E4 -->| x: 10 | | | | y: 10 | | | | | +------+ +-------+ +------+ +-------+ (sum-of-squares (+ (square x) (* x x) (* x x) (+ a 1) (square u)) (+ a 2))
To evaluate this combination, we first evaluate the subexpressions. The first
subexpression, sum-of-squares
, has a value that is a procedure object.
(Notice how this value is found: We first look in the first frame of E1, which
contains no binding for sum-of-squares
. Then we proceed to the
enclosing environment, i.e. the global environment, and find the binding shown
in Figure 3-4.) The other two subexpressions are evaluated by applying
the primitive operations +
and *
to evaluate the two combinations
(+ a 1)
and (* a 2)
to obtain 6 and 10, respectively.
Now we apply the procedure object sum-of-squares
to the arguments 6 and
10. This results in a new environment E2 in which the formal parameters
x
and y
are bound to the arguments. Within E2 we evaluate the
combination (+ (square x) (square y))
. This leads us to evaluate
(square x)
, where square
is found in the global frame and
x
is 6. Once again, we set up a new environment, E3, in which x
is bound to 6, and within this we evaluate the body of square
, which is
(* x x)
. Also as part of applying sum-of-squares
, we must
evaluate the subexpression (square y)
, where y
is 10. This
second call to square
creates another environment, E4, in which
x
, the formal parameter of square
, is bound to 10. And within E4
we must evaluate (* x x)
.
The important point to observe is that each call to square
creates a new
environment containing a binding for x
. We can see here how the
different frames serve to keep separate the different local variables all named
x
. Notice that each frame created by square
points to the global
environment, since this is the environment indicated by the square
procedure object.
After the subexpressions are evaluated, the results are returned. The values
generated by the two calls to square
are added by sum-of-squares
,
and this result is returned by f
. Since our focus here is on the
environment structures, we will not dwell on how these returned values are
passed from call to call; however, this is also an important aspect of the
evaluation process, and we will return to it in detail in Computing with Register Machines.
Exercise 3.9: In section Linear Recursion and Iteration we used the substitution model to analyze two procedures for computing factorials, a recursive version
(define (factorial n) (if (= n 1) 1 (* n (factorial (- n 1)))))and an iterative version
(define (factorial n) (fact-iter 1 1 n)) (define (fact-iter product counter max-count) (if (> counter max-count) product (fact-iter (* counter product) (+ counter 1) max-count)))Show the environment structures created by evaluating
(factorial 6)
using each version of thefactorial
procedure.(142)
[ << ] | [ < ] | [ Up ] | [ > ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
We can turn to the environment model to see how procedures and assignment can be used to represent objects with local state. As an example, consider the “withdrawal processor” from section Local State Variables created by calling the procedure
(define (make-withdraw balance) (lambda (amount) (if (>= balance amount) (begin (set! balance (- balance amount)) balance) "Insufficient funds")))
Let us describe the evaluation of
(define W1 (make-withdraw 100))
followed by
(W1 50) 50
Figure 3-6 shows the result of defining the make-withdraw
procedure in the global environment. This produces a procedure object that
contains a pointer to the global environment. So far, this is no different
from the examples we have already seen, except that the body of the procedure
is itself a lambda
expression.
Figure 3.6: Result of defining
make-withdraw
in the global environment.+---------------------------+ global -->| make-withdraw: --+ | env +------------------|--------+ | ^ V | .---.---. | | O | O-+--+ `-|-^---' | V parameters: balance body: (lambda (amount) (if (>= balance amount) (begin (set! balance (- balance amount)) balance) "Insufficient funds"))
The interesting part of the computation happens when we apply the procedure
make-withdraw
to an argument:
(define W1 (make-withdraw 100))
We begin, as usual, by setting up an environment E1 in which the formal
parameter balance
is bound to the argument 100. Within this
environment, we evaluate the body of make-withdraw
, namely the
lambda
expression. This constructs a new procedure object, whose code
is as specified by the lambda
and whose environment is E1, the
environment in which the lambda
was evaluated to produce the procedure.
The resulting procedure object is the value returned by the call to
make-withdraw
. This is bound to W1
in the global environment,
since the define
itself is being evaluated in the global environment.
Figure 3-7 shows the resulting environment structure.
Figure 3.7: Result of evaluating
(define W1 (make-withdraw 100))
.+-----------------------------------------------+ | make-withdraw: -----------------------+ | global -->| | | | W1: --+ | | +-------|-------------------------------|-------+ | ^ | ^ | | V | | +-------+------+ .---.---. | | E1 -->| balance: 100 | | O | O-+-+ | +--------------+ `-|-^---' V ^ | .---.---. | V +-+-O | O-+------------+ parameters: balance | `---^---' body: ... V parameters: amount body: (if (>= balance amount) (begin (set! balance (- balance amount)) balance) "Insufficient funds")
Now we can analyze what happens when W1
is applied to an argument:
(W1 50) 50
We begin by constructing a frame in which amount
, the formal parameter
of W1
, is bound to the argument 50. The crucial point to observe is
that this frame has as its enclosing environment not the global environment,
but rather the environment E1, because this is the environment that is
specified by the W1
procedure object. Within this new environment, we
evaluate the body of the procedure:
(if (>= balance amount) (begin (set! balance (- balance amount)) balance) "Insufficient funds")
The resulting environment structure is shown in Figure 3-8. The
expression being evaluated references both amount
and balance
.
Amount
will be found in the first frame in the environment, while
balance
will be found by following the enclosing-environment pointer to
E1.
Figure 3.8: Environments created by applying the procedure object
W1
.+---------------------------------------------------+ | make-withdraw: ... | global -->| | env | W1: --+ | +-------|-------------------------------------------+ | ^ | | | +-------+------+ Here is the balance | E1 -->| balance: 100 | that will be changed | +--------------+ by the set!. V ^ ^ .---.---. | +----+ | O | O-+-----------+ | `-|-^---' +------+-----+ | | amount: 50 | V +------------+ parameters: amount (if (>= balance amount) body: ... (begin (set! balance (- balance amount)) balance) "Insufficient funds")
When the set!
is executed, the binding of balance
in E1 is
changed. At the completion of the call to W1
, balance
is 50, and
the frame that contains balance
is still pointed to by the procedure
object W1
. The frame that binds amount
(in which we executed the
code that changed balance
) is no longer relevant, since the procedure
call that constructed it has terminated, and there are no pointers to that
frame from other parts of the environment. The next time W1
is called,
this will build a new frame that binds amount
and whose enclosing
environment is E1. We see that E1 serves as the “place” that holds the local
state variable for the procedure object W1
. Figure 3-9 shows the
situation after the call to W1
.
Figure 3.9: Environments after the call to
W1
.+------------------------------------+ | make-withdraw: ... | global --->| | env | W1: --+ | +-------|----------------------------+ | ^ | | | +------+------+ | E1 --->| balance: 50 | | +-------------+ V ^ .---.---. | | O | O-+---------------+ `-|-^---' | V parameters: amount body: ...
Observe what happens when we create a second “withdraw” object by making
another call to make-withdraw
:
(define W2 (make-withdraw 100))
This produces the environment structure of Figure 3-10, which shows that
W2
is a procedure object, that is, a pair with some code and an
environment. The environment E2 for W2
was created by the call to
make-withdraw
. It contains a frame with its own local binding for
balance
. On the other hand, W1
and W2
have the same code:
the code specified by the lambda
expression in the body of
make-withdraw
.(143) We see here why W1
and
W2
behave as independent objects. Calls to W1
reference the
state variable balance
stored in E1, whereas calls to W2
reference the balance
stored in E2. Thus, changes to the local state of
one object do not affect the other object.
Figure 3.10: Using
(define W2 (make-withdraw 100))
to create a second object.+-------------------------------------------------+ | make-withdraw: ... | global ->| W2: ---------------------------+ | env | W1: --+ | | +-------|------------------------|----------------+ | ^ | ^ | | | | | +------+------+ | +------+-------+ | E1 ->| balance: 50 | | E2 ->| balance: 100 | | +-------------+ | +--------------+ V ^ V ^ .---.---. | .---.---. | | O | O-+----------+ | O | O-+----------+ `-|-^---' `-|-^---' | +----------------------+ V V parameters: amount body: ...
Exercise 3.10: In the
make-withdraw
procedure, the local variablebalance
is created as a parameter ofmake-withdraw
. We could also create the local state variable explicitly, usinglet
, as follows:(define (make-withdraw initial-amount) (let ((balance initial-amount)) (lambda (amount) (if (>= balance amount) (begin (set! balance (- balance amount)) balance) "Insufficient funds"))))Recall from section Constructing Procedures Using
Lambda
thatlet
is simply syntactic sugar for a procedure call:(let ((<var> <exp>)) <body>)is interpreted as an alternate syntax for
((lambda (<var>) <body>) <exp>)Use the environment model to analyze this alternate version of
make-withdraw
, drawing figures like the ones above to illustrate the interactions(define W1 (make-withdraw 100)) (W1 50) (define W2 (make-withdraw 100))Show that the two versions of
make-withdraw
create objects with the same behavior. How do the environment structures differ for the two versions?
[ << ] | [ < ] | [ Up ] | [ > ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
Section Procedures as Black-Box Abstractions introduced the idea that procedures can have internal definitions, thus leading to a block structure as in the following procedure to compute square roots:
(define (sqrt x) (define (good-enough? guess) (< (abs (- (square guess) x)) 0.001)) (define (improve guess) (average guess (/ x guess))) (define (sqrt-iter guess) (if (good-enough? guess) guess (sqrt-iter (improve guess)))) (sqrt-iter 1.0))
Now we can use the environment model to see why these internal definitions
behave as desired. Figure 3-11 shows the point in the evaluation of the
expression (sqrt 2)
where the internal procedure good-enough?
has
been called for the first time with guess
equal to 1.
Figure 3.11:
Sqrt
procedure with internal definitions.+--------------------------------------------------+ global -->| sqrt: --+ | env | | | +---------|----------------------------------------+ V ^ ^ .---.---. | | +----------+-O | O-+---+ +----------+------------+ | `---^---' | x: 2 | V E1 -->| good-enough?: -+ | parameters: x | improve: ... | | body: (define good-enough? ...) | sqrt-iter: ... | | (define improve ...) +----------------|------+ (define sqrt-iter ...) ^ ^ | ^ (sqrt-iter 1.0) | | V | +---------++ | .---.---. | E2 -->| guess: 1 | | | O | O-+-+ +----------+ | `-|-^---' call to sqrt-iter | | | V +---------++ parameters: guess E3 -->| guess: 1 | body: (< (abs ...) +----------+ ...) call to good-enough?
Observe the structure of the environment. Sqrt
is a symbol in the
global environment that is bound to a procedure object whose associated
environment is the global environment. When sqrt
was called, a new
environment E1 was formed, subordinate to the global environment, in which the
parameter x
is bound to 2. The body of sqrt
was then evaluated
in E1. Since the first expression in the body of sqrt
is
(define (good-enough? guess) (< (abs (- (square guess) x)) 0.001))
evaluating this expression defined the procedure good-enough?
in the
environment E1. To be more precise, the symbol good-enough?
was added
to the first frame of E1, bound to a procedure object whose associated
environment is E1. Similarly, improve
and sqrt-iter
were defined
as procedures in E1. For conciseness, Figure 3-11 shows only the
procedure object for good-enough?
.
After the local procedures were defined, the expression (sqrt-iter 1.0)
was evaluated, still in environment E1. So the procedure object bound to
sqrt-iter
in E1 was called with 1 as an argument. This created an
environment E2 in which guess
, the parameter of sqrt-iter
, is
bound to 1. Sqrt-iter
in turn called good-enough?
with the value
of guess
(from E2) as the argument for good-enough?
. This set up
another environment, E3, in which guess
(the parameter of
good-enough?
) is bound to 1. Although sqrt-iter
and
good-enough?
both have a parameter named guess
, these are two
distinct local variables located in different frames. Also, E2 and E3 both
have E1 as their enclosing environment, because the sqrt-iter
and
good-enough?
procedures both have E1 as their environment part. One
consequence of this is that the symbol x
that appears in the body of
good-enough?
will reference the binding of x
that appears in E1,
namely the value of x
with which the original sqrt
procedure was
called.
The environment model thus explains the two key properties that make local procedure definitions a useful technique for modularizing programs:
Exercise 3.11: In section Frames as the Repository of Local State we saw how the environment model described the behavior of procedures with local state. Now we have seen how internal definitions work. A typical message-passing procedure contains both of these aspects. Consider the bank account procedure of section Local State Variables:
(define (make-account balance) (define (withdraw amount) (if (>= balance amount) (begin (set! balance (- balance amount)) balance) "Insufficient funds")) (define (deposit amount) (set! balance (+ balance amount)) balance) (define (dispatch m) (cond ((eq? m 'withdraw) withdraw) ((eq? m 'deposit) deposit) (else (error "Unknown request -- MAKE-ACCOUNT" m)))) dispatch)Show the environment structure generated by the sequence of interactions
(define acc (make-account 50)) ((acc 'deposit) 40) 90 ((acc 'withdraw) 60) 30Where is the local state for
acc
kept? Suppose we define another account(define acc2 (make-account 100))How are the local states for the two accounts kept distinct? Which parts of the environment structure are shared between
acc
andacc2
?
[ << ] | [ < ] | [ Up ] | [ > ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
Chapter 2 dealt with compound data as a means for constructing computational objects that have several parts, in order to model real-world objects that have several aspects. In that chapter we introduced the discipline of data abstraction, according to which data structures are specified in terms of constructors, which create data objects, and selectors, which access the parts of compound data objects. But we now know that there is another aspect of data that Building Abstractions with Data did not address. The desire to model systems composed of objects that have changing state leads us to the need to modify compound data objects, as well as to construct and select from them. In order to model compound objects with changing state, we will design data abstractions to include, in addition to selectors and constructors, operations called mutators, which modify data objects. For instance, modeling a banking system requires us to change account balances. Thus, a data structure for representing bank accounts might admit an operation
(set-balance! <account> <new-value>)
that changes the balance of the designated account to the designated new value. Data objects for which mutators are defined are known as objects mutable data objects.
Building Abstractions with Data introduced pairs as a general-purpose “glue” for synthesizing compound data. We begin this section by defining basic mutators for pairs, so that pairs can serve as building blocks for constructing mutable data objects. These mutators greatly enhance the representational power of pairs, enabling us to build data structures other than the sequences and trees that we worked with in section Hierarchical Data and the Closure Property. We also present some examples of simulations in which complex systems are modeled as collections of objects with local state.
3.3.1 Mutable List Structure | ||
3.3.2 Representing Queues | ||
3.3.3 Representing Tables | ||
3.3.4 A Simulator for Digital Circuits | ||
3.3.5 Propagation of Constraints |
[ << ] | [ < ] | [ Up ] | [ > ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
The basic operations on pairs—cons
, car
, and cdr
—can
be used to construct list structure and to select parts from list structure,
but they are incapable of modifying list structure. The same is true of the
list operations we have used so far, such as append
and list
,
since these can be defined in terms of cons
, car
, and cdr
.
To modify list structures we need new operations.
Figure 3.12: Lists
x
:((a b) c d)
andy
:(e f)
.+---+---+ +---+---+ +---+---+ x -->| * | *-+---->| * | *-+---->| * | / | +-|-+---+ +-|-+---+ +-|-+---+ | V V | +---+ +---+ | | c | | d | | +---+ +---+ | +---+---+ +---+---+ +---------->| * | *-+---->| * | / | +-|-+---+ +-|-+---+ V V +---+ +---+ | a | | b | +---+ +---+ +---+---+ +---+---+ y -->| * | *-+---->| * | / | +-|-+---+ +-|-+---+ V V +---+ +---+ | e | | f | +---+ +---+
Figure 3.13: Effect of
(set-car! x y)
on the lists in Figure 3-12.+---+---+ +---+---+ +---+---+ x -->| * | *-+---->| * | *-+---->| * | / | +-|-+---+ +-|-+---+ +-|-+---+ | V V | +---+ +---+ | | c | | d | | +---+ +---+ | +---+---+ +---+---+ | | * | *-+---->| * | / | | +-|-+---+ +-|-+---+ | V V | +---+ +---+ | | a | | b | | +---+ +---+ +---------->+---+---+ +---+---+ | * | *-+---->| * | / | y -->+-|-+---+ +-|-+---+ V V +---+ +---+ | e | | f | +---+ +---+
Figure 3.14: Effect of
(define z (cons y (cdr x)))
on the lists in Figure 3-12.+---+---+ +---+---+ +---+---+ x -->| * | *-+---->| * | *-+---->| * | / | +-|-+---+ +-->+-|-+---+ +-|-+---+ | | V V | | +---+ +---+ | | | c | | d | | | +---+ +---+ | | +---+---+ +---+---+ +-------+-->| * | *-+---->| * | / | | +-|-+---+ +-|-+---+ +---+---+ | V V z -->| * | *-+-+ +---+ +---+ +-|-+---+ | a | | b | | +---+ +---+ +---------->+---+---+ +---+---+ | * | *-+---->| * | / | y -->+-|-+---+ +-|-+---+ V V +---+ +---+ | e | | f | +---+ +---+
Figure 3.15: Effect of
(set-cdr! x y)
on the lists in Figure 3-12.+---+---+ +---+---+ +---+---+ x -->| * | * | | * | *-+---->| * | / | +-|-+-|-+ +-|-+---+ +-|-+---+ | | V V | | +---+ +---+ | | | c | | d | | | +---+ +---+ | | +---+---+ +---+---+ +---+------>| * | *-+---->| * | / | | +-|-+---+ +-|-+---+ | V V | +---+ +---+ | | a | | b | | +---+ +---+ +------>+---+---+ +---+---+ | * | *-+---->| * | / | y -->+-|-+---+ +-|-+---+ V V +---+ +---+ | e | | f | +---+ +---+
The primitive mutators for pairs are set-car!
and
set-cdr!
. Set-car!
takes two arguments, the first of which must
be a pair. It modifies this pair, replacing the car
pointer by a
pointer to the second argument of set-car!
.(144)
As an example, suppose that x
is bound to the list ((a b) c d)
and y
to the list (e f)
as illustrated in Figure 3-12.
Evaluating the expression (set-car! x y)
modifies the pair to which
x
is bound, replacing its car
by the value of y
. The
result of the operation is shown in Figure 3-13. The structure x
has been modified and would now be printed as ((e f) c d)
. The pairs
representing the list (a b)
, identified by the pointer that was
replaced, are now detached from the original structure.(145)
Compare Figure 3-13 with Figure 3-14, which illustrates the result
of executing (define z (cons y (cdr x)))
with x
and y
bound to the original lists of Figure 3-12. The variable z
is now
bound to a new pair created by the cons
operation; the list to which
x
is bound is unchanged.
The set-cdr!
operation is similar to set-car!
. The only
difference is that the cdr
pointer of the pair, rather than the
car
pointer, is replaced. The effect of executing (set-cdr! x y)
on the lists of Figure 3-12 is shown in Figure 3-15. Here the
cdr
pointer of x
has been replaced by the pointer to (e
f)
. Also, the list (c d)
, which used to be the cdr
of x
,
is now detached from the structure.
Cons
builds new list structure by creating new pairs, while
set-car!
and set-cdr!
modify existing pairs. Indeed, we could
implement cons
in terms of the two mutators, together with a procedure
get-new-pair
, which returns a new pair that is not part of any existing
list structure. We obtain the new pair, set its car
and cdr
pointers to the designated objects, and return the new pair as the result of
the cons
.(146)
(define (cons x y) (let ((new (get-new-pair))) (set-car! new x) (set-cdr! new y) new))
Exercise 3.12: The following procedure for appending lists was introduced in section Representing Sequences:
(define (append x y) (if (null? x) y (cons (car x) (append (cdr x) y))))
Append
forms a new list by successivelycons
ing the elements ofx
ontoy
. The procedureappend!
is similar toappend
, but it is a mutator rather than a constructor. It appends the lists by splicing them together, modifying the final pair ofx
so that itscdr
is nowy
. (It is an error to callappend!
with an emptyx
.)(define (append! x y) (set-cdr! (last-pair x) y) x)Here
last-pair
is a procedure that returns the last pair in its argument:(define (last-pair x) (if (null? (cdr x)) x (last-pair (cdr x))))Consider the interaction
(define x (list 'a 'b)) (define y (list 'c 'd)) (define z (append x y)) z (a b c d) (cdr x) <response> (define w (append! x y)) w (a b c d) (cdr x) <response>What are the missing <response>s? Draw box-and-pointer diagrams to explain your answer.
Exercise 3.13: Consider the following
make-cycle
procedure, which uses thelast-pair
procedure defined in Exercise 3-12:(define (make-cycle x) (set-cdr! (last-pair x) x) x)Draw a box-and-pointer diagram that shows the structure
z
created by(define z (make-cycle (list 'a 'b 'c)))What happens if we try to compute
(last-pair z)
?
Exercise 3.14: The following procedure is quite useful, although obscure:
(define (mystery x) (define (loop x y) (if (null? x) y (let ((temp (cdr x))) (set-cdr! x y) (loop temp x)))) (loop x '()))
Loop
uses the “temporary” variabletemp
to hold the old value of thecdr
ofx
, since theset-cdr!
on the next line destroys thecdr
. Explain whatmystery
does in general. Supposev
is defined by(define v (list 'a 'b 'c 'd))
. Draw the box-and-pointer diagram that represents the list to whichv
is bound. Suppose that we now evaluate(define w (mystery v))
. Draw box-and-pointer diagrams that show the structuresv
andw
after evaluating this expression. What would be printed as the values ofv
andw
?
We mentioned in section The Costs of Introducing Assignment the theoretical issues of “sameness” and “change” raised by the introduction of assignment. These issues arise in practice when individual pairs are shared among different data objects. For example, consider the structure formed by
(define x (list 'a 'b)) (define z1 (cons x x))
As shown in Figure 3-16, z1
is a pair whose car
and
cdr
both point to the same pair x
. This sharing of x
by
the car
and cdr
of z1
is a consequence of the
straightforward way in which cons
is implemented. In general, using
cons
to construct lists will result in an interlinked structure of pairs
in which many individual pairs are shared by many different structures.
Figure 3.16: The list
z1
formed by(cons x x)
.+---+---+ z1 -->| * | * | +-|-+-|-+ V V +---+---+ +---+---+ x -->| * | *-+---->| * | / | +-|-+---+ +-|-+---+ V V +---+ +---+ | a | | b | +---+ +---+
Figure 3.17: The list
z2
formed by(cons (list 'a 'b) (list 'a 'b))
.+---+---+ +---+---+ +---+---+ z2 -->| * | *-+---->| * | *-+---->| * | / | +-|-+---+ +-|-+---+ +-|-+---+ | V V | +---+ +---+ | | a | | b | | +---+ +---+ | ^ ^ | | | | +-|-+---+ +-|-+---+ +---------->| * | *-+---->| * | / | +---+---+ +---+---+
In contrast to Figure 3-16, Figure 3-17 shows the structure created by
(define z2 (cons (list 'a 'b) (list 'a 'b)))
In this structure, the pairs in the two (a b)
lists are distinct,
although the actual symbols are shared.(147)
When thought of as a list, z1
and z2
both represent “the same”
list, ((a b) a b)
. In general, sharing is completely undetectable if we
operate on lists using only cons
, car
, and cdr
. However,
if we allow mutators on list structure, sharing becomes significant. As an
example of the difference that sharing can make, consider the following
procedure, which modifies the car
of the structure to which it is
applied:
(define (set-to-wow! x) (set-car! (car x) 'wow) x)
Even though z1
and z2
are “the same” structure, applying
set-to-wow!
to them yields different results. With z1
, altering
the car
also changes the cdr
, because in z1
the car
and the cdr
are the same pair. With z2
, the car
and
cdr
are distinct, so set-to-wow!
modifies only the car
:
z1 ((a b) a b) (set-to-wow! z1) ((wow b) wow b) z2 ((a b) a b) (set-to-wow! z2) ((wow b) a b)
One way to detect sharing in list structures is to use the predicate
eq?
, which we introduced in section Quotation as a way to test whether
two symbols are equal. More generally, (eq? x y)
tests whether
x
and y
are the same object (that is, whether x
and
y
are equal as pointers). Thus, with z1
and z2
as defined
in figures Figure 3-16 and Figure 3-17, (eq? (car z1) (cdr
z1))
is true and (eq? (car z2) (cdr z2))
is false.
As will be seen in the following sections, we can exploit sharing to greatly
extend the repertoire of data structures that can be represented by pairs. On
the other hand, sharing can also be dangerous, since modifications made to
structures will also affect other structures that happen to share the modified
parts. The mutation operations set-car!
and set-cdr!
should be
used with care; unless we have a good understanding of how our data objects are
shared, mutation can have unanticipated results.(148)
Exercise 3.15: Draw box-and-pointer diagrams to explain the effect of
set-to-wow!
on the structuresz1
andz2
above.
Exercise 3.16: Ben Bitdiddle decides to write a procedure to count the number of pairs in any list structure. “It’s easy,” he reasons. “The number of pairs in any structure is the number in the
car
plus the number in thecdr
plus one more to count the current pair.” So Ben writes the following procedure:(define (count-pairs x) (if (not (pair? x)) 0 (+ (count-pairs (car x)) (count-pairs (cdr x)) 1)))Show that this procedure is not correct. In particular, draw box-and-pointer diagrams representing list structures made up of exactly three pairs for which Ben’s procedure would return 3; return 4; return 7; never return at all.
Exercise 3.17: Devise a correct version of the
count-pairs
procedure of Exercise 3-16 that returns the number of distinct pairs in any structure. (Hint: Traverse the structure, maintaining an auxiliary data structure that is used to keep track of which pairs have already been counted.)
Exercise 3.18: Write a procedure that examines a list and determines whether it contains a cycle, that is, whether a program that tried to find the end of the list by taking successive
cdr
s would go into an infinite loop. Exercise 3-13 constructed such lists.
Exercise 3.19: Redo Exercise 3-18 using an algorithm that takes only a constant amount of space. (This requires a very clever idea.)
When we introduced compound data, we observed in section What Is Meant by Data? that pairs can be represented purely in terms of procedures:
(define (cons x y) (define (dispatch m) (cond ((eq? m 'car) x) ((eq? m 'cdr) y) (else (error "Undefined operation -- CONS" m)))) dispatch) (define (car z) (z 'car)) (define (cdr z) (z 'cdr))
The same observation is true for mutable data. We can implement mutable data
objects as procedures using assignment and local state. For instance, we can
extend the above pair implementation to handle set-car!
and
set-cdr!
in a manner analogous to the way we implemented bank accounts
using make-account
in section Local State Variables:
(define (cons x y) (define (set-x! v) (set! x v)) (define (set-y! v) (set! y v)) (define (dispatch m) (cond ((eq? m 'car) x) ((eq? m 'cdr) y) ((eq? m 'set-car!) set-x!) ((eq? m 'set-cdr!) set-y!) (else (error "Undefined operation -- CONS" m)))) dispatch) (define (car z) (z 'car)) (define (cdr z) (z 'cdr)) (define (set-car! z new-value) ((z 'set-car!) new-value) z) (define (set-cdr! z new-value) ((z 'set-cdr!) new-value) z)
Assignment is all that is needed, theoretically, to account for the behavior of
mutable data. As soon as we admit set!
to our language, we raise all
the issues, not only of assignment, but of mutable data in general.(149)
Exercise 3.20: Draw environment diagrams to illustrate the evaluation of the sequence of expressions
(define x (cons 1 2)) (define z (cons x x)) (set-car! (cdr z) 17) (car x) 17using the procedural implementation of pairs given above. (Compare Exercise 3-11.)
[ << ] | [ < ] | [ Up ] | [ > ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
The mutators set-car!
and set-cdr!
enable us to use pairs to
construct data structures that cannot be built with cons
, car
,
and cdr
alone. This section shows how to use pairs to represent a data
structure called a queue. Section Representing Tables will show how to represent data
structures called tables.
A
queue is a sequence in which items are inserted at one end (called
the
rear of the queue) and deleted from the other end (the
front). Figure 3-18 shows an initially empty queue in which
the items a
and b
are inserted. Then a
is removed,
c
and d
are inserted, and b
is removed. Because items are
always removed in the order in which they are inserted, a queue is sometimes
called a
FIFO (first in, first out) buffer.
Figure 3.18: Queue operations.
Operation Resulting Queue (define q (make-queue)) (insert-queue! q 'a) a (insert-queue! q 'b) a b (delete-queue! q) b (insert-queue! q 'c) b c (insert-queue! q 'd) b c d (delete-queue! q) c d
In terms of data abstraction, we can regard a queue as defined by the following set of operations:
(make-queue)
returns an empty queue (a queue containing
no items).
(empty-queue? <queue>)
tests if the queue is empty.
(front-queue <queue>)
returns the object at the front of the queue, signaling an error if the queue is empty; it does not modify the queue.
(insert-queue! <queue> <item>)
inserts the item at the rear of the queue and returns the modified queue as its value.
(delete-queue! <queue>)
removes the item at the front of the queue and returns the modified queue as its value, signaling an error if the queue is empty before the deletion.
Because a queue is a sequence of items, we could certainly represent it as an
ordinary list; the front of the queue would be the car
of the list,
inserting an item in the queue would amount to appending a new element at the
end of the list, and deleting an item from the queue would just be taking the
cdr
of the list. However, this representation is inefficient, because
in order to insert an item we must scan the list until we reach the end. Since
the only method we have for scanning a list is by successive cdr
operations, this scanning requires [theta](n) steps for a list of n
items. A simple modification to the list representation overcomes this
disadvantage by allowing the queue operations to be implemented so that they
require [theta](1) steps; that is, so that the number of steps needed is
independent of the length of the queue.
The difficulty with the list representation arises from the need to scan to find the end of the list. The reason we need to scan is that, although the standard way of representing a list as a chain of pairs readily provides us with a pointer to the beginning of the list, it gives us no easily accessible pointer to the end. The modification that avoids the drawback is to represent the queue as a list, together with an additional pointer that indicates the final pair in the list. That way, when we go to insert an item, we can consult the rear pointer and so avoid scanning the list.
A queue is represented, then, as a pair of pointers, front-ptr
and
rear-ptr
, which indicate, respectively, the first and last pairs in an
ordinary list. Since we would like the queue to be an identifiable object, we
can use cons
to combine the two pointers. Thus, the queue itself will
be the cons
of the two pointers. Figure 3-19 illustrates this
representation.
Figure 3.19: Implementation of a queue as a list with front and rear pointers.
+---+---+ q -->| * | *-+-------------------+ +-|-+---+ | | | | front-ptr | rear-ptr V V +---+---+ +---+---+ +---+---+ | * | *-+--->| * | *-+--->| * | / | +-|-+---+ +-|-+---+ +-|-+---+ V V V +---+ +---+ +---+ | a | | b | | c | +---+ +---+ +---+
To define the queue operations we use the following procedures, which enable us to select and to modify the front and rear pointers of a queue:
(define (front-ptr queue) (car queue)) (define (rear-ptr queue) (cdr queue)) (define (set-front-ptr! queue item) (set-car! queue item)) (define (set-rear-ptr! queue item) (set-cdr! queue item))
Now we can implement the actual queue operations. We will consider a queue to be empty if its front pointer is the empty list:
(define (empty-queue? queue) (null? (front-ptr queue)))
The make-queue
constructor returns, as an initially empty queue, a pair
whose car
and cdr
are both the empty list:
(define (make-queue) (cons '() '()))
To select the item at the front of the queue, we return the car
of the
pair indicated by the front pointer:
(define (front-queue queue) (if (empty-queue? queue) (error "FRONT called with an empty queue" queue) (car (front-ptr queue))))
To insert an item in a queue, we follow the method whose result is indicated in
Figure 3-20. We first create a new pair whose car
is the item to
be inserted and whose cdr
is the empty list. If the queue was initially
empty, we set the front and rear pointers of the queue to this new pair.
Otherwise, we modify the final pair in the queue to point to the new pair, and
also set the rear pointer to the new pair.
Figure 3.20: Result of using
(insert-queue! q 'd)
on the queue of Figure 3-19.+---+---+ q -->| * | *-+--------------------------------+ +-|-+---+ | | | | front-ptr | rear-ptr V V +---+---+ +---+---+ +---+---+ +---+---+ | * | *-+--->| * | *-+--->| * | *-+--->| * | / | +-|-+---+ +-|-+---+ +-|-+---+ +-|-+---+ V V V V +---+ +---+ +---+ +---+ | a | | b | | c | | d | +---+ +---+ +---+ +---+
(define (insert-queue! queue item) (let ((new-pair (cons item '()))) (cond ((empty-queue? queue) (set-front-ptr! queue new-pair) (set-rear-ptr! queue new-pair) queue) (else (set-cdr! (rear-ptr queue) new-pair) (set-rear-ptr! queue new-pair) queue))))
To delete the item at the front of the queue, we merely modify the front
pointer so that it now points at the second item in the queue, which can be
found by following the cdr
pointer of the first item (see Figure 3-21):(150)
Figure 3.21: Result of using
(delete-queue! q)
on the queue of Figure 3-20.+---+---+ q -->| * | *-+--------------------------------+ +-|-+---+ | +------------+ | front-ptr | | rear-ptr V V +---+---+ +---+---+ +---+---+ +---+---+ | * | *-+--->| * | *-+--->| * | *-+--->| * | / | +-|-+---+ +-|-+---+ +-|-+---+ +-|-+---+ V V V V +---+ +---+ +---+ +---+ | a | | b | | c | | d | +---+ +---+ +---+ +---+
(define (delete-queue! queue) (cond ((empty-queue? queue) (error "DELETE! called with an empty queue" queue)) (else (set-front-ptr! queue (cdr (front-ptr queue))) queue)))
Exercise 3.21: Ben Bitdiddle decides to test the queue implementation described above. He types in the procedures to the Lisp interpreter and proceeds to try them out:
(define q1 (make-queue)) (insert-queue! q1 'a) ((a) a) (insert-queue! q1 'b) ((a b) b) (delete-queue! q1) ((b) b) (delete-queue! q1) (() b)“It’s all wrong!” he complains. “The interpreter’s response shows that the last item is inserted into the queue twice. And when I delete both items, the second
b
is still there, so the queue isn’t empty, even though it’s supposed to be.” Eva Lu Ator suggests that Ben has misunderstood what is happening. “It’s not that the items are going into the queue twice,” she explains. “It’s just that the standard Lisp printer doesn’t know how to make sense of the queue representation. If you want to see the queue printed correctly, you’ll have to define your own print procedure for queues.” Explain what Eva Lu is talking about. In particular, show why Ben’s examples produce the printed results that they do. Define a procedureprint-queue
that takes a queue as input and prints the sequence of items in the queue.
Exercise 3.22: Instead of representing a queue as a pair of pointers, we can build a queue as a procedure with local state. The local state will consist of pointers to the beginning and the end of an ordinary list. Thus, the
make-queue
procedure will have the form(define (make-queue) (let ((front-ptr … ) (rear-ptr … )) <definitions of internal procedures> (define (dispatch m) …) dispatch))Complete the definition of
make-queue
and provide implementations of the queue operations using this representation.
Exercise 3.23: A deque (“double-ended queue”) is a sequence in which items can be inserted and deleted at either the front or the rear. Operations on deques are the constructor
make-deque
, the predicateempty-deque?
, selectorsfront-deque
andrear-deque
, and mutatorsfront-insert-deque!
,rear-insert-deque!
,front-delete-deque!
, andrear-delete-deque!
. Show how to represent deques using pairs, and give implementations of the operations.(151) All operations should be accomplished in [theta](1) steps.
[ << ] | [ < ] | [ Up ] | [ > ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
When we studied various ways of representing sets in Building Abstractions with Data, we mentioned in section Example: Representing Sets the task of maintaining a table of records indexed by identifying keys. In the implementation of data-directed programming in section Data-Directed Programming and Additivity, we made extensive use of two-dimensional tables, in which information is stored and retrieved using two keys. Here we see how to build tables as mutable list structures.
We first consider a one-dimensional table, in which each value is stored under
a single key. We implement the table as a list of records, each of which is
implemented as a pair consisting of a key and the associated value. The records
are glued together to form a list by pairs whose car
s point to
successive records. These gluing pairs are called the
backbone of
the table. In order to have a place that we can change when we add a new
record to the table, we build the table as a
headed list. A headed
list has a special backbone pair at the beginning, which holds a dummy
“record”—in this case the arbitrarily chosen symbol *table*
.
Figure 3-22 shows the box-and-pointer diagram for the table
a: 1 b: 2 c: 3
Figure 3.22: A table represented as a headed list.
+---+---+ +---+---+ +---+---+ +---+---+ | * | *-+--->| * | *-+--->| * | *-+--->| * | / | +-|-+---+ +-|-+---+ +-|-+---+ +-|-+---+ | | | | V V V V +---------+ +---+---+ +---+---+ +---+---+ | *table* | | * | * | | * | * | | * | * | +---------+ +-|-+-|-+ +-|-+-|-+ +-|-+-|-+ | | | | | | V V V V V V +---+ +---+ +---+ +---+ +---+ +---+ | a | | 1 | | b | | 2 | | c | | 3 | +---+ +---+ +---+ +---+ +---+ +---+
To extract information from a table we use the lookup
procedure, which
takes a key as argument and returns the associated value (or false if there is
no value stored under that key). Lookup
is defined in terms of the
assoc
operation, which expects a key and a list of records as arguments.
Note that assoc
never sees the dummy record. Assoc
returns the
record that has the given key as its car
.(152) Lookup
then checks to see that the resulting record
returned by assoc
is not false, and returns the value (the cdr
)
of the record.
(define (lookup key table) (let ((record (assoc key (cdr table)))) (if record (cdr record) false))) (define (assoc key records) (cond ((null? records) false) ((equal? key (caar records)) (car records)) (else (assoc key (cdr records)))))
To insert a value in a table under a specified key, we first use assoc
to see if there is already a record in the table with this key. If not, we
form a new record by cons
ing the key with the value, and insert this at
the head of the table’s list of records, after the dummy record. If there
already is a record with this key, we set the cdr
of this record to the
designated new value. The header of the table provides us with a fixed
location to modify in order to insert the new record.(153)
(define (insert! key value table) (let ((record (assoc key (cdr table)))) (if record (set-cdr! record value) (set-cdr! table (cons (cons key value) (cdr table))))) 'ok)
To construct a new table, we simply create a list containing the symbol
*table*
:
(define (make-table) (list '*table*))
In a two-dimensional table, each value is indexed by two keys. We can construct such a table as a one-dimensional table in which each key identifies a subtable. Figure 3-23 shows the box-and-pointer diagram for the table
math: +: 43 -: 45 *: 42 letters: a: 97 b: 98
which has two subtables. (The subtables don’t need a special header symbol, since the key that identifies the subtable serves this purpose.)
Figure 3.23: A two-dimensional table.
table | V +---+---+ +---+---+ +---+---+ | * | *-+-->| * | *-+-->| * | / | +-|-+---+ +-|-+---+ +-|-+---+ V | V +-------+ | +---+---+ +---+---+ +---+---+ |*table*| | | * | *-+-->| * | *-+-->| * | / | +-------+ | +-|-+---+ +-|-+---+ +-|-+---+ | V V V | +-------+ +---+---+ +---+---+ | |letters| | * | * | | * | * | | +-------+ +-|-+-|-+ +-|-+-|-+ | V V V V | +---+ +---+ +---+ +---+ | | a | | 97| | b | | 98| | +---+ +---+ +---+ +---+ V +---+---+ +---+---+ +---+---+ +---+---+ | * | *-+-->| * | *-+-->| * | *-+-->| * | / | +-|-+---+ +-|-+---+ +-|-+---+ +-|-+---+ V V V V +------+ +---+---+ +---+---+ +---+---+ | math | | * | * | | * | * | | * | * | +------+ +-|-+-|-+ +-|-+-|-+ +-|-+-|-+ V V V V V V +---+ +---+ +---+ +---+ +---+ +---+ | + | | 43| | - | | 45| | * | | 42| +---+ +---+ +---+ +---+ +---+ +---+
When we look up an item, we use the first key to identify the correct subtable. Then we use the second key to identify the record within the subtable.
(define (lookup key-1 key-2 table) (let ((subtable (assoc key-1 (cdr table)))) (if subtable (let ((record (assoc key-2 (cdr subtable)))) (if record (cdr record) false)) false)))
To insert a new item under a pair of keys, we use assoc
to see if there
is a subtable stored under the first key. If not, we build a new subtable
containing the single record (key-2
, value
) and insert it into
the table under the first key. If a subtable already exists for the first key,
we insert the new record into this subtable, using the insertion method for
one-dimensional tables described above:
(define (insert! key-1 key-2 value table) (let ((subtable (assoc key-1 (cdr table)))) (if subtable (let ((record (assoc key-2 (cdr subtable)))) (if record (set-cdr! record value) (set-cdr! subtable (cons (cons key-2 value) (cdr subtable))))) (set-cdr! table (cons (list key-1 (cons key-2 value)) (cdr table))))) 'ok)
The lookup
and insert!
operations defined above take the table as
an argument. This enables us to use programs that access more than one table.
Another way to deal with multiple tables is to have separate lookup
and
insert!
procedures for each table. We can do this by representing a
table procedurally, as an object that maintains an internal table as part of
its local state. When sent an appropriate message, this “table object”
supplies the procedure with which to operate on the internal table. Here is a
generator for two-dimensional tables represented in this fashion:
(define (make-table) (let ((local-table (list '*table*))) (define (lookup key-1 key-2) (let ((subtable (assoc key-1 (cdr local-table)))) (if subtable (let ((record (assoc key-2 (cdr subtable)))) (if record (cdr record) false)) false))) (define (insert! key-1 key-2 value) (let ((subtable (assoc key-1 (cdr local-table)))) (if subtable (let ((record (assoc key-2 (cdr subtable)))) (if record (set-cdr! record value) (set-cdr! subtable (cons (cons key-2 value) (cdr subtable))))) (set-cdr! local-table (cons (list key-1 (cons key-2 value)) (cdr local-table))))) 'ok) (define (dispatch m) (cond ((eq? m 'lookup-proc) lookup) ((eq? m 'insert-proc!) insert!) (else (error "Unknown operation -- TABLE" m)))) dispatch))
Using make-table
, we could implement the get
and put
operations used in section Data-Directed Programming and Additivity for data-directed programming, as
follows:
(define operation-table (make-table)) (define get (operation-table 'lookup-proc)) (define put (operation-table 'insert-proc!))
Get
takes as arguments two keys, and put
takes as arguments two
keys and a value. Both operations access the same local table, which is
encapsulated within the object created by the call to make-table
.
Exercise 3.24: In the table implementations above, the keys are tested for equality using
equal?
(called byassoc
). This is not always the appropriate test. For instance, we might have a table with numeric keys in which we don’t need an exact match to the number we’re looking up, but only a number within some tolerance of it. Design a table constructormake-table
that takes as an argument asame-key?
procedure that will be used to test “equality” of keys.Make-table
should return adispatch
procedure that can be used to access appropriatelookup
andinsert!
procedures for a local table.
Exercise 3.25: Generalizing one- and two-dimensional tables, show how to implement a table in which values are stored under an arbitrary number of keys and different values may be stored under different numbers of keys. The
lookup
andinsert!
procedures should take as input a list of keys used to access the table.
Exercise 3.26: To search a table as implemented above, one needs to scan through the list of records. This is basically the unordered list representation of section Example: Representing Sets. For large tables, it may be more efficient to structure the table in a different manner. Describe a table implementation where the (key, value) records are organized using a binary tree, assuming that keys can be ordered in some way (e.g., numerically or alphabetically). (Compare Exercise 2-66 of Building Abstractions with Data.)
Exercise 3.27: Memoization (also called tabulation) is a technique that enables a procedure to record, in a local table, values that have previously been computed. This technique can make a vast difference in the performance of a program. A memoized procedure maintains a table in which values of previous calls are stored using as keys the arguments that produced the values. When the memoized procedure is asked to compute a value, it first checks the table to see if the value is already there and, if so, just returns that value. Otherwise, it computes the new value in the ordinary way and stores this in the table. As an example of memoization, recall from section Tree Recursion the exponential process for computing Fibonacci numbers:
(define (fib n) (cond ((= n 0) 0) ((= n 1) 1) (else (+ (fib (- n 1)) (fib (- n 2))))))The memoized version of the same procedure is
(define memo-fib (memoize (lambda (n) (cond ((= n 0) 0) ((= n 1) 1) (else (+ (memo-fib (- n 1)) (memo-fib (- n 2))))))))where the memoizer is defined as
(define (memoize f) (let ((table (make-table))) (lambda (x) (let ((previously-computed-result (lookup x table))) (or previously-computed-result (let ((result (f x))) (insert! x result table) result))))))Draw an environment diagram to analyze the computation of
(memo-fib 3)
. Explain whymemo-fib
computes the nth Fibonacci number in a number of steps proportional to n. Would the scheme still work if we had simply definedmemo-fib
to be(memoize fib)
?
[ << ] | [ < ] | [ Up ] | [ > ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
Designing complex digital systems, such as computers, is an important engineering activity. Digital systems are constructed by interconnecting simple elements. Although the behavior of these individual elements is simple, networks of them can have very complex behavior. Computer simulation of proposed circuit designs is an important tool used by digital systems engineers. In this section we design a system for performing digital logic simulations. This system typifies a kind of program called an event-driven simulation, in which actions (“events”) trigger further events that happen at a later time, which in turn trigger more events, and so so.
Our computational model of a circuit will be composed of objects that correspond to the elementary components from which the circuit is constructed. There are wires, which carry digital signals. A digital signal may at any moment have only one of two possible values, 0 and 1. There are also various types of digital function boxes, which connect wires carrying input signals to other output wires. Such boxes produce output signals computed from their input signals. The output signal is delayed by a time that depends on the type of the function box. For example, an inverter is a primitive function box that inverts its input. If the input signal to an inverter changes to 0, then one inverter-delay later the inverter will change its output signal to 1. If the input signal to an inverter changes to 1, then one inverter-delay later the inverter will change its output signal to 0. We draw an inverter symbolically as in Figure 3-24. An and-gate, also shown in Figure 3-24, is a primitive function box with two inputs and one output. It drives its output signal to a value that is the logical and of the inputs. That is, if both of its input signals become 1, then one and-gate-delay time later the and-gate will force its output signal to be 1; otherwise the output will be 0. An or-gate is a similar two-input primitive function box that drives its output signal to a value that is the logical or of the inputs. That is, the output will become 1 if at least one of the input signals is 1; otherwise the output will become 0.
Figure 3.24: Primitive functions in the digital logic simulator.
__ ___ |\ --| \ --\ \ --| >o-- | )-- ) >-- |/ --|__/ --/__/ Inverter And-gate Or-gate
We can connect primitive functions together to construct more complex functions. To accomplish this we wire the outputs of some function boxes to the inputs of other function boxes. For example, the half-adder circuit shown in Figure 3-25 consists of an or-gate, two and-gates, and an inverter. It takes two input signals, A and B, and has two output signals, S and C. S will become 1 whenever precisely one of A and B is 1, and C will become 1 whenever A and B are both 1. We can see from the figure that, because of the delays involved, the outputs may be generated at different times. Many of the difficulties in the design of digital circuits arise from this fact.
Figure 3.25: A half-adder circuit.
+--------------------------------------+ | ____ | A --------*---\ \ D ___ | | | > >---------------| \ | | +--|---/___/ | )----- S | | | |\ E +--|___/ | | | | +--| >o---+ | | | | ___ | |/ | | | +---| \ | | | | | )--*----------------------- C B -----*------|___/ | | | +--------------------------------------+
We will now build a program for modeling the digital logic circuits we wish to study. The program will construct computational objects modeling the wires, which will “hold” the signals. Function boxes will be modeled by procedures that enforce the correct relationships among the signals.
One basic element of our simulation will be a procedure make-wire
, which
constructs wires. For example, we can construct six wires as follows:
(define a (make-wire)) (define b (make-wire)) (define c (make-wire)) (define d (make-wire)) (define e (make-wire)) (define s (make-wire))
We attach a function box to a set of wires by calling a procedure that constructs that kind of box. The arguments to the constructor procedure are the wires to be attached to the box. For example, given that we can construct and-gates, or-gates, and inverters, we can wire together the half-adder shown in Figure 3-25:
(or-gate a b d) ok (and-gate a b c) ok (inverter c e) ok (and-gate d e s) ok
Better yet, we can explicitly name this operation by defining a procedure
half-adder
that constructs this circuit, given the four external wires
to be attached to the half-adder:
(define (half-adder a b s c) (let ((d (make-wire)) (e (make-wire))) (or-gate a b d) (and-gate a b c) (inverter c e) (and-gate d e s) 'ok))
The advantage of making this definition is that we can use half-adder
itself as a building block in creating more complex circuits. Figure 3-26, for example, shows a
full-adder composed of two half-adders
and an or-gate.(154) We can construct a full-adder as follows:
(define (full-adder a b c-in sum c-out) (let ((s (make-wire)) (c1 (make-wire)) (c2 (make-wire))) (half-adder b c-in s c1) (half-adder a s sum c2) (or-gate c1 c2 c-out) 'ok))
Having defined full-adder
as a procedure, we can now use it as a
building block for creating still more complex circuits. (For example, see
Exercise 3-30.)
Figure 3.26: A full-adder circuit.
+----------------------------------+ | +-------+ | A -----------------+ full +-------------- SUM | +-------+ | adder | ____ | B -----+ half +---+ +---\ \ | | | adder | +-------+ >or >----- Cout C -----+ +---------------/___/ | | +-------+ | +----------------------------------+
In essence, our simulator provides us with the tools to construct a language of circuits. If we adopt the general perspective on languages with which we approached the study of Lisp in section The Elements of Programming, we can say that the primitive function boxes form the primitive elements of the language, that wiring boxes together provides a means of combination, and that specifying wiring patterns as procedures serves as a means of abstraction.
The primitive function boxes implement the “forces” by which a change in the signal on one wire influences the signals on other wires. To build function boxes, we use the following operations on wires:
(get-signal <wire>)
(set-signal! <wire> <new value>)
(add-action! <wire> <procedure of no arguments>)
In addition, we will make use of a procedure after-delay
that takes a
time delay and a procedure to be run and executes the given procedure after the
given delay.
Using these procedures, we can define the primitive digital logic functions.
To connect an input to an output through an inverter, we use add-action!
to associate with the input wire a procedure that will be run whenever the
signal on the input wire changes value. The procedure computes the
logical-not
of the input signal, and then, after one
inverter-delay
, sets the output signal to be this new value:
(define (inverter input output) (define (invert-input) (let ((new-value (logical-not (get-signal input)))) (after-delay inverter-delay (lambda () (set-signal! output new-value))))) (add-action! input invert-input) 'ok) (define (logical-not s) (cond ((= s 0) 1) ((= s 1) 0) (else (error "Invalid signal" s))))
An and-gate is a little more complex. The action procedure must be run if
either of the inputs to the gate changes. It computes the logical-and
(using a procedure analogous to logical-not
) of the values of the
signals on the input wires and sets up a change to the new value to occur on
the output wire after one and-gate-delay
.
(define (and-gate a1 a2 output) (define (and-action-procedure) (let ((new-value (logical-and (get-signal a1) (get-signal a2)))) (after-delay and-gate-delay (lambda () (set-signal! output new-value))))) (add-action! a1 and-action-procedure) (add-action! a2 and-action-procedure) 'ok)
Exercise 3.28: Define an or-gate as a primitive function box. Your
or-gate
constructor should be similar toand-gate
.
Exercise 3.29: Another way to construct an or-gate is as a compound digital logic device, built from and-gates and inverters. Define a procedure
or-gate
that accomplishes this. What is the delay time of the or-gate in terms ofand-gate-delay
andinverter-delay
?
Exercise 3.30: Figure 3-27 shows a ripple-carry adder formed by stringing together n full-adders. This is the simplest form of parallel adder for adding two n-bit binary numbers. The inputs A_1, A_2, A_3, …, A_n and B_1, B_2, B_3, …, B_n are the two binary numbers to be added (each A_k and B_k is a 0 or a 1). The circuit generates S_1, S_2, S_3, …, S_n, the n bits of the sum, and C, the carry from the addition. Write a procedure
ripple-carry-adder
that generates this circuit. The procedure should take as arguments three lists of n wires each—the A_k, the B_k, and the S_k—and also another wire C. The major drawback of the ripple-carry adder is the need to wait for the carry signals to propagate. What is the delay needed to obtain the complete output from an n-bit ripple-carry adder, expressed in terms of the delays for and-gates, or-gates, and inverters?
Figure 3.27: A ripple-carry adder for n-bit numbers.
: : : : A_1 B_1 C_1 A_2 B_2 C_2 A_3 B_3 C_3: : A_n B_n C_n=0 : | | +---+ | | +---+ | | +----- : | | +- | | | | | | | | | | | | : : | | | : ++---+---++ | ++---+---++ | ++---+---++ : : ++---+---++ : | FA | | | FA | | | FA | : : | FA | : +--+---+--+ | +--+---+--+ | +--+---+--+ : : +--+---+--+ : | | | | | | | | : : | | C ------+ | +-----+ | +-----+ | : ------+ | : | C_1 | C_2 | : :C_(n-1) | : | | | : : | S_1 S_2 S_3 S_n
A wire in our simulation will be a computational object with two local state
variables: a signal-value
(initially taken to be 0) and a collection of
action-procedures
to be run when the signal changes value. We implement
the wire, using message-passing style, as a collection of local procedures
together with a dispatch
procedure that selects the appropriate local
operation, just as we did with the simple bank-account object in section
Local State Variables:
(define (make-wire) (let ((signal-value 0) (action-procedures '())) (define (set-my-signal! new-value) (if (not (= signal-value new-value)) (begin (set! signal-value new-value) (call-each action-procedures)) 'done)) (define (accept-action-procedure! proc) (set! action-procedures (cons proc action-procedures)) (proc)) (define (dispatch m) (cond ((eq? m 'get-signal) signal-value) ((eq? m 'set-signal!) set-my-signal!) ((eq? m 'add-action!) accept-action-procedure!) (else (error "Unknown operation -- WIRE" m)))) dispatch))
The local procedure set-my-signal!
tests whether the new signal value
changes the signal on the wire. If so, it runs each of the action procedures,
using the following procedure call-each
, which calls each of the items
in a list of no-argument procedures:
(define (call-each procedures) (if (null? procedures) 'done (begin ((car procedures)) (call-each (cdr procedures)))))
The local procedure accept-action-procedure!
adds the given procedure to
the list of procedures to be run, and then runs the new procedure once. (See
Exercise 3-31.)
With the local dispatch
procedure set up as specified, we can provide
the following procedures to access the local operations on
wires:(155)
(define (get-signal wire) (wire 'get-signal)) (define (set-signal! wire new-value) ((wire 'set-signal!) new-value)) (define (add-action! wire action-procedure) ((wire 'add-action!) action-procedure))
Wires, which have time-varying signals and may be incrementally attached to
devices, are typical of mutable objects. We have modeled them as procedures
with local state variables that are modified by assignment. When a new wire is
created, a new set of state variables is allocated (by the let
expression in make-wire
) and a new dispatch
procedure is
constructed and returned, capturing the environment with the new state
variables.
The wires are shared among the various devices that have been connected to them. Thus, a change made by an interaction with one device will affect all the other devices attached to the wire. The wire communicates the change to its neighbors by calling the action procedures provided to it when the connections were established.
The only thing needed to complete the simulator is after-delay
. The
idea here is that we maintain a data structure, called an
agenda,
that contains a schedule of things to do. The following operations are defined
for agendas:
(make-agenda)
returns a new empty agenda.
(empty-agenda? <agenda>)
is true if the specified agenda is
empty.
(first-agenda-item <agenda>)
returns the first item on the
agenda.
(remove-first-agenda-item! <agenda>)
modifies the agenda by
removing the first item.
(add-to-agenda! <time> <action>
<agenda>)
modifies the agenda by adding the given action procedure
to be run at the specified time.
(current-time <agenda>)
returns the current simulation time.
The particular agenda that we use is denoted by the-agenda
. The
procedure after-delay
adds new elements to the-agenda
:
(define (after-delay delay action) (add-to-agenda! (+ delay (current-time the-agenda)) action the-agenda))
The simulation is driven by the procedure propagate
, which operates on
the-agenda
, executing each procedure on the agenda in sequence. In
general, as the simulation runs, new items will be added to the agenda, and
propagate
will continue the simulation as long as there are items on the
agenda:
(define (propagate) (if (empty-agenda? the-agenda) 'done (let ((first-item (first-agenda-item the-agenda))) (first-item) (remove-first-agenda-item! the-agenda) (propagate))))
The following procedure, which places a “probe” on a wire, shows the simulator in action. The probe tells the wire that, whenever its signal changes value, it should print the new signal value, together with the current time and a name that identifies the wire:
(define (probe name wire) (add-action! wire (lambda () (newline) (display name) (display " ") (display (current-time the-agenda)) (display " New-value = ") (display (get-signal wire)))))
We begin by initializing the agenda and specifying delays for the primitive function boxes:
(define the-agenda (make-agenda)) (define inverter-delay 2) (define and-gate-delay 3) (define or-gate-delay 5)
Now we define four wires, placing probes on two of them:
(define input-1 (make-wire)) (define input-2 (make-wire)) (define sum (make-wire)) (define carry (make-wire)) (probe 'sum sum) sum 0 New-value = 0 (probe 'carry carry) carry 0 New-value = 0
Next we connect the wires in a half-adder circuit (as in Figure 3-25),
set the signal on input-1
to 1, and run the simulation:
(half-adder input-1 input-2 sum carry) ok (set-signal! input-1 1) done (propagate) sum 8 New-value = 1 done
The sum
signal changes to 1 at time 8. We are now eight time units from
the beginning of the simulation. At this point, we can set the signal on
input-2
to 1 and allow the values to propagate:
(set-signal! input-2 1) done (propagate) carry 11 New-value = 1 sum 16 New-value = 0 done
The carry
changes to 1 at time 11 and the sum
changes to 0 at
time 16.
Exercise 3.31: The internal procedure
accept-action-procedure!
defined inmake-wire
specifies that when a new action procedure is added to a wire, the procedure is immediately run. Explain why this initialization is necessary. In particular, trace through the half-adder example in the paragraphs above and say how the system’s response would differ if we had definedaccept-action-procedure!
as(define (accept-action-procedure! proc) (set! action-procedures (cons proc action-procedures)))
Finally, we give details of the agenda data structure, which holds the procedures that are scheduled for future execution.
The agenda is made up of time segments. Each time segment is a pair consisting of a number (the time) and a queue (see Exercise 3-32) that holds the procedures that are scheduled to be run during that time segment.
(define (make-time-segment time queue) (cons time queue)) (define (segment-time s) (car s)) (define (segment-queue s) (cdr s))
We will operate on the time-segment queues using the queue operations described in section Representing Queues.
The agenda itself is a one-dimensional table of time segments. It differs from the tables described in section Representing Tables in that the segments will be sorted in order of increasing time. In addition, we store the current time (i.e., the time of the last action that was processed) at the head of the agenda. A newly constructed agenda has no time segments and has a current time of 0:(156)
(define (make-agenda) (list 0)) (define (current-time agenda) (car agenda)) (define (set-current-time! agenda time) (set-car! agenda time)) (define (segments agenda) (cdr agenda)) (define (set-segments! agenda segments) (set-cdr! agenda segments)) (define (first-segment agenda) (car (segments agenda))) (define (rest-segments agenda) (cdr (segments agenda)))
An agenda is empty if it has no time segments:
(define (empty-agenda? agenda) (null? (segments agenda)))
To add an action to an agenda, we first check if the agenda is empty. If so, we create a time segment for the action and install this in the agenda. Otherwise, we scan the agenda, examining the time of each segment. If we find a segment for our appointed time, we add the action to the associated queue. If we reach a time later than the one to which we are appointed, we insert a new time segment into the agenda just before it. If we reach the end of the agenda, we must create a new time segment at the end.
(define (add-to-agenda! time action agenda) (define (belongs-before? segments) (or (null? segments) (< time (segment-time (car segments))))) (define (make-new-time-segment time action) (let ((q (make-queue))) (insert-queue! q action) (make-time-segment time q))) (define (add-to-segments! segments) (if (= (segment-time (car segments)) time) (insert-queue! (segment-queue (car segments)) action) (let ((rest (cdr segments))) (if (belongs-before? rest) (set-cdr! segments (cons (make-new-time-segment time action) (cdr segments))) (add-to-segments! rest))))) (let ((segments (segments agenda))) (if (belongs-before? segments) (set-segments! agenda (cons (make-new-time-segment time action) segments)) (add-to-segments! segments))))
The procedure that removes the first item from the agenda deletes the item at the front of the queue in the first time segment. If this deletion makes the time segment empty, we remove it from the list of segments:(157)
(define (remove-first-agenda-item! agenda) (let ((q (segment-queue (first-segment agenda)))) (delete-queue! q) (if (empty-queue? q) (set-segments! agenda (rest-segments agenda)))))
The first agenda item is found at the head of the queue in the first time segment. Whenever we extract an item, we also update the current time:(158)
(define (first-agenda-item agenda) (if (empty-agenda? agenda) (error "Agenda is empty -- FIRST-AGENDA-ITEM") (let ((first-seg (first-segment agenda))) (set-current-time! agenda (segment-time first-seg)) (front-queue (segment-queue first-seg)))))
Exercise 3.32: The procedures to be run during each time segment of the agenda are kept in a queue. Thus, the procedures for each segment are called in the order in which they were added to the agenda (first in, first out). Explain why this order must be used. In particular, trace the behavior of an and-gate whose inputs change from 0,1 to 1,0 in the same segment and say how the behavior would differ if we stored a segment’s procedures in an ordinary list, adding and removing procedures only at the front (last in, first out).
[ << ] | [ < ] | [ Up ] | [ > ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
Computer programs are traditionally organized as one-directional computations, which perform operations on prespecified arguments to produce desired outputs. On the other hand, we often model systems in terms of relations among quantities. For example, a mathematical model of a mechanical structure might include the information that the deflection d of a metal rod is related to the force f on the rod, the length L of the rod, the cross-sectional area A, and the elastic modulus E via the equation
dAE = FL
Such an equation is not one-directional. Given any four of the quantities, we can use it to compute the fifth. Yet translating the equation into a traditional computer language would force us to choose one of the quantities to be computed in terms of the other four. Thus, a procedure for computing the area A could not be used to compute the deflection d, even though the computations of A and d arise from the same equation.(159)
In this section, we sketch the design of a language that enables us to work in
terms of relations themselves. The primitive elements of the language are
primitive constraints, which state that certain relations hold
between quantities. For example, (adder a b c)
specifies that the
quantities a, b, and c must be related by the equation a +
b = c, (multiplier x y z)
expresses the constraint xy =
z, and (constant 3.14 x)
says that the value of x must be 3.14.
Our language provides a means of combining primitive constraints in order to express more complex relations. We combine constraints by constructing constraint networks, in which constraints are joined by connectors. A connector is an object that “holds” a value that may participate in one or more constraints. For example, we know that the relationship between Fahrenheit and Celsius temperatures is
9C = 5(F - 32)
Such a constraint can be thought of as a network consisting of primitive adder, multiplier, and constant constraints (Figure 3-28). In the figure, we see on the left a multiplier box with three terminals, labeled m1, m2, and p. These connect the multiplier to the rest of the network as follows: The m1 terminal is linked to a connector C, which will hold the Celsius temperature. The m2 terminal is linked to a connector w, which is also linked to a constant box that holds 9. The p terminal, which the multiplier box constrains to be the product of m1 and m2, is linked to the p terminal of another multiplier box, whose m2 is connected to a constant 5 and whose m1 is connected to one of the terms in a sum.
Figure 3.28: The relation 9C = 5(F - 32) expressed as a constraint network.
+---------+ +---------+ v +---------+ C -----+ m1 | u | m1 +-------+ a1 | | * p +-----+ p * | | * s +---- F +--+ m2 | | m2 +--+ +--+ a2 | | +---------+ +---------+ | | +---------+ w | x| |y | +-----+ +-----+ | | +-----+ +----+ 9 | | 5 +-----+ +-----+ 32 | +-----+ +-----+ +-----+
Computation by such a network proceeds as follows: When a connector is given a value (by the user or by a constraint box to which it is linked), it awakens all of its associated constraints (except for the constraint that just awakened it) to inform them that it has a value. Each awakened constraint box then polls its connectors to see if there is enough information to determine a value for a connector. If so, the box sets that connector, which then awakens all of its associated constraints, and so on. For instance, in conversion between Celsius and Fahrenheit, w, x, and y are immediately set by the constant boxes to 9, 5, and 32, respectively. The connectors awaken the multipliers and the adder, which determine that there is not enough information to proceed. If the user (or some other part of the network) sets C to a value (say 25), the leftmost multiplier will be awakened, and it will set u to 25*9 = 225. Then u awakens the second multiplier, which sets v to 45, and v awakens the adder, which sets f to 77.
To use the constraint system to carry out the temperature computation outlined
above, we first create two connectors, C
and F
, by calling the
constructor make-connector
, and link C
and F
in an
appropriate network:
(define C (make-connector)) (define F (make-connector)) (celsius-fahrenheit-converter C F) ok
The procedure that creates the network is defined as follows:
(define (celsius-fahrenheit-converter c f) (let ((u (make-connector)) (v (make-connector)) (w (make-connector)) (x (make-connector)) (y (make-connector))) (multiplier c w u) (multiplier v x u) (adder v y f) (constant 9 w) (constant 5 x) (constant 32 y) 'ok))
This procedure creates the internal connectors u
, v
, w
,
x
, and y
, and links them as shown in Figure 3-28 using the
primitive constraint constructors adder
, multiplier
, and
constant
. Just as with the digital-circuit simulator of section
A Simulator for Digital Circuits, expressing these combinations of primitive elements in terms of
procedures automatically provides our language with a means of abstraction for
compound objects.
To watch the network in action, we can place probes on the connectors C
and F
, using a probe
procedure similar to the one we used to
monitor wires in section A Simulator for Digital Circuits. Placing a probe on a connector will
cause a message to be printed whenever the connector is given a value:
(probe "Celsius temp" C) (probe "Fahrenheit temp" F)
Next we set the value of C
to 25. (The third argument to
set-value!
tells C
that this directive comes from the
user
.)
(set-value! C 25 'user) Probe: Celsius temp = 25 Probe: Fahrenheit temp = 77 done
The probe on C
awakens and reports the value. C
also propagates
its value through the network as described above. This sets F
to 77,
which is reported by the probe on F
.
Now we can try to set F
to a new value, say 212:
(set-value! F 212 'user) Error! Contradiction (77 212)
The connector complains that it has sensed a contradiction: Its value is 77,
and someone is trying to set it to 212. If we really want to reuse the network
with new values, we can tell C
to forget its old value:
(forget-value! C 'user) Probe: Celsius temp = ? Probe: Fahrenheit temp = ? done
C
finds that the user
, who set its value originally, is now
retracting that value, so C
agrees to lose its value, as shown by the
probe, and informs the rest of the network of this fact. This information
eventually propagates to F
, which now finds that it has no reason for
continuing to believe that its own value is 77. Thus, F
also gives up
its value, as shown by the probe.
Now that F
has no value, we are free to set it to 212:
(set-value! F 212 'user) Probe: Fahrenheit temp = 212 Probe: Celsius temp = 100 done
This new value, when propagated through the network, forces C
to have a
value of 100, and this is registered by the probe on C
. Notice that the
very same network is being used to compute C
given F
and to
compute F
given C
. This nondirectionality of computation is the
distinguishing feature of constraint-based systems.
The constraint system is implemented via procedural objects with local state, in a manner very similar to the digital-circuit simulator of section A Simulator for Digital Circuits. Although the primitive objects of the constraint system are somewhat more complex, the overall system is simpler, since there is no concern about agendas and logic delays.
The basic operations on connectors are the following:
(has-value? <connector>)
tells whether the connector has a value.
(get-value <connector>)
returns the connector’s current value.
(set-value! <connector> <new-value> <informant>)
indicates that the informant is requesting the connector to set its value to
the new value.
(forget-value! <connector> <retractor>)
tells the connector
that the retractor is requesting it to forget its value.
(connect <connector> <new-constraint>)
tells the connector
to participate in the new constraint.
The connectors communicate with the constraints by means of the procedures
inform-about-value
, which tells the given constraint that the connector
has a value, and inform-about-no-value
, which tells the constraint that
the connector has lost its value.
Adder
constructs an adder constraint among summand connectors a1
and a2
and a sum
connector. An adder is implemented as a
procedure with local state (the procedure me
below):
(define (adder a1 a2 sum) (define (process-new-value) (cond ((and (has-value? a1) (has-value? a2)) (set-value! sum (+ (get-value a1) (get-value a2)) me)) ((and (has-value? a1) (has-value? sum)) (set-value! a2 (- (get-value sum) (get-value a1)) me)) ((and (has-value? a2) (has-value? sum)) (set-value! a1 (- (get-value sum) (get-value a2)) me)))) (define (process-forget-value) (forget-value! sum me) (forget-value! a1 me) (forget-value! a2 me) (process-new-value)) (define (me request) (cond ((eq? request 'I-have-a-value) (process-new-value)) ((eq? request 'I-lost-my-value) (process-forget-value)) (else (error "Unknown request -- ADDER" request)))) (connect a1 me) (connect a2 me) (connect sum me) me)
Adder
connects the new adder to the designated connectors and returns it
as its value. The procedure me
, which represents the adder, acts as a
dispatch to the local procedures. The following “syntax interfaces” (see
footnote Footnote 27 in section A Simulator for Digital Circuits) are used in conjunction with
the dispatch:
(define (inform-about-value constraint) (constraint 'I-have-a-value)) (define (inform-about-no-value constraint) (constraint 'I-lost-my-value))
The adder’s local procedure process-new-value
is called when the adder
is informed that one of its connectors has a value. The adder first checks to
see if both a1
and a2
have values. If so, it tells sum
to
set its value to the sum of the two addends. The informant
argument to
set-value!
is me
, which is the adder object itself. If a1
and a2
do not both have values, then the adder checks to see if perhaps
a1
and sum
have values. If so, it sets a2
to the
difference of these two. Finally, if a2
and sum
have values,
this gives the adder enough information to set a1
. If the adder is told
that one of its connectors has lost a value, it requests that all of its
connectors now lose their values. (Only those values that were set by this
adder are actually lost.) Then it runs process-new-value
. The reason
for this last step is that one or more connectors may still have a value (that
is, a connector may have had a value that was not originally set by the adder),
and these values may need to be propagated back through the adder.
A multiplier is very similar to an adder. It will set its product
to 0
if either of the factors is 0, even if the other factor is not known.
(define (multiplier m1 m2 product) (define (process-new-value) (cond ((or (and (has-value? m1) (= (get-value m1) 0)) (and (has-value? m2) (= (get-value m2) 0))) (set-value! product 0 me)) ((and (has-value? m1) (has-value? m2)) (set-value! product (* (get-value m1) (get-value m2)) me)) ((and (has-value? product) (has-value? m1)) (set-value! m2 (/ (get-value product) (get-value m1)) me)) ((and (has-value? product) (has-value? m2)) (set-value! m1 (/ (get-value product) (get-value m2)) me)))) (define (process-forget-value) (forget-value! product me) (forget-value! m1 me) (forget-value! m2 me) (process-new-value)) (define (me request) (cond ((eq? request 'I-have-a-value) (process-new-value)) ((eq? request 'I-lost-my-value) (process-forget-value)) (else (error "Unknown request -- MULTIPLIER" request)))) (connect m1 me) (connect m2 me) (connect product me) me)
A constant
constructor simply sets the value of the designated
connector. Any I-have-a-value
or I-lost-my-value
message sent to
the constant box will produce an error.
(define (constant value connector) (define (me request) (error "Unknown request -- CONSTANT" request)) (connect connector me) (set-value! connector value me) me)
Finally, a probe prints a message about the setting or unsetting of the designated connector:
(define (probe name connector) (define (print-probe value) (newline) (display "Probe: ") (display name) (display " = ") (display value)) (define (process-new-value) (print-probe (get-value connector))) (define (process-forget-value) (print-probe "?")) (define (me request) (cond ((eq? request 'I-have-a-value) (process-new-value)) ((eq? request 'I-lost-my-value) (process-forget-value)) (else (error "Unknown request -- PROBE" request)))) (connect connector me) me)
A connector is represented as a procedural object with local state variables
value
, the current value of the connector; informant
, the object
that set the connector’s value; and constraints
, a list of the
constraints in which the connector participates.
(define (make-connector) (let ((value false) (informant false) (constraints '())) (define (set-my-value newval setter) (cond ((not (has-value? me)) (set! value newval) (set! informant setter) (for-each-except setter inform-about-value constraints)) ((not (= value newval)) (error "Contradiction" (list value newval))) (else 'ignored))) (define (forget-my-value retractor) (if (eq? retractor informant) (begin (set! informant false) (for-each-except retractor inform-about-no-value constraints)) 'ignored)) (define (connect new-constraint) (if (not (memq new-constraint constraints)) (set! constraints (cons new-constraint constraints))) (if (has-value? me) (inform-about-value new-constraint)) 'done) (define (me request) (cond ((eq? request 'has-value?) (if informant true false)) ((eq? request 'value) value) ((eq? request 'set-value!) set-my-value) ((eq? request 'forget) forget-my-value) ((eq? request 'connect) connect) (else (error "Unknown operation -- CONNECTOR" request)))) me))
The connector’s local procedure set-my-value
is called when there is a
request to set the connector’s value. If the connector does not currently have
a value, it will set its value and remember as informant
the constraint
that requested the value to be set.(160) Then the connector will notify all of its participating
constraints except the constraint that requested the value to be set. This is
accomplished using the following iterator, which applies a designated procedure
to all items in a list except a given one:
(define (for-each-except exception procedure list) (define (loop items) (cond ((null? items) 'done) ((eq? (car items) exception) (loop (cdr items))) (else (procedure (car items)) (loop (cdr items))))) (loop list))
If a connector is asked to forget its value, it runs the local procedure
forget-my-value
, which first checks to make sure that the request is
coming from the same object that set the value originally. If so, the
connector informs its associated constraints about the loss of the value.
The local procedure connect
adds the designated new constraint to the
list of constraints if it is not already in that list. Then, if the connector
has a value, it informs the new constraint of this fact.
The connector’s procedure me
serves as a dispatch to the other internal
procedures and also represents the connector as an object. The following
procedures provide a syntax interface for the dispatch:
(define (has-value? connector) (connector 'has-value?)) (define (get-value connector) (connector 'value)) (define (set-value! connector new-value informant) ((connector 'set-value!) new-value informant)) (define (forget-value! connector retractor) ((connector 'forget) retractor)) (define (connect connector new-constraint) ((connector 'connect) new-constraint))
Exercise 3.33: Using primitive multiplier, adder, and constant constraints, define a procedure
averager
that takes three connectorsa
,b
, andc
as inputs and establishes the constraint that the value ofc
is the average of the values ofa
andb
.
Exercise 3.34: Louis Reasoner wants to build a squarer, a constraint device with two terminals such that the value of connector
b
on the second terminal will always be the square of the valuea
on the first terminal. He proposes the following simple device made from a multiplier:(define (squarer a b) (multiplier a a b))There is a serious flaw in this idea. Explain.
Exercise 3.35: Ben Bitdiddle tells Louis that one way to avoid the trouble in Exercise 3-34 is to define a squarer as a new primitive constraint. Fill in the missing portions in Ben’s outline for a procedure to implement such a constraint:
(define (squarer a b) (define (process-new-value) (if (has-value? b) (if (< (get-value b) 0) (error "square less than 0 -- SQUARER" (get-value b)) <alternative1>) <alternative2>)) (define (process-forget-value) <body1>) (define (me request) <body2>) <rest of definition> me)
Exercise 3.36: Suppose we evaluate the following sequence of expressions in the global environment:
(define a (make-connector)) (define b (make-connector)) (set-value! a 10 'user)At some time during evaluation of the
set-value!
, the following expression from the connector’s local procedure is evaluated:(for-each-except setter inform-about-value constraints)Draw an environment diagram showing the environment in which the above expression is evaluated.
Exercise 3.37: The
celsius-fahrenheit-converter
procedure is cumbersome when compared with a more expression-oriented style of definition, such as(define (celsius-fahrenheit-converter x) (c+ (c* (c/ (cv 9) (cv 5)) x) (cv 32))) (define C (make-connector)) (define F (celsius-fahrenheit-converter C))Here
c+
,c*
, etc. are the “constraint” versions of the arithmetic operations. For example,c+
takes two connectors as arguments and returns a connector that is related to these by an adder constraint:(define (c+ x y) (let ((z (make-connector))) (adder x y z) z))Define analogous procedures
c-
,c*
,c/
, andcv
(constant value) that enable us to define compound constraints as in the converter example above.(161)
[ << ] | [ < ] | [ Up ] | [ > ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
We’ve seen the power of computational objects with local state as tools for modeling. Yet, as section The Costs of Introducing Assignment warned, this power extracts a price: the loss of referential transparency, giving rise to a thicket of questions about sameness and change, and the need to abandon the substitution model of evaluation in favor of the more intricate environment model.
The central issue lurking beneath the complexity of state, sameness, and change is that by introducing assignment we are forced to admit time into our computational models. Before we introduced assignment, all our programs were timeless, in the sense that any expression that has a value always has the same value. In contrast, recall the example of modeling withdrawals from a bank account and returning the resulting balance, introduced at the beginning of section Local State Variables:
(withdraw 25) 75 (withdraw 25) 50
Here successive evaluations of the same expression yield different values.
This behavior arises from the fact that the execution of assignment statements
(in this case, assignments to the variable balance
) delineates
moments in time when values change. The result of evaluating an
expression depends not only on the expression itself, but also on whether the
evaluation occurs before or after these moments. Building models in terms of
computational objects with local state forces us to confront time as an
essential concept in programming.
We can go further in structuring computational models to match our perception of the physical world. Objects in the world do not change one at a time in sequence. Rather we perceive them as acting concurrently—all at once. So it is often natural to model systems as collections of computational processes that execute concurrently. Just as we can make our programs modular by organizing models in terms of objects with separate local state, it is often appropriate to divide computational models into parts that evolve separately and concurrently. Even if the programs are to be executed on a sequential computer, the practice of writing programs as if they were to be executed concurrently forces the programmer to avoid inessential timing constraints and thus makes programs more modular.
In addition to making programs more modular, concurrent computation can provide a speed advantage over sequential computation. Sequential computers execute only one operation at a time, so the amount of time it takes to perform a task is proportional to the total number of operations performed.(162) However, if it is possible to decompose a problem into pieces that are relatively independent and need to communicate only rarely, it may be possible to allocate pieces to separate computing processors, producing a speed advantage proportional to the number of processors available.
Unfortunately, the complexities introduced by assignment become even more problematic in the presence of concurrency. The fact of concurrent execution, either because the world operates in parallel or because our computers do, entails additional complexity in our understanding of time.
3.4.1 The Nature of Time in Concurrent Systems | ||
3.4.2 Mechanisms for Controlling Concurrency |
[ << ] | [ < ] | [ Up ] | [ > ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
On the surface, time seems straightforward. It is an ordering imposed on
events.(163) For any events A and B, either A occurs before B,
A and B are simultaneous, or A occurs after B. For instance,
returning to the bank account example, suppose that Peter withdraws $10 and
Paul withdraws $25 from a joint account that initially contains $100, leaving
$65 in the account. Depending on the order of the two withdrawals, the
sequence of balances in the account is either $100 -> $90 -> $65 or $100 -> $75
-> $65. In a computer implementation of the banking system, this changing
sequence of balances could be modeled by successive assignments to a variable
balance
.
In complex situations, however, such a view can be problematic. Suppose that Peter and Paul, and other people besides, are accessing the same bank account through a network of banking machines distributed all over the world. The actual sequence of balances in the account will depend critically on the detailed timing of the accesses and the details of the communication among the machines.
This indeterminacy in the order of events can pose serious problems in the
design of concurrent systems. For instance, suppose that the withdrawals made
by Peter and Paul are implemented as two separate processes sharing a common
variable balance
, each process specified by the procedure given in
section Local State Variables:
(define (withdraw amount) (if (>= balance amount) (begin (set! balance (- balance amount)) balance) "Insufficient funds"))
If the two processes operate independently, then Peter might test the balance and attempt to withdraw a legitimate amount. However, Paul might withdraw some funds in between the time that Peter checks the balance and the time Peter completes the withdrawal, thus invalidating Peter’s test.
Things can be worse still. Consider the expression
(set! balance (- balance amount))
executed as part of each withdrawal process. This consists of three steps: (1)
accessing the value of the balance
variable; (2) computing the new
balance; (3) setting balance
to this new value. If Peter and Paul’s
withdrawals execute this statement concurrently, then the two withdrawals might
interleave the order in which they access balance
and set it to the new
value.
The timing diagram in Figure 3-29 depicts an order of events where
balance
starts at 100, Peter withdraws 10, Paul withdraws 25, and yet
the final value of balance
is 75. As shown in the diagram, the reason
for this anomaly is that Paul’s assignment of 75 to balance
is made
under the assumption that the value of balance
to be decremented is 100.
That assumption, however, became invalid when Peter changed balance
to
90. This is a catastrophic failure for the banking system, because the total
amount of money in the system is not conserved. Before the transactions, the
total amount of money was $100. Afterwards, Peter has $10, Paul has $25, and
the bank has $75.(164)
The general phenomenon illustrated here is that several processes may share a common state variable. What makes this complicated is that more than one process may be trying to manipulate the shared state at the same time. For the bank account example, during each transaction, each customer should be able to act as if the other customers did not exist. When a customer changes the balance in a way that depends on the balance, he must be able to assume that, just before the moment of change, the balance is still what he thought it was.
The above example typifies the subtle bugs that can creep into concurrent
programs. The root of this complexity lies in the assignments to variables
that are shared among the different processes. We already know that we must be
careful in writing programs that use set!
, because the results of a
computation depend on the order in which the assignments occur.(165) With concurrent processes we must be especially careful
about assignments, because we may not be able to control the order of the
assignments made by the different processes. If several such changes might be
made concurrently (as with two depositors accessing a joint account) we need
some way to ensure that our system behaves correctly. For example, in the case
of withdrawals from a joint bank account, we must ensure that money is
conserved. To make concurrent programs behave correctly, we may have to place
some restrictions on concurrent execution.
Figure 3.29: Timing diagram showing how interleaving the order of events in two banking withdrawals can lead to an incorrect final balance.
| Peter Bank Paul | ____ | / \ | .--------------| $100 |-------------. | | \____/ | | V V | .----------------------. .----------------------. | | Access balance: $100 | | Access balance: $100 | | `----------+-----------' `----------+-----------' | V V | .----------------------. .----------------------. | | new value: 100-10=90 | | new value: 100-25=75 | | `----------+-----------' `----------+-----------' | V | | .----------------------. | | | set! balance to $90 | | | `----------+-----------' ____ | | | / \ | | `------------->| $ 90 | V | \____/ .----------------------. | | new value: 100-25=75 | | ____ `----------+-----------' | / \ | | | $ 90 |<------------' V \____/ time
One possible restriction on concurrency would stipulate that no two operations that change any shared state variables can occur at the same time. This is an extremely stringent requirement. For distributed banking, it would require the system designer to ensure that only one transaction could proceed at a time. This would be both inefficient and overly conservative. Figure 3-30 shows Peter and Paul sharing a bank account, where Paul has a private account as well. The diagram illustrates two withdrawals from the shared account (one by Peter and one by Paul) and a deposit to Paul’s private account.(166) The two withdrawals from the shared account must not be concurrent (since both access and update the same account), and Paul’s deposit and withdrawal must not be concurrent (since both access and update the amount in Paul’s wallet). But there should be no problem permitting Paul’s deposit to his private account to proceed concurrently with Peter’s withdrawal from the shared account.
Figure 3.30: Concurrent deposits and withdrawals from a joint account in Bank1 and a private account in Bank2.
| Peter Bank1 Paul Bank2 | ____ ____ ____ ____ | / \ / \ / \ / \ | | $7 |--. .--| $100 | | $5 |--. .--| $300 | | \____/ V V \____/ \____/ V V \____/ | +---+ +---+ | | W | | D | | ____ ++-++ ____ ____ ++-++ ____ | / \ | | / \ / \ | | / \ | | $17 |<-' `->| $90 |--. .--| $0 |<-' `->| $305 | | \____/ \____/ V V \____/ \____/ | +---+ | | W | | ____ ____ ++-++ ____ ____ | / \ / \ | | / \ / \ | | $17 | | $65 |<-' `->| $25 | | $305 | | \____/ \____/ \____/ \____/ V time
A less stringent restriction on concurrency would ensure that a concurrent system produces the same result as if the processes had run sequentially in some order. There are two important aspects to this requirement. First, it does not require the processes to actually run sequentially, but only to produce results that are the same as if they had run sequentially. For the example in Figure 3-30, the designer of the bank account system can safely allow Paul’s deposit and Peter’s withdrawal to happen concurrently, because the net result will be the same as if the two operations had happened sequentially. Second, there may be more than one possible “correct” result produced by a concurrent program, because we require only that the result be the same as for some sequential order. For example, suppose that Peter and Paul’s joint account starts out with $100, and Peter deposits $40 while Paul concurrently withdraws half the money in the account. Then sequential execution could result in the account balance being either $70 or $90 (see Exercise 3-38).(167)
There are still weaker requirements for correct execution of concurrent programs. A program for simulating diffusion (say, the flow of heat in an object) might consist of a large number of processes, each one representing a small volume of space, that update their values concurrently. Each process repeatedly changes its value to the average of its own value and its neighbors’ values. This algorithm converges to the right answer independent of the order in which the operations are done; there is no need for any restrictions on concurrent use of the shared values.
Exercise 3.38: Suppose that Peter, Paul, and Mary share a joint bank account that initially contains $100. Concurrently, Peter deposits $10, Paul withdraws $20, and Mary withdraws half the money in the account, by executing the following commands:
Peter: (set! balance (+ balance 10)) Paul: (set! balance (- balance 20)) Mary: (set! balance (- balance (/ balance 2)))
- List all the different possible values for
balance
after these three transactions have been completed, assuming that the banking system forces the three processes to run sequentially in some order.- What are some other values that could be produced if the system allows the processes to be interleaved? Draw timing diagrams like the one in Figure 3-29 to explain how these values can occur.
[ << ] | [ < ] | [ Up ] | [ > ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
We’ve seen that the difficulty in dealing with concurrent processes is rooted in the need to consider the interleaving of the order of events in the different processes. For example, suppose we have two processes, one with three ordered events (a,b,c) and one with three ordered events (x,y,z). If the two processes run concurrently, with no constraints on how their execution is interleaved, then there are 20 different possible orderings for the events that are consistent with the individual orderings for the two processes:
(a,b,c,x,y,z) (a,x,b,y,c,z) (x,a,b,c,y,z) (x,a,y,z,b,c) (a,b,x,c,y,z) (a,x,b,y,z,c) (x,a,b,y,c,z) (x,y,a,b,c,z) (a,b,x,y,c,z) (a,x,y,b,c,z) (x,a,b,y,z,c) (x,y,a,b,z,c) (a,b,x,y,z,c) (a,x,y,b,z,c) (x,a,y,b,c,z) (x,y,a,z,b,c) (a,x,b,c,y,z) (a,x,y,z,b,c) (x,a,y,b,z,c) (x,y,z,a,b,c)
As programmers designing this system, we would have to consider the effects of each of these 20 orderings and check that each behavior is acceptable. Such an approach rapidly becomes unwieldy as the numbers of processes and events increase.
A more practical approach to the design of concurrent systems is to devise general mechanisms that allow us to constrain the interleaving of concurrent processes so that we can be sure that the program behavior is correct. Many mechanisms have been developed for this purpose. In this section, we describe one of them, the serializer.
Serialization implements the following idea: Processes will execute concurrently, but there will be certain collections of procedures that cannot be executed concurrently. More precisely, serialization creates distinguished sets of procedures such that only one execution of a procedure in each serialized set is permitted to happen at a time. If some procedure in the set is being executed, then a process that attempts to execute any procedure in the set will be forced to wait until the first execution has finished.
We can use serialization to control access to shared variables. For example, if we want to update a shared variable based on the previous value of that variable, we put the access to the previous value of the variable and the assignment of the new value to the variable in the same procedure. We then ensure that no other procedure that assigns to the variable can run concurrently with this procedure by serializing all of these procedures with the same serializer. This guarantees that the value of the variable cannot be changed between an access and the corresponding assignment.
To make the above mechanism more concrete, suppose that we have extended Scheme
to include a procedure called parallel-execute
:
(parallel-execute <p_1> <p_2> … <p_k>)
Each <p> must be a procedure of no arguments. Parallel-execute
creates a separate process for each <p>, which applies <p> (to no
arguments). These processes all run
concurrently.(168)
As an example of how this is used, consider
(define x 10) (parallel-execute (lambda () (set! x (* x x))) (lambda () (set! x (+ x 1))))
This creates two concurrent processes—P_1, which sets x
to
x
times x
, and P_2, which increments x
. After
execution is complete, x
will be left with one of five possible values,
depending on the interleaving of the events of P_1 and P_2:
101: P_1 setsx
to 100 and then P_2 incrementsx
to 101. 121: P_2 incrementsx
to 11 and then P_1 setsx
tox
timesx
. 110: P_2 changesx
from 10 to 11 between the two times that P_1 accesses the value ofx
during the evaluation of(* x x)
. 11: P_2 accessesx
, then P_1 setsx
to 100, then P_2 setsx
. 100: P_1 accessesx
(twice), then P_2 setsx
to 11, then P_1 setsx
.
We can constrain the concurrency by using serialized procedures, which are
created by
serializers. Serializers are constructed by
make-serializer
, whose implementation is given below. A serializer
takes a procedure as argument and returns a serialized procedure that behaves
like the original procedure. All calls to a given serializer return serialized
procedures in the same set.
Thus, in contrast to the example above, executing
(define x 10) (define s (make-serializer)) (parallel-execute (s (lambda () (set! x (* x x)))) (s (lambda () (set! x (+ x 1)))))
can produce only two possible values for x
, 101 or 121. The other
possibilities are eliminated, because the execution of P_1 and P_2
cannot be interleaved.
Here is a version of the make-account
procedure from section
Local State Variables, where the deposits and withdrawals have been serialized:
(define (make-account balance) (define (withdraw amount) (if (>= balance amount) (begin (set! balance (- balance amount)) balance) "Insufficient funds")) (define (deposit amount) (set! balance (+ balance amount)) balance) (let ((protected (make-serializer))) (define (dispatch m) (cond ((eq? m 'withdraw) (protected withdraw)) ((eq? m 'deposit) (protected deposit)) ((eq? m 'balance) balance) (else (error "Unknown request -- MAKE-ACCOUNT" m)))) dispatch))
With this implementation, two processes cannot be withdrawing from or depositing into a single account concurrently. This eliminates the source of the error illustrated in Figure 3-29, where Peter changes the account balance between the times when Paul accesses the balance to compute the new value and when Paul actually performs the assignment. On the other hand, each account has its own serializer, so that deposits and withdrawals for different accounts can proceed concurrently.
Exercise 3.39: Which of the five possibilities in the parallel execution shown above remain if we instead serialize execution as follows:
(define x 10) (define s (make-serializer)) (parallel-execute (lambda () (set! x ((s (lambda () (* x x)))))) (s (lambda () (set! x (+ x 1)))))
Exercise 3.40: Give all possible values of
x
that can result from executing(define x 10) (parallel-execute (lambda () (set! x (* x x))) (lambda () (set! x (* x x x))))Which of these possibilities remain if we instead use serialized procedures:
(define x 10) (define s (make-serializer)) (parallel-execute (s (lambda () (set! x (* x x)))) (s (lambda () (set! x (* x x x)))))
Exercise 3.41: Ben Bitdiddle worries that it would be better to implement the bank account as follows (where the commented line has been changed):
(define (make-account balance) (define (withdraw amount) (if (>= balance amount) (begin (set! balance (- balance amount)) balance) "Insufficient funds")) (define (deposit amount) (set! balance (+ balance amount)) balance) ;; continued on next page (let ((protected (make-serializer))) (define (dispatch m) (cond ((eq? m 'withdraw) (protected withdraw)) ((eq? m 'deposit) (protected deposit)) ((eq? m 'balance) ((protected (lambda () balance)))) ; serialized (else (error "Unknown request -- MAKE-ACCOUNT" m)))) dispatch))because allowing unserialized access to the bank balance can result in anomalous behavior. Do you agree? Is there any scenario that demonstrates Ben’s concern?
Exercise 3.42: Ben Bitdiddle suggests that it’s a waste of time to create a new serialized procedure in response to every
withdraw
anddeposit
message. He says thatmake-account
could be changed so that the calls toprotected
are done outside thedispatch
procedure. That is, an account would return the same serialized procedure (which was created at the same time as the account) each time it is asked for a withdrawal procedure.(define (make-account balance) (define (withdraw amount) (if (>= balance amount) (begin (set! balance (- balance amount)) balance) "Insufficient funds")) (define (deposit amount) (set! balance (+ balance amount)) balance) (let ((protected (make-serializer))) (let ((protected-withdraw (protected withdraw)) (protected-deposit (protected deposit))) (define (dispatch m) (cond ((eq? m 'withdraw) protected-withdraw) ((eq? m 'deposit) protected-deposit) ((eq? m 'balance) balance) (else (error "Unknown request -- MAKE-ACCOUNT" m)))) dispatch)))Is this a safe change to make? In particular, is there any difference in what concurrency is allowed by these two versions of
make-account
?
Serializers provide a powerful abstraction that helps isolate the complexities of concurrent programs so that they can be dealt with carefully and (hopefully) correctly. However, while using serializers is relatively straightforward when there is only a single shared resource (such as a single bank account), concurrent programming can be treacherously difficult when there are multiple shared resources.
To illustrate one of the difficulties that can arise, suppose we wish to swap the balances in two bank accounts. We access each account to find the balance, compute the difference between the balances, withdraw this difference from one account, and deposit it in the other account. We could implement this as follows:(169)
(define (exchange account1 account2) (let ((difference (- (account1 'balance) (account2 'balance)))) ((account1 'withdraw) difference) ((account2 'deposit) difference)))
This procedure works well when only a single process is trying to do the
exchange. Suppose, however, that Peter and Paul both have access to accounts
a1, a2, and a3, and that Peter exchanges a1 and a2 while
Paul concurrently exchanges a1 and a3. Even with account deposits and
withdrawals serialized for individual accounts (as in the make-account
procedure shown above in this section), exchange
can still produce
incorrect results. For example, Peter might compute the difference in the
balances for a1 and a2, but then Paul might change the balance in
a1 before Peter is able to complete the exchange.(170) For correct behavior, we must arrange for the
exchange
procedure to lock out any other concurrent accesses to the
accounts during the entire time of the exchange.
One way we can accomplish this is by using both accounts’ serializers to
serialize the entire exchange
procedure. To do this, we will arrange
for access to an account’s serializer. Note that we are deliberately breaking
the modularity of the bank-account object by exposing the serializer. The
following version of make-account
is identical to the original version
given in section Local State Variables, except that a serializer is provided to protect
the balance variable, and the serializer is exported via message passing:
(define (make-account-and-serializer balance) (define (withdraw amount) (if (>= balance amount) (begin (set! balance (- balance amount)) balance) "Insufficient funds")) (define (deposit amount) (set! balance (+ balance amount)) balance) (let ((balance-serializer (make-serializer))) (define (dispatch m) (cond ((eq? m 'withdraw) withdraw) ((eq? m 'deposit) deposit) ((eq? m 'balance) balance) ((eq? m 'serializer) balance-serializer) (else (error "Unknown request -- MAKE-ACCOUNT" m)))) dispatch))
We can use this to do serialized deposits and withdrawals. However, unlike our earlier serialized account, it is now the responsibility of each user of bank-account objects to explicitly manage the serialization, for example as follows:(171)
(define (deposit account amount) (let ((s (account 'serializer)) (d (account 'deposit))) ((s d) amount)))
Exporting the serializer in this way gives us enough flexibility to implement a
serialized exchange program. We simply serialize the original exchange
procedure with the serializers for both accounts:
(define (serialized-exchange account1 account2) (let ((serializer1 (account1 'serializer)) (serializer2 (account2 'serializer))) ((serializer1 (serializer2 exchange)) account1 account2)))
Exercise 3.43: Suppose that the balances in three accounts start out as $10, $20, and $30, and that multiple processes run, exchanging the balances in the accounts. Argue that if the processes are run sequentially, after any number of concurrent exchanges, the account balances should be $10, $20, and $30 in some order. Draw a timing diagram like the one in Figure 3-29 to show how this condition can be violated if the exchanges are implemented using the first version of the account-exchange program in this section. On the other hand, argue that even with this
exchange
program, the sum of the balances in the accounts will be preserved. Draw a timing diagram to show how even this condition would be violated if we did not serialize the transactions on individual accounts.
Exercise 3.44: Consider the problem of transferring an amount from one account to another. Ben Bitdiddle claims that this can be accomplished with the following procedure, even if there are multiple people concurrently transferring money among multiple accounts, using any account mechanism that serializes deposit and withdrawal transactions, for example, the version of
make-account
in the text above.(define (transfer from-account to-account amount) ((from-account 'withdraw) amount) ((to-account 'deposit) amount))Louis Reasoner claims that there is a problem here, and that we need to use a more sophisticated method, such as the one required for dealing with the exchange problem. Is Louis right? If not, what is the essential difference between the transfer problem and the exchange problem? (You should assume that the balance in
from-account
is at leastamount
.)
Exercise 3.45: Louis Reasoner thinks our bank-account system is unnecessarily complex and error-prone now that deposits and withdrawals aren’t automatically serialized. He suggests that
make-account-and-serializer
should have exported the serializer (for use by such procedures asserialized-exchange
) in addition to (rather than instead of) using it to serialize accounts and deposits asmake-account
did. He proposes to redefine accounts as follows:(define (make-account-and-serializer balance) (define (withdraw amount) (if (>= balance amount) (begin (set! balance (- balance amount)) balance) "Insufficient funds")) (define (deposit amount) (set! balance (+ balance amount)) balance) (let ((balance-serializer (make-serializer))) (define (dispatch m) (cond ((eq? m 'withdraw) (balance-serializer withdraw)) ((eq? m 'deposit) (balance-serializer deposit)) ((eq? m 'balance) balance) ((eq? m 'serializer) balance-serializer) (else (error "Unknown request -- MAKE-ACCOUNT" m)))) dispatch))Then deposits are handled as with the original
make-account
:(define (deposit account amount) ((account 'deposit) amount))Explain what is wrong with Louis’s reasoning. In particular, consider what happens when
serialized-exchange
is called.
We implement serializers in terms of a more primitive synchronization mechanism
called a
mutex. A mutex is an object that supports two
operations—the mutex can be
acquired, and the mutex can be
released. Once a mutex has been acquired, no other acquire
operations on that mutex may proceed until the mutex is released.(172) In our implementation, each
serializer has an associated mutex. Given a procedure p
, the serializer
returns a procedure that acquires the mutex, runs p
, and then releases
the mutex. This ensures that only one of the procedures produced by the
serializer can be running at once, which is precisely the serialization
property that we need to guarantee.
(define (make-serializer) (let ((mutex (make-mutex))) (lambda (p) (define (serialized-p . args) (mutex 'acquire) (let ((val (apply p args))) (mutex 'release) val)) serialized-p)))
The mutex is a mutable object (here we’ll use a one-element list, which we’ll refer to as a cell) that can hold the value true or false. When the value is false, the mutex is available to be acquired. When the value is true, the mutex is unavailable, and any process that attempts to acquire the mutex must wait.
Our mutex constructor make-mutex
begins by initializing the cell
contents to false. To acquire the mutex, we test the cell. If the mutex is
available, we set the cell contents to true and proceed. Otherwise, we wait in
a loop, attempting to acquire over and over again, until we find that the mutex
is available.(173) To release the
mutex, we set the cell contents to false.
(define (make-mutex)
(let ((cell (list false)))
(define (the-mutex m)
(cond ((eq? m 'acquire)
(if (test-and-set! cell)
(the-mutex 'acquire))) ; retry
((eq? m 'release) (clear! cell))))
the-mutex))
(define (clear! cell)
(set-car! cell false))
Test-and-set!
tests the cell and returns the result of the test. In
addition, if the test was false, test-and-set!
sets the cell contents to
true before returning false. We can express this behavior as the following
procedure:
(define (test-and-set! cell) (if (car cell) true (begin (set-car! cell true) false)))
However, this implementation of test-and-set!
does not suffice as it
stands. There is a crucial subtlety here, which is the essential place where
concurrency control enters the system: The test-and-set!
operation must
be performed
atomically. That is, we must guarantee that, once a
process has tested the cell and found it to be false, the cell contents will
actually be set to true before any other process can test the cell. If we do
not make this guarantee, then the mutex can fail in a way similar to the
bank-account failure in Figure 3-29. (See Exercise 3-46.)
The actual implementation of test-and-set!
depends on the details of how
our system runs concurrent processes. For example, we might be executing
concurrent processes on a sequential processor using a time-slicing mechanism
that cycles through the processes, permitting each process to run for a short
time before interrupting it and moving on to the next process. In that case,
test-and-set!
can work by disabling time slicing during the testing and
setting.(174) Alternatively, multiprocessing computers provide
instructions that support atomic operations directly in
hardware.(175)
Exercise 3.46: Suppose that we implement
test-and-set!
using an ordinary procedure as shown in the text, without attempting to make the operation atomic. Draw a timing diagram like the one in Figure 3-29 to demonstrate how the mutex implementation can fail by allowing two processes to acquire the mutex at the same time.
Exercise 3.47: A semaphore (of size n) is a generalization of a mutex. Like a mutex, a semaphore supports acquire and release operations, but it is more general in that up to n processes can acquire it concurrently. Additional processes that attempt to acquire the semaphore must wait for release operations. Give implementations of semaphores
- in terms of mutexes
- in terms of atomic
test-and-set!
operations.
Now that we have seen how to implement serializers, we can see that account
exchanging still has a problem, even with the serialized-exchange
procedure above. Imagine that Peter attempts to exchange a1 with a2
while Paul concurrently attempts to exchange a2 with a1. Suppose that
Peter’s process reaches the point where it has entered a serialized procedure
protecting a1 and, just after that, Paul’s process enters a serialized
procedure protecting a2. Now Peter cannot proceed (to enter a serialized
procedure protecting a2) until Paul exits the serialized procedure
protecting a2. Similarly, Paul cannot proceed until Peter exits the
serialized procedure protecting a1. Each process is stalled forever,
waiting for the other. This situation is called a
deadlock.
Deadlock is always a danger in systems that provide concurrent access to
multiple shared resources.
One way to avoid the deadlock in this situation is to give each account a
unique identification number and rewrite serialized-exchange
so that a
process will always attempt to enter a procedure protecting the lowest-numbered
account first. Although this method works well for the exchange problem, there
are other situations that require more sophisticated deadlock-avoidance
techniques, or where deadlock cannot be avoided at all. (See Exercise 3-48 and Exercise 3-49.)(176)
Exercise 3.48: Explain in detail why the deadlock-avoidance method described above, (i.e., the accounts are numbered, and each process attempts to acquire the smaller-numbered account first) avoids deadlock in the exchange problem. Rewrite
serialized-exchange
to incorporate this idea. (You will also need to modifymake-account
so that each account is created with a number, which can be accessed by sending an appropriate message.)
Exercise 3.49: Give a scenario where the deadlock-avoidance mechanism described above does not work. (Hint: In the exchange problem, each process knows in advance which accounts it will need to get access to. Consider a situation where a process must get access to some shared resources before it can know which additional shared resources it will require.)
We’ve seen how programming concurrent systems requires controlling the ordering of events when different processes access shared state, and we’ve seen how to achieve this control through judicious use of serializers. But the problems of concurrency lie deeper than this, because, from a fundamental point of view, it’s not always clear what is meant by “shared state.”
Mechanisms such as test-and-set!
require processes to examine a global
shared flag at arbitrary times. This is problematic and inefficient to
implement in modern high-speed processors, where due to optimization techniques
such as pipelining and cached memory, the contents of memory may not be in a
consistent state at every instant. In contemporary multiprocessing systems,
therefore, the serializer paradigm is being supplanted by new approaches to
concurrency control.(177)
The problematic aspects of shared state also arise in large, distributed systems. For instance, imagine a distributed banking system where individual branch banks maintain local values for bank balances and periodically compare these with values maintained by other branches. In such a system the value of “the account balance” would be undetermined, except right after synchronization. If Peter deposits money in an account he holds jointly with Paul, when should we say that the account balance has changed—when the balance in the local branch changes, or not until after the synchronization? And if Paul accesses the account from a different branch, what are the reasonable constraints to place on the banking system such that the behavior is “correct”? The only thing that might matter for correctness is the behavior observed by Peter and Paul individually and the “state” of the account immediately after synchronization. Questions about the “real” account balance or the order of events between synchronizations may be irrelevant or meaningless.(178)
The basic phenomenon here is that synchronizing different processes, establishing shared state, or imposing an order on events requires communication among the processes. In essence, any notion of time in concurrency control must be intimately tied to communication.(179) It is intriguing that a similar connection between time and communication also arises in the Theory of Relativity, where the speed of light (the fastest signal that can be used to synchronize events) is a fundamental constant relating time and space. The complexities we encounter in dealing with time and state in our computational models may in fact mirror a fundamental complexity of the physical universe.
[ << ] | [ < ] | [ Up ] | [ > ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
We’ve gained a good understanding of assignment as a tool in modeling, as well as an appreciation of the complex problems that assignment raises. It is time to ask whether we could have gone about things in a different way, so as to avoid some of these problems. In this section, we explore an alternative approach to modeling state, based on data structures called streams. As we shall see, streams can mitigate some of the complexity of modeling state.
Let’s step back and review where this complexity comes from. In an attempt to model real-world phenomena, we made some apparently reasonable decisions: We modeled real-world objects with local state by computational objects with local variables. We identified time variation in the real world with time variation in the computer. We implemented the time variation of the states of the model objects in the computer with assignments to the local variables of the model objects.
Is there another approach? Can we avoid identifying time in the computer with time in the modeled world? Must we make the model change with time in order to model phenomena in a changing world? Think about the issue in terms of mathematical functions. We can describe the time-varying behavior of a quantity x as a function of time x(t). If we concentrate on x instant by instant, we think of it as a changing quantity. Yet if we concentrate on the entire time history of values, we do not emphasize change—the function itself does not change.(180)
If time is measured in discrete steps, then we can model a time function as a (possibly infinite) sequence. In this section, we will see how to model change in terms of sequences that represent the time histories of the systems being modeled. To accomplish this, we introduce new data structures called streams. From an abstract point of view, a stream is simply a sequence. However, we will find that the straightforward implementation of streams as lists (as in section Representing Sequences) doesn’t fully reveal the power of stream processing. As an alternative, we introduce the technique of delayed evaluation, which enables us to represent very large (even infinite) sequences as streams.
Stream processing lets us model systems that have state without ever using assignment or mutable data. This has important implications, both theoretical and practical, because we can build models that avoid the drawbacks inherent in introducing assignment. On the other hand, the stream framework raises difficulties of its own, and the question of which modeling technique leads to more modular and more easily maintained systems remains open.
3.5.1 Streams Are Delayed Lists | ||
3.5.2 Infinite Streams | ||
3.5.3 Exploiting the Stream Paradigm | ||
3.5.4 Streams and Delayed Evaluation | ||
3.5.5 Modularity of Functional Programs and Modularity of Objects |
[ << ] | [ < ] | [ Up ] | [ > ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
As we saw in section Sequences as Conventional Interfaces, sequences can serve as standard interfaces
for combining program modules. We formulated powerful abstractions for
manipulating sequences, such as map
, filter
, and
accumulate
, that capture a wide variety of operations in a manner that
is both succinct and elegant.
Unfortunately, if we represent sequences as lists, this elegance is bought at the price of severe inefficiency with respect to both the time and space required by our computations. When we represent manipulations on sequences as transformations of lists, our programs must construct and copy data structures (which may be huge) at every step of a process.
To see why this is true, let us compare two programs for computing the sum of all the prime numbers in an interval. The first program is written in standard iterative style:(181)
(define (sum-primes a b) (define (iter count accum) (cond ((> count b) accum) ((prime? count) (iter (+ count 1) (+ count accum))) (else (iter (+ count 1) accum)))) (iter a 0))
The second program performs the same computation using the sequence operations of section Sequences as Conventional Interfaces:
(define (sum-primes a b) (accumulate + 0 (filter prime? (enumerate-interval a b))))
In carrying out the computation, the first program needs to store only the sum
being accumulated. In contrast, the filter in the second program cannot do any
testing until enumerate-interval
has constructed a complete list of the
numbers in the interval. The filter generates another list, which in turn is
passed to accumulate
before being collapsed to form a sum. Such large
intermediate storage is not needed by the first program, which we can think of
as enumerating the interval incrementally, adding each prime to the sum as it
is generated.
The inefficiency in using lists becomes painfully apparent if we use the sequence paradigm to compute the second prime in the interval from 10,000 to 1,000,000 by evaluating the expression
(car (cdr (filter prime? (enumerate-interval 10000 1000000))))
This expression does find the second prime, but the computational overhead is outrageous. We construct a list of almost a million integers, filter this list by testing each element for primality, and then ignore almost all of the result. In a more traditional programming style, we would interleave the enumeration and the filtering, and stop when we reached the second prime.
Streams are a clever idea that allows one to use sequence manipulations without incurring the costs of manipulating sequences as lists. With streams we can achieve the best of both worlds: We can formulate programs elegantly as sequence manipulations, while attaining the efficiency of incremental computation. The basic idea is to arrange to construct a stream only partially, and to pass the partial construction to the program that consumes the stream. If the consumer attempts to access a part of the stream that has not yet been constructed, the stream will automatically construct just enough more of itself to produce the required part, thus preserving the illusion that the entire stream exists. In other words, although we will write programs as if we were processing complete sequences, we design our stream implementation to automatically and transparently interleave the construction of the stream with its use.
On the surface, streams are just lists with different names for the procedures
that manipulate them. There is a constructor, cons-stream
, and two
selectors, stream-car
and stream-cdr
, which satisfy the
constraints
(stream-car (cons-stream x y)) = x (stream-cdr (cons-stream x y)) = y
There is a distinguishable object, the-empty-stream
, which cannot be the
result of any cons-stream
operation, and which can be identified with
the predicate stream-null?
.(182) Thus we can
make and use streams, in just the same way as we can make and use lists, to
represent aggregate data arranged in a sequence. In particular, we can build
stream analogs of the list operations from Building Abstractions with Data, such as
list-ref
, map
, and for-each
:(183)
(define (stream-ref s n) (if (= n 0) (stream-car s) (stream-ref (stream-cdr s) (- n 1)))) (define (stream-map proc s) (if (stream-null? s) the-empty-stream (cons-stream (proc (stream-car s)) (stream-map proc (stream-cdr s))))) (define (stream-for-each proc s) (if (stream-null? s) 'done (begin (proc (stream-car s)) (stream-for-each proc (stream-cdr s)))))
Stream-for-each
is useful for viewing streams:
(define (display-stream s) (stream-for-each display-line s)) (define (display-line x) (newline) (display x))
To make the stream implementation automatically and transparently interleave
the construction of a stream with its use, we will arrange for the cdr
of a stream to be evaluated when it is accessed by the stream-cdr
procedure rather than when the stream is constructed by cons-stream
.
This implementation choice is reminiscent of our discussion of rational numbers
in section Abstraction Barriers, where we saw that we can choose to implement rational
numbers so that the reduction of numerator and denominator to lowest terms is
performed either at construction time or at selection time. The two
rational-number implementations produce the same data abstraction, but the
choice has an effect on efficiency. There is a similar relationship between
streams and ordinary lists. As a data abstraction, streams are the same as
lists. The difference is the time at which the elements are evaluated. With
ordinary lists, both the car
and the cdr
are evaluated at
construction time. With streams, the cdr
is evaluated at selection
time.
Our implementation of streams will be based on a special form called
delay
. Evaluating (delay <exp>)
does not evaluate the
expression <exp>, but rather returns a so-called
object
delayed
object, which we can think of as a “promise” to evaluate <exp> at some
future time. As a companion to delay
, there is a procedure called
force
that takes a delayed object as argument and performs the
evaluation—in effect, forcing the delay
to fulfill its promise. We
will see below how delay
and force
can be implemented, but first
let us use these to construct streams.
Cons-stream
is a special form defined so that
(cons-stream <a> <b>)
is equivalent to
(cons <a> (delay <b>))
What this means is that we will construct streams using pairs. However, rather
than placing the value of the rest of the stream into the cdr
of the
pair we will put there a promise to compute the rest if it is ever requested.
Stream-car
and stream-cdr
can now be defined as procedures:
(define (stream-car stream) (car stream)) (define (stream-cdr stream) (force (cdr stream)))
Stream-car
selects the car
of the pair; stream-cdr
selects
the cdr
of the pair and evaluates the delayed expression found there to
obtain the rest of the stream.(184)
To see how this implementation behaves, let us analyze the “outrageous” prime computation we saw above, reformulated in terms of streams:
(stream-car (stream-cdr (stream-filter prime? (stream-enumerate-interval 10000 1000000))))
We will see that it does indeed work efficiently.
We begin by calling stream-enumerate-interval
with the arguments 10,000
and 1,000,000. Stream-enumerate-interval
is the stream analog of
enumerate-interval
(section Sequences as Conventional Interfaces):
(define (stream-enumerate-interval low high) (if (> low high) the-empty-stream (cons-stream low (stream-enumerate-interval (+ low 1) high))))
and thus the result returned by stream-enumerate-interval
, formed by the
cons-stream
, is(185)
(cons 10000 (delay (stream-enumerate-interval 10001 1000000)))
That is, stream-enumerate-interval
returns a stream represented as a
pair whose car
is 10,000 and whose cdr
is a promise to enumerate
more of the interval if so requested. This stream is now filtered for primes,
using the stream analog of the filter
procedure (section Sequences as Conventional Interfaces):
(define (stream-filter pred stream) (cond ((stream-null? stream) the-empty-stream) ((pred (stream-car stream)) (cons-stream (stream-car stream) (stream-filter pred (stream-cdr stream)))) (else (stream-filter pred (stream-cdr stream)))))
Stream-filter
tests the stream-car
of the stream (the car
of the pair, which is 10,000). Since this is not prime, stream-filter
examines the stream-cdr
of its input stream. The call to
stream-cdr
forces evaluation of the delayed
stream-enumerate-interval
, which now returns
(cons 10001 (delay (stream-enumerate-interval 10002 1000000)))
Stream-filter
now looks at the stream-car
of this stream, 10,001,
sees that this is not prime either, forces another stream-cdr
, and so
on, until stream-enumerate-interval
yields the prime 10,007, whereupon
stream-filter
, according to its definition, returns
(cons-stream (stream-car stream) (stream-filter pred (stream-cdr stream)))
which in this case is
(cons 10007 (delay (stream-filter prime? (cons 10008 (delay (stream-enumerate-interval 10009 1000000))))))
This result is now passed to stream-cdr
in our original expression.
This forces the delayed stream-filter
, which in turn keeps forcing the
delayed stream-enumerate-interval
until it finds the next prime, which
is 10,009. Finally, the result passed to stream-car
in our original
expression is
(cons 10009 (delay (stream-filter prime? (cons 10010 (delay (stream-enumerate-interval 10011 1000000))))))
Stream-car
returns 10,009, and the computation is complete. Only as
many integers were tested for primality as were necessary to find the second
prime, and the interval was enumerated only as far as was necessary to feed the
prime filter.
In general, we can think of delayed evaluation as “demand-driven” programming, whereby each stage in the stream process is activated only enough to satisfy the next stage. What we have done is to decouple the actual order of events in the computation from the apparent structure of our procedures. We write procedures as if the streams existed “all at once” when, in reality, the computation is performed incrementally, as in traditional programming styles.
delay
and force
Although delay
and force
may seem like mysterious operations,
their implementation is really quite straightforward. Delay
must
package an expression so that it can be evaluated later on demand, and we can
accomplish this simply by treating the expression as the body of a procedure.
Delay
can be a special form such that
(delay <exp>)
is syntactic sugar for
(lambda () <exp>)
Force
simply calls the procedure (of no arguments) produced by
delay
, so we can implement force
as a procedure:
(define (force delayed-object) (delayed-object))
This implementation suffices for delay
and force
to work as
advertised, but there is an important optimization that we can include. In
many applications, we end up forcing the same delayed object many times. This
can lead to serious inefficiency in recursive programs involving streams. (See
Exercise 3-57.) The solution is to build delayed objects so that the
first time they are forced, they store the value that is computed. Subsequent
forcings will simply return the stored value without repeating the computation.
In other words, we implement delay
as a special-purpose memoized
procedure similar to the one described in Exercise 3-27. One way to
accomplish this is to use the following procedure, which takes as argument a
procedure (of no arguments) and returns a memoized version of the procedure.
The first time the memoized procedure is run, it saves the computed result. On
subsequent evaluations, it simply returns the result.
(define (memo-proc proc) (let ((already-run? false) (result false)) (lambda () (if (not already-run?) (begin (set! result (proc)) (set! already-run? true) result) result))))
Delay
is then defined so that (delay <exp>)
is equivalent
to
(memo-proc (lambda () <exp>))
and force
is as defined previously.(186)
Exercise 3.50: Complete the following definition, which generalizes
stream-map
to allow procedures that take multiple arguments, analogous tomap
in section Sequences as Conventional Interfaces, footnote Footnote 12.(define (stream-map proc . argstreams) (if (<??> (car argstreams)) the-empty-stream (<??> (apply proc (map <??> argstreams)) (apply stream-map (cons proc (map <??> argstreams))))))
Exercise 3.51: In order to take a closer look at delayed evaluation, we will use the following procedure, which simply returns its argument after printing it:
(define (show x) (display-line x) x)What does the interpreter print in response to evaluating each expression in the following sequence?(187)
(define x (stream-map show (stream-enumerate-interval 0 10))) (stream-ref x 5) (stream-ref x 7)
Exercise 3.52: Consider the sequence of expressions
(define sum 0) (define (accum x) (set! sum (+ x sum)) sum) (define seq (stream-map accum (stream-enumerate-interval 1 20))) (define y (stream-filter even? seq)) (define z (stream-filter (lambda (x) (= (remainder x 5) 0)) seq)) (stream-ref y 7) (display-stream z)What is the value of
sum
after each of the above expressions is evaluated? What is the printed response to evaluating thestream-ref
anddisplay-stream
expressions? Would these responses differ if we had implemented(delay <exp>)
simply as(lambda () <exp>)
without using the optimization provided bymemo-proc
? Explain
[ << ] | [ < ] | [ Up ] | [ > ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
We have seen how to support the illusion of manipulating streams as complete entities even though, in actuality, we compute only as much of the stream as we need to access. We can exploit this technique to represent sequences efficiently as streams, even if the sequences are very long. What is more striking, we can use streams to represent sequences that are infinitely long. For instance, consider the following definition of the stream of positive integers:
(define (integers-starting-from n) (cons-stream n (integers-starting-from (+ n 1)))) (define integers (integers-starting-from 1))
This makes sense because integers
will be a pair whose car
is 1
and whose cdr
is a promise to produce the integers beginning with 2.
This is an infinitely long stream, but in any given time we can examine only a
finite portion of it. Thus, our programs will never know that the entire
infinite stream is not there.
Using integers
we can define other infinite streams, such as the stream
of integers that are not divisible by 7:
(define (divisible? x y) (= (remainder x y) 0)) (define no-sevens (stream-filter (lambda (x) (not (divisible? x 7))) integers))
Then we can find integers not divisible by 7 simply by accessing elements of this stream:
(stream-ref no-sevens 100) 117
In analogy with integers
, we can define the infinite stream of Fibonacci
numbers:
(define (fibgen a b) (cons-stream a (fibgen b (+ a b)))) (define fibs (fibgen 0 1))
Fibs
is a pair whose car
is 0 and whose cdr
is a promise
to evaluate (fibgen 1 1)
. When we evaluate this delayed (fibgen 1
1)
, it will produce a pair whose car
is 1 and whose cdr
is a
promise to evaluate (fibgen 1 2)
, and so on.
For a look at a more exciting infinite stream, we can generalize the
no-sevens
example to construct the infinite stream of prime numbers,
using a method known as the
Eratosthenes
sieve of
Eratosthenes.(188)
We start with the integers beginning with 2, which is the first prime. To get
the rest of the primes, we start by filtering the multiples of 2 from the rest
of the integers. This leaves a stream beginning with 3, which is the next
prime. Now we filter the multiples of 3 from the rest of this stream. This
leaves a stream beginning with 5, which is the next prime, and so on. In other
words, we construct the primes by a sieving process, described as follows: To
sieve a stream S
, form a stream whose first element is the first element
of S
and the rest of which is obtained by filtering all multiples of the
first element of S
out of the rest of S
and sieving the
result. This process is readily described in terms of stream operations:
(define (sieve stream) (cons-stream (stream-car stream) (sieve (stream-filter (lambda (x) (not (divisible? x (stream-car stream)))) (stream-cdr stream))))) (define primes (sieve (integers-starting-from 2)))
Now to find a particular prime we need only ask for it:
(stream-ref primes 50) 233
It is interesting to contemplate the signal-processing system set up by
sieve
, shown in the “Henderson diagram” in Figure 3-31.(189) The input stream
feeds into an “uncons
er” that separates the first element of the
stream from the rest of the stream. The first element is used to construct a
divisibility filter, through which the rest is passed, and the output of the
filter is fed to another sieve box. Then the original first element is
cons
ed onto the output of the internal sieve to form the output stream.
Thus, not only is the stream infinite, but the signal processor is also
infinite, because the sieve contains a sieve within it.
Figure 3.31: The prime sieve viewed as a signal-processing system.
+---------------------------------------------------------------+ | sieve | | | | __/| |\__ | | __/car|........................................| \__ | | _/ | : | \_ | ----><_ | V | cons _>----> | \__ | +------------+ +------------+ | __/ | | \cdr|--->| filter: | | sieve |--->| __/ | | \| | |--->| | |/ | | | not | | | | | | divisible? | | | | | +------------+ +------------+ | +---------------------------------------------------------------+
The integers
and fibs
streams above were defined by specifying
“generating” procedures that explicitly compute the stream elements one by
one. An alternative way to specify streams is to take advantage of delayed
evaluation to define streams implicitly. For example, the following expression
defines the stream ones
to be an infinite stream of ones:
(define ones (cons-stream 1 ones))
This works much like the definition of a recursive procedure: ones
is a
pair whose car
is 1 and whose cdr
is a promise to evaluate
ones
. Evaluating the cdr
gives us again a 1 and a promise to
evaluate ones
, and so on.
We can do more interesting things by manipulating streams with operations such
as add-streams
, which produces the elementwise sum of two given
streams:(190)
(define (add-streams s1 s2) (stream-map + s1 s2))
Now we can define the integers as follows:
(define integers (cons-stream 1 (add-streams ones integers)))
This defines integers
to be a stream whose first element is 1 and the
rest of which is the sum of ones
and integers
. Thus, the second
element of integers
is 1 plus the first element of integers
, or
2; the third element of integers
is 1 plus the second element of
integers
, or 3; and so on. This definition works because, at any point,
enough of the integers
stream has been generated so that we can feed it
back into the definition to produce the next integer.
We can define the Fibonacci numbers in the same style:
(define fibs (cons-stream 0 (cons-stream 1 (add-streams (stream-cdr fibs) fibs))))
This definition says that fibs
is a stream beginning with 0 and 1, such
that the rest of the stream can be generated by adding fibs
to itself
shifted by one place:
1 1 2 3 5 8 13 21 … =(stream-cdr fibs)
0 1 1 2 3 5 8 13 … =fibs
0 1 1 2 3 5 8 13 21 34 … =fibs
Scale-stream
is another useful procedure in formulating such stream
definitions. This multiplies each item in a stream by a given constant:
(define (scale-stream stream factor) (stream-map (lambda (x) (* x factor)) stream))
For example,
(define double (cons-stream 1 (scale-stream double 2)))
produces the stream of powers of 2: 1, 2, 4, 8, 16, 32, ….
An alternate definition of the stream of primes can be given by starting with the integers and filtering them by testing for primality. We will need the first prime, 2, to get started:
(define primes (cons-stream 2 (stream-filter prime? (integers-starting-from 3))))
This definition is not so straightforward as it appears, because we will test whether a number n is prime by checking whether n is divisible by a prime (not by just any integer) less than or equal to [sqrt](n):
(define (prime? n) (define (iter ps) (cond ((> (square (stream-car ps)) n) true) ((divisible? n (stream-car ps)) false) (else (iter (stream-cdr ps))))) (iter primes))
This is a recursive definition, since primes
is defined in terms of the
prime?
predicate, which itself uses the primes
stream. The
reason this procedure works is that, at any point, enough of the primes
stream has been generated to test the primality of the numbers we need to check
next. That is, for every n we test for primality, either n is not
prime (in which case there is a prime already generated that divides it) or
n is prime (in which case there is a prime already generated—i.e., a
prime less than n—that is greater than
[sqrt](n)).(191)
Exercise 3.53: Without running the program, describe the elements of the stream defined by
(define s (cons-stream 1 (add-streams s s)))
Exercise 3.54: Define a procedure
mul-streams
, analogous toadd-streams
, that produces the elementwise product of its two input streams. Use this together with the stream ofintegers
to complete the following definition of the stream whose nth element (counting from 0) is n + 1 factorial:(define factorials (cons-stream 1 (mul-streams <??> <??>)))
Exercise 3.55: Define a procedure
partial-sums
that takes as argument a stream S and returns the stream whose elements are S_0, S_0 + S_1, S_0 + S_1 + S_2, …. For example,(partial-sums integers)
should be the stream 1, 3, 6, 10, 15, ….
Exercise 3.56: A famous problem, first raised by R. Hamming, is to enumerate, in ascending order with no repetitions, all positive integers with no prime factors other than 2, 3, or 5. One obvious way to do this is to simply test each integer in turn to see whether it has any factors other than 2, 3, and 5. But this is very inefficient, since, as the integers get larger, fewer and fewer of them fit the requirement. As an alternative, let us call the required stream of numbers
S
and notice the following facts about it.
S
begins with 1.- The elements of
(scale-stream S 2)
are also elements ofS
.- The same is true for
(scale-stream S 3)
and(scale-stream 5 S)
.- These are all the elements of
S
.Now all we have to do is combine elements from these sources. For this we define a procedure
merge
that combines two ordered streams into one ordered result stream, eliminating repetitions:(define (merge s1 s2) (cond ((stream-null? s1) s2) ((stream-null? s2) s1) (else (let ((s1car (stream-car s1)) (s2car (stream-car s2))) (cond ((< s1car s2car) (cons-stream s1car (merge (stream-cdr s1) s2))) ((> s1car s2car) (cons-stream s2car (merge s1 (stream-cdr s2)))) (else (cons-stream s1car (merge (stream-cdr s1) (stream-cdr s2)))))))))Then the required stream may be constructed with
merge
, as follows:(define S (cons-stream 1 (merge <??> <??>)))Fill in the missing expressions in the places marked <??> above.
Exercise 3.57: How many additions are performed when we compute the nth Fibonacci number using the definition of
fibs
based on theadd-streams
procedure? Show that the number of additions would be exponentially greater if we had implemented(delay <exp>)
simply as(lambda () <exp>)
, without using the optimization provided by thememo-proc
procedure described in section Streams Are Delayed Lists.(192)
Exercise 3.58: Give an interpretation of the stream computed by the following procedure:
(define (expand num den radix) (cons-stream (quotient (* num radix) den) (expand (remainder (* num radix) den) den radix)))(
Quotient
is a primitive that returns the integer quotient of two integers.) What are the successive elements produced by(expand 1 7 10)
? What is produced by(expand 3 8 10)
?
Exercise 3.59: In section Example: Symbolic Algebra we saw how to implement a polynomial arithmetic system representing polynomials as lists of terms. In a similar way, we can work with power series, such as
x^2 x^3 x^4 e^x = 1 + x + ----- + ----- + --------- + ... 2 3 * 2 4 * 3 * 2 x^2 x^4 cos x = 1 - ----- + --------- - ... 2 4 * 3 * 2 x^3 x^5 sin x = x - ----- + ------------- - ... 3 * 2 5 * 4 * 3 * 2represented as infinite streams. We will represent the series a_0 + a_1 x + a_2 x^2 + a_3 x^3 + … as the stream whose elements are the coefficients a_0, a_1, a_2, a_3, ….
- The integral of the series a_0 + a_1 x + a_2 x^2 + a_3 x^3 + … is the series
1 1 1 c + a_0 x + --- x_1 r^2 + --- a_2 r^3 + --- a_3 r^4 + ... 2 3 4where c is any constant. Define a procedure
integrate-series
that takes as input a stream a_0, a_1, a_2, … representing a power series and returns the stream a_0, (1/2)a_1, (1/3)a_2, … of coefficients of the non-constant terms of the integral of the series. (Since the result has no constant term, it doesn’t represent a power series; when we useintegrate-series
, we willcons
on the appropriate constant.)- The function x |-> e^x is its own derivative. This implies that e^x and the integral of e^x are the same series, except for the constant term, which is e^0 = 1. Accordingly, we can generate the series for e^x as
(define exp-series (cons-stream 1 (integrate-series exp-series)))Show how to generate the series for sine and cosine, starting from the facts that the derivative of sine is cosine and the derivative of cosine is the negative of sine:
(define cosine-series (cons-stream 1 <??>)) (define sine-series (cons-stream 0 <??>))
Exercise 3.60: With power series represented as streams of coefficients as in Exercise 3-59, adding series is implemented by
add-streams
. Complete the definition of the following procedure for multiplying series:(define (mul-series s1 s2) (cons-stream <??> (add-streams <??> <??>)))You can test your procedure by verifying that sin^2 x + cos^2 x = 1, using the series from Exercise 3-59.
Exercise 3.61: Let S be a power series (Exercise 3-59) whose constant term is 1. Suppose we want to find the power series 1/S, that is, the series X such that S * X = 1. Write S = 1 + S_R where S_R is the part of S after the constant term. Then we can solve for X as follows:
S * X = 1 (1 + S_R) * X = 1 X + S_R * X = 1 X = 1 - S_R * XIn other words, X is the power series whose constant term is 1 and whose higher-order terms are given by the negative of S_R times X. Use this idea to write a procedure
invert-unit-series
that computes 1/S for a power series S with constant term 1. You will need to usemul-series
from Exercise 3-60.
Exercise 3.62: Use the results of Exercise 3-60 and Exercise 3-61 to define a procedure
div-series
that divides two power series.Div-series
should work for any two series, provided that the denominator series begins with a nonzero constant term. (If the denominator has a zero constant term, thendiv-series
should signal an error.) Show how to usediv-series
together with the result of Exercise 3-59 to generate the power series for tangent.
[ << ] | [ < ] | [ Up ] | [ > ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
Streams with delayed evaluation can be a powerful modeling tool, providing many of the benefits of local state and assignment. Moreover, they avoid some of the theoretical tangles that accompany the introduction of assignment into a programming language.
The stream approach can be illuminating because it allows us to build systems with different module boundaries than systems organized around assignment to state variables. For example, we can think of an entire time series (or signal) as a focus of interest, rather than the values of the state variables at individual moments. This makes it convenient to combine and compare components of state from different moments.
In section Linear Recursion and Iteration, we introduced iterative processes, which proceed by updating state variables. We know now that we can represent state as a “timeless” stream of values rather than as a set of variables to be updated. Let’s adopt this perspective in revisiting the square-root procedure from section Example: Square Roots by Newton’s Method. Recall that the idea is to generate a sequence of better and better guesses for the square root of x by applying over and over again the procedure that improves guesses:
(define (sqrt-improve guess x) (average guess (/ x guess)))
In our original sqrt
procedure, we made these guesses be the successive
values of a state variable. Instead we can generate the infinite stream of
guesses, starting with an initial guess of 1:(193)
(define (sqrt-stream x) (define guesses (cons-stream 1.0 (stream-map (lambda (guess) (sqrt-improve guess x)) guesses))) guesses) (display-stream (sqrt-stream 2)) 1. 1.5 1.4166666666666665 1.4142156862745097 1.4142135623746899 …
We can generate more and more terms of the stream to get better and better guesses. If we like, we can write a procedure that keeps generating terms until the answer is good enough. (See Exercise 3-64.)
Another iteration that we can treat in the same way is to generate an approximation to [pi], based upon the alternating series that we saw in section Procedures as Arguments:
[pi] 1 1 1 ---- = 1 - --- + --- - --- + ... 4 3 5 7
We first generate the stream of summands of the series (the reciprocals of the
odd integers, with alternating signs). Then we take the stream of sums of more
and more terms (using the partial-sums
procedure of Exercise 3-55)
and scale the result by 4:
(define (pi-summands n) (cons-stream (/ 1.0 n) (stream-map - (pi-summands (+ n 2))))) (define pi-stream (scale-stream (partial-sums (pi-summands 1)) 4)) (display-stream pi-stream) 4. 2.666666666666667 3.466666666666667 2.8952380952380956 3.3396825396825403 2.9760461760461765 3.2837384837384844 3.017071817071818 …
This gives us a stream of better and better approximations to [pi], although the approximations converge rather slowly. Eight terms of the sequence bound the value of [pi] between 3.284 and 3.017.
So far, our use of the stream of states approach is not much different from updating state variables. But streams give us an opportunity to do some interesting tricks. For example, we can transform a stream with a sequence accelerator that converts a sequence of approximations to a new sequence that converges to the same value as the original, only faster.
One such accelerator, due to the eighteenth-century Swiss mathematician Leonhard Euler, works well with sequences that are partial sums of alternating series (series of terms with alternating signs). In Euler’s technique, if S_n is the nth term of the original sum sequence, then the accelerated sequence has terms
(S_(n+1) - S_n)^2 S_(n+1) - ------------------------ S_(n-1) - 2S_n + S_(n+1)
Thus, if the original sequence is represented as a stream of values, the transformed sequence is given by
(define (euler-transform s) (let ((s0 (stream-ref s 0)) ; S_(n-1) (s1 (stream-ref s 1)) ; S_n (s2 (stream-ref s 2))) ; S_(n+1) (cons-stream (- s2 (/ (square (- s2 s1)) (+ s0 (* -2 s1) s2))) (euler-transform (stream-cdr s)))))
We can demonstrate Euler acceleration with our sequence of approximations to [pi]:
(display-stream (euler-transform pi-stream)) 3.166666666666667 3.1333333333333337 3.1452380952380956 3.13968253968254 3.1427128427128435 3.1408813408813416 3.142071817071818 3.1412548236077655 …
Even better, we can accelerate the accelerated sequence, and recursively accelerate that, and so on. Namely, we create a stream of streams (a structure we’ll call a tableau) in which each stream is the transform of the preceding one:
(define (make-tableau transform s) (cons-stream s (make-tableau transform (transform s))))
The tableau has the form
s_00 s_01 s_02 s_03 s_04 ... s_10 s_11 s_12 s_13 ... s_20 s_21 s_22 ... ...
Finally, we form a sequence by taking the first term in each row of the tableau:
(define (accelerated-sequence transform s) (stream-map stream-car (make-tableau transform s)))
We can demonstrate this kind of “super-acceleration” of the [pi] sequence:
(display-stream (accelerated-sequence euler-transform pi-stream)) 4. 3.166666666666667 3.142105263157895 3.141599357319005 3.1415927140337785 3.1415926539752927 3.1415926535911765 3.141592653589778 …
The result is impressive. Taking eight terms of the sequence yields the correct value of [pi] to 14 decimal places. If we had used only the original [pi] sequence, we would need to compute on the order of 10^13 terms (i.e., expanding the series far enough so that the individual terms are less then 10^(-13)) to get that much accuracy!
We could have implemented these acceleration techniques without using streams. But the stream formulation is particularly elegant and convenient because the entire sequence of states is available to us as a data structure that can be manipulated with a uniform set of operations.
Exercise 3.63: Louis Reasoner asks why the
sqrt-stream
procedure was not written in the following more straightforward way, without the local variableguesses
:(define (sqrt-stream x) (cons-stream 1.0 (stream-map (lambda (guess) (sqrt-improve guess x)) (sqrt-stream x))))Alyssa P. Hacker replies that this version of the procedure is considerably less efficient because it performs redundant computation. Explain Alyssa’s answer. Would the two versions still differ in efficiency if our implementation of
delay
used only(lambda () <exp>)
without using the optimization provided bymemo-proc
(section Streams Are Delayed Lists)?
Exercise 3.64: Write a procedure
stream-limit
that takes as arguments a stream and a number (the tolerance). It should examine the stream until it finds two successive elements that differ in absolute value by less than the tolerance, and return the second of the two elements. Using this, we could compute square roots up to a given tolerance by(define (sqrt x tolerance) (stream-limit (sqrt-stream x) tolerance))
1 1 1 ln 2 = 1 - --- + --- - --- + ... 2 3 4to compute three sequences of approximations to the natural logarithm of 2, in the same way we did above for [pi]. How rapidly do these sequences converge?
In section Sequences as Conventional Interfaces, we saw how the sequence paradigm handles traditional nested loops as processes defined on sequences of pairs. If we generalize this technique to infinite streams, then we can write programs that are not easily represented as loops, because the “looping” must range over an infinite set.
For example, suppose we want to generalize the prime-sum-pairs
procedure
of section Sequences as Conventional Interfaces to produce the stream of pairs of all integers
(i,j) with i <= j such that i + j is prime. If
int-pairs
is the sequence of all pairs of integers (i,j) with
i <= j, then our required stream is simply(194)
(stream-filter (lambda (pair) (prime? (+ (car pair) (cadr pair)))) int-pairs)
Our problem, then, is to produce the stream int-pairs
. More generally,
suppose we have two streams S = (S_i) and T = (T_j),
and imagine the infinite rectangular array
(S_0, T_0) (S_0, T_1) (S_0, T_2) ... (S_1, T_0) (S_1, T_1) (S_1, T_2) ... (S_2, T_0) (S_2, T_1) (S_2, T_2) ... ...
We wish to generate a stream that contains all the pairs in the array that lie on or above the diagonal, i.e., the pairs
(S_0, T_0) (S_0, T_1) (S_0, T_2) ... (S_1, T_1) (S_1, T_2) ... (S_2, T_2) ... ...
(If we take both S and T to be the stream of integers, then this will
be our desired stream int-pairs
.)
Call the general stream of pairs (pairs S T)
, and consider it to be
composed of three parts: the pair (S_0,T_0), the rest of the pairs in
the first row, and the remaining pairs:(195)
(S_0, T_0) | (S_0, T_1) (S_0, T_2) ... -----------+----------------------------- | (S_1, T_1) (S_1, T_2) ... | (S_2, T_2) ... | ...
Observe that the third piece in this decomposition (pairs that are not in the
first row) is (recursively) the pairs formed from (stream-cdr S)
and
(stream-cdr T)
. Also note that the second piece (the rest of the first
row) is
(stream-map (lambda (x) (list (stream-car s) x)) (stream-cdr t))
Thus we can form our stream of pairs as follows:
(define (pairs s t) (cons-stream (list (stream-car s) (stream-car t)) (<combine-in-some-way> (stream-map (lambda (x) (list (stream-car s) x)) (stream-cdr t)) (pairs (stream-cdr s) (stream-cdr t)))))
In order to complete the procedure, we must choose some way to combine the two
inner streams. One idea is to use the stream analog of the append
procedure from section Representing Sequences:
(define (stream-append s1 s2) (if (stream-null? s1) s2 (cons-stream (stream-car s1) (stream-append (stream-cdr s1) s2))))
This is unsuitable for infinite streams, however, because it takes all the elements from the first stream before incorporating the second stream. In particular, if we try to generate all pairs of positive integers using
(pairs integers integers)
our stream of results will first try to run through all pairs with the first integer equal to 1, and hence will never produce pairs with any other value of the first integer.
To handle infinite streams, we need to devise an order of combination that
ensures that every element will eventually be reached if we let our program run
long enough. An elegant way to accomplish this is with the following
interleave
procedure:(196)
(define (interleave s1 s2) (if (stream-null? s1) s2 (cons-stream (stream-car s1) (interleave s2 (stream-cdr s1)))))
Since interleave
takes elements alternately from the two streams, every
element of the second stream will eventually find its way into the interleaved
stream, even if the first stream is infinite.
We can thus generate the required stream of pairs as
(define (pairs s t) (cons-stream (list (stream-car s) (stream-car t)) (interleave (stream-map (lambda (x) (list (stream-car s) x)) (stream-cdr t)) (pairs (stream-cdr s) (stream-cdr t)))))
Exercise 3.66: Examine the stream
(pairs integers integers)
. Can you make any general comments about the order in which the pairs are placed into the stream? For example, about how many pairs precede the pair (1,100)? the pair (99,100)? the pair (100,100)? (If you can make precise mathematical statements here, all the better. But feel free to give more qualitative answers if you find yourself getting bogged down.)
Exercise 3.67: Modify the
pairs
procedure so that(pairs integers integers)
will produce the stream of all pairs of integers (i,j) (without the condition i <= j). Hint: You will need to mix in an additional stream.
Exercise 3.68: Louis Reasoner thinks that building a stream of pairs from three parts is unnecessarily complicated. Instead of separating the pair (S_0,T_0) from the rest of the pairs in the first row, he proposes to work with the whole first row, as follows:
(define (pairs s t) (interleave (stream-map (lambda (x) (list (stream-car s) x)) t) (pairs (stream-cdr s) (stream-cdr t))))Does this work? Consider what happens if we evaluate
(pairs integers integers)
using Louis’s definition ofpairs
.
Exercise 3.69: Write a procedure
triples
that takes three infinite streams, S, T, and U, and produces the stream of triples (S_i,T_j,U_k) such that i <= j <= k. Usetriples
to generate the stream of all Pythagorean triples of positive integers, i.e., the triples (i,j,k) such that i <= j and i^2 + j^2 = k^2.
Exercise 3.70: It would be nice to be able to generate streams in which the pairs appear in some useful order, rather than in the order that results from an ad hoc interleaving process. We can use a technique similar to the
merge
procedure of Exercise 3-56, if we define a way to say that one pair of integers is “less than” another. One way to do this is to define a “weighting function” W(i,j) and stipulate that (i_1,j_1) is less than (i_2,j_2) if W(i_1,j_1) < W(i_2,j_2). Write a proceduremerge-weighted
that is likemerge
, except thatmerge-weighted
takes an additional argumentweight
, which is a procedure that computes the weight of a pair, and is used to determine the order in which elements should appear in the resulting merged stream.(197) Using this, generalizepairs
to a procedureweighted-pairs
that takes two streams, together with a procedure that computes a weighting function, and generates the stream of pairs, ordered according to weight. Use your procedure to generate
- the stream of all pairs of positive integers (i,j) with i <= j ordered according to the sum i + j
- the stream of all pairs of positive integers (i,j) with i <= j, where neither i nor j is divisible by 2, 3, or 5, and the pairs are ordered according to the sum 2 i + 3 j + 5 i j.
Exercise 3.71: Numbers that can be expressed as the sum of two cubes in more than one way are sometimes called Ramanujan numbers, in honor of the mathematician Srinivasa Ramanujan.(198) Ordered streams of pairs provide an elegant solution to the problem of computing these numbers. To find a number that can be written as the sum of two cubes in two different ways, we need only generate the stream of pairs of integers (i,j) weighted according to the sum i^3 + j^3 (see Exercise 3-70), then search the stream for two consecutive pairs with the same weight. Write a procedure to generate the Ramanujan numbers. The first such number is 1,729. What are the next five?
Exercise 3.72: In a similar way to Exercise 3-71 generate a stream of all numbers that can be written as the sum of two squares in three different ways (showing how they can be so written).
We began our discussion of streams by describing them as computational analogs of the “signals” in signal-processing systems. In fact, we can use streams to model signal-processing systems in a very direct way, representing the values of a signal at successive time intervals as consecutive elements of a stream. For instance, we can implement an integrator or summer that, for an input stream x = (x_i), an initial value C, and a small increment dt, accumulates the sum
i --- S_i = C + > x_j dt --- j=1
and returns the stream of values S = (S_i). The following
integral
procedure is reminiscent of the “implicit style” definition
of the stream of integers (section Infinite Streams):
(define (integral integrand initial-value dt) (define int (cons-stream initial-value (add-streams (scale-stream integrand dt) int))) int)
Figure 3-32 is a picture of a signal-processing system that corresponds
to the integral
procedure. The input stream is scaled by dt and
passed through an adder, whose output is passed back through the same adder.
The self-reference in the definition of int
is reflected in the figure
by the feedback loop that connects the output of the adder to one of the
inputs.
Figure 3.32: The
integral
procedure viewed as a signal-processing system.initial-value | +-----------+ | |\__ input | | |\__ +-->| \_ integral ------>| scale: dt +----->| \_ |cons_>--*-------> | | | add_>---->| __/ | +-----------+ +-->| __/ |/ | | |/ | | | +------------------------+
Exercise 3.73: We can model electrical circuits using streams to represent the values of currents or voltages at a sequence of times. For instance, suppose we have an RC circuit consisting of a resistor of resistance R and a capacitor of capacitance C in series. The voltage response v of the circuit to an injected current i is determined by the formula in Figure 3-33, whose structure is shown by the accompanying signal-flow diagram.
Write a procedure
RC
that models this circuit.RC
should take as inputs the values of R, C, and dt and should return a procedure that takes as inputs a stream representing the current i and an initial value for the capacitor voltage v_0 and produces as output the stream of voltages v. For example, you should be able to useRC
to model an RC circuit with R = 5 ohms, C = 1 farad, and a 0.5-second time step by evaluating(define RC1 (RC 5 1 0.5))
. This definesRC1
as a procedure that takes a stream representing the time sequence of currents and an initial capacitor voltage and produces the output stream of voltages.
Figure 3.33: An RC circuit and the associated signal-flow diagram.
+ - ->----'\/\/\,---| |--- i C / t | i v = v + | dt + R i 0 | / 0 +--------------+ +-->| scale: R |---------------------+ |\_ | +--------------+ | | \_ | +-->| \ v i | +--------------+ +------------+ | add >---> ----+-->| scale: 1/C |---->| integral |----->| _/ +--------------+ +------------+ | _/ |/
Exercise 3.74: Alyssa P. Hacker is designing a system to process signals coming from physical sensors. One important feature she wishes to produce is a signal that describes the zero crossings of the input signal. That is, the resulting signal should be + 1 whenever the input signal changes from negative to positive, - 1 whenever the input signal changes from positive to negative, and 0 otherwise. (Assume that the sign of a 0 input is positive.) For example, a typical input signal with its associated zero-crossing signal would be
… 1 2 1.5 1 0.5 -0.1 -2 -3 -2 -0.5 0.2 3 4 … … 0 0 0 0 0 -1 0 0 0 0 1 0 0 …In Alyssa’s system, the signal from the sensor is represented as a stream
sense-data
and the streamzero-crossings
is the corresponding stream of zero crossings. Alyssa first writes a proceduresign-change-detector
that takes two values as arguments and compares the signs of the values to produce an appropriate 0, 1, or - 1. She then constructs her zero-crossing stream as follows:(define (make-zero-crossings input-stream last-value) (cons-stream (sign-change-detector (stream-car input-stream) last-value) (make-zero-crossings (stream-cdr input-stream) (stream-car input-stream)))) (define zero-crossings (make-zero-crossings sense-data 0))Alyssa’s boss, Eva Lu Ator, walks by and suggests that this program is approximately equivalent to the following one, which uses the generalized version of
stream-map
from Exercise 3-50:(define zero-crossings (stream-map sign-change-detector sense-data <expression>))Complete the program by supplying the indicated <expression>.
Exercise 3.75: Unfortunately, Alyssa’s zero-crossing detector in Exercise 3-74 proves to be insufficient, because the noisy signal from the sensor leads to spurious zero crossings. Lem E. Tweakit, a hardware specialist, suggests that Alyssa smooth the signal to filter out the noise before extracting the zero crossings. Alyssa takes his advice and decides to extract the zero crossings from the signal constructed by averaging each value of the sense data with the previous value. She explains the problem to her assistant, Louis Reasoner, who attempts to implement the idea, altering Alyssa’s program as follows:
(define (make-zero-crossings input-stream last-value) (let ((avpt (/ (+ (stream-car input-stream) last-value) 2))) (cons-stream (sign-change-detector avpt last-value) (make-zero-crossings (stream-cdr input-stream) avpt))))This does not correctly implement Alyssa’s plan. Find the bug that Louis has installed and fix it without changing the structure of the program. (Hint: You will need to increase the number of arguments to
make-zero-crossings
.)
Exercise 3.76: Eva Lu Ator has a criticism of Louis’s approach in Exercise 3-75. The program he wrote is not modular, because it intermixes the operation of smoothing with the zero-crossing extraction. For example, the extractor should not have to be changed if Alyssa finds a better way to condition her input signal. Help Louis by writing a procedure
smooth
that takes a stream as input and produces a stream in which each element is the average of two successive input stream elements. Then usesmooth
as a component to implement the zero-crossing detector in a more modular style.
[ << ] | [ < ] | [ Up ] | [ > ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
The integral
procedure at the end of the preceding section shows how we
can use streams to model signal-processing systems that contain feedback loops.
The feedback loop for the adder shown in Figure 3-32 is modeled by the
fact that integral
’s internal stream int
is defined in terms of
itself:
(define int (cons-stream initial-value (add-streams (scale-stream integrand dt) int)))
The interpreter’s ability to deal with such an implicit definition depends on
the delay
that is incorporated into cons-stream
. Without this
delay
, the interpreter could not construct int
before evaluating
both arguments to cons-stream
, which would require that int
already be defined. In general, delay
is crucial for using streams to
model signal-processing systems that contain loops. Without delay
, our
models would have to be formulated so that the inputs to any signal-processing
component would be fully evaluated before the output could be produced. This
would outlaw loops.
Unfortunately, stream models of systems with loops may require uses of
delay
beyond the “hidden” delay
supplied by cons-stream
.
For instance, Figure 3-34 shows a signal-processing system for solving
the differential equation dy/dt = f(y) where f is a given
function. The figure shows a mapping component, which applies f to its
input signal, linked in a feedback loop to an integrator in a manner very
similar to that of the analog computer circuits that are actually used to solve
such equations.
Figure 3.34: An “analog computer circuit” that solves the equation dy/dt = f(y).
y_0 | V +----------+ dy +----------+ y +-->| map: f +------>| integral +--*-----> | +----------+ +----------+ | | | +------------------------------------+
Assuming we are given an initial value y_0 for y, we could try to model this system using the procedure
(define (solve f y0 dt) (define y (integral dy y0 dt)) (define dy (stream-map f y)) y)
This procedure does not work, because in the first line of solve
the
call to integral
requires that the input dy
be defined, which
does not happen until the second line of solve
.
On the other hand, the intent of our definition does make sense, because we
can, in principle, begin to generate the y
stream without knowing
dy
. Indeed, integral
and many other stream operations have
properties similar to those of cons-stream
, in that we can generate part
of the answer given only partial information about the arguments. For
integral
, the first element of the output stream is the specified
initial-value
. Thus, we can generate the first element of the output
stream without evaluating the integrand dy
. Once we know the first
element of y
, the stream-map
in the second line of solve
can begin working to generate the first element of dy
, which will
produce the next element of y
, and so on.
To take advantage of this idea, we will redefine integral
to expect the
integrand stream to be a
delayed argument. Integral
will
force
the integrand to be evaluated only when it is required to generate
more than the first element of the output stream:
(define (integral delayed-integrand initial-value dt) (define int (cons-stream initial-value (let ((integrand (force delayed-integrand))) (add-streams (scale-stream integrand dt) int)))) int)
Now we can implement our solve
procedure by delaying the evaluation of
dy
in the definition of y
:(199)
(define (solve f y0 dt) (define y (integral (delay dy) y0 dt)) (define dy (stream-map f y)) y)
In general, every caller of integral
must now delay
the integrand
argument. We can demonstrate that the solve
procedure works by
approximating eapprox 2.718 by computing the value at y = 1 of the
solution to the differential equation dy/dt = y with initial
condition y(0) = 1:
(stream-ref (solve (lambda (y) y) 1 0.001) 1000) 2.716924
Exercise 3.77: The
integral
procedure used above was analogous to the “implicit” definition of the infinite stream of integers in section Infinite Streams. Alternatively, we can give a definition ofintegral
that is more likeintegers-starting-from
(also in section Infinite Streams):(define (integral integrand initial-value dt) (cons-stream initial-value (if (stream-null? integrand) the-empty-stream (integral (stream-cdr integrand) (+ (* dt (stream-car integrand)) initial-value) dt))))When used in systems with loops, this procedure has the same problem as does our original version of
integral
. Modify the procedure so that it expects theintegrand
as a delayed argument and hence can be used in thesolve
procedure shown above.
Figure 3.35: Signal-flow diagram for the solution to a second-order linear differential equation.
dy_0 y_0 | | V V ddy +----------+ dy +----------+ y +--------->| integral +-----*--+ integral +--*---> | +----------+ | +----------+ | | | | | +----------+ | | | __/|<--+ scale: a |<--+ | | _/ | +----------+ | +--<_add | | \__ | +----------+ | \|<--+ scale: b |<-------------------+ +----------+
Exercise 3.78: Consider the problem of designing a signal-processing system to study the homogeneous second-order linear differential equation
d^2 y d y ----- - a ----- - by = 0 d t^2 d tThe output stream, modeling y, is generated by a network that contains a loop. This is because the value of d^2y/dt^2 depends upon the values of y and dy/dt and both of these are determined by integrating d^2y/dt^2. The diagram we would like to encode is shown in Figure 3-35. Write a procedure
solve-2nd
that takes as arguments the constants a, b, and dt and the initial values y_0 and dy_0 for y and dy/dt and generates the stream of successive values of y.
Exercise 3.79: Generalize the
solve-2nd
procedure of Exercise 3-78 so that it can be used to solve general second-order differential equations d^2 y/dt^2 = f(dy/dt, y).
Exercise 3.80: A series RLC circuit consists of a resistor, a capacitor, and an inductor connected in series, as shown in Figure 3-36. If R, L, and C are the resistance, inductance, and capacitance, then the relations between voltage (v) and current (i) for the three components are described by the equations
v_R = i_R R d_(i L) v_L = L --------- d t d v_C i_C = C ------- d tand the circuit connections dictate the relations
i_R = i_L = -i_C v_C = v_L + v_RCombining these equations shows that the state of the circuit (summarized by v_C, the voltage across the capacitor, and i_L, the current in the inductor) is described by the pair of differential equations
d v_C i_L ----- = - --- d t C d i_L 1 R ----- = --- v_C - --- i_L d t L LThe signal-flow diagram representing this system of differential equations is shown in Figure 3-37.
Figure 3.36: A series RLC circuit. + v_R - i_R +--->----'\/\/\,--------+ | | i_L \|/ R \|/ + | i_C |_ + -+- __) v_C -+- C (_) v_L | __) - | | - +-----------------------+
Figure 3.37: A signal-flow diagram for the solution to a series RLC circuit.
+-------------+ +----------------+ scale: l/L |<--+ | +-------------+ | | | | +-------------+ | v_C | dv_C +-->| integral +---*------> | | +-------------+ | | ^ | | | v_(C_0) | | | | +-------------+ | +---+ scale: -l/C |<--+ | +-------------+ | | |\__ | +->| \_ di_L +-------------+ | i_L | add_>------>| integral +---*------> +->| __/ +-------------+ | | |/ ^ | | | i_(L_0) | | | | +-------------+ | +----------------+ scale: -R/L |<--+ +-------------+
Write a procedure RLC
that takes as arguments the parameters R,
L, and C of the circuit and the time increment dt. In a manner
similar to that of the RC
procedure of Exercise 3-73, RLC
should produce a procedure that takes the initial values of the state
variables, v_(C_0) and i_(L_0), and produces a pair (using
cons
) of the streams of states v_C and i_L. Using
RLC
, generate the pair of streams that models the behavior of a series
RLC circuit with R = 1 ohm, C = 0.2 farad, L = 1 henry, dt
= 0.1 second, and initial values i_(L_0) = 0 amps and v_(C_0) =
10 volts.
The examples in this section illustrate how the explicit use of delay
and force
provides great programming flexibility, but the same examples
also show how this can make our programs more complex. Our new integral
procedure, for instance, gives us the power to model systems with loops, but we
must now remember that integral
should be called with a delayed
integrand, and every procedure that uses integral
must be aware of this.
In effect, we have created two classes of procedures: ordinary procedures and
procedures that take delayed arguments. In general, creating separate classes
of procedures forces us to create separate classes of higher-order procedures
as well.(200)
One way to avoid the need for two different classes of procedures is to make
all procedures take delayed arguments. We could adopt a model of evaluation in
which all arguments to procedures are automatically delayed and arguments are
forced only when they are actually needed (for example, when they are required
by a primitive operation). This would transform our language to use
normal-order evaluation, which we first described when we introduced the
substitution model for evaluation in section The Substitution Model for Procedure Application. Converting to
normal-order evaluation provides a uniform and elegant way to simplify the use
of delayed evaluation, and this would be a natural strategy to adopt if we were
concerned only with stream processing. In section Variations on a Scheme – Lazy Evaluation, after we have
studied the evaluator, we will see how to transform our language in just this
way. Unfortunately, including delays in procedure calls wreaks havoc with our
ability to design programs that depend on the order of events, such as programs
that use assignment, mutate data, or perform input or output. Even the single
delay
in cons-stream
can cause great confusion, as illustrated by
Exercise 3-51 and Exercise 3-52. As far as anyone knows,
mutability and delayed evaluation do not mix well in programming languages, and
devising ways to deal with both of these at once is an active area of research.
[ << ] | [ < ] | [ Up ] | [ > ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
As we saw in section The Benefits of Introducing Assignment, one of the major benefits of introducing assignment is that we can increase the modularity of our systems by encapsulating, or “hiding,” parts of the state of a large system within local variables. Stream models can provide an equivalent modularity without the use of assignment. As an illustration, we can reimplement the Monte Carlo estimation of [pi], which we examined in section The Benefits of Introducing Assignment, from a stream-processing point of view.
The key modularity issue was that we wished to hide the internal state of a
random-number generator from programs that used random numbers. We began with
a procedure rand-update
, whose successive values furnished our supply of
random numbers, and used this to produce a random-number generator:
(define rand (let ((x random-init)) (lambda () (set! x (rand-update x)) x)))
In the stream formulation there is no random-number generator per se,
just a stream of random numbers produced by successive calls to
rand-update
:
(define random-numbers (cons-stream random-init (stream-map rand-update random-numbers)))
We use this to construct the stream of outcomes of the Cesàro experiment
performed on consecutive pairs in the random-numbers
stream:
(define cesaro-stream (map-successive-pairs (lambda (r1 r2) (= (gcd r1 r2) 1)) random-numbers)) (define (map-successive-pairs f s) (cons-stream (f (stream-car s) (stream-car (stream-cdr s))) (map-successive-pairs f (stream-cdr (stream-cdr s)))))
The cesaro-stream
is now fed to a monte-carlo
procedure, which
produces a stream of estimates of probabilities. The results are then
converted into a stream of estimates of [pi]. This version of the program
doesn’t need a parameter telling how many trials to perform. Better estimates
of [pi] (from performing more experiments) are obtained by looking farther
into the pi
stream:
(define (monte-carlo experiment-stream passed failed) (define (next passed failed) (cons-stream (/ passed (+ passed failed)) (monte-carlo (stream-cdr experiment-stream) passed failed))) (if (stream-car experiment-stream) (next (+ passed 1) failed) (next passed (+ failed 1)))) (define pi (stream-map (lambda (p) (sqrt (/ 6 p))) (monte-carlo cesaro-stream 0 0)))
There is considerable modularity in this approach, because we still can
formulate a general monte-carlo
procedure that can deal with arbitrary
experiments. Yet there is no assignment or local state.
Exercise 3.81: Exercise 3-6 discussed generalizing the random-number generator to allow one to reset the random-number sequence so as to produce repeatable sequences of “random” numbers. Produce a stream formulation of this same generator that operates on an input stream of requests to
generate
a new random number or toreset
the sequence to a specified value and that produces the desired stream of random numbers. Don’t use assignment in your solution.
Exercise 3.82: Redo Exercise 3-5 on Monte Carlo integration in terms of streams. The stream version of
estimate-integral
will not have an argument telling how many trials to perform. Instead, it will produce a stream of estimates based on successively more trials.
Let us now return to the issues of objects and state that were raised at the beginning of this chapter and examine them in a new light. We introduced assignment and mutable objects to provide a mechanism for modular construction of programs that model systems with state. We constructed computational objects with local state variables and used assignment to modify these variables. We modeled the temporal behavior of the objects in the world by the temporal behavior of the corresponding computational objects.
Now we have seen that streams provide an alternative way to model objects with
local state. We can model a changing quantity, such as the local state of some
object, using a stream that represents the time history of successive states.
In essence, we represent time explicitly, using streams, so that we decouple
time in our simulated world from the sequence of events that take place during
evaluation. Indeed, because of the presence of delay
there may be
little relation between simulated time in the model and the order of events
during the evaluation.
In order to contrast these two approaches to modeling, let us reconsider the implementation of a “withdrawal processor” that monitors the balance in a bank account. In section The Costs of Introducing Assignment we implemented a simplified version of such a processor:
(define (make-simplified-withdraw balance) (lambda (amount) (set! balance (- balance amount)) balance))
Calls to make-simplified-withdraw
produce computational objects, each
with a local state variable balance
that is decremented by successive
calls to the object. The object takes an amount
as an argument and
returns the new balance. We can imagine the user of a bank account typing a
sequence of inputs to such an object and observing the sequence of returned
values shown on a display screen.
Alternatively, we can model a withdrawal processor as a procedure that takes as input a balance and a stream of amounts to withdraw and produces the stream of successive balances in the account:
(define (stream-withdraw balance amount-stream) (cons-stream balance (stream-withdraw (- balance (stream-car amount-stream)) (stream-cdr amount-stream))))
Stream-withdraw
implements a well-defined mathematical function whose
output is fully determined by its input. Suppose, however, that the input
amount-stream
is the stream of successive values typed by the user and
that the resulting stream of balances is displayed. Then, from the perspective
of the user who is typing values and watching results, the stream process has
the same behavior as the object created by make-simplified-withdraw
.
However, with the stream version, there is no assignment, no local state
variable, and consequently none of the theoretical difficulties that we
encountered in section The Costs of Introducing Assignment. Yet the system has state!
This is really remarkable. Even though stream-withdraw
implements a
well-defined mathematical function whose behavior does not change, the user’s
perception here is one of interacting with a system that has a changing state.
One way to resolve this paradox is to realize that it is the user’s temporal
existence that imposes state on the system. If the user could step back from
the interaction and think in terms of streams of balances rather than
individual transactions, the system would appear stateless.(201)
From the point of view of one part of a complex process, the other parts appear to change with time. They have hidden time-varying local state. If we wish to write programs that model this kind of natural decomposition in our world (as we see it from our viewpoint as a part of that world) with structures in our computer, we make computational objects that are not functional—they must change with time. We model state with local state variables, and we model the changes of state with assignments to those variables. By doing this we make the time of execution of a computation model time in the world that we are part of, and thus we get “objects” in our computer.
Modeling with objects is powerful and intuitive, largely because this matches the perception of interacting with a world of which we are part. However, as we’ve seen repeatedly throughout this chapter, these models raise thorny problems of constraining the order of events and of synchronizing multiple processes. The possibility of avoiding these problems has stimulated the development of functional programming languages, which do not include any provision for assignment or mutable data. In such a language, all procedures implement well-defined mathematical functions of their arguments, whose behavior does not change. The functional approach is extremely attractive for dealing with concurrent systems.(202)
On the other hand, if we look closely, we can see time-related problems creeping into functional models as well. One particularly troublesome area arises when we wish to design interactive systems, especially ones that model interactions between independent entities. For instance, consider once more the implementation a banking system that permits joint bank accounts. In a conventional system using assignment and objects, we would model the fact that Peter and Paul share an account by having both Peter and Paul send their transaction requests to the same bank-account object, as we saw in section The Costs of Introducing Assignment. From the stream point of view, where there are no “objects” per se, we have already indicated that a bank account can be modeled as a process that operates on a stream of transaction requests to produce a stream of responses. Accordingly, we could model the fact that Peter and Paul have a joint bank account by merging Peter’s stream of transaction requests with Paul’s stream of requests and feeding the result to the bank-account stream process, as shown in Figure 3-38.
Figure 3.38: A joint bank account, modeled by merging two streams of transaction requests.
Peter's requests +---------+ +---------+ ------------------>| | | | Paul's requests | merge |---->| bank |----> ------------------>| | | account | +---------+ +---------+
The trouble with this formulation is in the notion of merge. It will not do to merge the two streams by simply taking alternately one request from Peter and one request from Paul. Suppose Paul accesses the account only very rarely. We could hardly force Peter to wait for Paul to access the account before he could issue a second transaction. However such a merge is implemented, it must interleave the two transaction streams in some way that is constrained by “real time” as perceived by Peter and Paul, in the sense that, if Peter and Paul meet, they can agree that certain transactions were processed before the meeting, and other transactions were processed after the meeting.(203) This is precisely the same constraint that we had to deal with in section The Nature of Time in Concurrent Systems, where we found the need to introduce explicit synchronization to ensure a “correct” order of events in concurrent processing of objects with state. Thus, in an attempt to support the functional style, the need to merge inputs from different agents reintroduces the same problems that the functional style was meant to eliminate.
We began this chapter with the goal of building computational models whose structure matches our perception of the real world we are trying to model. We can model the world as a collection of separate, time-bound, interacting objects with state, or we can model the world as a single, timeless, stateless unity. Each view has powerful advantages, but neither view alone is completely satisfactory. A grand unification has yet to emerge.(204)
[ << ] | [ < ] | [ Up ] | [ > ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
… It’s in words that the magic is—Abracadabra, Open Sesame, and the rest—but the magic words in one story aren’t magical in the next. The real magic is to understand which words work, and when, and for what; the trick is to learn the trick.
… And those words are made from the letters of our alphabet: a couple-dozen squiggles we can draw with the pen. This is the key! And the treasure, too, if we can only get our hands on it! It’s as if—as if the key to the treasure is the treasure!
—John Barth, Chimera
In our study of program design, we have seen that expert programmers control the complexity of their designs with the same general techniques used by designers of all complex systems. They combine primitive elements to form compound objects, they abstract compound objects to form higher-level building blocks, and they preserve modularity by adopting appropriate large-scale views of system structure. In illustrating these techniques, we have used Lisp as a language for describing processes and for constructing computational data objects and processes to model complex phenomena in the real world. However, as we confront increasingly complex problems, we will find that Lisp, or indeed any fixed programming language, is not sufficient for our needs. We must constantly turn to new languages in order to express our ideas more effectively. Establishing new languages is a powerful strategy for controlling complexity in engineering design; we can often enhance our ability to deal with a complex problem by adopting a new language that enables us to describe (and hence to think about) the problem in a different way, using primitives, means of combination, and means of abstraction that are particularly well suited to the problem at hand.(205)
Programming is endowed with a multitude of languages. There are physical languages, such as the machine languages for particular computers. These languages are concerned with the representation of data and control in terms of individual bits of storage and primitive machine instructions. The machine-language programmer is concerned with using the given hardware to erect systems and utilities for the efficient implementation of resource-limited computations. High-level languages, erected on a machine-language substrate, hide concerns about the representation of data as collections of bits and the representation of programs as sequences of primitive instructions. These languages have means of combination and abstraction, such as procedure definition, that are appropriate to the larger-scale organization of systems.
Metalinguistic abstraction—establishing new languages—plays an important role in all branches of engineering design. It is particularly important to computer programming, because in programming not only can we formulate new languages but we can also implement these languages by constructing evaluators. An evaluator (or interpreter) for a programming language is a procedure that, when applied to an expression of the language, performs the actions required to evaluate that expression.
It is no exaggeration to regard this as the most fundamental idea in programming:
The evaluator, which determines the meaning of expressions in a programming language, is just another program.
To appreciate this point is to change our images of ourselves as programmers. We come to see ourselves as designers of languages, rather than only users of languages designed by others.
In fact, we can regard almost any program as the evaluator for some language. For instance, the polynomial manipulation system of section Example: Symbolic Algebra embodies the rules of polynomial arithmetic and implements them in terms of operations on list-structured data. If we augment this system with procedures to read and print polynomial expressions, we have the core of a special-purpose language for dealing with problems in symbolic mathematics. The digital-logic simulator of section A Simulator for Digital Circuits and the constraint propagator of section Propagation of Constraints are legitimate languages in their own right, each with its own primitives, means of combination, and means of abstraction. Seen from this perspective, the technology for coping with large-scale computer systems merges with the technology for building new computer languages, and computer science itself becomes no more (and no less) than the discipline of constructing appropriate descriptive languages.
We now embark on a tour of the technology by which languages are established in terms of other languages. In this chapter we shall use Lisp as a base, implementing evaluators as Lisp procedures. Lisp is particularly well suited to this task, because of its ability to represent and manipulate symbolic expressions. We will take the first step in understanding how languages are implemented by building an evaluator for Lisp itself. The language implemented by our evaluator will be a subset of the Scheme dialect of Lisp that we use in this book. Although the evaluator described in this chapter is written for a particular dialect of Lisp, it contains the essential structure of an evaluator for any expression-oriented language designed for writing programs for a sequential machine. (In fact, most language processors contain, deep within them, a little “Lisp” evaluator.) The evaluator has been simplified for the purposes of illustration and discussion, and some features have been left out that would be important to include in a production-quality Lisp system. Nevertheless, this simple evaluator is adequate to execute most of the programs in this book.(206)
An important advantage of making the evaluator accessible as a Lisp program is that we can implement alternative evaluation rules by describing these as modifications to the evaluator program. One place where we can use this power to good effect is to gain extra control over the ways in which computational models embody the notion of time, which was so central to the discussion in Modularity, Objects, and State. There, we mitigated some of the complexities of state and assignment by using streams to decouple the representation of time in the world from time in the computer. Our stream programs, however, were sometimes cumbersome, because they were constrained by the applicative-order evaluation of Scheme. In section Variations on a Scheme – Lazy Evaluation, we’ll change the underlying language to provide for a more elegant approach, by modifying the evaluator to provide for normal-order evaluation.
Section Variations on a Scheme – Nondeterministic Computing implements a more ambitious linguistic change, whereby expressions have many values, rather than just a single value. In this language of nondeterministic computing, it is natural to express processes that generate all possible values for expressions and then search for those values that satisfy certain constraints. In terms of models of computation and time, this is like having time branch into a set of “possible futures” and then searching for appropriate time lines. With our nondeterministic evaluator, keeping track of multiple values and performing searches are handled automatically by the underlying mechanism of the language.
In section Logic Programming we implement a logic-programming language in which knowledge is expressed in terms of relations, rather than in terms of computations with inputs and outputs. Even though this makes the language drastically different from Lisp, or indeed from any conventional language, we will see that the logic-programming evaluator shares the essential structure of the Lisp evaluator.
4.1 The Metacircular Evaluator | ||
4.2 Variations on a Scheme – Lazy Evaluation | ||
4.3 Variations on a Scheme – Nondeterministic Computing | ||
4.4 Logic Programming |
[ << ] | [ < ] | [ Up ] | [ > ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
Our evaluator for Lisp will be implemented as a Lisp program. It may seem circular to think about evaluating Lisp programs using an evaluator that is itself implemented in Lisp. However, evaluation is a process, so it is appropriate to describe the evaluation process using Lisp, which, after all, is our tool for describing processes.(207) An evaluator that is written in the same language that it evaluates is said to be metacircular.
The metacircular evaluator is essentially a Scheme formulation of the environment model of evaluation described in section The Environment Model of Evaluation. Recall that the model has two basic parts:
These two rules describe the essence of the evaluation process, a basic cycle
in which expressions to be evaluated in environments are reduced to procedures
to be applied to arguments, which in turn are reduced to new expressions to be
evaluated in new environments, and so on, until we get down to symbols, whose
values are looked up in the environment, and to primitive procedures, which are
applied directly (see Figure 4-1).(208) This evaluation cycle will be embodied by the interplay between the two
critical procedures in the evaluator, eval
and apply
, which are
described in section The Core of the Evaluator (see Figure 4-1).
The implementation of the evaluator will depend upon procedures that define the
syntax of the expressions to be evaluated. We will use data
abstraction to make the evaluator independent of the representation of the
language. For example, rather than committing to a choice that an assignment
is to be represented by a list beginning with the symbol set!
we use an
abstract predicate assignment?
to test for an assignment, and we use
abstract selectors assignment-variable
and assignment-value
to
access the parts of an assignment. Implementation of expressions will be
described in detail in section Representing Expressions. There are also operations,
described in section Evaluator Data Structures, that specify the representation of procedures
and environments. For example, make-procedure
constructs compound
procedures, lookup-variable-value
accesses the values of variables, and
apply-primitive-procedure
applies a primitive procedure to a given list
of arguments.
[ << ] | [ < ] | [ Up ] | [ > ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
Figure 4.1: The
eval
-apply
cycle exposes the essence of a computer language..,ad88888888baa, _ ,d8P""" ""9888ba. _ / .a8" ,ad88888888888a |\ / aP' ,88888888888888888a \ / ,8" ,88888888888888888888, \ | ,8' (888888888888888888888, | / ,8' `8888888888888888888888 \ | 8) `888888888888888888888, | Procedure, | 8 "88888 Apply 8888888) | Expression Arguments | 8 Eval `888888888888888888) | Environment | 8) "8888888888888888 | \ (b "88888888888888' / | `8, 8888888888888) | \ "8a ,888888888888) / \ V8, d88888888888" / _\| `8b, ,d8888888888P' _/ `V8a, ,ad8888888888P' ""88888888888888888P" """""""""""" [graphic by Normand Veillux, modified]
The evaluation process can be described as the interplay between two
procedures: eval
and apply
.
Eval
takes as arguments an expression and an environment. It classifies
the expression and directs its evaluation. Eval
is structured as a case
analysis of the syntactic type of the expression to be evaluated. In order to
keep the procedure general, we express the determination of the type of an
expression abstractly, making no commitment to any particular representation
for the various types of expressions. Each type of expression has a predicate
that tests for it and an abstract means for selecting its parts. This
abstract syntax makes it easy to see how we can change the syntax of
the language by using the same evaluator, but with a different collection of
syntax procedures.
Primitive expressions
eval
returns the
expression itself.
Eval
must look up variables in the environment to find their values.
Special forms
eval
returns the expression that was quoted.
eval
to compute the new value to be associated with the variable. The
environment must be modified to change (or create) the binding of the variable.
if
expression requires special processing of its parts, so as to
evaluate the consequent if the predicate is true, and otherwise to evaluate the
alternative.
lambda
expression must be transformed into an applicable procedure by
packaging together the parameters and body specified by the lambda
expression with the environment of the evaluation.
begin
expression requires evaluating its sequence of expressions in
the order in which they appear.
cond
) is transformed into a nest of if
expressions and then evaluated.
Combinations
eval
must recursively evaluate the operator
part and the operands of the combination. The resulting procedure and
arguments are passed to apply
, which handles the actual procedure
application.
Here is the definition of eval
:
(define (eval exp env) (cond ((self-evaluating? exp) exp) ((variable? exp) (lookup-variable-value exp env)) ((quoted? exp) (text-of-quotation exp)) ((assignment? exp) (eval-assignment exp env)) ((definition? exp) (eval-definition exp env)) ((if? exp) (eval-if exp env)) ((lambda? exp) (make-procedure (lambda-parameters exp) (lambda-body exp) env)) ((begin? exp) (eval-sequence (begin-actions exp) env)) ((cond? exp) (eval (cond->if exp) env)) ((application? exp) (apply (eval (operator exp) env) (list-of-values (operands exp) env))) (else (error "Unknown expression type -- EVAL" exp))))
For clarity, eval
has been implemented as a case analysis using
cond
. The disadvantage of this is that our procedure handles only a few
distinguishable types of expressions, and no new ones can be defined without
editing the definition of eval
. In most Lisp implementations,
dispatching on the type of an expression is done in a data-directed style.
This allows a user to add new types of expressions that eval
can
distinguish, without modifying the definition of eval
itself. (See
Exercise 4-3.)
Apply
takes two arguments, a procedure and a list of arguments to which
the procedure should be applied. Apply
classifies procedures into two
kinds: It calls apply-primitive-procedure
to apply primitives; it
applies compound procedures by sequentially evaluating the expressions that
make up the body of the procedure. The environment for the evaluation of the
body of a compound procedure is constructed by extending the base environment
carried by the procedure to include a frame that binds the parameters of the
procedure to the arguments to which the procedure is to be applied. Here is
the definition of apply
:
(define (apply procedure arguments) (cond ((primitive-procedure? procedure) (apply-primitive-procedure procedure arguments)) ((compound-procedure? procedure) (eval-sequence (procedure-body procedure) (extend-environment (procedure-parameters procedure) arguments (procedure-environment procedure)))) (else (error "Unknown procedure type -- APPLY" procedure))))
When eval
processes a procedure application, it uses
list-of-values
to produce the list of arguments to which the procedure
is to be applied. List-of-values
takes as an argument the operands of
the combination. It evaluates each operand and returns a list of the
corresponding values:(209)
(define (list-of-values exps env) (if (no-operands? exps) '() (cons (eval (first-operand exps) env) (list-of-values (rest-operands exps) env))))
Eval-if
evaluates the predicate part of an if
expression in the
given environment. If the result is true, eval-if
evaluates the
consequent, otherwise it evaluates the alternative:
(define (eval-if exp env) (if (true? (eval (if-predicate exp) env)) (eval (if-consequent exp) env) (eval (if-alternative exp) env)))
The use of true?
in eval-if
highlights the issue of the
connection between an implemented language and an implementation language. The
if-predicate
is evaluated in the language being implemented and thus
yields a value in that language. The interpreter predicate true?
translates that value into a value that can be tested by the if
in the
implementation language: The metacircular representation of truth might not be
the same as that of the underlying Scheme.(210)
Eval-sequence
is used by apply
to evaluate the sequence of
expressions in a procedure body and by eval
to evaluate the sequence of
expressions in a begin
expression. It takes as arguments a sequence of
expressions and an environment, and evaluates the expressions in the order in
which they occur. The value returned is the value of the final expression.
(define (eval-sequence exps env) (cond ((last-exp? exps) (eval (first-exp exps) env)) (else (eval (first-exp exps) env) (eval-sequence (rest-exps exps) env))))
The following procedure handles assignments to variables. It calls eval
to find the value to be assigned and transmits the variable and the resulting
value to set-variable-value!
to be installed in the designated
environment.
(define (eval-assignment exp env) (set-variable-value! (assignment-variable exp) (eval (assignment-value exp) env) env) 'ok)
Definitions of variables are handled in a similar manner.(211)
(define (eval-definition exp env) (define-variable! (definition-variable exp) (eval (definition-value exp) env) env) 'ok)
We have chosen here to return the symbol ok
as the value of an
assignment or a definition.(212)
Exercise 4.1: Notice that we cannot tell whether the metacircular evaluator evaluates operands from left to right or from right to left. Its evaluation order is inherited from the underlying Lisp: If the arguments to
cons
inlist-of-values
are evaluated from left to right, thenlist-of-values
will evaluate operands from left to right; and if the arguments tocons
are evaluated from right to left, thenlist-of-values
will evaluate operands from right to left.Write a version of
list-of-values
that evaluates operands from left to right regardless of the order of evaluation in the underlying Lisp. Also write a version oflist-of-values
that evaluates operands from right to left.
[ << ] | [ < ] | [ Up ] | [ > ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
The evaluator is reminiscent of the symbolic differentiation program discussed in section Example: Symbolic Differentiation. Both programs operate on symbolic expressions. In both programs, the result of operating on a compound expression is determined by operating recursively on the pieces of the expression and combining the results in a way that depends on the type of the expression. In both programs we used data abstraction to decouple the general rules of operation from the details of how expressions are represented. In the differentiation program this meant that the same differentiation procedure could deal with algebraic expressions in prefix form, in infix form, or in some other form. For the evaluator, this means that the syntax of the language being evaluated is determined solely by the procedures that classify and extract pieces of expressions.
Here is the specification of the syntax of our language:
(define (self-evaluating? exp) (cond ((number? exp) true) ((string? exp) true) (else false)))
(define (variable? exp) (symbol? exp))
(quote <text-of-quotation>)
:(213)
(define (quoted? exp) (tagged-list? exp 'quote)) (define (text-of-quotation exp) (cadr exp))
Quoted?
is defined in terms of the procedure tagged-list?
, which
identifies lists beginning with a designated symbol:
(define (tagged-list? exp tag) (if (pair? exp) (eq? (car exp) tag) false))
(set! <var>
<value>)
:
(define (assignment? exp) (tagged-list? exp 'set!)) (define (assignment-variable exp) (cadr exp)) (define (assignment-value exp) (caddr exp))
(define <var> <value>)
or the form
(define (<var> <parameter_1> … <parameter_n>) <body>)
The latter form (standard procedure definition) is syntactic sugar for
(define <var> (lambda (<parameter_1> … <parameter_n>) <body>))
The corresponding syntax procedures are the following:
(define (definition? exp) (tagged-list? exp 'define)) (define (definition-variable exp) (if (symbol? (cadr exp)) (cadr exp) (caadr exp))) (define (definition-value exp) (if (symbol? (cadr exp)) (caddr exp) (make-lambda (cdadr exp) ; formal parameters (cddr exp)))) ; body
Lambda
expressions are lists that begin with the symbol lambda
:
(define (lambda? exp) (tagged-list? exp 'lambda)) (define (lambda-parameters exp) (cadr exp)) (define (lambda-body exp) (cddr exp))
We also provide a constructor for lambda
expressions, which is used by
definition-value
, above:
(define (make-lambda parameters body) (cons 'lambda (cons parameters body)))
if
and have a predicate, a consequent, and an
(optional) alternative. If the expression has no alternative part, we provide
false
as the alternative.(214)
(define (if? exp) (tagged-list? exp 'if)) (define (if-predicate exp) (cadr exp)) (define (if-consequent exp) (caddr exp)) (define (if-alternative exp) (if (not (null? (cdddr exp))) (cadddr exp) 'false))
We also provide a constructor for if
expressions, to be used by
cond->if
to transform cond
expressions into if
expressions:
(define (make-if predicate consequent alternative) (list 'if predicate consequent alternative))
Begin
packages a sequence of expressions into a single expression. We
include syntax operations on begin
expressions to extract the actual
sequence from the begin
expression, as well as selectors that return the
first expression and the rest of the expressions in the
sequence.(215)
(define (begin? exp) (tagged-list? exp 'begin)) (define (begin-actions exp) (cdr exp)) (define (last-exp? seq) (null? (cdr seq))) (define (first-exp seq) (car seq)) (define (rest-exps seq) (cdr seq))
We also include a constructor sequence->exp
(for use by cond->if
)
that transforms a sequence into a single expression, using begin
if
necessary:
(define (sequence->exp seq) (cond ((null? seq) seq) ((last-exp? seq) (first-exp seq)) (else (make-begin seq)))) (define (make-begin seq) (cons 'begin seq))
car
of the expression is the operator, and the
cdr
is the list of operands:
(define (application? exp) (pair? exp)) (define (operator exp) (car exp)) (define (operands exp) (cdr exp)) (define (no-operands? ops) (null? ops)) (define (first-operand ops) (car ops)) (define (rest-operands ops) (cdr ops))
Some special forms in our language can be defined in terms of expressions
involving other special forms, rather than being implemented directly. One
example is cond
, which can be implemented as a nest of if
expressions. For example, we can reduce the problem of evaluating the
expression
(cond ((> x 0) x) ((= x 0) (display 'zero) 0) (else (- x)))
to the problem of evaluating the following expression involving if
and
begin
expressions:
(if (> x 0) x (if (= x 0) (begin (display 'zero) 0) (- x)))
Implementing the evaluation of cond
in this way simplifies the evaluator
because it reduces the number of special forms for which the evaluation process
must be explicitly specified.
We include syntax procedures that extract the parts of a cond
expression, and a procedure cond->if
that transforms cond
expressions into if
expressions. A case analysis begins with
cond
and has a list of predicate-action clauses. A clause is an
else
clause if its predicate is the symbol else
.(216)
(define (cond? exp) (tagged-list? exp 'cond))
(define (cond-clauses exp) (cdr exp))
(define (cond-else-clause? clause)
(eq? (cond-predicate clause) 'else))
(define (cond-predicate clause) (car clause))
(define (cond-actions clause) (cdr clause))
(define (cond->if exp)
(expand-clauses (cond-clauses exp)))
(define (expand-clauses clauses)
(if (null? clauses)
'false ; no else
clause
(let ((first (car clauses))
(rest (cdr clauses)))
(if (cond-else-clause? first)
(if (null? rest)
(sequence->exp (cond-actions first))
(error "ELSE clause isn't last -- COND->IF"
clauses))
(make-if (cond-predicate first)
(sequence->exp (cond-actions first))
(expand-clauses rest))))))
Expressions (such as cond
) that we choose to implement as syntactic
transformations are called
derived expressions. Let
expressions are also derived expressions (see Exercise 4-6).(217)
Exercise 4.2: Louis Reasoner plans to reorder the
cond
clauses ineval
so that the clause for procedure applications appears before the clause for assignments. He argues that this will make the interpreter more efficient: Since programs usually contain more applications than assignments, definitions, and so on, his modifiedeval
will usually check fewer clauses than the originaleval
before identifying the type of an expression.
- What is wrong with Louis’s plan? (Hint: What will Louis’s evaluator do with the expression
(define x 3)
?)- Louis is upset that his plan didn’t work. He is willing to go to any lengths to make his evaluator recognize procedure applications before it checks for most other kinds of expressions. Help him by changing the syntax of the evaluated language so that procedure applications start with
call
. For example, instead of(factorial 3)
we will now have to write(call factorial 3)
and instead of(+ 1 2)
we will have to write(call + 1 2)
.
Exercise 4.3: Rewrite
eval
so that the dispatch is done in data-directed style. Compare this with the data-directed differentiation procedure of Exercise 2-73. (You may use thecar
of a compound expression as the type of the expression, as is appropriate for the syntax implemented in this section.)
Exercise 4.4: Recall the definitions of the special forms
and
andor
from Building Abstractions with Procedures:
and
: The expressions are evaluated from left to right. If any expression evaluates to false, false is returned; any remaining expressions are not evaluated. If all the expressions evaluate to true values, the value of the last expression is returned. If there are no expressions then true is returned.or
: The expressions are evaluated from left to right. If any expression evaluates to a true value, that value is returned; any remaining expressions are not evaluated. If all expressions evaluate to false, or if there are no expressions, then false is returned.Install
and
andor
as new special forms for the evaluator by defining appropriate syntax procedures and evaluation procedureseval-and
andeval-or
. Alternatively, show how to implementand
andor
as derived expressions.
Exercise 4.5: Scheme allows an additional syntax for
cond
clauses,(<test> => <recipient>)
. If <test> evaluates to a true value, then <recipient> is evaluated. Its value must be a procedure of one argument; this procedure is then invoked on the value of the <test>, and the result is returned as the value of thecond
expression. For example(cond ((assoc 'b '((a 1) (b 2))) => cadr) (else false))returns 2. Modify the handling of
cond
so that it supports this extended syntax.
Exercise 4.6:
Let
expressions are derived expressions, because(let ((<var_1> <exp_1>) … (<var_n> <exp_n>)) <body>)is equivalent to
((lambda (<var_1> … <var_n>) <body>) <exp_1> … <exp_n>)Implement a syntactic transformation
let->combination
that reduces evaluatinglet
expressions to evaluating combinations of the type shown above, and add the appropriate clause toeval
to handlelet
expressions.
Exercise 4.7:
Let*
is similar tolet
, except that the bindings of thelet
variables are performed sequentially from left to right, and each binding is made in an environment in which all of the preceding bindings are visible. For example(let* ((x 3) (y (+ x 2)) (z (+ x y 5))) (* x z))returns 39. Explain how a
let*
expression can be rewritten as a set of nestedlet
expressions, and write a procedurelet*->nested-lets
that performs this transformation. If we have already implementedlet
(Exercise 4-6) and we want to extend the evaluator to handlelet*
, is it sufficient to add a clause toeval
whose action is(eval (let*->nested-lets exp) env)or must we explicitly expand
let*
in terms of non-derived expressions?
Exercise 4.8: “Named
let
” is a variant oflet
that has the form(let <var> <bindings> <body>)The <bindings> and <body> are just as in ordinary
let
, except that <var> is bound within <body> to a procedure whose body is <body> and whose parameters are the variables in the <bindings>. Thus, one can repeatedly execute the <body> by invoking the procedure named <var>. For example, the iterative Fibonacci procedure (section Tree Recursion) can be rewritten using namedlet
as follows:(define (fib n) (let fib-iter ((a 1) (b 0) (count n)) (if (= count 0) b (fib-iter (+ a b) a (- count 1)))))Modify
let->combination
of Exercise 4-6 to also support namedlet
.
Exercise 4.9: Many languages support a variety of iteration constructs, such as
do
,for
,while
, anduntil
. In Scheme, iterative processes can be expressed in terms of ordinary procedure calls, so special iteration constructs provide no essential gain in computational power. On the other hand, such constructs are often convenient. Design some iteration constructs, give examples of their use, and show how to implement them as derived expressions.
Exercise 4.10: By using data abstraction, we were able to write an
eval
procedure that is independent of the particular syntax of the language to be evaluated. To illustrate this, design and implement a new syntax for Scheme by modifying the procedures in this section, without changingeval
orapply
.
[ << ] | [ < ] | [ Up ] | [ > ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
In addition to defining the external syntax of expressions, the evaluator implementation must also define the data structures that the evaluator manipulates internally, as part of the execution of a program, such as the representation of procedures and environments and the representation of true and false.
For conditionals, we accept anything to be true that is not the explicit
false
object.
(define (true? x) (not (eq? x false))) (define (false? x) (eq? x false))
To handle primitives, we assume that we have available the following procedures:
(apply-primitive-procedure <proc> <args>)
applies the given primitive procedure to the argument values in the list <args> and returns the result of the application.
(primitive-procedure? <proc>)
tests whether <proc> is a primitive procedure.
These mechanisms for handling primitives are further described in section Running the Evaluator as a Program.
Compound procedures are constructed from parameters, procedure bodies, and
environments using the constructor make-procedure
:
(define (make-procedure parameters body env) (list 'procedure parameters body env)) (define (compound-procedure? p) (tagged-list? p 'procedure)) (define (procedure-parameters p) (cadr p)) (define (procedure-body p) (caddr p)) (define (procedure-environment p) (cadddr p))
The evaluator needs operations for manipulating environments. As explained in section The Environment Model of Evaluation, an environment is a sequence of frames, where each frame is a table of bindings that associate variables with their corresponding values. We use the following operations for manipulating environments:
(lookup-variable-value <var> <env>)
returns the value that is bound to the symbol <var> in the environment <env>, or signals an error if the variable is unbound.
(extend-environment <variables> <values> <base-env>)
returns a new environment, consisting of a new frame in which the symbols in the list <variables> are bound to the corresponding elements in the list <values>, where the enclosing environment is the environment <base-env>.
(define-variable! <var> <value> <env>)
adds to the first frame in the environment <env> a new binding that associates the variable <var> with the value <value>.
(set-variable-value! <var> <value> <env>)
changes the binding of the variable <var> in the environment <env> so that the variable is now bound to the value <value>, or signals an error if the variable is unbound.
To implement these operations we represent an environment as a list of frames.
The enclosing environment of an environment is the cdr
of the list. The
empty environment is simply the empty list.
(define (enclosing-environment env) (cdr env)) (define (first-frame env) (car env)) (define the-empty-environment '())
Each frame of an environment is represented as a pair of lists: a list of the variables bound in that frame and a list of the associated values.(218)
(define (make-frame variables values) (cons variables values)) (define (frame-variables frame) (car frame)) (define (frame-values frame) (cdr frame)) (define (add-binding-to-frame! var val frame) (set-car! frame (cons var (car frame))) (set-cdr! frame (cons val (cdr frame))))
To extend an environment by a new frame that associates variables with values, we make a frame consisting of the list of variables and the list of values, and we adjoin this to the environment. We signal an error if the number of variables does not match the number of values.
(define (extend-environment vars vals base-env) (if (= (length vars) (length vals)) (cons (make-frame vars vals) base-env) (if (< (length vars) (length vals)) (error "Too many arguments supplied" vars vals) (error "Too few arguments supplied" vars vals))))
To look up a variable in an environment, we scan the list of variables in the first frame. If we find the desired variable, we return the corresponding element in the list of values. If we do not find the variable in the current frame, we search the enclosing environment, and so on. If we reach the empty environment, we signal an “unbound variable” error.
(define (lookup-variable-value var env) (define (env-loop env) (define (scan vars vals) (cond ((null? vars) (env-loop (enclosing-environment env))) ((eq? var (car vars)) (car vals)) (else (scan (cdr vars) (cdr vals))))) (if (eq? env the-empty-environment) (error "Unbound variable" var) (let ((frame (first-frame env))) (scan (frame-variables frame) (frame-values frame))))) (env-loop env))
To set a variable to a new value in a specified environment, we scan for the
variable, just as in lookup-variable-value
, and change the corresponding
value when we find it.
(define (set-variable-value! var val env) (define (env-loop env) (define (scan vars vals) (cond ((null? vars) (env-loop (enclosing-environment env))) ((eq? var (car vars)) (set-car! vals val)) (else (scan (cdr vars) (cdr vals))))) (if (eq? env the-empty-environment) (error "Unbound variable -- SET!" var) (let ((frame (first-frame env))) (scan (frame-variables frame) (frame-values frame))))) (env-loop env))
To define a variable, we search the first frame for a binding for the variable,
and change the binding if it exists (just as in set-variable-value!
).
If no such binding exists, we adjoin one to the first frame.
(define (define-variable! var val env) (let ((frame (first-frame env))) (define (scan vars vals) (cond ((null? vars) (add-binding-to-frame! var val frame)) ((eq? var (car vars)) (set-car! vals val)) (else (scan (cdr vars) (cdr vals))))) (scan (frame-variables frame) (frame-values frame))))
The method described here is only one of many plausible ways to represent environments. Since we used data abstraction to isolate the rest of the evaluator from the detailed choice of representation, we could change the environment representation if we wanted to. (See Exercise 4-11.) In a production-quality Lisp system, the speed of the evaluator’s environment operations—especially that of variable lookup—has a major impact on the performance of the system. The representation described here, although conceptually simple, is not efficient and would not ordinarily be used in a production system.(219)
Exercise 4.11: Instead of representing a frame as a pair of lists, we can represent a frame as a list of bindings, where each binding is a name-value pair. Rewrite the environment operations to use this alternative representation.
Exercise 4.12: The procedures
set-variable-value!
,define-variable!
, andlookup-variable-value
can be expressed in terms of more abstract procedures for traversing the environment structure. Define abstractions that capture the common patterns and redefine the three procedures in terms of these abstractions.
Exercise 4.13: Scheme allows us to create new bindings for variables by means of
define
, but provides no way to get rid of bindings. Implement for the evaluator a special formmake-unbound!
that removes the binding of a given symbol from the environment in which themake-unbound!
expression is evaluated. This problem is not completely specified. For example, should we remove only the binding in the first frame of the environment? Complete the specification and justify any choices you make.
[ << ] | [ < ] | [ Up ] | [ > ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
Given the evaluator, we have in our hands a description (expressed in Lisp) of the process by which Lisp expressions are evaluated. One advantage of expressing the evaluator as a program is that we can run the program. This gives us, running within Lisp, a working model of how Lisp itself evaluates expressions. This can serve as a framework for experimenting with evaluation rules, as we shall do later in this chapter.
Our evaluator program reduces expressions ultimately to the application of primitive procedures. Therefore, all that we need to run the evaluator is to create a mechanism that calls on the underlying Lisp system to model the application of primitive procedures.
There must be a binding for each primitive procedure name, so that when
eval
evaluates the operator of an application of a primitive, it will
find an object to pass to apply
. We thus set up a global environment
that associates unique objects with the names of the primitive procedures that
can appear in the expressions we will be evaluating. The global environment
also includes bindings for the symbols true
and false
, so that
they can be used as variables in expressions to be evaluated.
(define (setup-environment) (let ((initial-env (extend-environment (primitive-procedure-names) (primitive-procedure-objects) the-empty-environment))) (define-variable! 'true true initial-env) (define-variable! 'false false initial-env) initial-env)) (define the-global-environment (setup-environment))
It does not matter how we represent the primitive procedure objects, so long as
apply
can identify and apply them by using the procedures
primitive-procedure?
and apply-primitive-procedure
. We have
chosen to represent a primitive procedure as a list beginning with the symbol
primitive
and containing a procedure in the underlying Lisp that
implements that primitive.
(define (primitive-procedure? proc) (tagged-list? proc 'primitive)) (define (primitive-implementation proc) (cadr proc))
Setup-environment
will get the primitive names and implementation
procedures from a list:(220)
(define primitive-procedures (list (list 'car car) (list 'cdr cdr) (list 'cons cons) (list 'null? null?) <more primitives> )) (define (primitive-procedure-names) (map car primitive-procedures)) (define (primitive-procedure-objects) (map (lambda (proc) (list 'primitive (cadr proc))) primitive-procedures))
To apply a primitive procedure, we simply apply the implementation procedure to the arguments, using the underlying Lisp system:(221)
(define (apply-primitive-procedure proc args) (apply-in-underlying-scheme (primitive-implementation proc) args))
For convenience in running the metacircular evaluator, we provide a driver loop that models the read-eval-print loop of the underlying Lisp system. It prints a prompt, reads an input expression, evaluates this expression in the global environment, and prints the result. We precede each printed result by an output prompt so as to distinguish the value of the expression from other output that may be printed.(222)
(define input-prompt ";;; M-Eval input:") (define output-prompt ";;; M-Eval value:") (define (driver-loop) (prompt-for-input input-prompt) (let ((input (read))) (let ((output (eval input the-global-environment))) (announce-output output-prompt) (user-print output))) (driver-loop)) (define (prompt-for-input string) (newline) (newline) (display string) (newline)) (define (announce-output string) (newline) (display string) (newline))
We use a special printing procedure, user-print
, to avoid printing the
environment part of a compound procedure, which may be a very long list (or may
even contain cycles).
(define (user-print object) (if (compound-procedure? object) (display (list 'compound-procedure (procedure-parameters object) (procedure-body object) '<procedure-env>)) (display object)))
Now all we need to do to run the evaluator is to initialize the global environment and start the driver loop. Here is a sample interaction:
(define the-global-environment (setup-e