عنوان

Common LISP :

شابک

048679170X

شابک

1306512859

شابک

9780486791708

شابک

9781306512855

شابک اشتباه

0486498204

شابک اشتباه

9780486498201

عنوان اصلي

Common LISP :

نام عام مواد

[Book]

ساير اطلاعات عنواني

a Gentle Introduction to Symbolic Computation.

نام ناشر، پخش کننده و غيره

Dover Publications,

تاریخ نشرو بخش و غیره

2014.

نام خاص و کميت اثر

1 online resource

عنوان فروست

Dover Books on Engineering

متن يادداشت

Includes bibliographical references and index.

متن يادداشت

Cover; Title Page; Copyright Page; Dedication; Preface; Note to Instructors; Acknowledgements; Contents; 1. Functions and Data; 1.1. Introduction; 1.2. Functions On Numbers; 1.3. Three Kinds of Numbers; 1.4. Order Of Inputs Is Important; 1.5. Symbols; 1.6. The Special Symbols T and NIL; 1.7. Some Simple Predicates; 1.8. The EQUAL Predicate; 1.9. Putting Functions Together; 1.9.1. Defining ADD1; 1.9.2. Defining ADD2; 1.9.3. Defining TWOP; 1.9.4. Defining ONEMOREP; 1.10. The NOT Predicate; 1.11. Negating A Predicate; 1.12. Number of Inputs to a Function; 1.13. Errors; Advanced Topics.

متن يادداشت

1.14. The History of Lisp2. Lists; 2.1. Lists Are The Most Versatile Data Type; 2.2. What Do Lists Look Like?; 2.3. Lists of One Element; 2.4. Nested Lists; 2.5. Length of Lists; 2.6. NIL: The Empty List; 2.7. Equality of Lists; 2.8. FIRST, SECOND, THIRD, and REST; 2.9. Functions Operate On Pointers; 2.10. AR and CDR; 2.10.1. The CDR of a Single-Element List; 2.10.2. Combinations of CAR and CDR; 2.10.3. CAR and CDR of Nested Lists; 2.10.4. CAR and CDR of NIL; 2.11. CONS; 2.11.1. CONS and the Empty List; 2.11.2. Building Nested Lists With CONS; 2.11.3. CONS Can Build Lists From Scratch.

متن يادداشت

2.12. Symmetry of CONS and CAR/CDR2.13. LIST; 2.14. Replacing the First Element of a List; 2.15. List Predicates; Advanced Topics; 2.16. Unary Arithmetic with Lists; 2.17. Nonlist Cons Structures; 2.18. Circular Lists; 2.19. Length of Nonlist Cons Structures; 3. EVAL Notation; 3.1. Introduction; 3.2. The EVAL Function; 3.3. EVAL Notation Can Do Anything Box Notation Can Do; 3.4. Evaluation Rules Define the Behavior of EVAL; 3.5. Defining Functions in EVAL Notation; 3.6. Variables; 3.7. Evaluating Symbols; 3.8. Using Symbols and Lists as Data; 3.9. The Problem of Misquoting.

متن يادداشت

3.10. Three Ways to Make Lists3.11. Four Ways to Misdefine a Function; 3.12. More About Variables; Lisp on the Computer; 3.13. Running Lisp; 3.14. The Read-Eval-Print Loop; 3.15. Recovering From Errors; Lisp Toolkit: ED; Keyboard Exercise; Advanced Topics; 3.16. Functions of No Arguments; 3.17. The QUOTE Special Function; 3.18. Internal Structure of Symbols; 3.19. Lambda Notation; 3.20. Scope of Variables; 3.21. EVAL and APPLY; 4. Conditionals; 4.1. Introduction; 4.2. The IF Special Function; 4.3. The COND Macro; 4.4. Using T as a Test; 4.5. Two More Examples of COND.

متن يادداشت

4.6. COND and Parenthesis Errors4.7. The AND and OR Macros; 4.8. Evaluating AND and OR; 4.9. Building Complex Predicates; 4.10. Why AND and OR are Conditionals; 4.11. Conditionals are Interchangeable; Lisp Toolkit: STEP; Advanced Topics; 4.12. Boolean Functions; 4.13. Truth Tables; 4.14. DeMorgan's Theorem; 5. Variables and Side Effects; 5.1. Introduction; 5.2. Local and Global Variables; 5.3. SETF Assigns a Value to a Variable; 5.4. Side Effects; 5.5. The LET Special Function; 5.6. The LET* Special Function; 5.7. Side Effects Can Cause Bugs; Lisp Toolkit: DOCUMENTATION and APROPOS.

بدون عنوان

0

بدون عنوان

8

بدون عنوان

8

بدون عنوان

8

بدون عنوان

8

متن يادداشت

This highly accessible introduction to Lisp is suitable both for novices approaching their first programming language and experienced programmers interested in exploring a key tool for artificial intelligence research. The text offers clear, reader-friendly explanations of such essential concepts as cons cell structures, evaluation rules, programs as data, and recursive and applicative programming styles. The treatment incorporates several innovative instructional devices, such as the use of function boxes in the first two chapters to visually distinguish functions from data, use of evaltrace notation in later chapters to illustrate the operation of evaluation rules, and "Dragon stories" to explain recursion. The book contains nearly 400 diagrams and illustrations, and 77 pages of answers to exercises. Advanced topics and "toolkit" sections, and a variety of complete programs, extend readers' programming power.

منبع سفارش / آدرس اشتراک

MIL

منبع سفارش / آدرس اشتراک

OverDrive, Inc.

شماره انبار

582536

شماره انبار

DC8D8E39-F5DC-4644-B16C-AA82B21E0377

شماره استاندارد بين المللي کتاب و موسيقي

9781306512855

موضوع مستند نشده

LISP (Computer program language)

موضوع مستند نشده

LISP (Computer program language)

موضوع مستند نشده

TECHNOLOGY & ENGINEERING / Electrical.

شماره

شماره رده

مستند نام اشخاص تاييد نشده

Touretzky, David S.

تاريخ عمليات

20200822114441.0

قواعد فهرست نويسي ( بخش توصيفي )

pn

نام الکترونيکي

نوع ماده

[Book]

تكميل شده

Y