ericbb

17 ms·

31.
by ericbb 11y ago
Check out this Scientific American article[1], especially the video of a presentation given by Voevodsky. Edit: Here's a more direct page[2] if you just want the video. [1] http://blogs.scientificamerican.com/guest-blog
32.
by ericbb 11y ago
Here's a title for a rebuttal in case anybody wants to write it. ;) The Tragedy of ISLISP, Or, Why Small Languages Implode
33.
by ericbb 11y ago
For what it's worth, as someone who currently favours the public domain over copyright for his work, I will say that it's not especially because I think that it's simpler to choose the public domain; it's because I'
34.
by ericbb 11y ago
I'm curious, why don't you place your works into the public domain?
35.
by ericbb 11y ago
I love that he links to an annotated bibliography at the end. One related resource that I can recommend is Digital Geometry Processing with Discrete Exterior Calculus: http://www.cs.columbia.edu/~keenan/Projects/DG
36.
by ericbb 12y ago
Reading that article inspired me to write a little generic recursion library. The idea is that you'd write a 'map' function for each recursive data structure and then generate recursive functions from non-recursive functions
37.
by ericbb 13y ago
I'm in the midst of reading Types and Programming Languages right now. I'm also reading the more recent Practical Foundations for Programming Languages by Robert Harper. It's written for a similar audience. I would recommend
38.
by ericbb 13y ago
The simulation is always buggy. Don't you watch movies? ;)
39.
by ericbb 13y ago
If you like Pascal, then Compiler Construction, by Niklaus Wirth is certainly also worth a look: http://www.ethoberon.ethz.ch/WirthPubl/CBEAll.pdf Easy to read, concise, and good for beginners.
40.
by ericbb 13y ago
Here are a few, in no particular order: Ur-Scheme: http://canonical.org/~kragen/sw/urscheme/ An Incremental Approach to Compiler Construction: http://scheme2006.cs.uchicago.edu/11-ghuloum.pdf
41.
by ericbb 13y ago
I first saw that sampling technique in The Practice of Programming by Kernighan and Pike. It's used in their Markov Chain example.
42.
by ericbb 13y ago
The Gish source code does that too. https://github.com/blinry/gish
43.
by ericbb 13y ago
> LT will be open source, ... The licensing situation is really unclear. The Kickstarter page says, "In order to download packaged distributions, you'll need a license". But I expect that, if it's open source, I can get a packaged distr
44.
by ericbb 13y ago
My understanding of types took a big step forward when I read some of Robert Harper's stuff. In particular, the blog post, Dynamic Languages are Static Languages, and his book, Practical Foundations for Programming Languages. (The book is a
45.
by ericbb 13y ago
> Unix pipes are awesome and all, but chaining any more than 3 commands gets a little confusing with all of the parameters. That's what abstraction is for. Make a shell script that hides some of the complexity and substitute the script
46.
by ericbb 13y ago
> - It's hard to visualize the output at the intermediate steps of the chain. So if you have "cmd1 | cmd2 | cmd3", you'd have to spend more effort than it has to be in order to see what cmd2 and cmd3 got as input. cmd1 | tee input2 | cm
47.
by ericbb 13y ago
If /usr/include were dropped and /usr/lib only contained Go packages, then you'd have an ecosystem where library namespaces are handled in a scalable way--that's a pretty big deal. You'd be working in a statically linked environment rather
48.
by ericbb 13y ago
And, of course, "Debunking the 'Expensive Procedure Call' Myth, or, Procedure Call Implementations Considered Harmful, or, Lambda: The Ultimate GOTO" by Guy Steele. Available here: http://library.readscheme.org/page1.html
49.
by ericbb 13y ago
Or follow Alef ( http://www.cs.bell-labs.com/who/rsc/thread/ug.pdf ) and use "become". The Alef become statement is a kind of generalized tail-call form because you can use it to drop the current stack frame from anywhere, not just in tail-
50.
by ericbb 14y ago
The pinhole aremac idea is so elegant! Infinite field of view and no need to measure the eye's lens. I wonder if video games and head-mounted displays designed for gaming will one day take advantage of that.
51.
by ericbb 14y ago
Small rant ahead. You have been warned. My favorite system that supports hot-swapping is Linux. It works with every language, there is an excellent scheduler, processes are protected from each other, there are all kinds of interprocess comm
52.
by ericbb 14y ago
Edit 2: I ended up doing the translation from the Python article. ;) http://play.golang.org/p/ep8wK_UUGm It's pretty straightforward I think. One subtlety is that goroutines are not values and won't be garbage collected until they return.
53.
by ericbb 14y ago
If I were writing unwrap_protocol in Go, my first take would probably to use an io.ByteReader interface constructed using bufio.NewReader(bytes). The function can then use ReadByte as needed to consume the stream. Apologies if I'm overlooki
54.
by ericbb 14y ago
I was going to translate the example to Go but it's such an uninspiring example because the frame_receiver "coroutine" has no state and might as well have been a simple procedure. For an simple example--written in many languages including P
55.
by ericbb 14y ago
It's interesting to contrast this design with what Rob Pike presented in his talk on the Go template lexer. Some differences: (1) Pike's is more static: there is no Machine struct and states are identified with handlers so that there is no
56.
by ericbb 14y ago
Incidentally, I don't think it's entirely true that "there isn't any pointer math". I've never used it but I understand that you can do C-like pointer tricks by using the package called "unsafe": http://golang.org/pkg/unsafe/ and http://
57.
by ericbb 14y ago
The utopian ideal that is relevant here is the ideal that information should never be considered property. So you can't properly claim to be one of the utopian idealists while using the words "theft" and "stealing" here.
58.
by ericbb 14y ago
I'm not big on IDEs either but how can you dislike revision control?
59.
by ericbb 14y ago
It's not about escape analysis. The programmer explicitly specifies when to use pointers. Whenever pointers are not used, the object is stored in-place (for example, on the stack, in the array or slice, or in the struct).
60.
by ericbb 14y ago
You see the JVM as an asset. Many consider it a liability. And programmers in the New Jersey school (see Worse is Better) are unlikely to ever stomach Clojure. These differences are more in the realm of deep allegiances and HN comments will

More ›