John, Thanks very much for that bit of insight. I am not really writing anything right now that is in more hurry than what Haskell can handle nicely. I was feeling a bit guilty as, Shao said, I use $ over (.) and thought that my code could get some amount of ridicule as to style... when it gets a look by guru types.. Now I can just say, "Hey, it is just my style!".. I have written things that involved lists, where it was building and rebuilding lists of some length that took lots of time.. but that had nothing to do, as you had said with the syntax I chose to use. it would seem that the big ones are things like ordering placements to take advantage of tail recursion and such are more the issue.. and using more efficient data structures than a "straight" list when appropriate. Since you know this sort of thing... Point Free, does that end up being the exact same code after the compiler gets done with it.. I assume it must, but ... ?? Does it cause the compiler less or more work to get to that resultant code.. hmmm thanks, gene