Mathematics in Programming (Record no. 88550)
[ view plain ]
000 -LEADER | |
---|---|
fixed length control field | 03541nam a22005055i 4500 |
001 - CONTROL NUMBER | |
control field | 978-981-97-2432-1 |
005 - DATE AND TIME OF LATEST TRANSACTION | |
control field | 20240730172756.0 |
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
fixed length control field | 240711s2024 si | s |||| 0|eng d |
020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
ISBN | 9789819724321 |
-- | 978-981-97-2432-1 |
082 04 - CLASSIFICATION NUMBER | |
Call Number | 004.0151 |
100 1# - AUTHOR NAME | |
Author | Liu, Xinyu. |
245 10 - TITLE STATEMENT | |
Title | Mathematics in Programming |
250 ## - EDITION STATEMENT | |
Edition statement | 1st ed. 2024. |
300 ## - PHYSICAL DESCRIPTION | |
Number of Pages | XII, 383 p. 197 illus. |
505 0# - FORMATTED CONTENTS NOTE | |
Remark 2 | Chapter 1 Numbers -- Chapter 2 Recursion -- Chapter 3 Symmetry -- Chapter 4 Category -- Chapter 5 Fusion -- Chapter 6 Infinity -- Chapter 7 Paradox. |
520 ## - SUMMARY, ETC. | |
Summary, etc | The book presents the mathematical view and tools of computer programming with broad and friendly context. It explains the basic concepts such as recursion, computation model, types, data, and etc. The book serves as an introductory and reference guide to the engineers, students, researchers, and professionals who are interested in functional programming, type system, and computer programming languages. The book covers seven topics. Firstly, it lays out the number system based on Peano Axioms and demonstrates the isomorphic computer data structures. Then, it introduces Lambda calculus as a computing model and recursion, an important programming structure, with the Y-combinator. It next presents the basic abstract algebra, including group and fields, and provides a friendly introduction to Galois theory. After that, it uses category theory as a tool to explain several concepts in computer programming, including the type system, polymorphism, null handler, and recursive data types, then followed by an application of program optimization. In the last two chapters, the author shows how to program with the concept of infinity through stream and lazy evaluation, and then explains the naïve set theory and transfinite numbers, from which the logic paradox arises. Finally, it introduces four historical views of mathematical foundation, as well as Gödel's incompleteness theorems developed in 1930s, and how they define the boundaries of computer programming. Additionally, the book provides biographies, stories, and anecdotes of 25 mathematicians, along with over 130 exercises and their corresponding answers. |
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
General subdivision | Mathematics. |
856 40 - ELECTRONIC LOCATION AND ACCESS | |
Uniform Resource Identifier | https://doi.org/10.1007/978-981-97-2432-1 |
942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
Koha item type | eBooks |
264 #1 - | |
-- | Singapore : |
-- | Springer Nature Singapore : |
-- | Imprint: Springer, |
-- | 2024. |
336 ## - | |
-- | text |
-- | txt |
-- | rdacontent |
337 ## - | |
-- | computer |
-- | c |
-- | rdamedia |
338 ## - | |
-- | online resource |
-- | cr |
-- | rdacarrier |
347 ## - | |
-- | text file |
-- | |
-- | rda |
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
-- | Computer science. |
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
-- | Computer science |
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
-- | Mathematics. |
650 14 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
-- | Computer Science Logic and Foundations of Programming. |
650 24 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
-- | Mathematical Applications in Computer Science. |
650 24 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
-- | Mathematics in Popular Science. |
912 ## - | |
-- | ZDB-2-SCS |
912 ## - | |
-- | ZDB-2-SXCS |
No items available.