Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
T-R
searching Neon…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
7 ms
·
91.
▲
by
T-R
11y ago
You might be interested in looking at Gabriel Gonzalez' Morte ( http://begriffs.com/posts/2015-10-16-internet-of-code.html ), which started off as a supercompiler project, but seems to be moving somewhat in that d
92.
▲
by
T-R
11y ago
> Though HTTP proxies are dead thanks to HTTPS Well, they're not as broadly useful as without HTTPS, but you can still always MITM yourself to get a free transparent caching layer between the client and your end server.
93.
▲
by
T-R
11y ago
It may be worth looking into HTTP 2. While it may or may not be supported widely enough for production yet, it provides for things like "server push", which should allow you to minimize network round trips while keeping components
94.
▲
by
T-R
11y ago
It's great that GraphQL's solved some of your issues, and you've encouraged me to look into it a bit more. One thing you should worry about, though - if at any point there's any user-specific data in an HTTP response tha
95.
▲
by
T-R
11y ago
I'd interpret this a bit differently - levels with good design are likely to be few and far between, since good level design is a skill. Moreover, you can't really communicate "has good design" well in a title or with st
96.
▲
by
T-R
11y ago
Talk about the practical benefits you can get, and decide based off of those: - GET requests are supposed to be idempotent so they can be transparently cached by caching proxies. Even if you won't be taking advantage of caching proxies
97.
▲
by
T-R
11y ago
To add another way to look at it (thinking of a function as a set of tuples): With tuples (A,B), you're listing As uniquely paired with Bs With functions (A -> B), you're listnig unique sets of (As non-uniquely paired with Bs
98.
▲
by
T-R
11y ago
My basic strategy is that component composition gives you more leverage than memorizing individual words. Most languages have some degree of composition for vocabulary, like root-words, prefixes/suffixes, or individual chinese characte
99.
▲
by
T-R
11y ago
That's part of it. For IO/State, the idea is basically, if you wite a function that does something, you have to test it by doing that thing, so, instead, let's write recipes to do things, and then run them (recipes here j
100.
▲
by
T-R
11y ago
For Monad, 'join' or the kleisli arrow (>=>) might give better intuition than bind/flatMap - maybe something like "contextComposable": kleisli arrow in the Identity monad is just function composition, and for
101.
▲
by
T-R
11y ago
Surprised no one's brought up Haskell's Debug.Trace, which effectively does this, but returning whichever value you tell it to.
102.
▲
by
T-R
12y ago
My understanding is that it's not a proper category due to the presence of Bottom - https://wiki.haskell.org/Bottom > Bottom is a member of any type, even the trivial type () [...] If it were not, the compiler could
103.
▲
by
T-R
12y ago
That sounds fantastic. I'll give it a look
104.
▲
by
T-R
12y ago
When you say "NoSQL-Koolaid free", do you mean "focuses on Relational" or "treats the topic objectively/academically"?
105.
▲
by
T-R
12y ago
Just taking a quick glance through the table of contents, it looks like it aims to focus more on "how to think about problems in this paradigm" (as the title implies) than the more practically-oriented "let's go write fi
106.
▲
by
T-R
12y ago
But that's a pretty low bar. Using just 'pure', can you mutate an argument in a function called in a conditional expression (making it unsafe to check again)? Can it matter what order a list gets processed in a call to `map`
107.
▲
by
T-R
12y ago
I'm not saying it isn't - it's certainly good that it's also possible to declare something as referentially transparent, but defining the keyword "pure" to imply something much less than referential transparenc
108.
▲
by
T-R
12y ago
That still means the function can't be treated as referentially transparent (whereas a Haskell function with debug output still can be, for the most part). Don't get me wrong, that's still somewhat useful - it tells me "
109.
▲
by
T-R
12y ago
These kinds of tricks actually are being done: by the compiler (as long as you give it enough information and don't try to outsmart it) - they're exactly what gets put into optimization passes. Trying to do these optimizations by
110.
▲
by
T-R
12y ago
One of my side projects is very similar: I built a recursive descent disassembler for Gameboy that I'm working on building into a decompiler. I took a slightly different approach - rather than generate assembly, I generate a call graph
111.
▲
by
T-R
12y ago
If split screens are your thing, it might be worth it to try a Tiling Window Manager. I agree with you that Sublime doesn't natively have enough split screens, so I use XMonad, and split them and organize them as I please.
112.
▲
by
T-R
12y ago
This was the first thing that struck me as well - just fantastic level/game design. Immediately brought to mind the instructional level design from Super Mario Bros - http://www.theoryofgaming.com/gold-standard-for-game
113.
▲
by
T-R
12y ago
I think he might be referring to Mario Bros VGA - http://www.abandonia.com/games/880/MarioBrothersVGA
114.
▲
by
T-R
12y ago
The SMB3 mini-game was based on the original Mario Bros; The author describes Punch Ball as a distinct game: > This is almost identical to the original Mario Bros, except you can't knock enemies upside down by hitting the platform t
115.
▲
by
T-R
12y ago
I wasn't aware of that, that's good to hear. I'm under the impression, though, that since SPDY encrypts everything , that you can't get caching at intermediate nodes unless you explicitly MITM yourself, which would redu
116.
▲
by
T-R
12y ago
I really do wish HTTP had a mechanism for responding to a single request with multiple combined response bodies as if requests were made for each individually (from the perspective of, e.g., a caching proxy) - the loss of separation of conc
117.
▲
by
T-R
12y ago
> I'd argue that in REST it would be desirable that resource representations do do that (provide [...] the direct locations of any embedded subentities that are separate addressable). You could actually go a step further - if you&#x
118.
▲
by
T-R
12y ago
That's fantastic. I'd been thinking about modifying an emulator to do automatic speedrun splits based on changes in memory. Many of the people who'd most appreciate that kind of thing prefer to speedrun on original hardware,
119.
▲
by
T-R
12y ago
Thanks for this - I've bookmarked it to read later. It looks like you've explained everything pretty thoroughly in the readme, and looks like an excellent example for getting started.
120.
▲
by
T-R
12y ago
I think this past month has been a bit of an outlier with new languages, such as Avail, being posted. That said, I wouldn't count Idris as one of them - it's been around for a little while now, and in the community of people famil
More ›