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 30
Página
... structure forbinary trees Treebased data structures 4.14 Dictionaries 4.15 Functional and flexible arrays 4.16 Priority queues A tautology checker 4.17 Propositional Logic 4.18 Negation normalform 4.19 Conjunctivenormal form Summary of ...
... structure forbinary trees Treebased data structures 4.14 Dictionaries 4.15 Functional and flexible arrays 4.16 Priority queues A tautology checker 4.17 Propositional Logic 4.18 Negation normalform 4.19 Conjunctivenormal form Summary of ...
Página
... data structures (say, binary search trees) toabstract types (say, dictionaries). A typical section introduces an ... structure. Though reviewers have been kind to the first edition, many readers have requested such a restructuring. The ...
... data structures (say, binary search trees) toabstract types (say, dictionaries). A typical section introduces an ... structure. Though reviewers have been kind to the first edition, many readers have requested such a restructuring. The ...
Página
... data structures. Functional programmingis idealformany aspects of problemsolving, as argued briefly belowand demonstrated throughout the book. Programming tasks canbe approached mathematically, without preoccupation with the computer's ...
... data structures. Functional programmingis idealformany aspects of problemsolving, as argued briefly belowand demonstrated throughout the book. Programming tasks canbe approached mathematically, without preoccupation with the computer's ...
Página
... structures,such asthelinked list, require references. Functional languages, andsomeothers, managestorage ... data can processed as lists of the form [a, b, c, d, e, ... ]. Lists support sequential.
... structures,such asthelinked list, require references. Functional languages, andsomeothers, managestorage ... data can processed as lists of the form [a, b, c, d, e, ... ]. Lists support sequential.
Página
... data structures. A higherorder function (or functional) is a function that operates on other functions. The functional map, when applied toafunction f, returnsanother function;that function takes [x 1 ..., x n ]to[f(x1),... f(xn )] ...
... data structures. A higherorder function (or functional) is a function that operates on other functions. The functional map, when applied toafunction f, returnsanother function;that function takes [x 1 ..., x n ]to[f(x1),... f(xn )] ...
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