翻訳言語

CSP許可リスト実験

CSPで保護されたサンドボックスiframe内でアプリを実行し、fetch()をカスタマイズしてCSPエラーを検出。親ウィンドウがユーザーにドメインの許可リスト追加を促し、ページをリフレッシュできるようにする実験を紹介。GPT-5.5 xhigh（Codexデスクトップアプリ）を用いて構築。

Points are a weird and inconsistent unit of measure
2.0
LaTeX and Inkscape define a "point" differently: LaTeX uses 1/72.27 inch (Knuth's TeX standard), while Inkscape uses 1/72 inch (from PostScript and CSS). The difference traces back to historical variations in typographic measurement standards.
Partial static single information form
2.0
Partial static single information (SSI) form is an intermediate representation between SSA and full SSI form. It places σ-functions only at join points where different values converge, reducing overhead while retaining useful properties for optimization and analysis.
Partial static single information form
2.0
Partial SSI is a simplified alternative to full static single information form that inserts type refinement nodes during SSA construction or optimization rather than implementing complex SSI algorithms. This approach lets compilers propagate type information from conditionals and guards to enable optimizations, as demonstrated in projects like ZJIT, Cinder, and TruffleRuby.

翻訳言語

Points are a weird and inconsistent unit of measure
2.0
LaTeX and Inkscape define a "point" differently: LaTeX uses 1/72.27 inch (Knuth's TeX standard), while Inkscape uses 1/72 inch (from PostScript and CSS). The difference traces back to historical variations in typographic measurement standards.
Partial static single information form
2.0
Partial static single information (SSI) form is an intermediate representation between SSA and full SSI form. It places σ-functions only at join points where different values converge, reducing overhead while retaining useful properties for optimization and analysis.
Partial static single information form
2.0
Partial SSI is a simplified alternative to full static single information form that inserts type refinement nodes during SSA construction or optimization rather than implementing complex SSI algorithms. This approach lets compilers propagate type information from conditionals and guards to enable optimizations, as demonstrated in projects like ZJIT, Cinder, and TruffleRuby.

関連記事