A taste of functional programming — 2 |
| |
| Authors: | Madhavan Mukund |
| |
| Institution: | (1) Chennai Mathematical Institute, H1, SIPCOT IT Park Padur PO, Siruseri, 603 103, India |
| |
| Abstract: | Functional programming has its roots in Alonzo Church’s lambda calculus. In the first part1 of this article, we explored some basic notions of functional programming using the language Haskell. We now examine some
more advanced concepts, including polymorphism, infinite data types and computations, and user-defined data types.
Madhavan Mukund has been on the Computer Science faculty at Chennai Mathematical Institute since 1992, where he is currently
Professor. His research interests are primarily in formal methods for specifying and verifying computing systems. He is the
Secretary of the Indian Association for Research in Computing Science (IARCS) and the National Coordinator of the Indian Computing
Olympiad. |
| |
| Keywords: | Functional programming polymorphism currying reductions |
| 本文献已被 SpringerLink 等数据库收录！ |
|
