Daniel

Texas

21h
comment How to implement automatic generalization in a simple function
You can clean up the signature by annotating the return type: let inline (/!) (a : ^a) (b : ^a) : ^a = ...
1d
comment How can I cast a back to a type a value was before?
Why do you need to cast to float before calling sqrt?
2d
comment Join() equivalent function for F# sequences
Why not wrap the built-in join function and re-order the params to better support pipelines? That's sort of what you've done, but the query expression seems unnecessary.
Aug
25
awarded Yearling
Aug
25
awarded Yearling
Aug
22
answered Assignment to Nullable in F#
Aug
21
answered Tail-recursive query string builder in F#
Aug
21
awarded Nice Question
Aug
21
comment F# filter a two-dimensional array with multiple arguments
These aren't arrays; they're lists. And your two dimensional array is a list of lists.
Aug
20
revised FSharp Make a partially-filled array of bytes
added 91 characters in body
Aug
20
comment Cast MethodBase to RuntimeMethodInfo in F#
What version of .NET? RuntimeMethodInfo is internal in 4.5.1.
Aug
20
answered FSharp Make a partially-filled array of bytes
Aug
20
awarded Popular Question
Aug
20
answered Filtering through a given date in f#
Aug
14
answered F# Multidimensional array comprehensions
Aug
13
comment Create a list from many other lists f#
Oops, I forgot about concat.
Aug
13
answered Create a list from many other lists f#
Aug
6
comment F# Async.Await not catching Task exception
Just let continuation (t : Task) = if t.IsFaulted then raise t.Exception is probably clearer.
Aug
5
comment How to check if string only contains alphabets in F#
There's also String.forall, which you could partially apply to get let isCorrectString = String.forall (fun c -> System.Char.IsLetter(c) || c = ' ')
Aug
4
comment F# - how can I create an n-tuple from an n-1 tuple and a 1
Yes, reflection is slow, but "too slow" is up to you to decide. The signature is 'a -> 'b -> 'c so the result type must be inferrable, which might require annotations as in my example.
1 2 3 4 5