PeCaN

22 ms·

181.
by PeCaN 8y ago
I like that this architecture tackles a large problem in existing architectures, which Mike Pall put rather nicely: > All modern and advanced compilers convert source code through various stages and representation into an internal data-f
182.
by PeCaN 8y ago
That wasn't a mistake, and Itanium did just fine. Circa 2008 the fastest database servers in the world ran on Itanium.
183.
by PeCaN 8y ago
Erlang has an amazing track record though. It's battle tested in telecom platforms and internet messaging. Also, I poked around BEAM a fair bit and it seemed just fine to me. It's pretty clean and easy to understand for a fairly c
184.
by PeCaN 8y ago
The difference is Psystar: 1) Was kind of a scam 2) Sold computers with OS X already installed 2 is the real violation that got them sued. Obviously it's legal to sell computers that are compatible with OS X. Selling them with OS X ins
185.
by PeCaN 8y ago
It achieved that in a similar way to the JVM though, architecture-independent bytecode. That said, it's still incredibly impressive that System/38 programs can run unmodified and without recompilation on modern POWER8 (soon POWER9
186.
by PeCaN 8y ago
Both are pretty over-engineered, but Maven has a drastically reduced "I want to pull all my hair out" factor. Also, be careful not to confused "over-engineered" with "works correctly in the face of edge cases".
187.
by PeCaN 8y ago
Sun literally bought the StrongTalk team to make StrongTalk into the JVM, so "pretty big influence" is something of an understatement.
188.
by PeCaN 8y ago
ATS is an amazing language, but suffers from being mainly a one-person effort. doublec's ATS articles are probably the most accessible introduction: https://bluishcoder.co.nz/tags/ats/index.html Other than th
189.
by PeCaN 8y ago
Frankly, I'd be surprised if they didn't already have that access.
190.
by PeCaN 8y ago
That's really cool and IMO a great use case for ReactOS. Sounds like a neat project. Did everything just work out of the box? If so that's pretty impressive on the part of ReactOS.
191.
by PeCaN 8y ago
I need to work on my disruptive startup's decentralized AI blockchain machine learning product using Vue.js from my car's infotainment system. Actually though pre-6.6 QNX had a great GUI and is capable of running on desktops and l
192.
by PeCaN 8y ago
I'd love to use Atom on a little QNX system, can you tell me where I can find the Atom distribution? It's possible to build Emacs on it.
193.
by PeCaN 8y ago
Unfortunately, matrix multiplication is the kind of thing where you often need it to be fast and scale to huge matrices. I like simple code as much as the next guy, but occasionally you do need to write fast code.
194.
by PeCaN 8y ago
No, not at all. Egyptian is its own branch of the Afro-Asiatic languages, not particularly close to any Semitic language and today preserved in the form of Coptic as a liturgical language. Ethiopian (presumably referring to Ge'ez) is a
195.
by PeCaN 8y ago
> I'll speculate that the solution will involve blockchains and a new, more minimal, totally decentralized legal system. ok
196.
by PeCaN 8y ago
>It's on a computer. It is a database. So if I print it out is it not a database anymore?
197.
by PeCaN 8y ago
Honest question, does MongoDB work?
198.
by PeCaN 9y ago
Rhino (JavaScript on the JVM, originally written by Mozilla) dates back to 1997 and JRuby to 2001. Suffice it to say, dynamic languages have ran on the JVM for 20 years. Reflection used to be used to implement dynamic types, but since Java
199.
by PeCaN 9y ago
Tcl had event-driven programming much longer than JavaScript (and much more pleasant). I think Erlang may have been the first production platform to do it, but I'm not sure about that. I suspect the idea has been around for a very lo
200.
by PeCaN 9y ago
>Serif fonts have objectively better readability This claim is often repeated but questionable at best. >subjectively they're much prettier than anything else They might be pretty to you (and this is such a subjective claim tha
201.
by PeCaN 9y ago
Yes, someone wrote an APL-to-ArrayFire compiler in APL. https://news.ycombinator.com/item?id=13797797 It's really pleasant to program in APL once you get used to it. I would put it on the same level of ease and pure f
202.
by PeCaN 9y ago
Oh hey, I've used qp-tries in an interpreter for a Forth-like language. They're really elegant IMO. Thanks for publicizing and implementing your discovery!
203.
by PeCaN 9y ago
Ostensibly there are dozens, since it feels like everyone makes their own…. Honestly most of the time I use autotools. I hate autotools, but it breaks less often and is usually easier to fix when it does. CMake will occasionally just refuse
204.
by PeCaN 9y ago
I really want to like CLion (it's pretty good, honestly) except I cannot stand CMake as a build system. Being able to use Kotlin Native with it sounds quite nice, because then I don't have to deal with CMake. It's a pretty so
205.
by PeCaN 9y ago
As of a few years ago the DPT-RP1 isn't even available in the US anymore, only Japan.
206.
by PeCaN 9y ago
I boot it up in virtualbox periodically and play with it. Setting up the clustering and dragging Photon windows between two VMs is really satisfying. I wish RIM/Blackberry hadn't bought it, closed the source¹, and killed off Photo
207.
by PeCaN 9y ago
Remember the QNX 4.25 demo disk that fit on a single 3.5 floppy and included a GUI, networking, a web browser (with basic javascript), clustering, and various other applications? What a great little OS.
208.
by PeCaN 9y ago
> Thus, fully populating a 128-bit storage pool would, literally, require more energy than boiling the oceans. So we should be good until OceanCoin is introduced.
209.
by PeCaN 9y ago
Well, that list of languages got me interested. It'll be interesting to see where you're going with this. I think I'll check out the source a bit. I've been itching to hack on another GC for a while now. Thanks!
210.
by PeCaN 9y ago
This also conveniently allows you to store the length at the "real" base. 0 array length <--- base pointer 1 element 1 <--- array[1] == *(base + 1) 2 element 2 <--- array[2] == *(base + 2)

More ›