All Questions
6 questions
1
vote
2
answers
136
views
Type of map for Try[T]
I was looking at the type of map for Try[T] in Scala, which is:
def map[S](f: T=>S): Try[S]
From Haskell, I am used to the type of map being:
map :: (a->b)->[a]->[b]
This seems very ...
- 173
7
votes
3
answers
3k
views
Should databases be viewed as Monads?
Because any kind of persistence updates/inserts/deletes represents in some sense a kind of state change in a database, it makes me wonder whether databases can be considered monads. We say the same ...
- 431
19
votes
3
answers
21k
views
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 ...
- 309
1
vote
2
answers
2k
views
Performance of concurrent software on multicore processors [closed]
Recently I have often read that, since the trend is to build processors with multiple cores, it will be increasingly important to have programming languages
that support concurrent and parallel ...
- 19.8k
15
votes
4
answers
2k
views
Unit testing statically typed functional code
I wanted to ask you people, in which cases it makes sense to unit test statically typed functional code, as written in haskell, scala, ocaml, nemerle, f# or haXe (the last is what I am really ...
- 30.1k
9
votes
3
answers
5k
views
Getters and Setters in Functional Languages
One of the tenets of Functional Programming is the use of Pure Functions. A Pure function is one that is side-effect free and referentially transparent.
Getters are not referentially transparent - ...
- 236