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
https://omnipaxos.com/blog/how-omnipaxos-handles-partial-connectivity-and-why-other-protocols-cant/
https://dl.acm.org/doi/pdf/10.1145/3552326.3587441
OmniPaxos
How OmniPaxos handles partial connectivity - and why other protocols can’t
State machine replication (SMR) protocols such as Raft, VR, and MultiPaxos are widely used to build replicated services in the cloud. These protocols depend on a stable leader to make progress. However, as shown by the 6+ hour Cloudflare outage in 2020, partial…
👍5🤔2
Forwarded from aadaa_ftgaa
Нашел просто офигенный пост где подробно, вплоть до констант в эвристиках, рассказывают как jsовский джит в вебките работает — https://www.webkit.org/blog/10308/speculation-in-javascriptcore. Единственная проблема в том что там ~35k слов, так что можно случайно на несколько часов залипнуть. Хотя самое основное наверное где-то в первой трети нормально объяснено, дальше уже детали. Очень советую короче всем кому компиляция динамики интересна
WebKit
Speculation in JavaScriptCore
This post is all about speculative compilation, or just speculation for short, in the context of the JavaScriptCore virtual machine.
👍6🗿2
Forwarded from Alexander Chichigin
https://richardzach.org/2021/08/an-introduction-to-proof-theory-normalization-cut-elimination-and-consistency-proofs/
An intro book to Proof Theory.
An intro book to Proof Theory.
Richard Zach
An Introduction to Proof Theory: Normalization, Cut-elimination, and Consistency Proofs
Paolo Mancosu, Sergio Galvan, and Richard Zach. An Introduction to Proof Theory: Normalization, Cut-elimination, and Consistency Proofs. Oxford: Oxford University Press, 2021. DOI: 10.1093/oso/9780…
👍4🤓2👾1
Forwarded from Sergey Bronnikov
The Silent (R)evolution of SAT
https://cacm.acm.org/magazines/2023/6/273222-the-silent-revolution-of-sat/fulltext
https://cacm.acm.org/magazines/2023/6/273222-the-silent-revolution-of-sat/fulltext
👍3🤔1
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
A. Lorenzen, D. Leijen, W. Swierstra
https://www.microsoft.com/en-us/research/uploads/prod/2023/05/fbip.pdf
🔥7👎1
👍2🗿1
Александр Куклев написал два текста про языки программирования. Первый будет скорее интересен любителям вэлью, второй — академикам
https://akuklev.github.io/objects/
https://akuklev.github.io/HOCC/
https://akuklev.github.io/objects/
https://akuklev.github.io/HOCC/
🔥5👎3
👍3
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
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
🙈4
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://www.computingfoundations.org/index.html
👍1
Forwarded from Alex Gryzlov
👍1🔥1
Forwarded from Anton Trunov
интересную темку рабочий чатик подогнал: https://charm.sh
Charm
We make the command line glamorous
💅11
Forwarded from Just links
Explaining Competitive-Level Programming Solutions using LLMs https://arxiv.org/abs/2307.05337
👎3👍1
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
M. Madsen, J.L. Starup, M. Lutze
https://drops-beta.dagstuhl.de/entities/document/10.4230/LIPIcs.ECOOP.2023.17
👌1
In the #ECOOP23 paper 'Programming with Purity Reflection: Peaceful Coexistence of Effects, Laziness, and Parallelism,' we present a new programming construct that enables selective lazy and/or parallel evaluation.
In a nutshell, purity reflection enables a higher-order function to inspect the purity of a function argument and to vary its behavior based on this information.
For example, a function like Set.count can use parallel evaluation when given a pure predicate and revert to sequential evaluation when given an impure predicate.
The full paper is available here: https://drops-beta.dagstuhl.de/entities/document/10.4230/LIPIcs.ECOOP.2023.18
You can read more about purity reflection in Flix here: https://doc.flix.dev/purity-reflection.html
In a nutshell, purity reflection enables a higher-order function to inspect the purity of a function argument and to vary its behavior based on this information.
For example, a function like Set.count can use parallel evaluation when given a pure predicate and revert to sequential evaluation when given an impure predicate.
The full paper is available here: https://drops-beta.dagstuhl.de/entities/document/10.4230/LIPIcs.ECOOP.2023.18
You can read more about purity reflection in Flix here: https://doc.flix.dev/purity-reflection.html
🥴3🤯2👍1
MacoCaml: Staging Composable and Compilable Macros
N. Xie, L. White, O. Nicole, J. Yallop
We introduce MacoCaml, a new design and implementation of compile-time code generation for the OCaml language. MacoCaml features a novel combination of macros with phase separation and quotation-based staging, where macros are considered as compile-time bindings, expression cross evaluation phases using staging annotations, and compile-time evaluation happens inside top-level splices. We provide a theoretical foundation for MacoCaml by formalizing a typed source calculus 𝑚𝑎𝑐𝑜 that supports interleaving typing and compile-time code generation, references with explicit compile-time heaps, and modules. We study various crucial properties including soundness and phase distinction. We have implemented MacoCaml in the OCaml compiler, and ported two substantial existing libraries to validate our implementation.
https://xnning.github.io/papers/icfp23.pdf
N. Xie, L. White, O. Nicole, J. Yallop
We introduce MacoCaml, a new design and implementation of compile-time code generation for the OCaml language. MacoCaml features a novel combination of macros with phase separation and quotation-based staging, where macros are considered as compile-time bindings, expression cross evaluation phases using staging annotations, and compile-time evaluation happens inside top-level splices. We provide a theoretical foundation for MacoCaml by formalizing a typed source calculus 𝑚𝑎𝑐𝑜 that supports interleaving typing and compile-time code generation, references with explicit compile-time heaps, and modules. We study various crucial properties including soundness and phase distinction. We have implemented MacoCaml in the OCaml compiler, and ported two substantial existing libraries to validate our implementation.
https://xnning.github.io/papers/icfp23.pdf
👍4👎2
The First Room-Temperature Ambient-Pressure Superconductor
https://arxiv.org/abs/2307.12008
Воспроизведения пока нет, но на данный момент звучит и выглядит достаточно правдоподобно.
https://arxiv.org/abs/2307.12008
Воспроизведения пока нет, но на данный момент звучит и выглядит достаточно правдоподобно.
😱3👍2🔥1