Stories
Slash Boxes
Comments

News for nerds, stuff that matters

Slashdot Log In

Log In

Create Account  |  Retrieve Password

Programming Erlang

Posted by samzenpus on Wed Sep 05, 2007 01:43 PM
from the read-all-about-it dept.
gnalre writes "Every day it seems there is a new publication of a book on perl/python/ruby. Some languages however do not seem to get that sort of attention. One of those under-represented languages is Erlang, however for the first time in 10 years a new Erlang book has been published. As someone who had a brief flirtation with Erlang long ago, I was interested to see how the language had evolved in the intervening decade. I was also curious to re-evaluate Erlang to see what solutions it offered to the present day issues of writing reliable distributed applications." Read on for the rest of Tony's review.


Programming Erlang — Software For A Concurrent World (ISBN 10193435600X) is part of the pragmatic programmer series. As with all the books in this series, it is available in paperback or for a reduced cost you can directly download it in PDF format (which is always useful if you spend a lot of time on the move and you do not like carrying around a dead tree with you). The book's format and layout as with all the books of this series are clear and logical.

The book is written by Joe Armstrong, who co-authored the first Erlang book a decade ago. He was also one of the originators of the Erlang language and has been directly connected to its development ever since. We can therefore be assured about the author's knowledge and insight into the language, if not his impartiality.

The book itself can be roughly split into three main sections: Getting started and Sequential programming, Concurrent Programming and Erlang libraries and advanced Erlang techniques.

In Chapter 1 the author sets out his stall of why Erlang is worthy of your attention. It's clear from this chapter that the author feels Erlang's strength lies in applications requiring an element concurrency and fault tolerance. Another emphasis is made of running Erlang on modern multi-core processors, something that was only a glint in a hardware designer's eye 10 years ago, but is rapidly becoming an issue in all areas of programming. From this chapter you also get a feel on how the author approaches his programming in that he states that he wants the reader to have fun with the language, which is a refreshing change to some language text books whose main purpose appears to be as a cure for insomnia.

Chapter 2 goes through installing Erlang and the Erlang shell (a command line environment similar to ones with languages such as perl). The chapter also starts us into the strange world of functional programming, where variables can only be given a value once (e.g you cannot do i=i+1), recursion replace loops and pattern matching replaces assignments. Fortunately the Erlang language is remarkably concise. For example there are only 4 data types. However to those coming from a purely procedural programming background the learning curve could be a steep one. Saying that the Author does a good job of leading you through the languages intricacies with examples being compared to code from languages such as Java to help keep your feet on solid programming ground.

The next 3 chapters move on to writing simple Erlang programs. As a quick aside, for anyone new to Erlang it is well worth examining the quicksort implementation described in chapter 3. Its conciseness and simplicity was one of the reasons the language won me over when I first met the language.

These chapters also cover error detection and handling. It's worth noting that Erlang has a philosophy of ensuring programs fail hard, so that bugs can be weeded out at an early stage. This idea very much defines how Erlang error handling is defined.

One criticism of the first section is Chapter 6, which describes compiling and running an Erlang program. I would have preferred that this information be covered earlier in the book or be placed in an appendix because it is probably an area you will want to reference repeatedly.

Chapter 7 is where things really get interesting and the true power of Erlang starts to come to the fore. This is where Erlang's concurrency credentials are explained. This chapter begins by providing some useful metaphors of the Erlang concurrent model, but chapter 8 is where the fun begins by describing the Erlang concurrency primitives that allow the creation of processes and the process communication methods. The author here highlights one of the language features, the Erlang light weight process. These are true processes (not threads) but take up very little in the way of resources. Indeed it is not unusual to have 1000's of such processes running in an application.

The next few chapters expand on the available concurrency primitives and how to move from concurrency on your local processor to concurrency utilizing the resources of multiple machines either on a local network or across the web. It finishes the section off by showing the example of a simple IRC application.

Chapter 12 starts the next section by looking at how to interact with the world outside the Erlang environment. First it examines how to interface an Erlang program to applications written in other languages such as C. It then goes onto to look at file and socket handling in Erlang. Chapter 15 looks at two important Erlang storage primitives ETS and DETS before we get to the OTP Erlang libraries in Chapter 16.

