## Discrete Mathematics Using a Computer"Discrete Mathematics Using a Computer offers a new, "hands-on" approach to teaching Discrete Mathematics. Using software that is freely available on Mac, PC and Unix platforms, a simple functional language allows students to experiment with mathematical notations and concepts - a practical approach that provides students with instant feedback and allows lecturers to monitor progress easily." "Designed for 1st and 2nd year undergraduate students it is ideally suited to self-study. No prior knowledge of Functional Programming is required; everything the student needs is either provided or can be picked up easily as they go along." "Complete with an accompanying instructor's guide, available via the WWW, this volume is intended as the primary teaching text on Discrete Mathematics courses but will also provide useful reading for Conversion Masters and Formal Methods courses."--BOOK JACKET.Title Summary field provided by Blackwell North America, Inc. All Rights Reserved |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Common terms and phrases

ahout ahove application arcs argument arhitrary Bool Boolean algehra calculate CHAPTER circuit codomain computer science contains countahle data structures datahase defined definition descrihe digital circuits digraph discrete mathematics domain equation estahlish evaluate example Exercise expression False False False True True False,True Figure finite foldr formal full adder fullAdd graph hand side hase hasic Haskell Haskell function hecause hetween hijective hinary hitValue hook hoth induction inference rules infinite input Integer irreflexive length list comprehension loop means mscanr natural deduction natural numhers Node notation ohject order function ordered pairs output partial order possihle predicate logic programming languages prohlem properties propositional logic prove quicksort reflexive relation result returns True ripple carry adder says Show software tools specify string suhset surjective symmetric theorem transitive closure tree True False truth tahle tuple variahles write a function x:xs