Topics

• Type Handlers
• Constructors and Finalizers
• Keywords
• Generics
• Reflection
• LINQ
• Lambda expressions
• LINQ Queries
• Expression Trees
• Functions
• Getting started with Haskell Language
• Files & Folders I/O
• Foldable
• Traversable
• Structs
• Task Parallel Library
• QuickCheck
• Delegates
• Nullable types
• Common GHC Language Extensions
• Free Monads
• Arrays
• Lock Statement
• Exceptions
• Type Classes
• IO
• C# 7.0 Features
• Partial Application
• Looping
• Monoid
• IEnumerable
• Category Theory
• Lists
• Casting
• Monads
• Recursion Schemes
• Idioms
• C# 4.0 Features
• Interoperability
• Data.Text
• Using GHCi
• Strictness
• Functor
• Vectors
• Phantom types
• Modules
• Views
• Pipes
• Bifunctor
• Proxies
• Applicative Functor

Examples

• Converting varchar to IHtmlString
• Array covariance
• Type inference (classes)
• Initialising a nullable
• Check if a Nullable has a value
• Get the value of a nullable type
• Singleton constructor pattern
• SelectMany: Flattening a sequence of sequences
• Hello, World!
• Installing a TypeHandler
• Declaring a struct
• Counting the elements of a Foldable structure
• Folding a structure in reverse
• An instance of Foldable for a binary tree
• Instantiating Functor and Foldable for a Traversable structure
• An instance of Traversable for a binary tree
• Traversing a structure in reverse
• Struct usage
• Reflecting on type parameters
• Flattening a Foldable structure into a list
• Performing a side-effect for each element of a Foldable structure
• Declaring a property
• Checking a single property
• Checking all the properties in a file
• Randomly generating data for custom types
• The Func<T, TResult>, Action<T> and Predicate<T> delegate types
• Closure
• OverloadedStrings
• Free monads split monadic computations into data structures and interpreters
• IEnumerable<int>
• Passing delegates as parameters
• Raising Exceptions
• Catching Exceptions
• Running clean-up code with finally
• Re-raising exceptions
• Chain exceptions with raise from
• Exception Hierarchy
• Exceptions are Objects too
• The Maybe monad
• Partially Applied Adding Function
• Check if a generic type parameter is a nullable type
• An instance of Monoid for lists
• Collapsing a list of Monoids into a single value
• Numeric Monoids
• Getting the 'a' "out of" 'IO a'
• An instance of Monoid for ()
• Covariance
• Contravariance
• Invariance
• Variant interfaces
• Variant delegates
• Eq
• Ord
• Variant types as parameters and return values
• Throwing exception in a lock statement
• Cast an object to a base type
• Return in a lock statement
• Monoid
• List basics
• An async cancellable polling Task that waits between iterations
• A cancellable polling Task using CancellationTokenSource
• Create Expression Trees with a lambda expression
• RankNTypes
• Checking if one array contains another array
• Num
• Encapsulating transformations in funcs
• Fixed points
• Folding up a structure one layer at a time
• Unfolding a structure one layer at a time
• Unfolding and then folding, fused
• Free Monads are like fixed points
• Foreach Loop
• Variance
• Switching variables
• Replacing text in a file
• Flattening a Foldable structure into a Monoid
• Text Literals
• Stripping whitespace
• Splitting Text Values
• Encoding and Decoding Text
• Starting GHCi
• Changing the GHCi default prompt
• The GHCi configuration file
• Loading a file
• Bang Patterns
• Getting started
• Common instances of Functor
• Primitive recursion
• Primitive corecursion
• Definition of Foldable
• Definition of Traversable
• Simple code to expose class for com
• How do foldFree and iterM work?
• foldl
• The Data.Vector Module
• foldr
• Transforming a Traversable structure with the aid of an accumulating parameter
• Traversable structures as shapes with contents
• Breakpoints with GHCi
• Transposing a list of lists
• Haskell Applicative in terms of Category Theory
• Use Case for Phantom Types: Currencies
• Checking if a Foldable structure is empty
• Create a view
• Create or replace view
• Producers
• Consumers
• Pipes
• Running Pipes with runEffect
• Connecting Pipes
• The Proxy monad transformer
• Checking if a Text is a substring of another Text
• Hierarchical module names
• Class Definition of Functor and Laws
• Replacing all elements of a Functor with a single value
• Common instances of Bifunctor
• first and second
• Definition of Bifunctor
• Polynomial functors
• Using Proxy
• The "polymorphic proxy" idiom
• Proxy is like ()
• Functors in Category Theory
• The Freer monad
• Deriving Functor
• Alternative definition
• Create a view with schema binding
• Common instances of Applicative
• Multi-line statements
• Strict fields
• Definition of Monad