6 ms·

We learned Scheme, Haskell, Prolog and Clips in one semester for Programming Paradigms course. I can still remember the homework for each programming language

We learned Scheme, Haskell, Prolog and Clips in one semester for Programming Paradigms course. I can still remember the homework for each programming language (this was 6 years ago): - Something with genetic algorithms in Scheme - 2048 implementation in Haskell - Searching in an infinite space in Prolog - Phutball in Clips Pretty dope if you ask me. :)

grogenaut 6y ago
Glad it was good for you. It was not for me.
- agumonkey 6y ago
  It's interesting to have intense negative reactions to a language. Could you give details what annoyed you with scheme ? I hope it goes beside the syntax.
  - grogenaut 6y ago
    Many people who like scheme and functional languages have an averse reaction to more procedural or OOP languages. It's interesting that people don't grok it can go the other way. But this is HN so I guess I'll explain. A few things (and for context this was 1996). With the class I disliked they were trying to teach me a language and a complex concept at the same time. In a 4 month semester, half of it was spent just getting basically proficient in the language. So instead of learning one concept I'm learning 2. We were essentially using scheme to build a interpreter for a simplified scheme. I understand why we were implementing scheme, it's one of the simplest languages to implement and maps well to many concepts in CS. this is actually why the game studio I worked at used it, not that it was the right language, in fact it's caused a lot of trouble and they have a lot of c/python like in the language now Scheme seemed like a pretty useless language as well. The book for it listed (in the forward) out how amazing it was and showed all the amazing projects done with lisp-like languages. That list started with emacs and then the rest was academic things I'd never heard of, which seemed like a joke. If I recall scheme had some pretty weak language library functions at the time as well. Also at the time I cared about drawing triangles on the screen. [I will lose points for this but it's my POV] I tend to find people who strongly like functional languages a bit insufferable, especially academics. I tend to learn by getting a real world project done, and I like tools that let you build real world things. I don't care anywhere near as much about form of the solution. . Functional languages seem to gel better with people who care about the beauty of a simple proof. I hate proofs. Also in much of the work I've done, the folks who really pushed for functional languages didn't really understand that most of their coworkers were juts not capable of understanding those languages or thinking that logically. There's a reason (imho) that they're not as popular of languages. I have written stuff in these languages since then. I did work in the (gp reference) scripting language and on its implementation in the engine. This got me real features (like a mission in an AAA game, and features for my mission designers in the engine). This seemed useful to me. I spent about 3 months trying to use Clojure to do a highly parallel data processing work. It seemed to map well to the problem. However it was insufferably slow, and with required type hinting was essentially complicated java (lost the benefit). I re-wrote it in C++ in about a week and brought the processing time from 15 minutes to 32 seconds by leveraging the deeper parts of the machine (buffers, disk cache, physical cores) which were not as available inside the abstraction. So it also comes down to I haven't found a problem that maps well to something like scheme that I need to solve. When I do stuff with interpreters I just grab ANTLR and java/go/c++. This is more maintainable for everyone I work with.
    - pantaloony 6y ago
      You’re not alone. My brain works in steps, not proofs. If all code looked like Haskell and friends I doubt I’d ever have gotten into it in the first place. [edit] algos, over proofs, would probably be a better way to put it.
      - vvv312 6y ago
        Proofs work in steps too. I can never tell what an index-juggling loop is doing, in whatever language (including Scheme). But when you follow the data type case by case, each step is simple and logical, easy to comprehend so the whole solution is easy too.
        pantaloony 6y ago
        Sure, which is why I edited that “algorithms” is more accurate. When I read proofs I have to go through each step and figure out what every term on either side “does” to something “going through” it to make sense of it. I’d rather have my sandwich-making instructions as instructions than a series of statements about how the sandwich looks at each stage that I have to go back and turn into instructions to actually do anything with it, if that makes sense. I get that other people don’t have this preference, but I strongly do. Test results indicate I should be incredibly well suited to mathematical work but I feel the way I imagine a dyslexic must when I try to read math or “mathy” programming languages. Give me something more-or-less procedural and I’m totally happy (though I gather I had a much easier time understanding and getting comfortable with recursion than many people do, which seems weird given I find the languages most heavily associated with it almost unreadable).
        agumonkey 6y ago
        proofs to me, are 'typed' steps. you explicitely state the domains
    - gen220 6y ago
      I think your view’s totally reasonable. In my experience, the benefit of FP is To teach good program design: I’ve observed that functional programming languages encourage good practices that can be practiced in any language. For example: pushing I/O to the leaves of your program, dependency injection, eradicating global state, focus on functional interfaces. These are patterns that you can do in any language, but functional languages kind of compel you to follow them. Many people first learned these patterns from FP, and carry them over to OOP, which they have to write at work. I don’t know if there are many problems that are elegantly defined for FP, as you suggest. I think people just get comfortable in their cages. :)

