What is Hackers' Pub?

Hackers' Pub is a place for software engineers to share their knowledge and experience with each other. It's also an ActivityPub-enabled social network, so you can follow your favorite hackers in the fediverse and get their latest posts in your feed.

WeatherBotAK @WeatherBotAK@elsewhere.cozysumo.space
Public

Winter Weather Advisory, Bering Strait Coast, 2025-04-17 09:47 AKDT.

WHAT...Snow and blowing snow. Additional snow accumulations of 1 to 3 inches. Winds gusting as high as 40 mph. Visibility may drop to one-quarter mile at times.

WHERE...Bering Strait Coast.

WHEN...Until 1 AM AKDT Friday.

IMPACTS...Travel could be very difficult.

https://forecast.weather.gov/MapClick.php?zoneid=AKZ821


National Weather Service

forecast.weather.gov

0
0
0
WeatherBotAK @WeatherBotAK@elsewhere.cozysumo.space
Public

Blizzard Warning, Northwest Arctic Coast; Northern Arctic Coast; Central Beaufort Sea Coast; Eastern Beaufort Sea Coast, 2025-04-17 09:48 AKDT.

WHAT...Blizzard conditions occurring. Total snow accumulations of up to two inches. Winds gusting as high as 50 mph.

WHERE...Northwest Arctic Coast, Northern Arctic Coast, Central Beaufort Sea Coast and Eastern Beaufort Sea Coast.

WHEN...From 4 AM Thursday to 10 PM AKDT Friday.

IMPACTS...Travel will be very difficult. Areas of blowing snow could significantly reduce visibility.

https://forecast.weather.gov/MapClick.php?zoneid=AKZ802


National Weather Service

forecast.weather.gov

0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
1
0
0
0
0
0
nixCraft 🐧 @nixCraft@mastodon.social
Public

High-frequency data packets traveling long distances across the internet occasionally need to "refuel." Secret micro-antennae within data centers emit bursts of pure information energy, giving these packets the extra boost they need to reach their destination without latency. They are called as “Data Packet Refueling Stations” and part of all modern internet data centres worldwide.

0
5
0
Gea-Suan Lin @gslin@abpe.org
Public
Shared by MJ+

Arch Linux 打算淘汰掉 Redis，改用 Valkey

在 Lobsters 上看到 Arch Linux 要用 Valkey 淘汰掉 Redis 的消息：「Valkey to replace Redis in the [extra] Repository」。 Redis 會從官方的 repository 搬到 AUR 上，然後就隨緣： Arch Linux Package Maintainers intend to support the availability of the redis package for roughly 14 days from the day of this post, to enable a smooth transition to valkey. After the 14 day transiti…

blog.gslin.org/archives/2025/0

Arch Linux 打算淘汰掉 Redis，改用 Valkey

在 Lobsters 上看到 Arch Linux 要用 Valkey 淘汰掉 Redis 的消息：「Valkey to replace Redis in the Repository」。 Redis 會從官方的 repository 搬到 AUR 上，然後就隨緣： Arch Linux Package Maintainers intend to support the availability of the redis package for roughly 14 d...

blog.gslin.org · Gea-Suan Lin's BLOG

0
0
0
0
0
0
1
0
0
0
0
0
Gea-Suan Lin @gslin@abpe.org
Public

Arch Linux 打算淘汰掉 Redis，改用 Valkey

在 Lobsters 上看到 Arch Linux 要用 Valkey 淘汰掉 Redis 的消息：「Valkey to replace Redis in the [extra] Repository」。 Redis 會從官方的 repository 搬到 AUR 上，然後就隨緣： Arch Linux Package Maintainers intend to support the availability of the redis package for roughly 14 days from the day of this post, to enable a smooth transition to valkey. After the 14 day transiti…

blog.gslin.org/archives/2025/0

Arch Linux 打算淘汰掉 Redis，改用 Valkey

在 Lobsters 上看到 Arch Linux 要用 Valkey 淘汰掉 Redis 的消息：「Valkey to replace Redis in the Repository」。 Redis 會從官方的 repository 搬到 AUR 上，然後就隨緣： Arch Linux Package Maintainers intend to support the availability of the redis package for roughly 14 d...

blog.gslin.org · Gea-Suan Lin's BLOG

0
0
0
The Japan Times @thejapantimes@mastodon.social
Public
Shared by nixCraft 🐧

Scores of people who have licensed their image to artificial intelligence marketing companies have ended up seeing themselves feature in deepfakes, dubious adverts or even political propaganda. japantimes.co.jp/business/2025

They sold their likeness to AI companies — and regretted it

