Discrete Mathematics Using a ComputerSpringer Science & Business Media, 2000 - 339 頁 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. |
內容
Introduction to Haskell | 1 |
Propositional Logic | 2 |
8 | 27 |
And Elimination EL ER | 56 |
Predicate Logic | 84 |
Set Theory | 111 |
Recursion | 131 |
Inductively Defined Sets | 147 |
Relations | 185 |
Topological Sort | 222 |
Functions | 229 |
5 | 244 |
Discrete Mathematics in Circuit Design | 273 |
A Software Tools for Discrete Mathematics | 295 |
Bibliography | 331 |
Induction | 163 |
其他版本 - 查看全部
常見字詞
algorithms and2 bijective binary relation bit Value Bool calculate called circuit codomain computer science contains data structure defining equation definition Digraph discrete mathematics domain elements error evaluated example Exercise expression False False False True Figure finite number foldl foldr following function following theorem formal function takes function that takes functional programming graph hand side Haskell Haskell function higher order function imp1 imp2 implement induction inference rules infinite input Integer irreflexive length list comprehension loop map f means Modus Ponens natural deduction natural numbers Node notation operator ordered pairs parentheses partial order Peano predicate logic programming languages properties propositional logic prove quasi order R₁ real numbers recursion reflexive returns True says Show software tools specify sqrt statement String subset Succ Suppose surjective symmetric tree True False True True truth table tuple Write a function Zero