Book Image

Soar with Haskell

By : Tom Schrijvers
Book Image

Soar with Haskell

By: Tom Schrijvers

Overview of this book

With software systems reaching new levels of complexity and programmers aiming for the highest productivity levels, software developers and language designers are turning toward functional programming because of its powerful and mature abstraction mechanisms. This book will help you tap into this approach with Haskell, the programming language that has been leading the way in pure functional programming for over three decades. The book begins by helping you get to grips with basic functions and algebraic datatypes, and gradually adds abstraction mechanisms and other powerful language features. Next, you’ll explore recursion, formulate higher-order functions as reusable templates, and get the job done with laziness. As you advance, you’ll learn how Haskell reconciliates its purity with the practical need for side effects and comes out stronger with a rich hierarchy of abstractions, such as functors, applicative functors, and monads. Finally, you’ll understand how all these elements are combined in the design and implementation of custom domain-specific languages for tackling practical problems such as parsing, as well as the revolutionary functional technique of property-based testing. By the end of this book, you’ll have mastered the key concepts of functional programming and be able to develop idiomatic Haskell solutions.
Table of Contents (23 chapters)
Free Chapter
1
Part 1:Basic Functional Programming
6
Part 2: Haskell-Specific Features
11
Part 3: Functional Design Patterns
16
Part 4: Practical Programming

Answers

  1. Enumeration types are defined with the syntax data ET = K1 | … | Kn, where ET is the name of the type and K1Kn are the names of the data constructors. Each of the constructors is a value of the enumeration type. Values can be distinguished by means of pattern matching, writing one equation of a function per constructor:
    f K1 = ..
    
    f Kn = …
  2. Record types are defined with the syntax data RT = RK {f1 :: T1, …, fn :: Tn}, where RT is the name of the record type and RK is its constructor. The fields are named f1...fn and have the T1...Tn types, respectively. A value of RT is created with the syntax RT { f1 = e1, …, fn=en}, where e1...en are expressions of the T1...Tn types that yield the values for the fields. Given a value of the record type, a field can be extracted by using the field name as a function, fi :: RT -> Ti.
  3. An algebraic datatype is defined with the syntax data AT = K1 T11… | … | Kn Tn1 …...