Book Image

Learning F# Functional Data Structures and Algorithms

By : Adnan Masood
Book Image

Learning F# Functional Data Structures and Algorithms

By: Adnan Masood

Overview of this book

Table of Contents (21 chapters)
Learning F# Functional Data Structures and Algorithms
Credits
Foreword
Foreword
Foreword
About the Author
Acknowledgments
About the Reviewers
www.PacktPub.com
Preface
Index

Summary


In this chapter, we covered setting up of Visual Studio .NET and F# Compiler to work together with the environment and runtime. We reviewed how you can run your F# programs in IDE and via an interactive REPL shell. We also implemented a Fibonacci sequence and Tower of Hanoi using recursion, and applied lazy evaluation for a quick sort.

In the next chapter, we will gain knowledge about the built-in data structures: array, list, set, and map, and will present their typical use cases. So now, what part of Hindley–Milner type inference algorithm do you not understand?