ML for the Working ProgrammerCambridge University Press, 1996 M06 28 - 476 páginas 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. |
Dentro del libro
Resultados 1-5 de 88
Página vi
... Example : real square roots 54 2.18 Hiding declarations using local 55 2.19 Simultaneous declarations 56 Introduction to modules 59 2.20 The complex numbers 59 2.21 Structures 60 2.22 Signatures 62 Polymorphic type checking 63 2.23 Type ...
... Example : real square roots 54 2.18 Hiding declarations using local 55 2.19 Simultaneous declarations 56 Introduction to modules 59 2.20 The complex numbers 59 2.21 Structures 60 2.22 Signatures 62 Polymorphic type checking 63 2.23 Type ...
Página x
... examples 346 8.10 A pretty printer 351 Summary of main points 356 9 Writing Interpreters for the λ - Calculus 357 ... Example : parsing and displaying types 367 Introducing the λ - calculus 372 9.5 λ - terms and λ - reductions 372 9.6 ...
... examples 346 8.10 A pretty printer 351 Summary of main points 356 9 Writing Interpreters for the λ - Calculus 357 ... Example : parsing and displaying types 367 Introducing the λ - calculus 372 9.5 λ - terms and λ - reductions 372 9.6 ...
Página xv
Lo sentimos, el contenido de esta página está restringido..
Lo sentimos, el contenido de esta página está restringido..
Página xvi
Lo sentimos, el contenido de esta página está restringido..
Lo sentimos, el contenido de esta página está restringido..
Página 2
Lo sentimos, el contenido de esta página está restringido..
Lo sentimos, el contenido de esta página está restringido..
Contenido
III | 1 |
IV | 2 |
VI | 3 |
VII | 5 |
IX | 9 |
X | 11 |
XII | 13 |
XIII | 15 |
CXIX | 192 |
CXX | 194 |
CXXI | 197 |
CXXII | 201 |
CXXIII | 204 |
CXXV | 207 |
CXXVI | 208 |
CXXVII | 210 |
XIV | 17 |
XV | 18 |
XVIII | 19 |
XIX | 21 |
XX | 22 |
XXII | 24 |
XXIII | 26 |
XXIV | 27 |
XXV | 28 |
XXVI | 29 |
XXVII | 32 |
XXVIII | 36 |
XXIX | 38 |
XXX | 39 |
XXXI | 40 |
XXXII | 44 |
XXXIII | 48 |
XXXIV | 49 |
XXXV | 52 |
XXXVI | 53 |
XXXVII | 54 |
XXXVIII | 55 |
XXXIX | 56 |
XL | 59 |
XLII | 60 |
XLIII | 62 |
XLIV | 63 |
XLV | 64 |
XLVI | 65 |
XLVII | 67 |
XLVIII | 69 |
XLIX | 70 |
LI | 72 |
LII | 74 |
LIV | 76 |
LV | 78 |
LVI | 81 |
LVII | 82 |
LVIII | 83 |
LIX | 85 |
LX | 87 |
LXI | 89 |
LXII | 90 |
LXIII | 93 |
LXIV | 95 |
LXV | 96 |
LXVI | 97 |
LXVII | 101 |
LXVIII | 102 |
LXIX | 108 |
LXXI | 109 |
LXXII | 110 |
LXXIII | 111 |
LXXIV | 114 |
LXXV | 115 |
LXXVI | 116 |
LXXVII | 117 |
LXXVIII | 119 |
LXXIX | 121 |
LXXX | 123 |
LXXXI | 124 |
127 | |
LXXXIV | 128 |
LXXXV | 130 |
LXXXVI | 134 |
LXXXVIII | 135 |
LXXXIX | 136 |
XC | 138 |
XCI | 140 |
XCII | 141 |
XCIII | 142 |
XCIV | 145 |
XCV | 146 |
XCVI | 148 |
XCVII | 149 |
XCVIII | 154 |
XCIX | 159 |
C | 164 |
CII | 166 |
CIII | 167 |
CIV | 170 |
CV | 171 |
CVI | 172 |
CVIII | 173 |
CIX | 176 |
CX | 177 |
CXI | 179 |
CXIII | 180 |
CXIV | 182 |
CXV | 184 |
CXVI | 185 |
CXVII | 188 |
CXVIII | 191 |
CXXVIII | 211 |
CXXIX | 213 |
CXXX | 214 |
CXXXII | 216 |
CXXXIII | 220 |
CXXXIV | 224 |
CXXXV | 225 |
CXXXVI | 229 |
CXXXVII | 233 |
CXXXVIII | 237 |
CXXXIX | 238 |
CXL | 242 |
CXLI | 246 |
CXLII | 248 |
CXLIII | 249 |
CXLIV | 251 |
CXLV | 254 |
CXLVI | 256 |
CXLVII | 257 |
CXLVIII | 258 |
CL | 259 |
CLI | 260 |
CLII | 261 |
CLIII | 263 |
CLV | 264 |
CLVI | 266 |
CLVII | 269 |
CLVIII | 271 |
CLIX | 272 |
CLX | 275 |
CLXI | 280 |
CLXII | 285 |
CLXIV | 290 |
CLXV | 294 |
CLXVI | 299 |
CLXVII | 305 |
CLXVIII | 308 |
CLXIX | 309 |
CLXX | 311 |
CLXXI | 312 |
CLXXII | 313 |
CLXXIII | 314 |
CLXXV | 317 |
CLXXVI | 321 |
CLXXVII | 326 |
CLXXVIII | 327 |
CLXXIX | 331 |
CLXXX | 335 |
CLXXXI | 340 |
CLXXXIII | 344 |
CLXXXIV | 346 |
CLXXXV | 351 |
CLXXXVI | 356 |
CLXXXVII | 357 |
CLXXXVIII | 358 |
CLXXXIX | 360 |
CXC | 363 |
CXCI | 367 |
CXCII | 372 |
CXCIII | 375 |
CXCIV | 378 |
CXCVI | 381 |
CXCVII | 382 |
CXCVIII | 384 |
CXCIX | 385 |
CC | 388 |
CCI | 389 |
CCII | 393 |
CCIII | 396 |
CCIV | 397 |
CCV | 398 |
CCVI | 399 |
CCVII | 400 |
CCVIII | 403 |
CCIX | 404 |
CCX | 407 |
CCXII | 411 |
CCXIII | 416 |
CCXIV | 420 |
CCXVI | 421 |
CCXVII | 424 |
CCXVIII | 426 |
CCXIX | 428 |
CCXX | 430 |
CCXXII | 433 |
CCXXIII | 436 |
CCXXIV | 440 |
CCXXV | 445 |
CCXXVI | 449 |
CCXXVII | 457 |
469 | |
Otras ediciones - Ver todas
Términos y frases comunes
abstract type algorithm applied argument arithmetic array Atom binary tree bool Braun components compute Conj Cons constraint constructors data structures datatype declaration defined depth-first search efficient elements empty equality test evaluation example exception Exercise expression first-order logic foldl foldr formula func functional programming functor imperative programming implement infix infix operator input insert int list integer label language lazy evaluation let val list list matrix merge sort ML's natural numbers node normal form numbers pairs parameter parser parsing pattern polymorphic priority queues PRIORITY_QUEUE proof prove quantifier real list real numbers recursive call recursive functions result returns rule Section sequence sequent calculus signature sort specifies Standard ML string list struct structural induction subgoal substring subtree tactic term theorem tion unify update V:right variables vector well-founded well-founded relation
Referencias a este libro
Logic in Computer Science: Modelling and Reasoning about Systems Michael Huth,Mark Ryan Sin vista previa disponible - 2004 |