The Optimal Implementation of Functional Programming Languages

Etukansi
Cambridge University Press, 3.12.1998 - 392 sivua
0 Arvostelut
All traditional implementation techniques for functional languages fail to avoid useless repetition of work. They are not "optimal" in their implementation of sharing, often causing a catastrophic, exponential explosion in reduction time. Optimal reduction is an innovative graph reduction technique for functional expressions, introduced by Lamping in 1990, that solves the sharing problem. This work, the first on the subject, is a comprehensive account by two of its leading exponents. Practical implementation aspects are fully covered as are the mathematical underpinnings of the subject. The relationship to the pioneering work of Lévy and to Girard's more recent "Geometry of Interaction" are explored; optimal reduction is thereby revealed as a prime example of how a beautiful mathematical theory can lead to practical benefit. The book is essentially self-contained, requiring no more than basic familiarity with functional languages. It will be welcomed by graduate students and research workers in lambda calculus, functional programming or linear logic.
 

Mitä ihmiset sanovat - Kirjoita arvostelu

Yhtään arvostelua ei löytynyt.

Sisältö

III
1
IV
4
V
8
VI
14
VIII
15
IX
19
X
20
XI
29
LXVI
208
LXVII
209
LXVIII
212
LXIX
215
LXX
216
LXXI
217
LXXII
220
LXXIII
221

XII
33
XIII
35
XIV
38
XV
39
XVI
41
XVII
43
XVIII
46
XIX
50
XX
52
XXI
60
XXII
63
XXIII
66
XXIV
71
XXV
73
XXVI
75
XXVII
76
XXVIII
80
XXIX
81
XXX
83
XXXI
86
XXXII
88
XXXIII
89
XXXIV
91
XXXV
96
XXXVI
98
XXXVII
101
XXXVIII
105
XXXIX
108
XL
119
XLI
122
XLII
124
XLIII
126
XLIV
129
XLV
138
XLVI
141
XLVII
142
XLVIII
144
XLIX
148
L
150
LI
154
LII
159
LIII
168
LIV
178
LVI
179
LVII
181
LVIII
184
LIX
185
LX
189
LXI
191
LXII
196
LXIII
199
LXIV
200
LXV
206
LXXIV
222
LXXV
223
LXXVI
224
LXXVII
225
LXXVIII
227
LXXIX
229
LXXX
231
LXXXI
233
LXXXII
235
LXXXIII
239
LXXXIV
240
LXXXV
243
LXXXVI
244
LXXXVII
247
LXXXVIII
248
LXXXIX
250
XC
257
XCI
262
XCII
265
XCIII
268
XCIV
269
XCV
272
XCVI
273
XCVII
277
XCVIII
279
XCIX
281
C
284
CI
288
CII
291
CIII
296
CIV
302
CV
303
CVII
305
CVIII
313
CX
316
CXI
328
CXII
329
CXIII
331
CXIV
334
CXV
342
CXVI
343
CXVII
344
CXVIII
351
CXIX
352
CXXI
355
CXXII
361
CXXIII
365
CXXIV
370
CXXV
371
CXXVI
376
CXXVIII
383
CXXIX
390
Tekijänoikeudet

Yleiset termit ja lausekkeet

Suositut otteet

Sivu 387 - In Automata, Languages and Programming. 24th International Colloquium, volume 1256 of Lecture Notes in Computer Science, pages 177-187.
Sivu 388 - Press, 1980. [LM96] Julia L. Lawall and Harry G. Mairson. Optimality and inefficiency: What isn'ta cost model of the lambda calculus? In 1996 ACM International Conference on Functional Programming, 1996.
Sivu 386 - S. Abramsky and G. McCusker. Linearity, sharing and state: a fully abstract game semantics for Idealized Algol with active expressions (extended abstract). In Proceedings of 1996 Workshop on Linear Logic, volume 3 of Electronic notes in Theoretical Computer Science. Elsevier, 1996.

Viitteet tähän teokseen

Kaikki Kirjat-palvelun tulokset »

Kirjaluettelon tiedot