Overloading is typically the bugaboo of type-inferenced languages (at least when, like F#, the type system isn’t powerful enough to contain type-classes). There are a number of choices you have in F#: Use overloading on methods (members of a type), in which case overloading works much like as in other .Net languages (you can ad-hoc … Read more
Perl style regex matching let (=~) input pattern = System.Text.RegularExpressions.Regex.IsMatch(input, pattern) It lets you match text using let test = “monkey” =~ “monk.+” notation.
General benefits of functional programming over imperative languages: You can formulate many problems much easier, closer to their definition and more concise in a functional programming language like F# and your code is less error-prone (immutability, more powerful type system, intuitive recurive algorithms). You can code what you mean instead of what the computer wants … Read more
‘let rec… and…’ is the syntax you seek. let rec F() = G() and G() = F() See also Adventures in F# Co-Recursion.
EDIT Better/recent info is here: Keeping partially applied function generic (original below) I think a pragmatic thing here is not to try to understand this too deeply, but rather to know a couple general strategies to get past the VR and move on with your work. It’s a bit of a ‘cop out’ answer, but … Read more
3. type Line = {a:double; b:double} let LinesIntersection x y = if x.a <> y.a then Some ((x.b – y.b)/(y.a – x.a), (y.a*x.b – x.a*y.b)/(y.a – x.a)) else None let l1 = {a = 2.0; b = -3.0} let l2 = {a = -3.0; b = 2.0} let l3 = {a = 2.0; b = … Read more