√лавна€    Ex Libris     ниги    ∆урналы    —татьи    —ерии     аталог    Wanted    «агрузка    ’удЋит    —правка    ѕоиск по индексам    ѕоиск    ‘орум   
blank
јвторизаци€

       
blank
ѕоиск по указател€м

blank
blank
blank
 расота
blank
Lawrence C. Paulson Ч ML for the working programmer
Lawrence C. Paulson Ч ML for the working programmer

„итать книгу
бесплатно

—качать книгу с нашего сайта нельз€

ќбсудите книгу на научном форуме



Ќашли опечатку?
¬ыделите ее мышкой и нажмите Ctrl+Enter


Ќазвание: ML for the working programmer

јвтор: Lawrence C. Paulson

јннотаци€:

The new edition of this successful and established textbook retains its two original intentions of explaining how to program in the ML language, and teaching the fundamentals of functional programming. The major change is the early and prominent coverage of modules, which the author extensively uses throughout. In addition, Paulson has totally rewritten the first chapter to make the book more accessible to students who have no experience of programming languages. The author describes the main features of new Standard Library for the revised version of ML, and gives many new examples, e.g. polynomial arithmetic and new ways of treating priority queues. Finally he has completely updated the references. Dr. Paulson has extensive practical experience of ML, and has stressed its use as a tool for software engineering; the book contains many useful pieces of code, which are freely available (via Internet) from the author. He shows how to use lists, trees, higher-order functions and infinite data structures. He includes many illustrative and practical examples, covering sorting, matrix operations, and polynomial arithmetic. He describes efficient functional implementations of arrays, queues, and priority queues. Larger examples include a general top-down parser, a lambda-calculus reducer and a theorem prover. A chapter is devoted to formal reasoning about functional programs. The combination of careful explanation and practical advice will ensure that this textbook continues to be the preferred text for many courses on ML for students at all levels.


язык: en

–убрика: Computer science/

—татус предметного указател€: √отов указатель с номерами страниц

ed2k: ed2k stats

»здание: 2 edition

√од издани€: 1996

 оличество страниц: 496

ƒобавлена в каталог: 16.10.2010

