wingo

7 ms·

1.
Structure and Interpretation of Ark(wingolog.org)
1 points by wingo 3y ago|0 comments
2.
by wingo 12y ago
Igalia, http://www.igalia.com/ -- 40+ people, 11 or 12 years old (I forget!). A few articles I wrote on working at Igalia last year: http://wingolog.org/archives/2013/06/05/no-master ht
3.
by wingo 13y ago
GC needs to know about all references in the program. If the mutator (the program) is running concurrently with the collector, it's difficult (though not impossible) for the collector to construct this consistent view. Here is a good
4.
by wingo 13y ago
That's certainly the case for full CPS, but using a CPS intermediate language does not imply call/cc. Indeed Kennedy targeted the .Net CIL; a direct-style VM. The important thing to note is that continuations and functions can b
5.
by wingo 13y ago
I recommend Andrew Kennedy's "Compiling with Continuations, Continued" article if you are actually interested in using continuations in a production compiler. Might's formulation of CPS is good for analysis but not actu
6.
by wingo 13y ago
They play this video while you wait for the train to take you up to that glacier (the mer de glace). I stared at it gapemouthed for some time!
7.
by wingo 13y ago
I'm pretty impressed, and especially by the apachebench test -- to serve a spike of 30K reqs/s while having 600K idle connections is quite good.
8.
by wingo 14y ago
You already have a programming language in your makefiles. http://okmij.org/ftp/Computation/#Makefile-functional
9.
by wingo 14y ago
AFAIUI libc is in the initrd, but it's a statically linked libc. Guile's dynamic FFI uses dlopen/dlsym to get its function pointers, so it can't do that in a statically linked libc. (Or could it? I suppose there's no reason why a statica
10.
by wingo 14y ago
You can redirect the control-flow of the program by overwriting a return address or a vtable. Once you've done that, it's easiest if you can redirect control to code you've written, in executable heap; but if that's not possible, you can s
11.
Localhost port scanner(wingolog.org)
1 points by wingo 14y ago|0 comments
12.
by wingo 14y ago
Sure, it's possible. The sequence of multiplications chosen to reach the exponent is different, so these expressions take different paths through scm_integer_expt.
13.
by wingo 14y ago
http://git.savannah.gnu.org/gitweb/?p=guile.git;a=commit;h=2... Fixed by Mark H Weaver, on Fri, 7 Dec 2012. Avoid signed integer overflow in scm_product * libguile/numbers.c (scm_product): Avoid signed integer overflow, which modern C c
14.
by wingo 14y ago
Sounds like your problem is more that Scheme is too small for the programs you'd like to write. Implementations that are adequate to your needs being incompatible with each other is a natural side effect. The new standard will help margina
15.
by wingo 14y ago
An interesting perspective here: "MCNP is written in the style of Dr. Thomas N. K. Godfrey, the principal MCNP programmer from 1975-1989 ... All variables local to a routine are no more than two characters in length, and all COMMON variable
16.
Postcards from the post-XSS world(lcamtuf.coredump.cx)
3 points by wingo 14y ago|0 comments
17.
by wingo 14y ago
Well, I guess the one thing I would correct is the "why". The LLInt doesn't just produce assembler to be fast, though it is faster than the old interpreter. The real reason it produces assembler is to control the stack representation, so
18.
by wingo 14y ago
No offense intended, but this comment does not add very much while misunderstanding some other things. For example, I did not write the LLInt. It was mostly written by Apple's Filip Pizlo. If this is the sort of topic you are interested i
19.
by wingo 14y ago
How does such a touching, honest article get such terrible comments? (Referring to the comments on the author's blog.) In any case I don't see why anyone would allow such lampreys to suck the life of their own web page.
20.
by wingo 14y ago
Nice work, and (as another fastmail.fm user) thank you for the responsible disclosure. May it amply repay you in consulting gigs :) Regarding the script injection from image file names, there is a simple solution to this problem: separate
21.
Inline cache applications in Scheme(wingolog.org)
7 points by wingo 14y ago|0 comments
22.
by wingo 14y ago
Fold is implicitly sequential. See Guy Steele's ICFP 09 presentation on conc lists, previously discussed here as http://news.ycombinator.com/item?id=814632 .
23.
by wingo 14y ago
I look forward to seeing articles on Moore's work; I did not have the pleasure of knowing him. In the meantime, this headline had me a little confused, thinking of the chip designer Chuck Moore who was Forth's creator. It doesn't seem that
24.
by wingo 14y ago
Besides what sdcooke said, ad networks also use the HTTP requests to track users. Embedding the ad in the (third-party) page defeats that purpose.
25.
TCP Slow Start(packetlife.net)
4 points by wingo 14y ago|0 comments
26.
by wingo 14y ago
> The fix is straightforward: just use a strict pair type for nested accumulators: Uf. Haskell impresses me a lot, but it seems that performance-wise, it would be better if it were strict by default.
27.
by wingo 15y ago
A form of this will probably be in ES6: http://people.mozilla.org/~jorendorff/es6-draft.html#sec-11....
28.
by wingo 15y ago
Much love for lisp machines, but stack machines do not offer any performance advantages over register machines, and actually make optimization much harder. See Ungar's 1993 thesis on the Self 93 compiler for an early realization of this, w
29.
by wingo 15y ago
Dunno, Paul. While SPJ does have a lot of relevance to current computing, his work is not a product like Etherpad was. I haven't seen YC companies moving towards or staying with fringe languages -- not that I criticize that business decis
30.
by wingo 15y ago
Lovely article! I wonder though, how do you know that is parsing time? There are a number of things happening when JS is loaded, and parsing is only one of them. Also, an update on that article would probably be useful -- a number of thing

More ›