页面

2012-10-23

a drawback of functional programming

After having posted a question on implementing functional graph depth-first search, I did some investigations seriously. My finding is that functional programming suffers from handling the popular graph algorithms.

People with purely functional favour have to treat graph in a distinct way from the normal literature. That's the motivation of pushing guys to generate the following works:
  • functional graph algorithms with depth-first search
  • graph algorithm lazy functional programming language
  • inductive graphs and functional graph algorithms
  • purely functional data structures
  • graph algorithms with a functional flavour

`Graph algorithms have long been a challenge to program in a pure functional language. Previous attempts have either tended to be unreadable, or have failed to achieve standard asymptotic complexity measures.'
-John Launchbury. 1995. Graph Algorithms with a Functional Flavous. In Advanced Functional Programming, First International Spring School on Advanced Functional Programming Techniques-Tutorial Text, Johan Jeuring and Erik Meijer (Eds.). Springer-Verlag, London, UK, 308-331.

没有评论: