Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
sb
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
23 ms
·
241.
▲
by
sb
17y ago
For me, the same observation holds true for bandwidth. I have had the same bandwidth for a couple of years and see just no reason to upgrade. A 100Mbit (assumed though not explicitly mentioned in the article) line seems just out of reach fo
242.
▲
by
sb
17y ago
A very interesting article by the creator of quicksort on his contribution of axiomantic semantics to programming languages (the infamous Hoare triple {P}Q{S} [ 1 ]). What strikes me as most interesting is his idea in chosing software verif
243.
▲
by
sb
17y ago
hi, obviously you have more experience here--I have just provided details straight from memory and did not want to disseminate misinformation and apologize if you or anyone else got that impression. Many of the lock-free algorithms use CAS
244.
▲
by
sb
17y ago
AFAIR/CT the following paper might be of interest to you: Jeremy Siek, Walid Taha: "Gradual Typing for Functional Languages", 2006 http://www.cs.colorado.edu/~siek/pubs/pubs/2006/siek06:_grad...
245.
▲
by
sb
17y ago
Read this and understand where the (justified) fear comes from: http://lambda-the-ultimate.org/node/3522 Personally, I am happy that those pieces of source code appear with a big time delay; probably I wouldn't drive a car knowing details
246.
▲
by
sb
17y ago
This is a classic amongst the EWDs. It contains many brilliant quotes on the state of computing science in that era, shortly before he left the Netherlands for teaching at the University of Texas at Austin. His view of "software engineering
247.
▲
by
sb
17y ago
jfyi: CAS is the abbreviation of Compare-And-Swap, which are dedicated native machine instructions that offer atomicity and therefore simplify locking.
248.
▲
by
sb
17y ago
I had really strong tendonitis (endured 1 month of pain) and this is what I did: * Got hardware: Kinesis Freestyle (which is not the Advantage, but still highly recommended!) and the Kensington Expert Mouse (which is probably the best track
249.
▲
by
sb
17y ago
I am usually the last one to even read language flame wars, let alone participate in them, but how exactly are Eiffel, Forth and Pascal fatally flawed?
250.
▲
by
sb
17y ago
Hm, while reading the article I noticed an interesting aside of this theory, similarly to yours: Assume it is correct, then your need to compete will make all the difference it takes: Have double the amount of helpers so as to reduce waitin
251.
▲
by
sb
17y ago
I think it's a very good article detailing the various flaws of C++; I particularly have problems with the complexity of the languages making it very difficult for compiler writers to generate usable error messages (not only true for gcc as
252.
▲
by
sb
17y ago
one of the best texts around is "the art of prolog, advanced programming techniques" 2nd edition, by leon sterling and ehud shapiro. however, by now, it seems a bit dated (e.g. on the constraint logic programming side), so there is another
253.
▲
by
sb
17y ago
afair, the most important optimization there is that something can be allocated on the stack instead of the heap, which is quite an optimization. EDIT: it does not actually have anything to do what you can stick in registers--at least nothi
254.
▲
Intel Research Programming System Seminars (feat. Alan Kay, and many more)
(irbseminars.intel-research.net)
14 points
by
sb
17y ago
|
0 comments
255.
▲
by
sb
17y ago
aside of alan kay, ian piumarta is working at vpri at cola (common object lambda abstration) and ometa right now. i recently posted a relevant video of alan kay's talk at intel's berkeley research lab on the topic of programming languages:
256.
▲
by
sb
17y ago
an interesting article in similar vain: niklaus wirth's "good ideas, through the looking glass".
257.
▲
by
sb
17y ago
just for the record since nobody else mentioned it: if you find this kind of material interesting/relevant, you may very well check with "velocity" conferences and their presentations (which are available online--or were for last years conf
258.
▲
by
sb
17y ago
having sources of important systems widely (and publicly!) available as "common goods" would be a very good idea for people to learn and read what has been done in the past and how they did it. it is admittedly very difficult to effectively
259.
▲
by
sb
17y ago
hi, the comment is not meant in /that/ way; rather APL used special symbols for representing functions/operations, i.e., it had its own non-ASCII character set (google for details) AFAIR, there was also a java programming puzzler with unico
260.
▲
by
sb
17y ago
my general lack of interest in shopping (or being from europe--difficult to judge from the inside...), i have never actually heard of zappos before the amazon acquisition. could some guys from the us briefly explain what's so great about za
261.
▲
by
sb
17y ago
regarding use of advanced techniques my experience is mostly limited to lectures i attended (several on model checking, automated theorem proving, analysis and verification, and one on verification of compilers). i figure the field is somew
262.
▲
by
sb
17y ago
from personal experience i have none* (since i would have to have written the same software system twice [using the past experience from either way makes this mutually exclusive]). but a simple "productivity formal methods" query on scholar
263.
▲
by
sb
17y ago
i am a tad bit unsure that your thought experiment "nails" it. actually, my interpretation of dijkstra's work is that these questions are the beginning of the problems that are so immanent in our business. regarding point 2: from my experie
264.
▲
by
sb
17y ago
anybody interested should probably consider hakmem, too. http://inwap.com/pdp10/hbaker/hakmem/hakmem.html and probably alan mycrofts more useful c-interpretation: http://www.cl.cam.ac.uk/~am21/hakmemc.html
265.
▲
by
sb
17y ago
I second "Programming Language Pragmatics" it is a fantastic book, and he is a very good writer, with illustrative examples and just the right balance between breadth/depth.
266.
▲
by
sb
17y ago
hi there, thanks for all the work; i came across the quote a couple of years ago (i believe google was not even "big" then) and never bothered to check back (for this post i just googled and found a couple of attributes, just for reassuranc
267.
▲
by
sb
17y ago
i don't know if you know, but there is a great quote concerning at least a partial aspect of the argument: The greater danger for most of us is not that our aim is too high and we miss it, but that it is too low and we reach it. --m
268.
▲
by
sb
17y ago
concerning your second point: you're absolutely right, there are a couple of direct compilation systems (without interpreters). for example, the cacao jvm for dec alphas (afaik) used to be a jit compiler without an interpreter (but they add
269.
▲
by
sb
17y ago
yeah, i think i know what you mean, there are two ways: 1) explicit top of stack elements (e.g. the a-stack architecture of ocaml always keeps the TOS element in a register) 2) implicit top of stack element handling; the technique is called
270.
▲
by
sb
17y ago
is a very interesting read, for those who are too lazy or just looking for a gist, here it is: instead of using the prevalent stack-based interpreter architecture, register based interpreters need fewer instructions, since all those load &#
More ›