grogenaut 6y ago

Glad it was good for you. It was not for me.

agumonkey 6y ago
It's interesting to have intense negative reactions to a language. Could you give details what annoyed you with scheme ? I hope it goes beside the syntax.
- grogenaut 6y ago
  Many people who like scheme and functional languages have an averse reaction to more procedural or OOP languages. It's interesting that people don't grok it can go the other way. But this is HN so I guess I'll explain. A few things (and for context this was 1996). With the class I disliked they were trying to teach me a language and a complex concept at the same time. In a 4 month semester, half of it was spent just getting basically proficient in the language. So instead of learning one concept I'm learning 2. We were essentially using scheme to build a interpreter for a simplified scheme. I understand why we were implementing scheme, it's one of the simplest languages to implement and maps well to many concepts in CS. this is actually why the game studio I worked at used it, not that it was the right language, in fact it's caused a lot of trouble and they have a lot of c/python like in the language now Scheme seemed like a pretty useless language as well. The book for it listed (in the forward) out how amazing it was and showed all the amazing projects done with lisp-like languages. That list started with emacs and then the rest was academic things I'd never heard of, which seemed like a joke. If I recall scheme had some pretty weak language library functions at the time as well. Also at the time I cared about drawing triangles on the screen. [I will lose points for this but it's my POV] I tend to find people who strongly like functional languages a bit insufferable, especially academics. I tend to learn by getting a real world project done, and I like tools that let you build real world things. I don't care anywhere near as much about form of the solution. . Functional languages seem to gel better with people who care about the beauty of a simple proof. I hate proofs. Also in much of the work I've done, the folks who really pushed for functional languages didn't really understand that most of their coworkers were juts not capable of understanding those languages or thinking that logically. There's a reason (imho) that they're not as popular of languages. I have written stuff in these languages since then. I did work in the (gp reference) scripting language and on its implementation in the engine. This got me real features (like a mission in an AAA game, and features for my mission designers in the engine). This seemed useful to me. I spent about 3 months trying to use Clojure to do a highly parallel data processing work. It seemed to map well to the problem. However it was insufferably slow, and with required type hinting was essentially complicated java (lost the benefit). I re-wrote it in C++ in about a week and brought the processing time from 15 minutes to 32 seconds by leveraging the deeper parts of the machine (buffers, disk cache, physical cores) which were not as available inside the abstraction. So it also comes down to I haven't found a problem that maps well to something like scheme that I need to solve. When I do stuff with interpreters I just grab ANTLR and java/go/c++. This is more maintainable for everyone I work with.
  - pantaloony 6y ago
    You’re not alone. My brain works in steps, not proofs. If all code looked like Haskell and friends I doubt I’d ever have gotten into it in the first place. [edit] algos, over proofs, would probably be a better way to put it.
    - vvv312 6y ago
      Proofs work in steps too. I can never tell what an index-juggling loop is doing, in whatever language (including Scheme). But when you follow the data type case by case, each step is simple and logical, easy to comprehend so the whole solution is easy too.
      - pantaloony 6y ago
        Sure, which is why I edited that “algorithms” is more accurate. When I read proofs I have to go through each step and figure out what every term on either side “does” to something “going through” it to make sense of it. I’d rather have my sandwich-making instructions as instructions than a series of statements about how the sandwich looks at each stage that I have to go back and turn into instructions to actually do anything with it, if that makes sense. I get that other people don’t have this preference, but I strongly do. Test results indicate I should be incredibly well suited to mathematical work but I feel the way I imagine a dyslexic must when I try to read math or “mathy” programming languages. Give me something more-or-less procedural and I’m totally happy (though I gather I had a much easier time understanding and getting comfortable with recursion than many people do, which seems weird given I find the languages most heavily associated with it almost unreadable).
      - agumonkey 6y ago
        proofs to me, are 'typed' steps. you explicitely state the domains
  - gen220 6y ago
    I think your view’s totally reasonable. In my experience, the benefit of FP is To teach good program design: I’ve observed that functional programming languages encourage good practices that can be practiced in any language. For example: pushing I/O to the leaves of your program, dependency injection, eradicating global state, focus on functional interfaces. These are patterns that you can do in any language, but functional languages kind of compel you to follow them. Many people first learned these patterns from FP, and carry them over to OOP, which they have to write at work. I don’t know if there are many problems that are elegantly defined for FP, as you suggest. I think people just get comfortable in their cages. :)