Для Scala.js разработали новый плагин для hot reload: https://www.scala-lang.org/blog/2023/04/18/faster-scalajs-development-with-frontend-tooling.html
В отличии от старого scalajs-bundler, который работал с webpack, новая разработка нацелена на Vite.
А вы пробовали этот бандлер?

Logic, Optimization, and Constraint Programming: A Fruitful Collaboration

There are deep connections between logic, optimization, and constraint programming (CP) that underlie some of the most effective solution methods. Conflict clause generation in SAT algorithms, as well as SAT modulo theories, are forms of Benders decomposition, a classical optimization method that can itself be generalized by viewing it as based on logical inference. The resolution method for logical inference is intimately related to the core concept of cutting planes in integer programming (IP), as well as to Fourier-Motzkin elimination, which lies at the root of linear programming (LP) and ultimately network flow models that play an essential role in CP’s filtering techniques. In first order logic, Herbrand’s theorem is based on a compactness property that is perfectly mirrored in IP, while CP is based on a generalization of unification. Boole’s probability logic poses an LP problem that can be solved by column generation, while default and nonmonotonic logics have natural IP models. Binary decision diagrams, used for logic circuit design, provide the basis for recent developments in both CP and combinatorial optimization. The concept of consistency in CP inspires a reinterpretation of cutting planes in IP.

https://www.youtube.com/watch?v=TknN8fCQvRk

How OmniPaxos handles partial connectivity - and why other protocols can’t

https://omnipaxos.com/blog/how-omnipaxos-handles-partial-connectivity-and-why-other-protocols-cant/

https://dl.acm.org/doi/pdf/10.1145/3552326.3587441

Нашел просто офигенный пост где подробно, вплоть до констант в эвристиках, рассказывают как jsовский джит в вебките работает — https://www.webkit.org/blog/10308/speculation-in-javascriptcore. Единственная проблема в том что там ~35k слов, так что можно случайно на несколько часов залипнуть. Хотя самое основное наверное где-то в первой трети нормально объяснено, дальше уже детали. Очень советую короче всем кому компиляция динамики интересна

https://richardzach.org/2021/08/an-introduction-to-proof-theory-normalization-cut-elimination-and-consistency-proofs/

An intro book to Proof Theory.

The Silent (R)evolution of SAT
https://cacm.acm.org/magazines/2023/6/273222-the-silent-revolution-of-sat/fulltext

FP2: Fully in-Place Functional Programming
A. Lorenzen, D. Leijen, W. Swierstra

https://www.microsoft.com/en-us/research/uploads/prod/2023/05/fbip.pdf

Александр Куклев написал два текста про языки программирования. Первый будет скорее интересен любителям вэлью, второй — академикам

https://akuklev.github.io/objects/

https://akuklev.github.io/HOCC/

BOB Conference 2023

https://www.youtube.com/playlist?list=PLHvf3gk-RdgVuOMnM0Pn8cfEeAEUVeald

Homotopy Type Theory for Sewn Quilts

C. Clark, R. Bohrer

This paper introduces PieceWork, an imperative programming language for the construction of designs for sewn quilts, whose semantics are inspired by Homotopy Type Theory.

https://users.wpi.edu/~rbohrer/pub/farm23.pdf

This is a special topics course in software engineering. The idea that we will explore is that we can now import ongoing advances in the formalization of abstract mathematics (in type theory and to a significant extent around the Lean prover and its mathematics libraries) as new foundations for engineering software programs for systems that inhabit domains that have such abstract mathematical underpinnings.

https://www.computingfoundations.org/index.html

интересную темку рабочий чатик подогнал: https://charm.sh

Explaining Competitive-Level Programming Solutions using LLMs https://arxiv.org/abs/2307.05337

Restrictable Variants: A Simple and Practical Alternative to Extensible Variants
M. Madsen, J.L. Starup, M. Lutze

https://drops-beta.dagstuhl.de/entities/document/10.4230/LIPIcs.ECOOP.2023.17