GNU Nabe retweeted
【告知】
「Eスポーツ業界に興味はあるけど、実際どんな仕事があるの?」
「学生からどうすれば業界に入れるの?」
「社会人からの転職って厳しい?」
そんな疑問に、NTPグループ入社半年の激浅社会人の僕が12/1の配信でお答えします🙋
ベテランではない、入社半年のぺーぺーだからこそ、Eスポーツ業界を目指す学生や転職者の方に一番近い目線でお話できるはず…!
匿名で送れるので、聞きづらいこともぜひ質問箱へ投げてください📮
GNU Nabe retweeted
With all the noise around formal verification today, it is easy to forget that the Lean or Dafny approach is not the only game in town. When you look closely at how different paradigms connect specifications, proofs, and executable code, four distinct philosophies emerge—each differing on who does the work of finding the witness.
1. Program, Then Prove (Lean, Dafny)
In Dafny or Lean, you write an algorithm that computes the value you want—the witness—alongside a proof that the witness satisfies your specification. In Dafny, the specification and implementation languages are distinct. Yet even in Lean, which fuses them via dependent types, the proof is erased at compile time; at runtime, the machine simply executes the deterministic algorithm you wrote.
2. Program Calculation (Squiggol / Bird–Meertens)
In the Squiggol style, you start with an obviously correct, albeit inefficient, executable program. There is no separate specification and implementation—the specification is the implementation. From there, you apply algebraic, correctness-preserving transformations (like fusion and promotion) to calculate an efficient algorithm. Every equational step is its own proof, though you are still manually deriving the algorithm that computes the witness.
3. Constructive Proof Extraction & Refinement (Rocq, Isabelle/HOL)
Rocq (formerly Coq) and Isabelle/HOL take this a step further through code extraction. In Rocq’s constructive logic, you don't even have to write the algorithm first: you can prove an existential theorem (∃ witness), and Rocq will erase the purely logical steps to extract the computational skeleton of your proof directly into an OCaml program. Classical systems like Isabelle/HOL achieve a similar result through stepwise data refinement, transforming abstract mathematical specs into executable code. Still, the human must construct the proof—and thus the underlying algorithm—ahead of time.
4. Proof Search as Execution (Logic Programming)
Logic programming collapses the entire divide at runtime. You state the axioms, and your query is the existential theorem you want to prove. Execution is the proof search itself, using unification and resolution to dynamically construct the witness you are after.
In the first three approaches, the human invents or vibe codes the algorithm (or proof) that produces the witness, and the machine verifies it.
Only in logic programming do you state what makes a witness valid and let execution itself find both the proof and the witness together—which is why logic programming is my favorite paradigm for formal verification.
GNU Nabe retweeted
上司と先輩はこの記事を読み上げてんのかっていうくらい上司の口癖のってた笑
不思議の国のSE用語、10年前のQiitaなのに「握りつぶす」「マサカリ」とか今も現場で全部聞く 誰も教えてくれない方言がまとまってるのありがたい
自分も染まってきたなー笑
qiita.com/t_nakayama0714/ite…
GNU Nabe retweeted
長野格ゲー交流会「eスポーツグラウンド39」+スト6対戦会「Fighters Crossover NAGANO#38」は来週日曜、11月22日開催!一大イベント開催で盛り上がる中、長野でも盛り上がりませんか⁉是非お越し下さい!!詳細はx.gd/71o70で!!
#FightersCrossover #FC_SF6 #25esg #SF6
GNU Nabe retweeted
──────────
#魔法使いの夜
本日公開
──────────
カウントダウンも本日で最終日。
奈須きのこさんのコメントを公開!
ぜひ劇場でお会いしましょう!
✧公開劇場はこちら
eigakan.org/theaterpage/sche…
#TYPEMOON #ufotable
GNU Nabe retweeted
『モンハン ライズ』モバイル版11月24日リリースが正式発表!Netflix経由でプレイ可能
gamespark.jp/article/2026/11…
GNU Nabe retweeted
I just discovered you two today
Forget computer science degrees. Just watch Tokyo Hacker Girls, a VTuber duo consisting of a former Google engineer and a Linux kernel driver developer, and become an engineer yourself
Encore! Today we're teaching you about TCP~ 🌐 ✨
Join your favorite anime girls and learn about networking! 🩵
🕖 Starting at 20:00 JST / 11:00 UTC!
▶️ youtube.com/live/O63H0SuXqac
GNU Nabe retweeted
HTTP ステータスコード 483 I'm Not a Freezer(私は冷蔵庫ではありません)
IETFにDraftがでてる。4月1日ではない。
ietf.org/archive/id/draft-ba…







































