| bio | website | |
|---|---|---|
| location | ||
| age | ||
| visits | member for | 2 years, 6 months |
| seen | 8 hours ago | |
| stats | profile views | 379 |
|
Apr 26 |
comment |
Does a programming language have to be compiled to be considered a programming language? @SK-logic Then it's a pretty bad presentation of that proof IMHO. See various other answers for how to make such points (not the exact same point, yeah) explicitly rather than in a manner reminiscent of satire, and hence vulnerable to Poe's law. But whatever, this is getting off topic. |
|
Apr 26 |
comment |
Does a programming language have to be compiled to be considered a programming language? @SK-logic You have to admit, you appear to be flip-flopping here. Why not point that out to begin with? ;-) |
|
Apr 26 |
comment |
Does a programming language have to be compiled to be considered a programming language? @IanCarroll Brainfuck is indeed a real language, though a so-called esoteric one. |
|
Apr 26 |
comment |
Does a programming language have to be compiled to be considered a programming language? @DavidThornley How does turing completeness even enter the picture? There's no mention of it in this answer (which isn't bad; many people ascribe far too much to it). |
|
Apr 26 |
comment |
Does a programming language have to be compiled to be considered a programming language? @SK-logic CSS 3 is turing complete, but that is a crude metric for whether it's a programming language (as you point out in another comment, at the very least it's not a necessary condition). Go ask around. Even after explaining its turing completeness, I'd wager most people would not consider them, because CSS is still neither intended for programming nor practically usable for it. |
|
Apr 26 |
comment |
Does a programming language have to be compiled to be considered a programming language? @JimmyHoffa Turing completeness is not the criteria by which most people decide if a computer language is a programming language. CSS 3 is turing complete. The game of life is turing complete. SQL (or at least the 90% used by most programmers) is not turing complete, but considered something of a programming language by many. But yeah, not all of these "indicators" (note that it's not "requirements") are present in all programming languages. |
|
Apr 26 |
answered | Does a programming language have to be compiled to be considered a programming language? |
|
Apr 23 |
revised |
Why do more languages not support === deleted 63 characters in body |
|
Apr 23 |
comment |
How is Nothing a subtype of every other type in Scala @JörgWMittag That's a different statement, and extremely arguable (I tend to agree that it's harmful, but I would not attribute this to a misunderstanding of typing). No point in discussing it here. |
|
Apr 23 |
comment |
How is Nothing a subtype of every other type in Scala @JörgWMittag The designers of Java and C# know that as they put interfaces in the respective languages. And the designers of C++ know that as C++ has numerous types which aren't classes. Now, many users of those languages confuse the two, but it's safe to say the designers are aware that Class is a subtype of Type. |
|
Apr 22 |
comment |
How do distributed version-control systems deal with fragmentation? That scenario is older than and independent from any DVCS. It's how Apache came to be IIRC. |
|
Apr 16 |
comment |
Is reverse debugging possible? I can't tell you if it means "really debugging backwards" because I don't know what you mean by "really debugging backwards" ;-) |
|
Apr 16 |
comment |
How can I say that programming language compiles to other languages? @teresko How so? The only way I could see you argue that is you using an overly restrictive and useless definition of compilation (which restricts the output to machine code). |
|
Apr 14 |
comment |
Are there any statically-typed Web scripting languages? @mikerobi Actually "mine" is C++ too (and AFAIK the successor of CINT), I just screwed up that bit. |
|
Apr 14 |
comment |
Are there any statically-typed Web scripting languages? @FlorianMargaine So C is a scripting language? |
|
Apr 14 |
comment |
Are there any statically-typed Web scripting languages? What kind of execution model are you looking for, interpreted but sufficiently restricted that a separate tool can perform useful static analysis? That would clash with the performance concern btw (no opportunity to optimize AOT). |
|
Apr 9 |
comment |
How to see bits of an integer in Visual Studio Hexadecimal is trivial to translate to binary (1 hex digit = 4 bits), so while you wait for a solution, hexadecimal is almost as good. |
|
Apr 9 |
comment |
Is this a Proper “Rule” for Identifying the “Big O” Notation of an Algorithm? O(2 N) is perfectly fine. It doesn't take a mathematician to see that it is well-defined and equal to O(N) - the analogy with 0.5 and 1/2 above is dead on. The only question is whether it is useful to write it out instead of automatically simplifying to (N). And I'd say it helps more than it hurts: It also tells the reader that there's a factor of 2 in the actual value, and that it's significant (e.g. that the algorithm consists of two O(N) operations from a high level view). It can make intent clearer, and the worst that can happen is that you have to remind beginners that O(2 N) = O(N). |
|
Apr 8 |
comment |
Applications of heapsort Um, isn't this just the heap data structure, not the sorting algorithm based on and named after said data structure? |
|
Apr 5 |
comment |
Why have a wrapper constructor when storing a function in a data type? @RobertHarvey Both monads and applicative functors are used to great effect for parsing. To keep with RWH, chapter 16 uses both styles. Yeah, if you're not gonna support either anyway (RWH ch. 10 apparently doesn't), it's kind of moot. But other examples of this "pattern" (such as State and ErrorT, as OP mentioned in another comment) are monads (or monad transformers, for ErrorT), and instances of numerous other type classes as well, so YANI - You Already Need It. |