You are not logged in. Your edit will be placed in a queue until it is peer reviewed.
We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.
Required fields*
-
3+1 despite the question has been framed rather antagonistically, it's a good question.mattnz– mattnz2012-01-12 03:36:19 +00:00Commented Jan 12, 2012 at 3:36
-
16As many have stated in the answers, Functional decomposition and Functional programming are two different beasts. So conclusion that "this seems to pretty much a challenge to functional programming" is plainly wrong, it has nothing to do with it.Fabio Fracassi– Fabio Fracassi2012-01-12 10:24:10 +00:00Commented Jan 12, 2012 at 10:24
-
5Clearly McConnel's knowledge in the modern functional data type systems and high order first class modules is somewhat patchy. His statement is utterly nonsense, since we've got the first class modules and functors (see SML), type classes (see Haskell). It's just another example of how OO way of thinking is more a religion than a respectful design methodology. And, by the way, where did you get this thing about the concurrency? Most of the functional programmers do not care at all about the parallelism.SK-logic– SK-logic2012-01-12 11:38:22 +00:00Commented Jan 12, 2012 at 11:38
-
6@SK-logic All McConnell said was that "functional decomposition alone" does not provide the same means of abstraction as OOP, which seems a pretty safe statement to me. Nowhere does he say that FP languages don't have means of abstractions as powerful as OOP. In fact he doesn't mention FP languages at all. That's just the OP's interpretation.sepp2k– sepp2k2012-01-12 12:29:01 +00:00Commented Jan 12, 2012 at 12:29
-
2@sepp2k, ok, I see. But still, a very complex and well-layered system of data structures and processing abstractions can be built on top of nothing but functional decomposition for nearly pure lambda calculus - via simulating the modules behaviour. No need for the OO abstractions at all.SK-logic– SK-logic2012-01-12 15:50:12 +00:00Commented Jan 12, 2012 at 15:50
Add a comment
|
How to Edit
- Correct minor typos or mistakes
- Clarify meaning without changing it
- Add related resources or links
- Always respect the author’s intent
- Don’t use edits to reply to the author
How to Format
-
create code fences with backticks ` or tildes ~
```
like so
``` -
add language identifier to highlight code
```python
def function(foo):
print(foo)
``` - put returns between paragraphs
- for linebreak add 2 spaces at end
- _italic_ or **bold**
- indent code by 4 spaces
- backtick escapes
`like _so_` - quote by placing > at start of line
- to make links (use https whenever possible)
<https://example.com>[example](https://example.com)<a href="https://example.com">example</a>
How to Tag
A tag is a keyword or label that categorizes your question with other, similar questions. Choose one or more (up to 5) tags that will help answerers to find and interpret your question.
- complete the sentence: my question is about...
- use tags that describe things or concepts that are essential, not incidental to your question
- favor using existing popular tags
- read the descriptions that appear below the tag
If your question is primarily about a topic for which you can't find a tag:
- combine multiple words into single-words with hyphens (e.g. design-patterns), up to a maximum of 35 characters
- creating new tags is a privilege; if you can't yet create a tag you need, then post this question without it, then ask the community to create it for you