ML for the Working ProgrammerCambridge University Press, 1996 M06 28 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 are extensively used throughout. In addition, the first chapter has been totally rewritten to make the book more accessible to those without experience of programming languages. The main features of new Standard Library for the revised version of ML are described and many new examples are given, while references have also been updated. 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 the Internet) from the author. He shows how to use lists, trees, higher-order functions and infinite data structures. Many illustrative and practical examples are included.. Efficient functional implementations of arrays, queues, priority queues, etc. are described. Larger examples include a general top-down parser, a lambda-calculus reducer and a theorem prover. The combination of careful explanation and practical advice will ensure that this textbook continues to be the preferred text for many courses on ML. |
Dentro del libro
Resultados 1-5 de 56
Página
... error, or are consistent with any particular standard ofmerchantability, or thattheywill meet your requirements for any particular application. They should not berelied uponfor solvinga problemwhose incorrect solution could result in ...
... error, or are consistent with any particular standard ofmerchantability, or thattheywill meet your requirements for any particular application. They should not berelied uponfor solvinga problemwhose incorrect solution could result in ...
Página
... errors. Information and warning boxes. Technical asides, descriptionsoflibrary functions, and notes for further study appear from place toplace.They are highlighted forthe benefit of readers whowish to skipover them: KingHenry's claim ...
... errors. Information and warning boxes. Technical asides, descriptionsoflibrary functions, and notes for further study appear from place toplace.They are highlighted forthe benefit of readers whowish to skipover them: KingHenry's claim ...
Página
... error to waste hours of a programmer's time. The new standard library introduces incompatibilities between old and new compilers. Warnings of possible hazards appear throughout the book.They looklike this: Beware theDuke of Gloucester ...
... error to waste hours of a programmer's time. The new standard library introduces incompatibilities between old and new compilers. Warnings of possible hazards appear throughout the book.They looklike this: Beware theDuke of Gloucester ...
Página
... errors in previous printings. Piete Brooks, John Carroll and Graham Titmus helped with the computers.I wish to thankDave Matthews for developing Poly/ML,which wasfor manyyears theonly efficient implementation of Standard ML . Of the ...
... errors in previous printings. Piete Brooks, John Carroll and Graham Titmus helped with the computers.I wish to thankDave Matthews for developing Poly/ML,which wasfor manyyears theonly efficient implementation of Standard ML . Of the ...
Página
... errors. Beforeaprogrammay run, the compilerchecks that all module interfaces agreeand that dataare used consistently. For ... error message. But it cannotcrash. ML supports alevelof abstraction that isoriented tothe requirements ofthe ...
... errors. Beforeaprogrammay run, the compilerchecks that all module interfaces agreeand that dataare used consistently. For ... error message. But it cannotcrash. ML supports alevelof abstraction that isoriented tothe requirements ofthe ...
Contenido
Summary of main points 4 Trees and Concrete Data | |
Functions and InfiniteData Chapter outline Functions asvalues 5 1 Anonymous functionswith | |
Summary of main points 3 Lists | |
Summary of main points 7 Abstract Types andFunctors Chapter outline | |
Imperative Programming in ML | |
Summary of main points 10 A Tactical Theorem Prover | |
Términos y frases comunes
abstract type algorithm applied argument arithmetic binary search trees binary tree callbyvalue canbe characters components compute constructors contains curried function data structures datatype datatype declaration defined depthfirst search dictionary efficient elements empty error example exception Exercise expression flexible arrays foldl foldr formula functional programming functor handler heap higherorder functions imperative programming implement infix infix operator input insert integers iterative label lazy evaluation logic lookup match mathematical mathematical induction matrix merge sort ML’s modules multisets natural numbers node normal form notation numbers ofthe output pairs parameter parser parsing pattern patternmatching polymorphic polynomials predicate priority queues proof proposition prove quantifier real numbers recursive call recursive functions references replaces representation represented result returns rule Section sequence sequent calculus signature solutions sort specifies standard library Standard ML string structural induction subgoal subtrees syntax tactics takes term terminate theorem update vector wellfounded