Böcker i Cambridge Computer Science Texts-serien

Based on ANSI C - the recently adopted standard for the C language - and assuming familiarity with programming concepts such as variables, constants, iteration and looping, this work covers all aspects of C. It is about learning programming skills and mastering the art of coding programs in C.

This book describes algorithms of mathematical methods and illustrates their application with examples. The mathematical background needed is elementary algebra and calculus.

This book, first published in 1982, will be useful to both undergraduate and postgraduate students taking courses on simulation in departments of computer science, operations research and statistics in universities and polytechnics. It will be of benefit also to practitioners in the field.

Computer Mathematics will be of interest to undergraduate students of computer science and mathematics, post-graduate computing 'conversion' course students and computer professionals who need an introduction to the mathematics that underpins computer science theory.

An introduction to functional programming and its associated systems. A unique feature is its use of the language Haskell for teaching both the rudiments and the finer points of the functional technique. It serves as an introduction both to functional programming and Haskell. Especially valuable are the chapters on programming and implementation, along with a large number of exercises.

This textbook is an introduction to the design and writing of computer programs. It leads the reader through all the stages of program construction from the original specifications through to the final program. The formal verification of intermediate versions of the program is studied in considerable detail.

This 1987 book is a self-contained text on the probabilistic modelling method. It provides the reader with an understanding of the available results as well as with examples of their application. The necessary fundamentals of probability are presented followed by an introduction to stochastic processes.

This 1989 book provides an introduction to the immensely important area of computer networking. The book covers everything from systems linked by telephone lines to tightly coupled networks of processors using high speed links, and the correspondingly broad range of techniques that are needed.

The book builds on the student's familiarity with sequential programming in a high level language, and is concerned mainly with the high level aspects of concurrency.

This textbook has been enriched with many computer science related topics and, although its aim is to give an introduction to categories for students of computer science, it retains a level of mathematical correctness that will broaden its appeal to include students of mathematics as well.

This textbook is an introduction to denotational semantics and its applications to programming languages. Dr Allison emphasizes a practical approach and the student is encouraged to write and test denotational definitions.

Simulating a continuous process on a (computer) model provides a means of understanding how a system will behave when it is subject to particular constraints. This book describes how analogue, digital and hybrid computers are used in simulating continuous systems. Their use is illustrated by numerous simple problems.

This book is devoted to recursion in programming, the technique by which the solution to a problem is expressed partly in terms of the solution to a simpler version of the same problem. Ultimately the solution to the simplest version must be given explicitly. In functional programming, recursion has received its full due since it is quite often the only repetitive construct. However, the programming language used here is Pascal and the examples have been chosen accordingly. It makes an interesting contrast with the use of recursion in functional and logic programming. The early chapters consider simple linear recursion using examples such as finding the highest common factor of a pair of numbers, and processing linked lists. Subsequent chapters move up through binary recursion, with examples which include the Towers of Hanoi problem and symbolic differentiation, to general recursion. The book contains well over 100 examples.