Is it possible to control Computation Expression matching order to get fine grained control?
I would like to construct some objects using Computation Expression syntax. Ideally, I’d like to have one Computation Expression, and have the compiler figure out the right set of overloads to make the types work.
Is it possible to control Computation Expression matching order to get fine grained control?
I would like to construct some objects using Computation Expression syntax. Ideally, I’d like to have one Computation Expression, and have the compiler figure out the right set of overloads to make the types work.
mechanisms for handing functions with multiple optional parameters
I’m writing a library where there will be some functions that take many (more than 50) parameters (not my design but I need to model it).
When do you use a class instead of a record when you do not want to use mutable fields?
I’m imagining a situation where you are creating an F# module in a purely functional style. This means objects do not have mutable fields and are not modified in place. I’m assuming for simplicity that there is no need to use .NET objects or other kinds of objects. There are two possible ways of implementing an object-oriented kind of solution: the first is to use classes and the second to use records which have fields of functional type, to implement methods.
Are There Other Use Cases For F# Type Providers?
So I think I know the main use case for F# 3.0’s Type Providers, i. e. better Intellisense when working with data stores that use them. Are there other use cases for Type Providers or is that pretty much it?
Why Does F# Contain Both Modules and Namespaces?
I’ve been assuming that F# includes the module keyword in addition to the namespace keyword due to backwards compatibility with OCaml. Is this the only reason for the inclusion of the module keyword or are there other reasons module was included?
Fastest Functional Language
I’ve recently been delving into functional programming especially Haskell and F#, the prior more so. After some googling around I could not find a benchmark comparison of the more prominent functional languages (Scala,F# etc).
Y combinator and tail call optimizations
The definition of a Y combinator in F# is
Use Queue or stick to native f# lists
I need something that represents a queue in F#.
How to serialize and deserialize lambda expression in F#?
I serialized lambda expressions in C# before. Now I wanna use F# instead of C# for serialization and deserialization.