ќперации: ѕоложить на полку | —копировать ссылку дл€ форума | —копировать ID
blank
ѕредметный указатель
! function      314Ч318
$\lambda$-calculus      182 372Ч396
$\nu$-arrays      336Ч339
() constructor      32
* infix      22 23 303
+ infix      22 23 303
- infix      22 23 303
/ infix      23 303
:: constructor      70Ч71 77 186
:= infix      314Ч317
< infix      26
<= infix      27
<> infix      27 (see also УEqualityФ)
= infix      27 97
=> keyword      133 138 172 463
>= infix      27
>infix      27
@ infix      78Ч80 82 186
@ infix for sequences      195
@ infix, eliminating      80 111 146
@ infix, proofs about      226Ч229
AAMP5 microprocessor      256
Aasa, Annika      339
abs function      24
Abstract types      97 115 263Ч269
Abstract types for proof systems      421
Abstract types, examples of      281Ч283 327Ч334
Abstract types, how to declare      268
Abstraction over variables in $\lambda$-calculus      372Ч374 377 379
Abstraction over variables in logic      407Ч409
abstype declarations      266Ч269 281 284 460
abstype declarations, repeated      293
Adams, Stephen      154
ALF system      13
all function      184Ч185 187
Amortized cost      262
Andalso keyword      27 43 462
Andrews, Peter      446
app function      320
Appel, Andrew      10 15 102 351 371
APPEND      see У@Ф
Applicative programming      see УFunctional programmingФ
ARITH signature      62Ч63 86 116
Arithmetic in ML      14 22Ч24 137 465
Arithmetic in ML, unlimited precision      445Ч446
Array structure      335
Arrays, flexible      154Ч159 263 300
Arrays, functional      336Ч339
Arrays, mutable      154 335Ч336
AS keyword      132 156 463Ч464
Assignment commands      see У: =Ф
Assignments in logic      398
Association lists      101Ч102 150 287Ч288 336
Atan function      24
AUTOMATH system      395
Backtracking      see УSearch depth-firstФ
Backus, John      6n 9
Beckert, B.      443
before infix      320
Bevier, William R.      256
Biagioni, Edoardo      10
Binary arithmetic      85Ч87
Bind exception      137 138
BinIO structure      350
Boehm, Hans      446
Bool structure      340
bool type      26 127
Boolean values      26Ч27
Boolean values in $\lambda$-calculus      385
Boyer/Moore theorem prover      see УNQTHMФ
Braun, W.      155
Bruijn, N.G. de      395
Burge, W.H.      371
C      15Ч16 274
Call-by-name      44Ч45 194 200n
Call-by-name in $\lambda$-calculus      375 388Ч392 395
Call-by-need      8 9 45Ч48 140
Call-by-value      39Ч40 43 44 136 140
Call-by-value in $\lambda$-calculus      375 389Ч393
CAML      12 136
Cardelli, Luca      67
Cartwright, Robert      446
CASE expressions      133 137Ч140 173 462
CEIL function      24
Char structure      26 341Ч342
Char type      25Ч26
Chr exception      137
chr function      25Ч26 137
Church Ч Rosser Theorem      374
Church, Alonzo      47 372
Cohn, Avra      256
Combinators      180Ч182
Comments      20 467
complex numbers      59Ч61
Composition of functions      see УoФ
Computer algebra      114
CONCAT function      74 82
concat function for lists      81 187 190
concat function for sequences      437
Concatenation of lists      see У@Ф
Concatenation of lists, in $\lambda$-calculus      388 395
Concatenation of sequences      195
Concatenation of strings      25
conditional expressions      26Ч27 43Ч44 462
Conditional expressions and exceptions      137 140
Conditional expressions in $\lambda$-calculus      385 391
Conditional expressions, type checking of      64
Conjunctive normal form      167Ч170 240Ч242
Cons      see У: : constructorФ
Constable, Robert      443
Constructive type theory      13 443
Constructors      125 130Ч132
Constructors for lists      70
Constructors, hiding      159 265Ч269
Control structures      317Ч321
cos function      24
Cousineau, Guy      12
Damas, Luis      67
Datatype bindings      267 461
datatype declarations      124Ч130 460
datatype declarations with one constructor      159 261
datatype declarations, recursive      142 165 192 194 233
datatype declarations, repeated      128 293
datatype specifications      310
Date structure      15
Davis Ч Putnam procedure      170 446
Declarations      18Ч22 53Ч56 460
Declarations in a structure      60
Declarations of modules      311Ч312 457Ч458
Declarations, simultaneous      56Ч58
Declarative programming      10
Depth function      143 189 232
Dereferencing      see У!Ф
Dictionary functor      281Ч283
DICTIONARY signature      149Ч150 266 281 288
Dijkstra, Edsger      82 93 94 159
Disjoint sum type      129Ч130
Disjunctive normal form      170
distrib function      see УConjunctive normal formФ
Div exception      137
div infix      22 49 64
Domain exception      137
Domain theory      215 216 233 247 443
DROP FUNCTION      78 82 111 188 424
drop function, proofs about      251Ч254
dropwhile function      184
Efficiency      9Ч10 47
Efficiency of recursion      42 76Ч80
Eight queens problem      208Ч211
Empty exception      138
Environments      21 39 62 378 393 418
eqtype specifications      266 269 287Ч288 310 459
EQUAL constructor      127 281 289
Equality      96Ч107
Equality and abstract types      97 267 268
Equality and functions      97 234Ч236
Equality of references      316 332Ч334
EuclidТs algorithm      see УGreatest Common DivisorФ
Evaluation      38Ч48 136
evaluation, lazy      see УCall-by-needФ
Evaluation, strict      see УCall-by-valueФ
exception declarations      135Ч136 304 460
exception specifications      310 459
Exceptions      134Ч141 462
Exceptions and commands      320Ч321
Exceptions, eliminating      151
Exceptions, type checking of      325
exists function      184Ч185 187
exn type      135Ч139 141 177 321
Exp function      24
explode function      73
Expressions      462Ч463
Expressions in programming languages      2Ч4
fact function      40Ч42 245
facti function      40Ч42 47
facti function, proofs about      214 220Ч222 245 247
facti function, type checking of      64
Factorials      40Ч43 189 317Ч319 УfactiФ)
Factorials in $\lambda$-calculus      388Ч389 393Ч395
Fail exception      138
false constructor      26 127
Fibonacci numbers      49Ч51 191 222Ч223 329Ч330
Filter function      182Ч183 187 209
filter function for sequences      196 206
Fitzgerald, J.S.      256
Fixed point property      389 392
Fixedlnt structure      14
Floor function      24
fn expressions      172Ч174 178 323 427Ч428 462
fn expressions and delayed evaluation      193 202 391
foldl function      185Ч187
foldl function, proofs about      236Ч237
foldr function      185Ч187 190 211 409
foldr function, proofs about      237
Formula      398
Formula in ML      408
FORTRAN      2 7 9 127 356
FP      9
from function      193 199
Frost, R.      371
Fully-functorial programming      294Ч299
fun declarations      19Ч20 28Ч31 125Ч127 460
fun declarations of curried functions      174 182Ч183
fun declarations, polymorphic      325
Functional languages      9
Functional programming      1Ч11 38 58
Functional programming and imperative features      327Ч330 336Ч339
Functional programming, applications of      10
Functionals      7Ч8 179Ч190 409 426Ч428 УTacticsФ)
Functionals and parsing      362Ч366
Functionals, proofs about      233Ч237
Functions      6
Functions as arguments      177Ч178 280
Functions as data      176Ч177 191Ч192
Functions with multiple arguments/results      29Ч32 82 110
Functions, curried      173Ч178 183Ч185 209
functions, declaring      see УFun declarationsФ
Functions, higher-order      see УFunctionalsФ
Functions, iterative      42Ч44 49 51 76Ч78 151 186 247
functions, recursive      6 40Ч44 48Ч53 175 317
functor declarations      272 275Ч277 285Ч289 312 458
functors      271Ч299 309
Gansner, Emden      13
Garbage collection      5Ч6 130 313
Gaussian elimination      90Ч92
General structure      15
Gerhart, Susan      256
Gordon, Michael J.C.      12 440 443
Grant, P.W.      92
graphs      102Ч107 278Ч280
GREATER constructor      127
Greatest common divisor      3 10 48 53 248
Greatest common divisor for polynomials      120Ч121
Greiner, John      326
HAL      397 407Ч443
Halfant, Matthew      200
Hamming problem      330
handle keyword      138 462
HARP system      443
Harper, Robert      326
Haskell      9 10 92 102 13In
hd function      74 82 138 176
hd function for sequences      192 327
heaps      see УPriority queuesФ
Heaps, binomial      164
Hoare, C.A.R.      10 15 69 110 111
HOL system      443
Holmstrom, Soren      336
Hoogerwoord, R.      159
HOPE      12
HTML      348Ч350
Hudak, Paul      9
Huet, Gerard      12 421
Hughes, John      200 336
Identifiers      21Ч22 61 465Ч467
if expressions      see УConditional expressionsФ
ignore function      319
Imperative programming      2Ч5 79 108
Imperative programming in ML      313Ч340 344Ч356
ImperativeIO functor      350
implode function      73
include specifications      307Ч308 310 459
Induction on natural numbers      216Ч224 244Ч245
Induction on size      238Ч245
Induction, structural      224Ч233 245
Induction, well-founded      238 242Ч247
infix declarations      460
Infix operators      36Ч38 283 303 363 462
Infix operators, parsing      364Ч366 412Ч414
Input/Output      8 340Ч356
Instances of polymorphic types      65 176
Instances of signatures      264
Instances of terms/$formul{\ae}$      379 416Ч420
Int structure      24 340
int type      22Ч24
inter function      98 183
interleave function      195 202
IntInf structure      14
Io exception      344
Isabelle system      246 421 440 443
it value      19 50 174
iterates function      196 198 331
Keywords of Standard ML      21
Lakatos, Imre      256
LAMBDA system      13
Landin, Peter      12
Launchbury, J.      371
Lazy ML      9
LCF system      11Ч13 421 440 443
LeanTAP system      443
Left-recursive rules      361 381 412
length function      76Ч77 82 229
Leroy, Xavier      136
LESS constructor      127
let expressions      53Ч55 135Ч137 300Ч301 318
let expressions and polymorphism      324
Letz, R.      443
Lexical analysis      358Ч360 368 412
Library      ix 13Ч15 127 319
Library, arithmetic and      24 303
1 2 3
blank
–еклама
blank
blank
HR
@Mail.ru
       © Ёлектронна€ библиотека попечительского совета мехмата ћ√”, 2004-2017
Ёлектронна€ библиотека мехмата ћ√” | Valid HTML 4.01! | Valid CSS! ќ проекте