Hi there,the latest episode of Software Engineering Radio features a nice discussion about FP
http://www.se-radio.net/podcast/2008-08/episode-108-simon-peyton-jones-functional-programming-and-haskell with kind regards, David Linsin - - - - - - - - - - - - - - - - - - - - - - - - email: [EMAIL PROTECTED] blog: http://dlinsin.blogspot.com On Aug 29, 2008, at 10:39 PM, Scoot wrote:
Apologies if this is somewhat off topic, but I think (hope) the posse audience have some useful insights on this. I'm trying to get my head into functional thinking. I'm sold on the principles of immutability and all the attendant advantages; I've looked at examples in various languages (erlang, haskell, scala) and admired the elegant simplicity of recursion. What I'm struggling with is how to model real-world domains using these principles. Someone (Dijkstra?) once jested stacks were invented solely to demonstrate Abstract Data Types; it kind of feels like the Fibonacci series is the functional programming equivalent. What I'm missing are examples from real world domains; like customers holding accounts or purchasing products. I want to think about these as stateful entities; e.g. the account moving from in credit to overdrawn and back. So: how does one "think" about these things functionally? I know in scala I can represent them as stateful objects but that's sidestepping the issue; how do I think about state - and persistence - functionally? Any thoughts/pointers gratefully accepted. tia, Scott. --~--~---------~--~----~------------~-------~--~----~You received this message because you are subscribed to the Google Groups "The Java Posse" group.To post to this group, send email to [email protected] To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/javaposse?hl=en -~----------~----~----~----~------~----~------~--~---
smime.p7s
Description: S/MIME cryptographic signature
