Implementing Mathematics with The Nuprl Proof Development System
by R. L. Constable, at al.
Publisher: Prentice Hall 1986
The authors offer a tutorial on the new mathematical ideas which underlie their research. In doing so they have tried to provide several entry points into the material, even at the cost of considerable redundancy. Many of the ideas will be accessible to a well-trained undergraduate with a good background in mathematics and computer science.
Home page url
Download or read it online for free here:
by Philip J. Koopman, Jr. - Academic Press
The results of cache-simulation experiments with an abstract machine for reducing combinator graphs are presented. The abstract machine, called TIGRE, exhibits reduction rates that compare favorably with previously reported techniques.
The purpose of this book is to show how the computer can draw technically perfect pictures of Julia and Mandelbrot sets. All the necessary theory is explained and some words are said about how to put the things into a computer program.
by Richard Liska, at al. - Czech Technical University
From the table of contents: Introduction; Algorithms for algebraic computation; Integrated mathematical systems; Basic possibilities of integrated mathematical systems; Applications of computer algebra; Another sources of study.
by Victor Shoup - Cambridge University Press
This introductory book emphasises algorithms and applications, such as cryptography and error correcting codes. It is accessible to a broad audience. Prerequisites are a typical undergraduate course in calculus and some experience in doing proofs.