Roland Backhouse – författare
Visar alla böcker från författaren Roland Backhouse. Handla med fri frakt och snabb leverans.
6 produkter
6 produkter
599 kr
Skickas
An entertaining and captivating way to learn the fundamentals of using algorithms to solve problems The algorithmic approach to solving problems in computer technology is an essential tool. With this unique book, algorithm expert Roland Backhouse shares his four decades of experience to teach the fundamental principles of using algorithms to solve problems. Using fun and well-known puzzles to gradually introduce different aspects of algorithms in mathematics and computing. Backhouse presents a readable, entertaining, and energetic book that will motivate and challenge students to open their minds to the algorithmic nature of problem solving. Provides a novel approach to the mathematics of problem solving focusing on the algorithmic nature of problem solvingUses popular and entertaining puzzles to teach you different aspects of using algorithms to solve mathematical and computing challengesFeatures a theory section that supports each of the puzzles presented throughout the bookAssumes only an elementary understanding of mathematics
705 kr
Skickas inom 5-8 vardagar
Most texts on logic or discrete math fail to show why math and logic are fundamental tools for programmers. Program Construction illustrates the importance of math and logic to programming, providing a complete, self-contained account of the principles of logical reasoning. Designed specifically so users can construct programs that meet their specifications, the book details program construction principles in a straightforward fashion, avoiding overly complicated theory, and then illustrating each with convincing examples.
500 kr
Skickas inom 10-15 vardagar
Generic programming attempts to make programming more efficient by making it more general. This book is devoted to a novel form of genericity in programs, based on parameterizing programs by the structure of the data they manipulate.The book presents the following four revised and extended chapters first given as lectures at the Generic Programming Summer School held at the University of Oxford, UK in August 2002:- Generic Haskell: Practice and Theory- Generic Haskell: Applications- Generic Properties of Datatypes- Basic Category Theory for Models of Syntax
Algebraic and Coalgebraic Methods in the Mathematics of Program Construction
International Summer School and Workshop, Oxford, UK, April 10-14, 2000, Revised Lectures
Häftad, Engelska, 2002
555 kr
Skickas inom 10-15 vardagar
Program construction is about turning specifications of computer software into implementations. Recent research aimed at improving the process of program construction exploits insights from abstract algebraic tools such as lattice theory, fixpoint calculus, universal algebra, category theory, and allegory theory.This textbook-like tutorial presents, besides an introduction, eight coherently written chapters by leading authorities on ordered sets and complete lattices, algebras and coalgebras, Galois connections and fixed point calculus, calculating functional programs, algebra of program termination, exercises in coalgebraic specification, algebraic methods for optimization problems, and temporal algebra.
Mathematics of Program Construction
5th International Conference, MPC 2000 Ponte de Lima, Portugal, July 3-5, 2000 Proceedings
Häftad, Engelska, 2000
555 kr
Skickas inom 10-15 vardagar
This volume constitutes the refereed proceedings of the 5th International Conference on Mathematics of Program Construction, MPC 2000, held in Ponte de Lima, Portugal, in July 2000.The 12 revised full papers presented were carefully reviewed and selected for inclusion in the book. Also presented are three invited contributions. The papers address issues of programming methodology, program specification, program transformation, programming paradigms, programming calculi, and programming language semantics from the mathematical and logical point of view.
Datatype-Generic Programming
International Spring School, SSDGP 2006, Nottingham, UK, April 24-27, 2006, Revised Lectures
Häftad, Engelska, 2007
555 kr
Skickas inom 10-15 vardagar
A leitmotif in the evolution of programming paradigms has been the level and extent of parametrisation that is facilitated — the so-called genericity of the paradigm. The sorts of parameters that can be envisaged in a programming language range from simple values, like integers and ?oating-point numbers, through structured values, types and classes, to kinds (the type of types and/or classes).Datatype-generic programming is about parametrising programsby the structure of the data that they manipulate. Toappreciatethe importanceofdatatypegenericity,oneneedlooknofurther than the internet. The internet is a massive repository of structured data, but the structure is rarely exploited. For example, compression of data can be much more e?ective if its structure is known, but most compression algorithms regard the input data as simply a string of bits, and take no account of its internal organisation. Datatype-genericprogrammingisaboutexploitingthestructureofdatawhen it is relevant and ignoring it when it is not. Programming languages most c- monly used at the present time do not provide e?ective mechanisms for do- menting and implementing datatype genericity. This volume is a contribution towards improving the state of the art. The emergence of datatype genericity can be traced back to the late 1980s.