tarball.tar.gz

ghci

Functional programming is a problem-solving paradigm that differs drastically from the imperative programming style of languages like C++ or Java. While functional programming principles have invaded most modern programming languages to some degree, there is no language that embraces this paradigm quite as Haskell does. As a result, Haskell code can reach a level of expressiveness, safety, and elegance that is difficult to achieve in other programming languages.

This course will introduce you to the core concepts of functional programming in Haskell. You will learn how to write pure functions using techniques such as pattern matching and recursion, and how to work with Haskell's powerful List data type. You will understand the basics of Haskell's powerful type system and define your own data types. Finally, you’ll learn how to perform IO operations the Haskell way. By the end of this course, you’ll have a new paradigm to add under your belt and you can start using functional programming in your own projects.

Learn Functional Programming in Haskell

So far, we have only dealt with functions that take exactly one argument and yield exactly one result. This may seem limiting, but in some sense, that's all there is to Haskell functions. They have one argument type and one result type. But these types do not have to be the primitive types that we have learned about so far. We will look at **tuples** as an example of more complex types built from simpler types.

## Tuple types
A tuple is a **finite, ordered sequence** of values. For example, `(5, True)` is a tuple containing the integer `5` and the boolean `True`. It has the tuple type `(Int, Bool)`, representing values that contain **first** an `Int` value and **second** a `Bool` value.

Tuples do not need to be pairs, there are also triples, 4-tuples and so on. Here are some examples of tuple types and values:


So far, we have only dealt with functions that take exactly one argument and yield exactly one result. This may seem limiting, but in some sense, that's all there is to Haskell functions. They have one argument type and one result type. But these types do not have to be the primitive types that we have learned about so far. We will look at **tuples** as an example of more complex types built from simpler types.

# Tuple types
A tuple is a **finite, ordered sequence** of values. For example, `(5, True)` is a tuple containing the integer `5` and the boolean `True`. It has the tuple type `(Int, Bool)`, representing values that contain **first** an `Int` value and **second** a `Bool` value.

Tuples do not need to be pairs, there are also triples, 4-tuples and so on. Here are some examples of tuple types and values:


Introduction

First Steps with Haskell

Techniques for Writing Functions

Working with Lists

Creating Data Types

Input and Output

Conclusion

Appendix

Tuples

Tuple types