6 ms·
A statically typed language I'd actually want to use
- apl 16y agoAt this point in computing history, your language needs a stronger raison d'être than "Python isn't statically typed, and C++ has awkward syntax!"; especially considering that 99% of all new languages never get off the ground. I'm virtually certain that there's something out there that fits the bill. If not, contribute to something that gets close. Go, Scala, Haskell; whatever works. [Obviously, I do realize that building compilers/interpreters/parsers/etc. can be fun: if that's the point, disregard this.]
- bad_user 16y agoAll of them suck: Go doesn't have parametric polymorphism and feels half-baked, Scala is not compiled to machine code and is awkward in his own unique way, and for Haskell you need a PhD and the compiler's behavior is not at all transparent and comes back to haunt you. I've stopped searching for the perfect language some time ago and just don't care anymore.
- mahmud 16y agoLearn an ML dialect and be happy.
- silentbicycle 16y agoI'm hoping to see a fortune cookie that says that, someday. ("Learn an ML dialect and be happy in bed"?)
- Rusky 16y agoYou don't need a degree to use Haskell. Just because it's a research language doesn't mean it requires a lot of research to understand or use.
- bad_user 16y agoIt was a figurative statement, and you can't really say that Haskell doesn't have a steep learning curve. Every language sucks in one way or another; and when I'm saying "language" I'm also talking about the implementations since you can't really separate them when working. It's funny that the fastest way to get downvotes on discussion boards (other than saying something really stupid) is to criticize technologies.
- jbermudes 16y agoI'm not sure if that's true. While newer languages like python and ruby have taken the desktop app and web app arena by storm, most system/embedded level stuff is still done in C/C++. The usual arguments for this are that A) The language gives you more control over memory management so you can squeeze as much performance out of every cycle. B) There's a ton of existing libraries and legacy code in these languages. (Arguably one of the only reasons C++ gained any sort of traction was because of its advertised compatibility with C) We've put up with the "shortcomings" of C (most programmers learned or think in OOP) and C++ (abundance of so-called gotchas and quirky areas of the language, Alan Kay's famous quote about C++'s OOP) and it still leaves much to be desired in my opinion. Java was an interesting development, but its GC disqualifies it for many systems or high-performance programming until recently. I don't have much experience with obj-c but it looks like another contender in this space as well. There does seem to be a desire for a true "heir" to C as evidenced by D, Google's Go, and Mozilla's Rust. In fact, I'd be happy if someone just took the Java language and stripped out the GC instead of trying to restrict myself to a "safe" subset of C++. I'm rooting for all of these projects because I'd love to see some of of the benefits of modern programming language theory brought to this sector of programming. This is an area where when there's competition everybody wins.
- stygianguest 16y agoHis example is also completely unconvincing. I just don't see the problem he is trying to solve here. Unless you take the absence of static typing as a problem. In general, new type systems should start with a good problem definition: e.g. what of errors would you like to prevent, and do those problems really occur? Then design a type system, and see if its costs (there is no free lunch) justify the gains. I think the big successes of dynamically typed languages such as Python point out a problem with the C/Java/C++ type systems: they fail to answer especially the latter question. Finally, why a new language?! Build it on top of the type annotations in Python 3: http://www.python.org/dev/peps/pep-3107/ http://www.python.org/dev/peps/pep-3107/ BTW I'm all for statically typed languages, if well done, and am a huge fan of Haskell
- seunosewa 16y agoThe problem with python is the lack of speed.
- silentbicycle 16y agoAlso: No tail-call optimization, lack of a separate compile-time phase / static metaprogramming, strictly class-based / single-dispatch OO, etc.
- Chris_Newton 16y ago> At this point in computing history, your language needs a stronger raison d'être than "Python isn't statically typed, and C++ has awkward syntax!" True, but for all the rapid development in programming languages at the moment, we still don't actually have (AFAIK) a general purpose programming language that has simple, clean syntax à la Python, a static type system that covers all the basics but doesn't get too clever/complicated for everyday use, and good performance. This always seems strange to me, given that all the necessary ingredients are widely available in other languages and I see no inherent difficulty in combining them. I suppose industrial forces already have "good enough" languages and academic forces are more interested in pushing the frontiers in languages like Haskell. That probably doesn't leave a lot of people with the required skills, time and inclination to work on a solid, practical, boring tool that just gets the job done a bit better than anything we have today but without trying to somehow reshape the entire programming industry and become the Next Big Thing.
- chipsy 16y agohaXe seems to come within inches of your idea: Inferred static compilation for multiple VM/source targets with a "trapdoor" into the target's dynamic typesystem. JS-like syntax. Macro system(still in development but usable). Compiles to reasonably performant C++, although matching hand-written C++ performance is not a goal. I have been using it for several years now with the Flash/JS targets.
- anon_d 16y agoSML/Ocaml: - Rapid development - Clean syntax - Static type system - Good performance - Practical, not about pushing boundaries SML especially, is a very stable, simple, and well thought out language.
- mahmud 16y agoAliceML adds distributed programming, constraint programming, lazy evaluation, plus more. http://www.ps.uni-saarland.de/alice/ http://www.ps.uni-saarland.de/alice/
- tomjen3 16y agoHaskell could, trivially, do the first example shorter than python.
- jrockway 16y agoYeah, but then there wouldn't be anything to blog about.
- fogus 16y agoI'm no Haskell expert, but it's a couple chars shorter AND solves the premise of the entire post. [x*x | x <- s, x `mod` 3 == 0] And the function definition doesn't need all of the type clutter: let playWithSeq s = [x*x | x <- s, x `mod` 3 == 0] playWithSeq [0..10] -- [0,9,36,81]
- jrockway 16y agoC++ is statically typed? I guess if you omit the five cast operators and don't throw exceptions and don't allocate any heap, you can sort of reason about type safety. Sort of.
- viraptor 16y agoOOC, assuming `x` implements `List<Int>` (sorry for syntax mistakes, don't have a compiler here). So yes - generics and type safety included: x = x filter(func (i:Int)->Bool {i%3==0}) map(func (i:Int)->Int {i*i}) Edit: missed the multiplication
- auxbuss 16y agoI really wish that Fantom http://fantom.org/ http://fantom.org/ received more love.
- paulsmith 16y agoCan you elaborate on why? What is it you like about Fantom? Why should I check it out?
- auxbuss 16y agoMy comment was about the fact that I'd like to commit to it (for production work), but as a player not getting much love from devs, I cannot bring myself to do that... yet. Fantom would bring _me_ most of jRuby's benefits, but with familiar syntax for non-Ruby devs, with the addition of optional JavaScript runtimes; thus providing one language for front and back ends. I also simply like the "feel" of Fantom. It kind of melds the best bits of Java, Ruby, Scala, and C#, I guess. And it rejects the bad. The fact that Stephen Colebourne likes it is a plus, as I trust his judgement in such matters. http://www.artima.com/lejava/articles/javaone_2010_the_next_big_jvm_lang_stephen_colebourne.html http://www.artima.com/lejava/articles/javaone_2010_the_next_... For ref, here's the Why Fantom? page http://fantom.org/doc/docIntro/WhyFantom.html http://fantom.org/doc/docIntro/WhyFantom.html Without using it in full fury, I can't argue a defensible "must try" validation, but there's more to like in Fantom, for me, than anything else I see at the moment.
- KingOfB 16y agoJust found: http://fantom.org/doc/docIntro/WhyFantom.html http://fantom.org/doc/docIntro/WhyFantom.html Nice language syntax wise, seems pretty nice. Prime unique feature is the ability to run on a JVM or the .NET runtime. It also provides a base layer of objects to replace java.io/util etc. I'm not to clear if it maintains JVM or .NET interoperability. That would be interesting if it could call both JVM and .NET code.
- jbellis 16y agoC# is a statically typed language that gets a lot right (and not coincidentally also borrows a ton from Python). As mainstream languages go it's probably the best out there; too bad the Mono compiler is usually a version behind and the VM does not have competitive performance with either Windows CLR or Linux JVM.
- MichaelGG 16y agoExcept C#'s still quite verbose. Doubly so if you heavily use generics and functional programming. You just aren't as free in the style of code that works. For one sample point, I rewrote one of FreeSWITCH's C modules in C# and F#. The F# version had 1/20th the number of type annotations.
- fertel 16y agoThe c# version is pretty concise. And since 3.0 with implicitly typed local variables, its gotten less verbose. var result = seq.Where(a=>a %3==0).Select(a=>a*a);
- MichaelGG 16y agoYea, but try moving the predicate to a local function, and you get: Func<int, bool> pred = a => a %3 == 0. Mix in more complex types (say a dictionary with a tuple in it), and it starts getting pretty verbose.
- rwmj 16y agoThose who don't know type inference are destined to reinvent it ... badly.
- vukk 16y agoEspecially as the upcoming BitC language seems to have sound _and_ complete type inference http://en.wikipedia.org/wiki/BitC http://en.wikipedia.org/wiki/BitC
- raganwald 16y agoTrue, but Matz didn't know a lot of things about programming languages and luckily for me, he didn't care and reinvented them anyways.
- swannodette 16y agoTalking about static typing without investigating something like Haskell (as mentioned by others) seems limiting, particularly since Guido picked up a couple of things from Haskell like the list comprehensions presented in this post. And then you'll discover that Haskell's type system is limited as well. Learn some Qi - http://www.lambdassociates.org/qilisp.htm http://www.lambdassociates.org/qilisp.htm.
- efsavage 16y ago"A good example is "give me the square of all the items in this sequence who are divisible by 3"" A good example? Really? You get paid to write stuff like that? Because I don't. If you're going to promote a language as a better solution, try solving real problems. What happens when there's a string in the sequence? The C++ example solved that, why didn't your code?
- eru 16y agoHaskell also would solve it, by outlawing the occurence of strings at compile time.
- scott_s 16y agoI use C++, and I have a variety of utility functions defined. To do his task, first I already would have the following defined: template <class Pred, class Sequence> Sequence filter(Pred p, const Sequence& in) { Sequence out; for (typename Sequence::const_iterator i = in.begin(); i != in.end(); ++i) { if (p(*i)) { out.insert(out.end(), *i); } } return out; } And then I would do: bool is_div3(const int n) { return n % 3; } // in another scope result = filter(is_div3, seq); It's not how most people use C++, but my recent work has involved manipulating parse trees. I find the most natural way to do this is recursively using functional techniques, so I've built up a small set of functionaly inspired utility functions (https://github.com/scotts/cellgen/blob/master/src/utility.h https://github.com/scotts/cellgen/blob/master/src/utility.h). C++0x will let me use an anonymous function instead of having to define a function (or function object) for my predicate.
- jimwise 16y agoLooks like scala to me: def playwith_seq[A] (seq : Iterable[A]) : List[A] for (x <- seq if x % 3 == 0) yield x * x