Programming language Dino and its implementation

(github.com)

64 points | by 90s_dev 246 days ago

6 comments

  • johnisgood 246 days ago
    I do not know how to interpret the benchmarks. OCaml is really fast, so the numbers do not make sense to me, at a quick glance. Is it worse or better to Python or Ruby according to the benchmark? I would like to see the code, too, because if it is that much slower than Python or Ruby, then there is a serious problem with the implementation.
    • extrabajs 246 days ago
      Guessing from the text that they’re running the (interactive) bytecode compiler + interpreter version of OCaml, which is much slower.
    • ghurtado 246 days ago
      Feature-wise it looks very complete / modern.

      It seems to have a pretty high ratio of "I use X because it's the only one that has Y" type features, all in one place. Very appealing to Python users, since it fills a few well known language gaps.

      • 90s_dev 246 days ago
        What do you mean, George?

        > It seems to have a pretty high ratio of "I use X because it's the only one that has Y" type features, all in one place.

        • ghurtado 246 days ago
          My name is certainly not George :D but I'll pick two features:

          - fibers

          - advanced pattern matching

          These are two not so common language features that are often the differentiator in a class of languages: "I like Python - but Ruby has fibers" or "I like Ruby - but Python has pattern matching"

          To see such features all in one language has a lot of appeal (to me, anyway)

          • dleslie 246 days ago
            FYI, Janet has fibers and parsing expression grammars. Many scheme implementations also feature some form of pattern matching.
            • 90s_dev 246 days ago
              Yeah but Janet is a Lisp. And Lisps are like black coffee.
              • dleslie 244 days ago
                ... I prefer my coffee black, and I love lisp.

                So that tracks.

            • riffraff 246 days ago
              Is there something missing in ruby's pattern matching? It has subpatterns, alternation, pinning, guards.

              I've got limited experience with it but it seems on par with what most languages have.

            • fuzztester 246 days ago
              >What do you mean, George?

              Home, James.

              >https://www.google.com/search?q=home%2C+james

          • johnisgood 244 days ago
            By the way, for your other project[1], you might find this one interesting: https://internet-janitor.itch.io/decker. I just found it.

            I could not comment there, so I did it here.

            Let me know if it helps.

            [1] https://news.ycombinator.com/item?id=44042371

            • bravesoul2 246 days ago
              Cool. A golike from 1993 with a similar name to a certain modern JS runner.
              • 90s_dev 246 days ago
                How is it like Go? It seems differenter.
                • bravesoul2 246 days ago
                  C-like with slices
                  • 90s_dev 246 days ago
                    Doesn't C have slices but they're just kind of manual and non ergonomic and memory unsafe?
                    • johnisgood 246 days ago
                      C has anything we please! :) With a disclaimer or warning at times.
                • pjmlp 246 days ago
                  That would be Oberon-2.
                • zem 246 days ago
                  looks like a very pleasant and capable language! honestly not what I was expecting given the origin story as a game scripting language.
                  • Lerc 246 days ago
                    I was not expecting to feel as sad as I did after seeing the name Animatek after all these years.

                    If things are hard, seek help, please.