close menu
Bookswagon-24x7 online bookstore
close menu
My Account
Home > Mathematics and Science Textbooks > Mathematics > Discrete Mathematics and Functional Programming
25%
Discrete Mathematics and Functional Programming

Discrete Mathematics and Functional Programming

          
5
4
3
2
1

Out of Stock


Premium quality
Premium quality
Bookswagon upholds the quality by delivering untarnished books. Quality, services and satisfaction are everything for us!
Easy Return
Easy return
Not satisfied with this product! Keep it in original condition and packaging to avail easy return policy.
Certified product
Certified product
First impression is the last impression! Address the book’s certification page, ISBN, publisher’s name, copyright page and print quality.
Secure Checkout
Secure checkout
Security at its finest! Login, browse, purchase and pay, every step is safe and secured.
Money back guarantee
Money-back guarantee:
It’s all about customers! For any kind of bad experience with the product, get your actual amount back after returning the product.
On time delivery
On-time delivery
At your doorstep on time! Get this book delivered without any delay.
Notify me when this book is in stock
Add to Wishlist

About the Book

This book provides a distinct way to teach discrete mathematics. Since discrete mathematics is crucial for rigorous study in computer science, many texts include applications of mathematical topics to computer science or have selected topics of particular interest to computer science. This text fully integrates discrete mathematics with programming and other foundational ideas in computer science. In fact, this text serves not only the purpose of teaching discrete math. It is also an introduction to programming, although a non-traditional one. Functional programming is a paradigm in which the primary language construct is the function - and function here is essentially the same as what it is in mathematics. In the functional paradigm we conceive the program as a collection of composed functions, as opposed to a sequence of instructions (in the imperative paradigm) or a set of interacting objects (in the object-oriented paradigm). Dominant computer science curricula emphasize object-oriented and imperative programming, but competence in all paradigms is important for serious programmers - and functional programming in particular may be appropriate for many casual programmers, too. For our purposes, the concepts underlying functional programming are especially grounded in those of discrete mathematics. Discrete mathematics and functional programming are equal partners in this endeavour, with the programming topics giving concrete applications and illustrations of the mathematical topics, and the mathematics providing the scaolding for explaining the programming concepts. The two work together in mutual illumination.

Table of Contents:
Chapter 1 Foundations 1.1 Your mathematical biography 1.2 Reasoning about items collectively 1.3 Set notation 1.4 Set operations 1.5 Verifying facts about sets 1.6 Values, expressions, and types in ML 1.7 Characters and strings 1.8 Cardinality, disjointness, and partitions 1.9 Cartesian products 1.10 Making your own types 1.11 Making your own operations 1.12 Recursive functions 1.13 Statements and exceptions 1.14 Extended example: A cumulative song 1.15 Special topic: Comparison with object-oriented programming Chapter 2 List 2.1 Lists 2.2 Functions on lists 2.3 Datatypes that use lists 2.4 Powersets 2.5 Case expressions and option types 2.6 Extended example: A language processor 2.7 Special topic: Lists vs. tuples vs. arrays Chapter 3 Proposition 3.1 Forms 3.2 Symbols 3.3 Boolean values 3.4 Logical equivalence 3.5 Conditional propositions 3.6 Conditionals and natural language 3.7 Conditional expressions 3.8 Arguments 3.9 Using argument forms for deduction 3.10 Predicates 3.11 Quantification 3.12 Multiple quantifi cation 3.13 Quantifi cation and algorithms 3.14 Quantifi cation and arguments 3.15 Extended example: Verifying arguments automatically 3.16 Special topic: Quantifi cation and natural language Chapter 4 Proof 4.1 General outline 4.2 Subset proofs 4.3 Set equality 4.4 Set emptiness 4.5 Conditional proofs 4.6 Integers 4.7 Biconditionals 4.8 Warnings 4.9 Case study: Powersets 4.10 From theorems to algorithms 4.11 Extended example: Solving games 4.12 Special topic: Russell's paradox Chapter 5 Relation 5.1 Defi nition 5.2 Representation 5.3 Image, inverse, and composition 5.4 Properties of relations 5.5 Equivalence relations 5.6 Computing transitivity 5.7 Transitive closure 5.8 Partial orders 5.9 Comparability and topological sort 5.10 Extended example: Unifi cation and resolution 5.11 Special topic: Representing relations Chapter 6 Self Reference 6.1 Peano numbers 6.2 Trees 6.3 Mutual recursion 6.4 Structural induction 6.5 Mathematical induction 6.6 Mathematical induction on sets 6.7 Program correctness 6.8 Sorting 6.9 Iteration 6.10 Loop invariants 6.11 From theorems to algorithms, revisited 6.12 Extended example: Huff man encoding 6.13 Special topic: Recursion vs. iteration Chapter 7 Function 7.1 Defi nition 7.2 Function equality 7.3 Functions as fi rst-class values 7.4 Images and inverse images 7.5 Map 7.6 Function properties 7.7 Inverse functions 7.8 Function composition 7.9 Cardinality 7.10 Counting 7.11 Permutations and combinations 7.12 Currying 7.13 Fixed-point iteration 7.14 Extended example: Modeling mathematical functions 7.15 Special topic: Countability Chapter 8 Graph 8.1 Defi nition and terms 8.2 Propositions on graphs 8.3 Strolling about a graph 8.4 Isomorphisms 8.5 A garden of graphs 8.6 Representing graphs 8.7 Extended example: Graph algorithms 8.8 Special topic: Graph coloring Chapter 9 Complexity Class 9.1 Recurrence relations 9.2 Complexity of algorithms 9.3 Analyzing sorting algorithms 9.4 Alternative examples of analyzing algorithms 9.5 Big-oh complexity classes 9.6 Big-theta and family 9.7 Properties of complexity classes 9.8 Tables 9.9 Memoization 9.10 Extended example: The Knapsack Problem 9.11 Special topic: P vs NP Chapter 10 Lattice 10.1 Defi nition and terms 10.2 Propositions on lattices 10.3 Isomorphisms 10.4 Modular and distributive lattices 10.5 Implementing lattice operations 10.6 Boolean algebras 10.7 Special topic: Digital logic circuits Chapter 11 Group 11.1 Preliminary terms 11.2 Defi nition 11.3 Isomorphisms 11.4 Subgroups 11.5 A garden of groups 11.6 Extended example: RSA encryption Chapter 12 Automaton 12.1 Alphabets and languages 12.2 Deterministic fi nite automata 12.3 Nondeterminism 12.4 Regular expressions 12.5 Language model equivalence and limitations 12.6 Context-free grammars 12.7 Push-down automata 12.8 The lambda calculus 12.9 Hierarchies of computational models 12.10 Special topic: Computability Appendix A Patterns for proofs


Best Sellers



Product Details
  • ISBN-13: 9781590282601
  • Publisher: Franklin, Beedle & Associates Inc
  • Publisher Imprint: Franklin, Beedle & Associates Inc
  • Height: 235 mm
  • No of Pages: 688
  • Weight: 1220 gr
  • ISBN-10: 1590282604
  • Publisher Date: 30 Jan 2012
  • Binding: Paperback
  • Language: English
  • Spine Width: 35 mm
  • Width: 190 mm


Similar Products

How would you rate your experience shopping for books on Bookswagon?

Add Photo
Add Photo

Customer Reviews

REVIEWS           
Click Here To Be The First to Review this Product
Discrete Mathematics and Functional Programming
Franklin, Beedle & Associates Inc -
Discrete Mathematics and Functional Programming
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Discrete Mathematics and Functional Programming

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book
    Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals



    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!
    ASK VIDYA