Scores have ended up with the unpleasant surprise of seeing themselves feature in deepfakes, dubious adverts or even political propaganda.

www.japantimes.co.jp · The Japan Times

0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
Fedi.Tips @FediTips@social.growyourown.services
Public

Mastodon has a built-in translation system for posts in other languages. For it to work, three things have to happen:

- Your server has to offer the service
- Your language settings have to be correct
- The person posting has to use the correct language settings

If all these are ok, you will see a "Translate" link below the post or in the post's ⋯ menu when you encounter a post in a foreign language.

Lots more info and questions answered at:

➡️ fedi.tips/is-there-a-built-in-

Illustration of a stylised fox opening a treasure chest. Inside the chest are icons of various Fediverse services including Mastodon, Pixelfed and PeerTube as well as the overall Fediverse logo.

How to use the built-in language translation system on Mastodon | Fedi.Tips – An Unofficial Guide to Mastodon and the Fediverse

An unofficial guide to using Mastodon and the Fediverse

fedi.tips

Link author: Fedi.Tips@FediTips@social.growyourown.services

0
0
0
0
0
0
0
0
0
0
0
0
netzpolitik.org @netzpolitik_feed@chaos.social
Public

Einmal mehr wird über die Einführung von Palantir-Software für die deutsche Polizei diskutiert. In den USA wird die Technik zur Deportation missliebiger Personen genutzt. Auch die Nato schließt einen Vertrag mit dem umstrittenen Unternehmen.

netzpolitik.org/2025/us-progno

US-Analysesoftware: Palantir macht Polizei und Militär politisch

Einmal mehr wird über die Einführung von Palantir-Software für die deutsche Polizei diskutiert. In den USA wird die Technik zur Deportation missliebiger Personen genutzt. Auch die Nato schließt einen Vertrag mit dem umstrittenen Unternehmen.

netzpolitik.org · netzpolitik.org

0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
Max S. New ⚜️ @maxsnew@types.pl
Public

I'm happy to announce that our paper "Intrinsic Verification of
Parsers and Formal Grammar Theory in Dependent Lambek Calculus" has
been accepted at PLDI 2025. Authors are Steven Schaefer (my PhD
student @stschaefSteven Schaefer), Nathan Varner (an undergrad here at
UM) and Pedro Amorim (@pamorimPedro Amorim). The extended version
of the paper is already up on arxiv (arxiv.org/abs/2504.03995)
and the code is available on github
(github.com/maxsnew/grammars-an).

The main idea of the paper is to define formal grammars as types in an
ordered linear logic (aka Lambek calculus). Then the terms are a kind
of intrinsically sound parse transformer, with intrinsically verified
parsers as a special case. The idea is that you write a parser as a
function from strings to parse trees, but the syntactic discipline of
Lambek calculus ensures that the output tree is a parse of the input
string.

Then formalisms like regular expressions and context-free grammars are
just inductive data types in Lambek calculus, and with the addition of
type dependency on non-linear types we are also able to express
automata formalisms. So far, we have an intrinsically verified parser
for regular expressions (using the classic Regex->NFA->DFA pipeline
using the powerset construction) as well as some hand-written parsers
for context-free grammars.

We give a simple denotational model where a grammar is defined as a
family of sets indexed by strings Σ* -> Set, a proof relevant version
of the definition of a formal language as a predicate Σ* -> Prop. This
category is monoidal closed and bicomplete, so supports all the
constructions of dependent Lambek calculus. The denotational semantics
is used as the basis for a shallow embedding of the system in Agda,
where we have formally verified all of our examples.

arXiv logo

Intrinsic Verification of Parsers and Formal Grammar Theory in Dependent Lambek Calculus (Extended Version)

We present Dependent Lambek Calculus, a domain-specific dependent type theory for verified parsing and formal grammar theory. In $\textrm{Lambek}^D$, linear types are used as a syntax for formal grammars,and parsers can be written as linear terms. The linear typing restriction provides a form of intrinsic verification that a parser yields only valid parse trees for the input string. We demonstrate the expressivity of this system by showing that the combination of inductive linear types and dependency on non-linear data can be used to encode commonly used grammar formalisms such as regular and context-free grammars as well as traces of various types of automata. Using these encodings, we define parsers for regular expressions using deterministic automata, as well as examples of verified parsers of context-free grammars. We present a denotational semantics of our type theory that interprets the linear types as functions from strings to sets of abstract parse trees and terms as parse transformers. Based on this denotational semantics, we have made a prototype implementation of $\textrm{Lambek}^D$ using a shallow embedding in the Agda proof assistant. All of our examples parsers have been implemented in this prototype implementation.

arxiv.org · arXiv.org

0
0
0
0
0
0