|
Showing 1 - 7 of
7 matches in All Departments
Structure and Interpretation of Computer Programs has had a
dramatic impact on computer science curricula over the past decade.
This long-awaited revision contains changes throughout the
text.There are new implementations of most of the major programming
systems in the book, including the interpreters and compilers, and
the authors have incorporated many small changes that reflect their
experience teaching the course at MIT since the first edition was
published.A new theme has been introduced that emphasizes the
central role played by different approaches to dealing with time in
computational models: objects with state, concurrent programming,
functional programming and lazy evaluation, and nondeterministic
programming. There are new example sections on higher-order
procedures in graphics and on applications of stream processing in
numerical programming, and many new exercises.In addition, all the
programs have been reworked to run in any Scheme implementation
that adheres to the IEEE standard.
Strategies for building large systems that can be easily adapted
for new situations with only minor programming modifications. Time
pressures encourage programmers to write code that works well for a
narrow purpose, with no room to grow. But the best systems are
evolvable; they can be adapted for new situations by adding code,
rather than changing the existing code. The authors describe
techniques they have found effective--over their combined 100-plus
years of programming experience--that will help programmers avoid
programming themselves into corners. The authors explore ways to
enhance flexibility by: - Organizing systems using combinators to
compose mix-and-match parts, ranging from small functions to whole
arithmetics, with standardized interfaces - Augmenting data with
independent annotation layers, such as units of measurement or
provenance - Combining independent pieces of partial information
using unification or propagation - Separating control structure
from problem domain with domain models, rule systems and pattern
matching, propagation, and dependency-directed backtracking -
Extending the programming language, using dynamically extensible
evaluators
An explanation of the mathematics needed as a foundation for a deep
understanding of general relativity or quantum field theory.
Physics is naturally expressed in mathematical language. Students
new to the subject must simultaneously learn an idiomatic
mathematical language and the content that is expressed in that
language. It is as if they were asked to read Les Miserables while
struggling with French grammar. This book offers an innovative way
to learn the differential geometry needed as a foundation for a
deep understanding of general relativity or quantum field theory as
taught at the college level. The approach taken by the authors (and
used in their classes at MIT for many years) differs from the
conventional one in several ways, including an emphasis on the
development of the covariant derivative and an avoidance of the use
of traditional index notation for tensors in favor of a
semantically richer language of vector fields and differential
forms. But the biggest single difference is the authors'
integration of computer programming into their explanations. By
programming a computer to interpret a formula, the student soon
learns whether or not a formula is correct. Students are led to
improve their program, and as a result improve their understanding.
A new edition of a book, written in a humorous question-and-answer
style, that shows how to implement and use an elegant little
programming language for logic programming. The goal of this book
is to show the beauty and elegance of relational programming, which
captures the essence of logic programming. The book shows how to
implement a relational programming language in Scheme, or in any
other functional language, and demonstrates the remarkable
flexibility of the resulting relational programs. As in the first
edition, the pedagogical method is a series of questions and
answers, which proceed with the characteristic humor that marked
The Little Schemer and The Seasoned Schemer. Familiarity with a
functional language or with the first five chapters of The Little
Schemer is assumed. For this second edition, the authors have
greatly simplified the programming language used in the book, as
well as the implementation of the language. In addition to revising
the text extensively, and simplifying and revising the "Laws" and
"Commandments," they have added explicit "Translation" rules to
ease translation of Scheme functions into relations.
Die UEbersetzung der bewahrten Einfuhrung in die Informatik,
entstanden am Massachusetts Institute of Technology (MIT), wird
seit Jahren erfolgreich in der Lehre eingesetzt. Schritt fur
Schritt werden Konstruktion und Abstraktion von Daten und
Prozeduren dargestellt. Von der Modularisierung bis zum
Problemloesen mit Registermaschinen werden verschiedene
Programmierparadigmen entwikckelt und die effektive Handhabung von
Komplexitat gezeigt. Als Programmiersprache wird SCHEME verwendet,
ein Dialekt von LISP. Alle Programme laufen in jeder dem
IEEE-Standard entsprechenden SCHEME-Implementierung.
The new edition of a classic text that concentrates on developing
general methods for studying the behavior of classical systems,
with extensive use of computation. We now know that there is much
more to classical mechanics than previously suspected. Derivations
of the equations of motion, the focus of traditional presentations
of mechanics, are just the beginning. This innovative textbook, now
in its second edition, concentrates on developing general methods
for studying the behavior of classical systems, whether or not they
have a symbolic solution. It focuses on the phenomenon of motion
and makes extensive use of computer simulation in its explorations
of the topic. It weaves recent discoveries in nonlinear dynamics
throughout the text, rather than presenting them as an
afterthought. Explorations of phenomena such as the transition to
chaos, nonlinear resonances, and resonance overlap to help the
student develop appropriate analytic tools for understanding. The
book uses computation to constrain notation, to capture and
formalize methods, and for simulation and symbolic analysis. The
requirement that the computer be able to interpret any expression
provides the student with strict and immediate feedback about
whether an expression is correctly formulated. This second edition
has been updated throughout, with revisions that reflect insights
gained by the authors from using the text every year at MIT. In
addition, because of substantial software improvements, this
edition provides algebraic proofs of more generality than those in
the previous edition; this improvement permeates the new edition.
|
You may like...
Loot
Nadine Gordimer
Paperback
(2)
R398
R330
Discovery Miles 3 300
Gloria
Sam Smith
CD
R238
R194
Discovery Miles 1 940
Brightside
The Lumineers
CD
R194
Discovery Miles 1 940
|