HOME > 상세정보

상세정보

Lisp lore : a guide to programming the Lisp machine 2nd ed

Lisp lore : a guide to programming the Lisp machine 2nd ed (5회 대출)

자료유형
단행본
개인저자
Bromley, Hank. Lamson, Richard.
서명 / 저자사항
Lisp lore : a guide to programming the Lisp machine / by Hank Bromley and Richard Lamson.
판사항
2nd ed.
발행사항
Boston :   Kluwer Academic ,   c1987.  
형태사항
xix, 337 p. : ill. ; 24 cm.
ISBN
0898382289 :
일반주기
Includes index.  
일반주제명
LISP (Computer program language).
000 00723camuuu2002411a 4500
001 000000022837
005 19980604104209.0
008 870326s1987 maua 00110 eng d
010 ▼a 87003639
020 ▼a 0898382289 : ▼c $49.95 (est.)
040 ▼a 211009 ▼c 211009
049 1 ▼l 111023397
082 0 0 ▼a 005.13/3 ▼2 19
090 ▼a 005.13 ▼b B868L2
100 1 ▼a Bromley, Hank.
245 1 0 ▼a Lisp lore : ▼b a guide to programming the Lisp machine / ▼c by Hank Bromley and Richard Lamson.
250 ▼a 2nd ed.
260 ▼a Boston : ▼b Kluwer Academic , ▼c c1987.
300 ▼a xix, 337 p. : ▼b ill. ; ▼c 24 cm.
500 ▼a Includes index.
650 0 ▼a LISP (Computer program language).
700 1 0 ▼a Lamson, Richard.

소장정보

No. 소장처 청구기호 등록번호 도서상태 반납예정일 예약 서비스
No. 1 소장처 학술정보관(CDL)/B1 국제기구자료실(보존서고8)/ 청구기호 005.13 B868L2 등록번호 111023397 (5회 대출) 도서상태 대출가능 반납예정일 예약 서비스 B M

컨텐츠정보

책소개

