Going by the example in the Github, it looks like a right-to-left Lisp with Arabic keywords. Does that fully describe the language or is there more to it than that?
I’d be interested in hearing about the parts that are more influenced by Arabic than Scheme. Are there any beyond the keyword language and writing direction? Like a new keyword that does something useful but has no equivalent in Scheme because the concept isn’t easily expressed by an English keyword?
As someone who knows very little about Scheme or Arabic, what are some aspects of this language that might be novel or interesting to someone with a background in mainstream languages?
That texture healing looks super nice. Is that something fonts can just do or does it require special editor support?
I might buy more from Epic if their launcher weren’t So. Freaking. Slow. Even claiming the free game is such a chore that I can’t be bothered to do it. It takes several minutes to load, responds sluggishly, and lags everything else on my computer the whole time it’s running. The only game I play from them anymore is Celeste because I can start it without ever going through the launcher.
Seconding this request, this is the number one thing that has me keep going back to other apps.
If you don’t need to reuse the collection or access its items out of order, you can also use Iterable which accepts even more inputs like generators.
Out of curiosity, what is that spoilered book?
…What are they actually launching though? I mean I love the payment scheme but I can’t get excited over this without an actual good product being sold.
Do people actually use Epic? I wasn’t much of a gamer before and didn’t care for Steam, and my first real exposure to PC gaming was when Epic started their weekly giveaway of free games. I made an account, discovered some cool titles, and could have been a happy customer if only their launcher weren’t so ridiculously slow. Now I can barely even stand opening the launcher to collect the free game, let alone trying to browse for games to buy.
The one case where I prefer video is when I know next to nothing about the topic and the other choice is mediocre to low-quality writing. Most people aren’t great technical writers, and it’s easy to skip over steps either because the writer assumes too much prior knowledge or simply because it takes effort to put that information in. On the other hand, videos are the opposite where it takes effort to cut stuff out, so you usually get all the steps which is what I need when I don’t know anything.
If I have the option of a well-written, step-by-step tutorial though, or if I already know the topic and have a vague idea of what I’m looking for, then text is much better for being able to search/skim/go back and forth at my own pace.
I guess it depends on what you mean by using monads, but you can have a monadic result type without introducing a concrete monad abstraction that it implements.
At a library level, couldn’t you have an opaque sum type where the only thing you can do with it is call a match method that requires a function pointer for each possible variant of the sum type? It’d be pretty cursed to use but at least it wouldn’t require compiler plugins.
Really? I would argue that pocket calculators are AI
The behavior is defined; the behavior is whatever the processor does when you read memory from address 0.
If that were true, there would be no problem. Unfortunately, what actually happens is that compilers use the undefined behavior as an excuse to mangle your program far beyond what mere variation in processor behavior could cause, in the name of optimization. In the kernel bug, the issue wasn’t that the null pointer dereference was undefined per se, the real issue was that the subsequent null check got optimized out because of the previous undefined behavior.
Do you care about modeling the cells? If not, you could represent each row with just a number. When X plays, add 1 to all the rows that include the position they played, and when O plays, subtract 1. If any row reaches +3 or -3, that player wins.
As for rotation/reflection invariance, that seems more like a math problem than a Rust problem.
My main point is that PRQL makes no distinction. If you didn’t inspect that SQL output and already know about the difference between WHERE and HAVING, you would have no idea, because in PRQL they’re both just “filter”.
Hmm, I have to disagree here. PRQL has no distinction in keyword, but it does have a distinction in where the filter goes relative to the aggregation. Given that the literal distinction being made is whether the filter happens before or after the aggregation, PRQL’s position-based distinction seems a lot clearer than SQL’s keyword-based distinction. Instead seeing two different keywords, remembering that one happens before the aggregation and the other after, then deducing the performance impacts from that, you just immediately see that one comes before the aggregation and the other after then deduce the performance impacts.
As far as removing arbitrary SQL features, I agree that that is it’s main advantage. However, I think either the developers or else the users of PRQL will discover that far fewer of SQL’s complexities are arbitrary than you might first assume.
That’s fair, I was just thinking of things that frustrate me with SQL, but I admittedly haven’t thought too hard about why things are that way.
What are the implications of WHERE vs HAVING? I thought the only primary difference was that one happens before the aggregation and the other happens after, and all the other implications stem from that fact. PRQL’s simplification, rather than obscuring, seems like a more clear and reasonable way to express that distinction.
I don’t know if PRQL supports all SQL features, but I think it could while being less complex than SQL by removing arbitrary SQL complications like different keywords for WHERE vs HAVING, only being able to use column aliases in certain places, needing to recompute a transformation to use it in multiple clauses, not forcing queries to be in SELECT… FROM… WHERE… order, etc.
Why would you need to know the eccentricities of SQL? Shouldn’t it be enough to just know PRQL? The generated SQL should have the same semantics as the PRQL source, unless the transpiler is buggy.
Agreed, smartness is about what it can do, not how it works. As an analogy, if a chess bot could explore the entire game tree hundreds of moves ahead, it would be pretty damn smart (easily the best in the world, probably strong enough to solve chess) despite just being dumb minmax plus absurd amounts of computing power.
The fact that ChatGPT works by predicting the most likely next word isn’t relevant to its smartness except as far as its mechanism limits its outputs. And predicting the most likely next word has proven far less limiting than I expected, so even though I can think of lots of reasons why it will never scale to true intelligence, how could I be confident that those are real limits and not just me being mistaken yet again?
I don’t think Turing-completeness implies omniperiodicity. I’m imagining a cellular automaton which follows Game of Life rules on even-numbered generations and does nothing on odd-numbered generations, which is trivially Turing-complete because it’s just Conway’s Game of Life if you ignore every other generation, but also trivially has no odd-period oscillators.