Readings shared May 4, 2026

The readings shared in Bluesky on 4 May 2026 are: Compfiles: Catalog of math problems formalized in Lean. ~ David Renshaw et als. #LeanProver #ITP #Math Primitive pythagorean triples in lean and redu

Vestigium

So this was funny. My solver rederived theorems that had been marked as private because it predicted they'd be there. Twice. #agda

```
-- Made public 2026-05-02 (Step 1 of orbit-aware-completion-residue
-- arc): NSAHomReal2Complex re-derived `α*0` / `0*α` / `neg-0`
-- inline; Goal-T's `*-comm-ℂ` proof would re-derive them again.
-- Two re-derivations of identical content trigger RFS to expose
-- the originals. Behavior-preserving for existing callers.
```

Delooping generated groups in homotopy type theory. ~ Camil Champin, Samuel Mimram, Emile Oleon. https://arxiv.org/abs/2405.03264v1 #Agda #ITP #HoTT
Delooping generated groups in homotopy type theory

Homotopy type theory is a logical setting based on Martin-Löf type theory in which one can perform geometric constructions and proofs in a synthetic way. Namely, types can be interpreted as spaces (up to continuous deformation) and proofs as homotopy invariant constructions. In this context, the loop spaces of types with a distinguished element (more precisely, pointed connected groupoids), provide a natural representation of groups, what we call here internal groups. The construction which internalizes a given group is called delooping, because it is a formal inverse to the loop space operator. As we recall in the article, this delooping operation has a concrete definition for any group G given by the type of G-torsors. Those are particular sets together with an action of G, which means that they come equipped with an endomorphism for every element of G. We show that, when a generating set is known for the group, we can construct a smaller representation of the type of G-torsors, using the fact that we only need automorphisms for the elements of the generating set. We thus obtain a concise definition of (internal) groups in homotopy type theory, which can be useful to define deloopings without resorting to higher inductive types, or to perform computations on those. We also investigate an abstract construction for the Cayley group of a generated group. Most of the developments performed in the article have been formalized using the cubical version of the Agda proof assistant.

arXiv.org
Then the sloppification of the #Agda codebase drove any serious person off Agda. Mikan proof assistant is an 'ai'-free fork by types.pl/@amy

Amélia Liao (@[email protected])
Amélia Liao (@[email protected])

6.89K Toots, 258 Following, 1.41K Followers · 1Lab main author. Charitably describable as "hinged"

types.pl

Nice, now I can go back to being unproductive with #agda.

{ pkgs ? import <nixpkgs> { } }:
with pkgs;
mkShell {
buildInputs = [
(agda.withPackages (ps: [
ps.standard-library
]))
];
}

Readings shared April 29, 2026

The readings shared in Bluesky on 29 April 2026 are: A Lean companion to «Conceptual mathematics». ~ David Kinkead. #LeanProver #ITP #Math A milestone in formalization: The sphere packing problem in

Vestigium
Formalizing the real numbers in Homotopy Type Theory with Cubical Agda. ~ Jackson Brough. https://users.cs.utah.edu/~blg/resources/pdf/jackson-brough-cubicalreals-2026.pdf #Agda #ITP #Math
Finally finished a just-for-fun, completely-from-scratch constructive proof of the Fundamental Theorem of Arithmetic (just the existence part, not uniqueness (yet)) in #Agda. Took me about 10 hours and 750 lines of code. Fun times! Will probably turn it into a blog post at some point.
🔥 Ah, yes, the classic "let's throw neural networks and #types in a blender and see what mess comes out" approach. 🤖✨ The article rambles on about separating training and typechecking like it's some groundbreaking revelation, when really, it's just playing code Jenga with fancy names like #Idris, #Lean, and #Agda. 🧩🔍
https://www.brunogavranovic.com/posts/2026-04-20-types-and-neural-networks.html #neuralnetworks #codeJenga #HackerNews #ngated
Types and Neural Networks

Just submitted my latest Swedish Science Council grant proposal: "Navigating the Incomparable"!

We want to build correct-by-construction software for multi-objective optimization—helping safely navigate complex trade-offs like economic costs vs. global temperature rise (see the attached idealised Pareto front).

To do this, we're proposing three connected work packages (see diagram) moving from formal specification, to state-space reduction, and finally scalable execution. We aim to combine #FunctionalProgramming, #DependentTypes, and dimensional analysis to build algebraically accountable tools for climate policy and fusion energy.

If funded, this opens a new PhD position in 2027!

📖 Read the full abstract: https://patrikja.owlstown.net/posts/5441

#Haskell #Agda #TypeTheory #ClimateScience #FusionEnergy #ProgLang