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?

Get Learning F# Functional Data Structures and Algorithms now with the O’Reilly learning platform.

O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.