Strongly-typed, type-inferred languages like F#, Scala, and Haskell make Java feel like its static typing system is half-assed. This is not Java’s fault entirely; it’s the way we use it. Say we have a domain class like public class User { public User(String firstName, String lastName, String email, long balanceInDollars) {}… } I’m in agreement …
This F# Snippet illustrates a way to divide a sequence into a sequence of shorter sequences of a fixed length. The snippet uses list comprehensions. I don’t like it, because it involves flipping through the original sequence over and over and over. With recursion, we can do all the construction in one pass through the …
In Professional F# 2.0, an example is given for using an active pattern to match against a struct. The example could be improved. The original: []type Point(x : int, y : int) = member pt.X = x member pt.Y = y override pt.ToString() = System.String.Format(“({0},{1})”, x, y)let newPoint = new Point(0,0)let (|Point|) (x : int, …