The OTP libraries are the standard Erlang libraries and tools. In fact the OTP libraries are worthy of a book in itself. The author highlights the section on the generic Server module as the most important section in the whole book and one to be reread until its importance has sunk in. This is because here are encapsulated many of the lessons learned in writing industrial fault-tolerant applications, such the updating of a running applications code without causing that application to miss a beat. The section is finished off by describing the Erlang distributed database (humorously named Mnesia) and then finishing it off with the example of a simple server application.

The book finishes off by looking at Erlang on multicore systems including its support for SMP. As the author states this is the leading edge of present day Erlang and is still under development.

I would like to thank the pragmatic programmers for publishing this book. Erlang's profile has been in need of highlighting for many years and hopefully this book will help. The book definitely provides a great starting point for anyone who wants to get to grips with the language and takes them to the point where they can start writing useful applications. This book is a worthy successor to the last book published and does a good job of both updating the material and explaining some of the later developments such as SMP. Anyone who has a need for writing fault tolerant applications should at least look at this book. If nothing else you will never be afraid of dealing with recursion ever again.

In many ways the book cuts off just when things are getting interesting. There are hints in the book about real world Erlang's applications and it would have been good if some of these experiences could have been expanded. Hopefully this book is the start of increased exposure for Erlang. If so then someone may get around to writing another Erlang book describing some of the advanced issues about generating robust applications. I just hope it won't take another 10 years this time.

Tony Pedley is a senior engineer specializing in real-time embedded systems. In his spare time he likes to tease windows programmers and confuse managers by telling them it would be a lot easier if we wrote it in Erlang.


You can purchase Programming Erlang - Software For A Concurrent World from amazon.com. Slashdot welcomes readers' book reviews -- to see your own review here, read the book review guidelines, then visit the submission page.
+ -
story
This discussion has been archived. No new comments can be posted.
The Fine Print: The following comments are owned by whoever posted them. We are not responsible for them in any way.
 Full
 Abbreviated
 Hidden
