Discrete Mathematics Using a Computer
This volume offers a new, hands-on approach to teaching Discrete Mathematics. A simple functional language is used to allow students to experiment with mathematical notations which are traditionally difficult to pick up. This practical approach provides students with instant feedback and also allows lecturers to monitor progress easily. All the material needed to use the book will be available via ftp (the software is freely available and runs on Mac, PC and Unix platforms), including a special module which implements the concepts to be learned.No prior knowledge of Functional Programming is required: apart from List Comprehension (which is comprehensively covered in the text) everything the students need is either provided for them or can be picked up easily as they go along. An Instructors Guide will also be available on the WWW to help lecturers adapt existing courses.
What people are saying - Write a review
We haven't found any reviews in the usual places.
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