andolanra

17 ms·

91.
by andolanra 10y ago
The link you provided has no information as to whether that's a correct etymology or not, only that 月食 yuèshí is made up of characters 月 yuè 'moon' and 食 shí 'eat'. There are numerous other explanations for wh
92.
by andolanra 10y ago
It looks like data declarations get translated to immutable subclasses of collections.namedtuple in such a way that you can match on the resulting values. So it's really less like an algebraic data type and more like one of Scala&#
93.
by andolanra 10y ago
jq is powerful enough to express it in one query: it has variables (using expr as name ) which make this thing at least vaguely feasible. That doesn't mean you should, but you could : .models | (.[] | if .title ==
94.
by andolanra 11y ago
I'm not actually sure whether this actually helps with the problem described in the post, but such a thing does exist: https://github.com/guardianproject/libsqlfs
95.
by andolanra 11y ago
Terra is lower-level, and on evaluation compiles to object code. Lua is higher-level, and on evaluation compiles to bytecode before being executed. A source file written entirely in Terra would produce a binary, and a source file written in
96.
by andolanra 11y ago
I mean, the multiple-ways-to-do-things bit is possible in any language. Even Python, with its guiding principle that 'there's only one way to do it', would allow you to do it in different ways: def factorial(n):
97.
by andolanra 11y ago
The story, if I recall correctly, is that the programmer Edwin Brady had a previous project that was a proof engine, and lacking a suitable name for it, named after an older British children's cartoon called Ivor the Engine.[^1] When i
98.
by andolanra 11y ago
A very cool paper! But it has in fact been superseded by subsequent research: the actual number of tie-knots is much larger—at least in the tens of thousands. The insights that led to that research on top of the Fink and Mao paper are descr
99.
by andolanra 11y ago
PEGs can sometimes be pretty unintuitive. For example, consider the grammar ("a" / "aa") "a" in a traditional BNF setting, this grammar could match the string aa or the string aaa . However, th
100.
by andolanra 11y ago
Wilkins' book describes a universal language , which is not at all the same thing as linguistic universals . Wilkins was trying to derive a language in which each word functioned as an index into a universal ontology of concepts, so
101.
by andolanra 11y ago
There's a hidden premise in your argument that I would argue is false, and that's that programming languages should attempt to emulate the same principles as natural languages. Programming languages and natural languages do not at
102.
by andolanra 11y ago
No, the implications are actually quite small. This article is a very bad pop-science summary of relatively banal linguistic research. Linguists have studied linguistic universals for a long time, which are properties that all human langu
103.
by andolanra 11y ago
There's also Void Linux, which has musl and glibc versions of packages and offers both musl-based and glibc-based download images: http://www.voidlinux.eu/
104.
by andolanra 11y ago
If you're using something that generates a parser for you—like bison or yacc—then sure, you can express your grammar like that, and there are advantages to doing so. On the other hand, if you don't have something like that availab
105.
by andolanra 11y ago
You can have manual control over memory if you want, though. This worked the last time I looked at the language, at least: foo = cast[ptr Foo](alloc(sizeof(Foo))) # do stuff with foo dealloc(foo) EDIT: Here's the docum
106.
by andolanra 11y ago
There's a Rust client in the making called Hematite[1], but it currently will only allow you to move around static worlds, with no other interaction. The focus so far has been on making the rendering as close to pixel-per-pixel identic
107.
by andolanra 11y ago
The proposed OCaml implementation of modular implicits[1] considers ambiguity a compile-time error, so in that case you'd have to manually indicate which module you're passing in. (This is in contrast to Scala, in which there&#x27
108.
by andolanra 11y ago
We could in fact write mkMap in Idris with very little change, and give it a proper type: -- This might not be the best/cleanest way of writing it, as my -- Idris is a little rusty, but this will work: mkMap : (size: In
109.
by andolanra 11y ago
That type means something slightly different: (Map m) => Int -> m doesn't mean that it returns some Map type, it means it returns any Map type. We could write a function of that signature, but that would imply that the call
110.
by andolanra 11y ago
There are very much ways of expressing that computation in SML—or in Haskell or other languages—but not in the language of modules . Haskell typeclasses would have a similar problem. Consider the following pseudocode: class Map m whe
111.
by andolanra 11y ago
One of the classic motivating examples (which is addressed in the 1ML paper) goes like this: Both trees and hash tables can be used to implement map-like data structures. You could, in ML, have an abstract signature for Map types that get
112.
by andolanra 12y ago
I'd argue that your "spectrum" misses where emacs really shines: nobody really bothers to reconfigure Eclipse or Netbeans as their mail client or web browser, whereas this is not entirely unusual with emacs. This is because e
113.
by andolanra 12y ago
This is the kind of thing which could very easily turn into a flame war, and is much further off-topic. I'm not interested in that kind of argument right now, so all I will say in this thread is this: My personal experience with Less W
114.
by andolanra 12y ago
I read well through chapter 70. I did imply that scientific investigation shows up a little , after all! I agree that the line people gave me wasn't correct, but I've heard that line enough that I felt it was appropriate to dispe
115.
by andolanra 12y ago
I have been following someone's critical chapter-by-chapter criticism of HPMOR for some time now, which might be illustrative. It is admittedly quite long: http://su3su2u1.tumblr.com/tagged/Hariezer-Yudotter/c
116.
by andolanra 12y ago
There's a lambda-calculus-like core to Lisps, but there's enough on top that I'm not comfortable saying that Lisp implementations are "just the lambda calculus." As for indentation-based syntax, there is a Scheme SR
117.
by andolanra 12y ago
I don't think there were too many people in that debate who were dissatisfied with the idea of a new init system. People were dissatisfied with systemd specifically , because of various architectural choices that it made. The fact tha
118.
by andolanra 12y ago
I see this used a lot with enums to make a kind of 'homogeneous struct' where all the members have the same type: enum fields = { x, y, z }; int point[] = { [x] = 1, [y] = 2, [z] = 3 }; This is u
119.
by andolanra 12y ago
That's already how it works. You could run your own node and share information back and forth with other nodes, or you could use an account on an existing node. This is clearly the case: if you go to the C2 Federated Wiki, you'll
120.
by andolanra 12y ago
It's all still there: http://c2.com/cgi/wiki I assume they'll move it over to the Federated wiki at some point, but you can still view everything on the old wiki.

More ›