User loginNavigation |
What are the properties of "Functional Programming Languages"?1 - Please let standardize the dynamically-typed, statically-typed, weakly-typed and strongly-typed definitions. We have 2 dimensions here: strongly-typed: Every value has a type and can not implicitly be converted. Haskell, C#, Java are statically-typed and strongly-typed. (Unfortunately even in MIT Schema description (PDF) this concepts are used misunderstoodly) (Let's for now forget about things like Linear typed languages.) 2 - Now in every of mentioned groups, which features must be implemented for that the language could be assumed as a functional one? For example JavaScript and Ruby are dynamically-typed. So things like pattern-matching are meaningless in their scope (or have a very different meaning). Is "purity" really needed in a language to be considered as functional programming? Personally I do not think so. Because I think functional programming is about higher-order composability. For example structural-composability gives you the power to make more pluggable codes. So again the question: By kaveh.shahbazian at 2007-11-19 10:27 | LtU Forum | previous forum topic | next forum topic | other blogs | 41329 reads
|
Browse archives
Active forum topics |
Recent comments
27 weeks 1 day ago
27 weeks 1 day ago
27 weeks 1 day ago
49 weeks 2 days ago
1 year 1 week ago
1 year 3 weeks ago
1 year 3 weeks ago
1 year 5 weeks ago
1 year 10 weeks ago
1 year 10 weeks ago