This book had its genesis in the following piece of computer mail: From allegra!joan-b Tue Dec 18 89:15:54 1984 To: sola!hjb Subj ect: 1 i spm Hank, I've been talking with Mark Plotnik and Bill Gale about asking you to conduct a basic course on using the lisp machine. Mark, for instance, would really like to cover basics like the flavor system, etc. , so he could start doing his own programming without a lot of trial and error, and Bill and I would be interested in this, too. I'm quite sure that Mark Jones, Bruce, Eric and Van would also be really interested. Would you like to do it? Bill has let me know that if you'd care to set something up, he's free to meet with us anytime this week or next (although I'll only be here on Wed. next week) so we can come up with a plan. What do you think? Joan. xiv Lisp Lore (All the people and computers mentioned above work at AT&T Bell Laboratories, in Murray Hill, New Jersey. ) I agreed, with some trepidation, to try teaching such a course. It wasn't clear how I was going to explain the Lisp Machine environment to a few dozen beginners when at the time I felt I was scarcely able to keep myself afloat. Particularly since many of the "beginners" had PhD's in computer science and a decade or two of programming experience.

This book had its genesis in the following piece of computer mail: From allegra!joan-b Tue Dec 18 89:15:54 1984 To: sola!hjb Subj ect: 1 i spm Hank, I've been talking with Mark Plotnik and Bill Gale about asking you to conduct a basic course on using the lisp machine. Mark, for instance, would really like to cover basics like the flavor system, etc. , so he could start doing his own programming without a lot of trial and error, and Bill and I would be interested in this, too. I'm quite sure that Mark Jones, Bruce, Eric and Van would also be really interested. Would you like to do it? Bill has let me know that if you'd care to set something up, he's free to meet with us anytime this week or next (although I'll only be here on Wed. next week) so we can come up with a plan. What do you think? Joan. xiv Lisp Lore (All the people and computers mentioned above work at AT&T Bell Laboratories, in Murray Hill, New Jersey. ) I agreed, with some trepidation, to try teaching such a course. It wasn't clear how I was going to explain the Lisp Machine environment to a few dozen beginners when at the time I felt I was scarcely able to keep myself afloat. Particularly since many of the "beginners" had PhD's in computer science and a decade or two of programming experience.


정보제공 : Aladin

목차


CONTENTS
Preface to the First Edition = xiii
Preface to the Second Edition = xvii
1. Introduction = 1
2. Getting Started on the Lisp Machine = 7
 2.1 Why Use a Lisp Machine? = 7
  2.1.1 Why This Book? = 8
  2.1.2 Looking Ahead = 9
 2.2 The Keyboard = 11
 2.3 Typing to a Lisp Listener = 13
 2.4 Getting Around the Environment = 15
 2.5 The Mouse = 17
  2.5.1 The System Menu = 18
 2.6 The Monitor = 19
 2.7 The Editor = 21
 2.8 The Compiler and the Debugger = 23
 2.9 Getting Started = 24
  2.9.1 Bringing the Machine up = 25
  2.9.2 Logging in = 27
 2.10 A Word About Work Style = 30
 2.11 This and That = 31
  2.11.1 Problem Reporting = 31
  2.11.2 Backup = 32
 2.12 Problem Set #1 = 33
3. Flow of Control = 37
 3.1 Conditionals = 37
 3.2 Blocks and Exits = 40
 3.3 Nonlocal Exits = 41
 3.4 Iteration = 42
  3.4.1 Mapping = 44
  3.4.2 Do = 45
  3.4.3 Loop = 47
  3.4.4 Implicit Iteration = 51
 3.5 Lexical Scoping = 52
 3.6 Macros = 53
 3.7 Unwind-protect = 55
 3.8 Fun and Games = 57
 3.9 Problem Set = 58
4. More on Navigating the Lisp Machine = 67
 4.1 The Scheduler and Processes = 67
 4.2 Windows = 73
 4.3 Debugging = 80
 4.4 The Input Editor and Histories = 83
 4.5 Mouse Sensitivity = 86
 4.6 Poking Around = 90
 4.7 Fun and Games = 92
 4.8 Problem Set = 94
5. What's a Flavor? = 97
 5.1 Instance Variables = 98
 5.2 Methods = 99
 5.3 Making Instances = 101
 5.4 Initial Values for Instance Variables = 102
 5.5 Methods for Make-instance = 105
 5.6 Mixing Flavors = 105
 5.7 Combined Methods = 108
 5.8 Whoppers = 111
 5.9 Internal Interfaces = 115
 5.10 Vanilla Flavor = 115
 5.11 The Flavor Examiner Tools = 116
 5.12 Message Passing = 117
 5.13 The Window System = 120
 5.14 Fun and Games = 121
 5.15 Problem Set = 122
6. User Interface = 131
 6.1 Program Frameworks : an Overview = 132
 6.2 Defining Commands = 135
 6.3 The Redisplay = 137
 6.4 Presentation Types = 138
 6.5 Mouse Sensitivity = 141
  6.5.1 Mouse Sensitivity - the Easy part = 142
  6.5.2 Mouse Gesture Translations = 144
 6.6 Fun and Games = 147
7. The Graph Example = 149
 7.1 The Nodes and Arcs = 150
 7.2 The Presentation Types = 154
 7.3 The Display = 155
 7.4 The Commands = 157
 7.5 The Mouse Gesture Translators = 157
 7.6 The Program = 159
 7.7 Problem Set = 169
8. Streams and Files = 173
 8.1 Streams = 174
  8.1.1 Standard Stream Operations = 175
  8.1.2 Special-purpose Operations = 177
  8.1.3 Standard Stream = 179
 8.2 Accessing Files and Directories = 180
  8.2.1 Open and Other Functions for Operating on Files = 181
  8.2.2 Directories = 184
 8.3 Pathnames = 184
  8.3.1 Component Values = 187
  8.3.2 Case in Pathnames = 189
  8.3.3 Defaults and Merging = 190
  8.3.4 Pathname Functions and Methods = 191
  8.3.5 Logical Pathnames = 195
 8.4 Making Other I/O Streams = 198
 8.5 Fun and Games = 199
 8.6 Problem Set = 201
9. The Calculator Example = 205
 9.1 The Program Frame = 205
 9.2 The Redisplay = 207
 9.3 The Command-definition Macrology = 209
 9.4 The Program = 210
 9.5 Fun and Games = 214
10. Systems, Storage and Errors = 217
 10.1 Systems = 217
  10.1.1 Defining a System = 218
  10.1.2 Compiling and Loading Systems = 221
  10.1.3 Patching a System = 222
 10.2 Storage Allocation = 224
  10.2.1 Allocation and the Garbage Collector = 224
  10.2.2 Areas = 226
  10.2.3 Resources = 227
  10.2.4 Stack Allocation = 231
 10.3 Condition Handling = 233
  10.3.1 Signalling Conditions = 234
  10.3.2 Handling Conditions = 235
  10.3.3 Creating New Condition Flavors = 236
  10.3.4 Restart Handlers = 237
  10.3.5 Proceeding = 238
  10.3.6 A Few Examples = 239
 10.4 Fun and Games = 243
11. The Card Game Example = 245
 11.1 Card Definitions = 246
 11.2 Presentation Types = 248
 11.3 Card Places = 249
  11.3.1 Basic Places = 249
  11.3.2 Presentation = 250
  11.3.3 Caching = 251
  11.3.4 Stacked Palces = 251
 11.4 The Interactive Program = 252
  11.4.1 Games = 253
  11.4.2 Place Display = 255
 11.5 The Program = 256
 11.6 Problem Set = 278
 11.7 Fun and Games = 278
12. More Advanced Use of the Editor = 279
 12.1 Keyboard Macros = 280
 12.2 Writing New Commands = 282
  12.2.1 Zwei Data Structure = 282
  12.2.2 Command Tables and Command Definition = 286
  12.2.3 Reading From the Mini-buffer = 289
  12.2.4 A Real Example = 290
 12.3 Learning More About the Editor = 290
 12.4 Fun and Games = 291
 12.5 Problem Set = 292
13. A Quick Look At the Network = 299
 13.1 The Gee-whiz Look = 299
  13.1.1 what is a Network? = 300
  13.1.2 Levels of Abstraction = 302
 13.2 The Generic Network System = 305
  13.2.1 How Does Path-finding Work? = 306
  13.2.2 How Does Service Invocation Work? = 307
  13.2.3 Other GNS Functions = 307
 13.3 The Namespace System = 308
 13.4 Examples of the Use of the Generic Network System = 310
  13.4.1 Time of Day = 310
  13.4.2 Who's Logged in = 311
  13.4.3 Mail Delivery = 311
 13.5 Writing Your Own Network Software = 314
  13.5.1 Writing Your Own User End = 317
  13.5.2 Writing Your Own Server End = 317
  13.5.3 Sample User and Server Definition = 318
APPENDIX A. Basic Zmacs Commands = 325
Index = 331


관련분야 신착자료

Harvard Business Review (2025)