More
Loading... please wait.
  • Try it out (Score:5, Informative)

    by romiz (757548) on Wednesday September 05 2007, @01:51PM (#20483307)
    The first chapter [pragmaticprogrammer.com] is avalable online to get a taste of the book (and the language).
    • The Ericsson Language, for those who have not been exposed to it, is a programming language meant to make concurrent (multi-process, multi-processor, multi-machine) programming really simple. It's used on many AXE telephone base stations world-wide. It has great message-passing support, and a pretty nice library. It is actually not a functional language, but a logical one. Basically a perverted version of Prolog.
      • Erlang is a functional language with prolog-style unification for pattern matching, just like one sees in ML or Haskell.
      • Re: (Score:3, Insightful)

        Erlang does not stand for "Ericsson Language". It's named for the the telecom term, which itself was named for A. K. Erlang.

        And yeah it's like Prolog, except without horn clauses or backtracking. You know, just like lisp and java.
        • Re: (Score:3, Interesting)

          Actually it stands for both.
        • Re: (Score:3, Informative)

          Ericsson is a Swedish company, founded by Lars Magnus Ericsson [wikipedia.org]. Erlang was developed by Swedes at Ericsson but is named after Erlang who was unfortunately Danish. It is possible some Danes sneaked in and did this naming before the security guards could throw them out.
          • Re: (Score:3, Informative)

            add(X, 0, Sum) :- Sum = X.
            add(0, Y, Sum) :- Sum = Y.
            add(X, Y, Sum) :- dec(X, 1, X2), inc(Y, 1, Y2), add(X2, Y2, Sum).

            This is quite bad Prolog. Try this instead:

            add(0,X,X).
            add(s(X),Y,s(Sum)) :- add(X, Y, Sum).

            Where s/1 is a successor operator, which may or may not be defined, depending on how you wish to represent numbers. Your second case is not required, although it can be used for a tiny speed boost. If you want to take this to its logical conclusion, then you can assert/1 each result that you've already unified with true. This technique is more useful in something like a Fibonacci sequence, however.

        • by Brummund (447393) on Wednesday September 05 2007, @05:36PM (#20487193)
          Authors should give away their books, and instead earn their money giving seminars and lectures.

          And, as I'm told, earn top dollar from merchandise like t-shirts, mouse pads and coffee mugs.
              • Re: (Score:3, Interesting)

                Yes, it does, because it's for the exact same reason -- economics. It's too costly, in time/money, to train developers in a drastically different language. The days of difficult but powerful languages and other technologies (like CORBA, COM, prolly others) achieving mainstream status are over. That's why C++ is being replaced with Java and C#. Anything hard is undesirable by PHB's. As is anything drastically different.

                You are right on reasonably short time scales (a year or two) at a single organization. O

  • by DoofusOfDeath (636671) on Wednesday September 05 2007, @01:56PM (#20483403)
    I bought the book while it was still being written. I was able to download drafts, and (if I had the time) submit bug reports. When it was finally done, I got a printed copy in the mail.

    I haven't had much time to play with Erlang (or the book) yet, but it was a really nice feeling to be able to get early access as long as I was willing to see unpolished content. Bravo, publisher.
  • by SanityInAnarchy (655584) <ninja@slaphack.com> on Wednesday September 05 2007, @01:58PM (#20483437) Journal
    Last I checked, there was an implementation issue and a design issue.

    The design issue, for me, was a lack of namespaces. I think it might have been that I can't have an atom with a namespace, beyond prefixing, which is a hack for languages that don't support namespaces.

    The implementation issue was that you had to choose between performance and being able to reload functions later. I would very much like it to be able to JIT or even compile down to binary (x86_64 too, pretty please?), then be able to just leave it running, and have it reload functions as needed.

    I'll have to think of what else I didn't like, but I don't think there was much, aside from some odd syntax. I don't actually have a problem with the somewhat functional nature of it, just certain syntax that looks ugly, but that's a matter of opinion, and something I can live with.
    • Re: (Score:3, Informative)

      You can do reload natively compiled modules. In fact, you can replace a native compiled module with a byte-code one and then vice versa, in a running vm. I just did it 5 seconds ago.

      You can use periods and @s (and anything else) to namespace atoms, if you want. The module loader will even track down module foo.bar to foo/bar.beam... compiler support for it isn't great but it works. nobody bothers to use it though.

      The syntax takes a while to get used to, but it becomes very easy to write.

      What I've found
        • by be-fan (61476) on Wednesday September 05 2007, @02:58PM (#20484613)
          But that's what I'm holding out for, is a high-level language with good performance that at least approaches C.

          There's basically a handful of languages that would meet your needs here. On the dynamic side, you've got Common Lisp. On the static side, you've got ML, O'Caml, or Haskell.

          After that, your options trail-off significantly. The other dynamic languages are all much slower than Lisp (more in the league of Python than in the league of C), and the other static languages (C#, Java), are much lower-level/less productive.
                • Re: (Score:3, Interesting)

                  Scheme and Common Lisp are both Lisp dialects, but both have very different cultures behind them. Major differences (very CL-biased):

                  - Common Lisp was designed with a strong bent towards practical utility. It has a lot of features* and features that aren't necessarily clean**, but are included because of usefulness or backwards compatibility reasons. Scheme was designed first and foremost to be a very clean, pure language. It's easy to learn, and you can hold the whole thing in your head without much effort
            • Re: (Score:3, Informative)

              Yes, I understand that. But since atoms in Erlang have no associated value, I don't see how the fact that another module uses the same atom could cause any confusion. Maybe if you gave an example.

              I'm considering Erlang for a project, so I honestly would appreciate knowing how this might be problematic.
  • by ikewillis (586793) on Wednesday September 05 2007, @02:02PM (#20483511) Homepage
    This book is written by the language's creator, Joe Armstrong, and provides one of the best introductions to a programming language I've ever seen. The entire approach is nicely bottom up, with the idiosyncrasies of the syntax presented immediately so they are not confusing later. More powerful features are introduced, such as the tools for concurrent and distributed programming, with the book finishing off with the immensely powerful Open Telcom Platform and its associated tools, such as the "one server to rule them all" gen_server implementation and Erlang's distributed database, Mnesia.

    All in all this is an excellent book about an excellent language and I would highly recommend it to any programmer, especially those concerned with the multicore future which will increasingly demand concurrent programming languages.
  • Wings3D (Score:4, Informative)

    by UglyMike (639031) on Wednesday September 05 2007, @02:04PM (#20483535)
    Strange that I didn't see Wings3D mentioned yet. ( http://www.wings3d.com/ [wings3d.com] )
    It's an open-source subdivision surface modeler held to great esteem in the modeling scene

    It is also an Erlang application....
    • Re: (Score:3, Interesting)

      What about eJabberd? It's currently the most feature-complete open source Jabber server, and it's written in Erlang. I've just migrated from Jabberd (written in C, and older) to eJabberd for the features.
  • by Z00L00K (682162) on Wednesday September 05 2007, @02:06PM (#20483573) Homepage
    The review is well written, and even though Erlang is a programming language that not everyone is used to program in it's well worth to mention that a large number of telecommunication devices from Ericsson are running software written in Erlang, so most people has probably been using it without knowing it.

    And in my opinion; If you are familiar with more common languages like C and Java you should take a deeper look into Erlang unless you prefer to study Prolog or Cobol. Just take a dip or a deep plunge, you never know when you end up in a project where knowing Erlang may prove useful - it is actually developed to be used in real applications and not as a theoretical study object.

    And Erlang is designed to handle concurrent programming from the bottom, which is a real problem in large multi-user systems. You can of course use C or Java and solve concurrency problems with semaphores or synchronization, but the solution in Erlang may be much more elegant.

    And for all of you that are familiar with the Eclipse development environment; There is a plugin called Erlide [sourceforge.net].

  • Saying that the Author does a good job of leading you through the languages intricacies with examples being compared to code from languages such as Java to help keep your feet on solid programming ground.

  • Overall, the book is very good: the examples are clear and useful, and for an old Prolog programmer like me, Erlang has a natural feel to it.

    I have been disappointed that none of my customers seem to be interested in Erlang development - I proposed using it for one application where 'share nothing' asynchronous communication seemed like a very good fit.
  • The author here highlights one of the language features, the Erlang light weight process. These are true processes (not threads) but take up very little in the way of resources. Indeed it is not unusual to have 1000's of such processes running in an application.

    Would a good analogy be that an Erlang process is comparable to an object instance, in that both are loosely coupled (ideally), focused on one task (ideally), but in Erlang they're all running asynchronously and the OS/runtime automatically handl

    • Yes, that's a reasonably good way to think of them, with the proviso that an Erlang process doesn't bind particular code to the receipt of particular messages like you see in OOP (where particular bodies are bound to particular methods). When an Erlang process receives a message, it's up to the process to decide what to do with it.
  • IAAEP (Score:4, Insightful)

    by schmiddy (599730) <schmiddy@NOSPAm.gmail.com> on Wednesday September 05 2007, @09:23PM (#20489239) Homepage Journal

    I am (well, was, at least) an Erlang Programmer. I was toying around with Erlang for some small projects [sf.net] with distributed programming.

    I've been looking forward to Joe's book for a long time, as he's one of the few big names in the Erlang community, and has done a lot of work (both code and, even more importantly, documentation) for the community -- first that jumps to mind is his important look at Yaws vs. apache [www.sics.se].

    There are serious problems with the Erlang language as a whole and the community, right now. The mailing lists are actually pretty good, but quite frankly, the documentation online is terrible and the Erlang interpreter is pretty rudimentary. Not to mention basic problems with the syntax and grammar of the Erlang language itself. When I was learning Erlang a few months back, I was pretty frustrated that about the only source of documentation was on erlang.org [erlang.org], and they.. weren't great. For instance, there needs to be a big warning right at the beginning explaining that atomic values always start with a lowercase letter and all other variables must begin with a capital letter. This must be a huge problem for other beginners (at least, I hope I assume I wasn't alone..) compounded by the unfriendliness of the error messages produced by the Erlang interpreter.

    Now that I've switched over to doing as much as I can in Python, which has a great user community, wonderful docs, a healthy standard library, and a reasonably helpful interpreter.. I don't really worry about Erlang that much anymore. It would be wonderful if I could write, say, web crawlers (I work in web security) in Erlang. But the mysql support in Erlang looks alpha-quality at best, and AFAIK there's nothing even remotely similar to Python's urllib2 for basic web client functionality in Erlang.

    I think it says a lot that so much attention is paid to a language that is so rough around the edges, unfriendly, and lacking in documentation. Even given all that.. the ease of use of the concurrency and message passing in Erlang is so fantastic that it almost makes up for the rough spots.

    On a final note, I'd like to point out to anyone interested that I think there's a huge void out there for a language that's as easy to use and learn as Python, but with the concurrency and message passing in Erlang. It actually might not take that much work to build a network-transparent message passing interface as a Python module (I've looked into Pyro [sourceforge.net] a bit.. it looks rather cumbersome and makes easy things too hard, correct me if I'm wrong). Also, modern languages need basic support for splitting up the workloads of map() or similar trivially parallelizable functions across multiple processors/cores (I know the Perl6 group was thinking about this.. not sure if this works in Parrot now or what). Basically, modern languages like Python/Perl/Ruby should really think more about making simple modules to mimic the message passing that Erlang has. Really, a little bit of code could go a long way. The Google team put together sawzall [google.com] which looks kind of cool, on this note..

    • by Anonymous Coward on Wednesday September 05 2007, @02:10PM (#20483641)
      Lets look at these "sins":
      1. Not a sin, not needed and shows you don't know what you're talking about wrt reliability. hard real time is irrelevant.
      2. More FUD based on your lack of understanding of programming.
      3. is a downright lie
      4. Contradicts three!
      5. Ok, now I'm thinking you're not just a troll but verifiably insane. Show us a language (one that exists outside your head) thats not "alkorithmic"
      6. Contradicts itself- is it based on english or is it cryptic?
      7. Asinine in the extreme, and of course contradicted by the other 6 points. erlang is not logo

      Bottom line- you are just making assertions that make no sense. If you ever were a programmer, you never learned much about programming... and your constant bashing of erlang is just an attempt to get attention. COSA doesn't exist, except in your head, where it can be magical and change as is needed for you to make whatever "point" you want to make.

      I guess its a sign that erlang is becomming mainstream that it has attracted a loon such as yourself.
            • Re: (Score:3, Interesting)

              I kind of like what Donnald Knuth had proposed, which is using a typesetting system to display code. So you'd use regular ascii symbols that are close to what you want when typing it out, but they get converted to a more graphical symbol in your editor automatically.
    • by Wesley Felter (138342) <wesley@felter.org> on Wednesday September 05 2007, @02:15PM (#20483707) Homepage
      Summary: "Erlang isn't based on my fringe pet theory, so it sucks".
    • I often judge the quality of something by looking at the quality of the criticisms of it. If that's the best criticism of Erlang that you can find (or come up with) then Erlang looks pretty damn good. Of course, if you could see your way clear to describing how to write programs without implementing algorithms instead of simply explaining in great detail that algorithmic software is bad, maybe I would find it easier to embrace your view of programming.
    • Re: (Score:3, Informative)

      That is the same guy who says you can get artificial intelligence from the bible [rebelscience.org]. He's a loon with a large vocabulary.
    • Well, thats it.

      The blog you link (especially the authors reactions to criticism in the comments) show that he should really have been aborted when it was still possible.
      • and his mother shot in the face during the procedure; you just can't be too careful in cases like this
        • by rk (6314) on Wednesday September 05 2007, @02:57PM (#20484587) Journal

          See, here's the thing: I can download Erlang and start to learn it right now. Where can I find COSA? That's right, it's vaporware.

          Who knows, you may be on to something. I'd suggest writing fewer white papers and less name-calling of your detractors and get busy implementing your vision. Nothing will shut them up faster when you've got something that lets people develop systems that are more reliable for no extra cost.

          Until then, you're in the same category as people who promise us perpetual motion machines and anti-gravity levitation.

                • "COSA is 100% reactive, that is, it is based on change."

                  Or would be if it... you know, existed.

                  lol

                  I'm sure you're taking the Internet crank world by storm. Best of luck to you.
            • Foaming at the mouth? No, you;re misunderstanding. we're either on the floor laughing at your stupidity or starting dumbfounded at our screens wondering how someone as stupid as you can possibly exist.

              Please do continue posting as it's endlessly amusing, people like you are like digital clowns. After all every society needs a town idiot to make everyone else feel better about themselves.
      • Re: (Score:3, Informative)

        Erlang is actually the closest language I've seen to the original meaning of Object Oriented Programming; Alan Kay's simple computers communicating via message passing. The syntax varies from absolutely gorgeous (anything involving binary data) to just plain painful (metaprogramming, string manipulation, ADTs, etc). The foreign interface layer is horrendously badly documented, and has enough overhead that it's hard to use it for the one thing where it would actually be really useful: serial code that need

    • Its surely a dumb idea for applications written in languages like C and Java... but not for erlang.

      Remember, systems running this language have had uptime on the order of many years, and that's with in-place code modification.

      You're rejecting what you don't understand based on assumptions that are true for other contexts.

      Downtime is a sin, not a virtue!
        • Re: (Score:3, Informative)

          Nobody live-updates a running Erlang (or Lisp, which does the same thing), without deploying the code into a test environment first. The thing that live-update let's you do is take a well-tested and well-debugged piece of code and inject it into a running service without stopping the service.

          AT&T uses Lisp for some of their call routing equipment for the same reason. If you need to add a new feature to a switch, you cannot drop the call's it's handling to swap out the software.

          There are also lot's of us
    • by J.R. Random (801334) on Wednesday September 05 2007, @02:50PM (#20484441)

      There is nothing in the second example that isn't completely familiar to anyone who has ever programmed in LISP, one the world's oldest programming languages.

      Newbies, feh!

    • Re: (Score:3, Informative)

      So, think, what are you actually trying to accomplish in the first block of code, in terms of the end-result.

      You're computing a list, target, where each item is computed by F(G(x)), where x is an item from source_list, taken in order.

      Note that stuff like "iterating over source_list", and "appending to target" are not really important. They are certain necessary steps in one possible implementation of what you're trying to accomplish, but they're just incidental --- they're not part of the end result.

      Now, ma
    • Re: (Score:3, Informative)

      At this point, I don't even understand what situations this could be usefully applied to.

      Well, functional programs have a lot of other restrictions, but it boils down to this: with very rare exceptions (such as file or socket handling), functions don't have side effects. That is, they don't modify a program's global state, and they don't depend on global state. You can call foo(args) 100 times in a row and each time the output will be identical. My C++ is rusty, but imagine something like:

      int foo(int &bar, int &baz) { return bar++ * baz++; }

      Any code that calls foo() will find i

    • by Estanislao Martínez (203477) on Wednesday September 05 2007, @03:30PM (#20485325) Homepage

      It's very different, but the big advantage is that it's higher level than the stuff you confess to understanding better.

      The code in question (in Python? not a great choice for doing an example!) uses two very common higher-order operations in functional programming: map and compose. A map operation takes a complex data structure (most common example: a list), and a function that applies to elements of that data structure, and returns another structure, with the same "shape," where each element in the result is related to its corresponding element in the original structure by being the result of apply the function. Thus, if you have a list [2, 3, 5, 7], and a function inc that increments a number by one, map(inc, [2, 3, 5, 7]) evaluates to [3, 4, 6, 8].

      In the case of a list, map is can be implemented by creating a new list of the same length as the original, looping over the list, applying the function to each value, and storing the result in the result list. This is a kind of task that imperative programmers find themselves doing all the time. The problem with this, however, is that if you're writing code like this all the time, you're writing at a much too low level, with the all the disadvantages of that:

      1. It takes you longer to write code. Instead of writing just result = map(fn, myList), you have to write a loop.
      2. Your code is specifying the mechanism to convert the input list into the output list over and over, instead of describing the relation between the lists. Suppose you want to change the mechanism for doing this sort of operation, e.g., to parallelize it. In functional style, you can just rewrite map to do its work in parallel. In imperative programming, you have to work harder.
      3. The concept of mapping a function over a structure, to produce a new structure with values related to the original by the function, applies to many kinds of data structure, not just sequences. You can write equivalents of maps for any container data function you like, even though the mechanics are different; e.g., to implement a map function over a tree you typically use recursion. This means that in the imperative style, the code for "increment all the values of this list by 1" looks very different from the code for "increment all values in this tree by 1"; in functional programming, they will at least look very similar, if not completely the same.
      4. There are many, many other common progamming blocks that you can abstract into a function in functional programming, but not in imperative programming. For example, filtering a list to only keep the elements that satisfy a boolean function, which in functional programming is usually just a function called something like filter. For example, if you have a function called even, that returns true only for even numbers, here's how you get the even numbers in myList: filter(even, myList)
      5. Functional programming solutions often compose more easily than imperative ones; i.e., it is easier to put them together to solve more complex tasks. For example, if you need to increment a list of numbers by one each, and only keep the ones that are even in the result, you can do that easily and transparently: filter(even, map(inc, myList)). In the imperative style, the patterns for mapping and for filtering don't combine this straightforwardly.
      6. Functional code is usually easier to read. When I read a piece of imperative code and come across a loop, I normally have to work the steps a bit in my mind in order to see what it is that it does: "Hmm, we create a new list at the beginning, then we loop through the elements of this other list, and as we go through each one, we apply a function to it, and put the result in the list we first created. Ah, we're mapping over the list." In functional programming, these common patterns find immediate expression in a higher-order function
    • Re: (Score:3, Interesting)

      The Haskell equivalent of the same thing would be:

      target = map (f . g) source_list

      A minor shift in syntax, and dropping a lot of superfluous parentheses from the language and adding sugar (.) for function composition goes a long way to cleaning that up into something readable. =)

      The main strengths of functional programming come when you start thinking about functions as first class values.

      Here the function obtained by composing f and g became a new function that was usable just like the primitives you built
        • Re: (Score:3, Insightful)

          I agree partly with your sentiments on debugging - although I don't think it would be a huge problem. However, I don't think that the second piece of code is more difficult to understand than the first. I'm able to look at the second piece of code and easily understand exactly what's happening almost instantly. It largely depends on what you're used to. If you're used to writing only in an imperative style, obviously a functional style is going to take some time getting used to. The vice versa is also
          • Re: (Score:3, Insightful)

            I agree partly with your sentiments on debugging - although I don't think it would be a huge problem.

            It's not a problem, because no functional programming language has a buggy map. There is no need to debug into map, it's a primitive like floating-point addition (which actually abstracts a much more complex algorithm than map!)
        • by be-fan (61476) on Wednesday September 05 2007, @03:34PM (#20485407)
          Also next to impossible to maintain, debug, or understand.

          Uh, if you don't know functional programming, then yeah. If you do, it's instant to understand, and can be maintained more easily because there is less of it to maintain.

          Your argument basically amounts to "stuff I don't know is hard to understand". No shit. New notation and concepts have to be learned, yes, but there is a point to learning them. It makes things simpler and easier once you have learned them. Consider, why do people in signal processing do all sorts of Z transforms and Fourier transforms and whatnot on data? Surely it's _easier_ to just think of a sound signal as a series of amplitudes at discrete time intervals? The thing is --- it isn't. Once you learn all that math, you can do stuff with signals by hand that you couldn't even have dreamed off if you'd used a less powerful technique.
        • Re: (Score:3, Informative)

          Actually FP code is an order of magnitude easier to debug/maintain/understand, once you get past the weird syntax and restrictions. The absence of side effects makes it easier to isolate a problem or to build up an understanding of what the code does. The human brain can focus on only so many things at once. Since you don't have side effects, a function's result depends only on its parameters, so once you understand it you can think of it as a black box and move up to the call chain. When you debug, you