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 65
Página
... exception and to the provisions of relevant collective licensing agreements, no reproduction of any part may takeplacewithoutthewritten permissionof Cambridge UniversityPress. First edition published 1991 First published in paperback ...
... exception and to the provisions of relevant collective licensing agreements, no reproduction of any part may takeplacewithoutthewritten permissionof Cambridge UniversityPress. First edition published 1991 First published in paperback ...
Página
... Exceptions 4.5 Introduction toexceptions 4.6 Declaring exceptions 4.7 Raising exceptions 4.8 Handlingexceptions 4.9 Objections toexceptions Trees 4.10 A type for binarytrees 4.11 Enumerating the contentsofatree 4.12 Building atreefrom a ...
... Exceptions 4.5 Introduction toexceptions 4.6 Declaring exceptions 4.7 Raising exceptions 4.8 Handlingexceptions 4.9 Objections toexceptions Trees 4.10 A type for binarytrees 4.11 Enumerating the contentsofatree 4.12 Building atreefrom a ...
Página
... (exceptions). Thanksinpart tothe library, ML programs are portable. Commercially supported compilers offer increasing quality and efficiency. ML can nowrunas fast as C, especially in applications requiringcomplicated storage management ...
... (exceptions). Thanksinpart tothe library, ML programs are portable. Commercially supported compilers offer increasing quality and efficiency. ML can nowrunas fast as C, especially in applications requiringcomplicated storage management ...
Página
... exceptions. • Since a theorem proverwould be useless ifthere were loopholes, MLwas designed to be secure,with no way ofcorrupting the environment. The ML system of Edinburgh LCF was slow: programs were translated into Lisp and then ...
... exceptions. • Since a theorem proverwould be useless ifthere were loopholes, MLwas designed to be secure,with no way ofcorrupting the environment. The ML system of Edinburgh LCF was slow: programs were translated into Lisp and then ...
Página
... allow programmers to work inteams, and to reuse components. Its types and overall safetycontribute to reliability. Its exceptions allow programstorespond tofailures. Comparing ML withC, Appel admits that ML programs need a great deal of.
... allow programmers to work inteams, and to reuse components. Its types and overall safetycontribute to reliability. Its exceptions allow programstorespond tofailures. Comparing ML withC, Appel admits that ML programs need a great deal of.
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