I've been thinking about the best approach to implement pure function verification in the Scala compiler. An approach similar to the one in D would fit a lot better than the one used in Haskell (which would break all existing code and cause some problems due to strict evaluation). A solution using annotations would be quite simple to implement:
Twitter has become quite the hotbed of chatter about functional programming over the past few months, as a substantial number of pretty well known FP people have either been present all along or have signed up recently and started following each other. Here is a list of people I know about who tweet about FP on a semi-regular basis, along with what I think are their main interest
Scala is a general purpose programming language designed to express common programming patterns in a concise, elegant, and type-safe way. It smoothly integrates features of object-oriented and functional languages, enabling Java and other programmers to be more productive. Code sizes are typically reduced by a factor of two to three when compared to an equivalent Java application.
Scala ist eine elegante, ausdrucksstarke Programmiersprache, die sich in letzter Zeit zunehmender Beliebtheit und Verbreitung erfreut. Sie lässt sich gut mit Java und der .NET-Plattform integrieren und ist als "General Purpose Language" für alle Aufgaben geeignet, für die man sonst Java oder C# verwendet.