Keep on to blur preview images; turn off to show them clearly
RT @serkodev: in the next version of the @vuejs language tools, we finally fixed a long-standing Vue file syntax highlighting bug that has…
Husband / Father of two / Founder @voidzerodev / Creator @vuejs & @vite_js. Chinese-only alt: @yuxiyou
今日份的《无限聊斋》已经发布，发布了3章： 无限聊斋 (25): 第三副本开启：粉红色的迷雾，竟然是黑山老妖的“纳妾”花轿 无限聊斋 (26): 开局即团灭！十名新人轮回者，三秒内被鬼卒当成辣条撕碎 无限聊斋 (27): 绝望之际的香风，那个踩着鬼头跳舞的红裙少女
有兴趣的朋友可以点击阅读： https://t.co/YuDfm4eJgL 反正不可怕，可以看看。
> "The surge in solar use has also pushed Pakistan to renegotiate its LNG contracts with top supplier Qatar and cancel cargoes supplied by Italy's Eni" I'm not sure this is priced in «oil prices will be fine» was premised in large part on developing countries increasing demand
that's fair, this is more directly threatening to LNG
So with SupGen approaching, I'll post some tech contents that will flop because they're not brain dead AI content, but I want to do it anyway Here are some thoughts about totality and termination. In Agda (and Lean?), termination is ensured by "structural recursion", which means arguments may decrease in "lexicographical order". Do you get what this means? Yes so neither did I. But actually it is pretty simple. Suppose you have a clause like: foo : Nat → Nat foo (S a) (S b) (S c) (S d) = foo (S a) (S b) c (S (S (S d))) foo x = x Is it terminating? Is it not? How to tell? In Agda, it goes like this: Step #0: - argument 0 on LHS: (S a) - argument 0 on RHS: (S a) - this is *identical*, so, check next argument (note: LHS/RHS means left/right side of equation) Step #1: - argument 1 on LHS: (S b) - argument 1 on RHS: (S b) - this is *identical*, so, check next argument Step #2: - argument 2 on LHS: (S c) - argument 2 on RHS: c - this is *smaller*, so, this clause is terminating! And we're done. So, in short, whenever there is a recursive call on the right side, just compare its args with the corresponding patterns on the left side, one by one, until one is smaller. Simple, isn't it? (I wish they could've explained it like that...) Now, consider: foo : Pair -> Pair foo (Pair (S a) (S b)) = foo (P a (S (S (S b)))) foo x = x Is this function terminating? Well, accordingly to Agda... no! Yet, it clearly is, for the same logic: since the first component is smaller, the second being larger is irrelevant. Seems like Agda's checker is hardcoded to chunk arguments. So, this clause, as written, won't pass its checker, even though it terminates. Why I'm talking about this? So, I was reviewing SupGen's recursion generator, and I realized that it could become cleaner *and* faster with some changes. But are these changes valid? I tested and, to my surprise, SupGen was generating non-terminating programs... according to Agda. At first I assumed my approach was wrong, but, turns out, Agda was. Now you have a new knowledge. I'm sure this will eventually be useful to you!
the new algorithm used by SupGen to generate terminating recursive calls is way simpler *and* more general!
This movie is in my top 3 movies. This one scene changed the entire man's life. A man ran for 2 days without sleep, raced a Jaguar, survived a waterfall, and had to have a son who would be one with pneumonia. Jaguar Paw was fantastic in this film.
Founder | Author | Speaker Building @beltstripe. Healtech/EdTech/Agric I'm Not The Man Of Your Dreams. Your Imagination Wasn't This Great.
We went to Dubai many times already and we spoke to people there, including immigrants and what I noticed is that all the negative things you read online about Dubai are just not true The people there were so grateful to be there and had only great things to say about Dubai So before you listen to all the crap people say online, make sure they’ve been there first, otherwise it’s just nonsense. Moo talk The only thing that I could say is a negative imo is the extreme heat during summer. Even late may is getting super hot 🥵 Nonetheless, I’d personally move there in a heartbeat but my wife has a great job @ home and she doesn’t want to leave it, for now. Maybe I’ll convince her one day 😁
I build stuff. On my way to making $1M 💰 My projects 👇