Parallel LISP Systems

Name: Parallel LISP Systems
Availability: OutOfStock
ISBN: 9780412455605

ISBN-10: 0412455609

ISBN-13: 9780412455605

Edition: 1993

Authors: C. K. Yuen

List price: $46.50

30 day, 100% satisfaction guarantee!

Out of stock

We're sorry. This item is currently unavailable.

what's this?

Rush Rewards U
Members Receive:

You have reached 400 XP and carrot coins. That is the daily max!

Book details

List price: $46.50
Copyright year: 1993
Publisher: Thomson Learning
Binding: Paperback
Size: 6.25" wide x 9.25" long x 0.50" tall
Weight: 0.748
Language: English

Preface
Lisp: history and background	p. 1
Fortran	p. 2
List processing	p. 4
[lambda] calculus	p. 6
Development of Lisp	p. 11
Programming in Lisp	p. 15
Lisp examples	p. 15
COND	p. 21
SET and LET	p. 25
Lexical and dynamic scoping	p. 28
Lisp dialects	p. 33
Common Lisp	p. 33
Scheme	p. 37
Parallel Lisp	p. 39
Implementation methods	p. 43
A Lisp self-interpreter	p. 43
Stack execution	p. 47
Dataflow machines	p. 51
Garbage collection in Lisp processors	p. 55
Classification of garbage collection algorithms	p. 56
Reference counting schemes	p. 57
Copy collectors	p. 60
Mark-and-sweep algorithms	p. 68
Discussion	p. 72
BaLinda Lisp: a parallel lisp dialect	p. 79
Parallel programming and Linda	p. 79
BaLinda Lisp	p. 82
Speculative processing	p. 86
Discussion of BaLinda Lisp	p. 94
Parallel processing in BaLinda Lisp	p. 99
Dining philosophers	p. 99
Perfect shuffle	p. 101
Pattern matching	p. 102
All-pairs shortest paths	p. 103
Root finding	p. 105
Parser	p. 106
Stable marriage	p. 108
Boyer benchmark	p. 111
Eight-queens problem	p. 113
Heuristic search	p. 115
Applications of heuristic templates	p. 119
Survey of parallel Lisp dialects	p. 129
Current parallel Lisp dialects	p. 129
Multilisp	p. 131
Qlisp	p. 134
Spur Lisp	p. 138
Concurrent scheme	p. 139
CmLisp	p. 142
Comparison with BaLinda Lisp	p. 144
BIDDLE: a dataflow architecture for Lisp	p. 159
Description of BIDDLE	p. 159
BIDDLE design	p. 161
Speculative evaluation	p. 168
Distributed storage	p. 170
Discussion	p. 171
Current developments	p. 175
Parallel language implementation	p. 175
Semi-pure functional languages	p. 182
Types and polymorphic functions	p. 194
Looking at the future	p. 196
Appendix: logic programming	p. 201
A1: Formal systems	p. 201
A2: Formal definition of proposition logic	p. 202
A3: Predicate logic	p. 208
A4: Making deductions	p. 212
A5: Resolution and unification	p. 216
A6: Logic programming	p. 219
A7: List representation of relations	p. 223
Index	p. 227
Table of Contents provided by Blackwell. All Rights Reserved.