Alex G

proof engineer / prog lang dev

[Alex G @clayrat]

@headinthebox You verify it separately, in layers or stages. Even with pure stuff, there are many ways to write one thing, a spectrum between "most verifiable" and "most performant". The first gives you the math of your algorithm, and you expand it when doing the more performant version.

[Lambda World @Lambda_World]

Applying Functional Programming to make AI more reliable? HELL YEAH!

AI isn’t only about big data and neural networks there’s also a world where logic leads the way... That’s where Alexander Gryzlov, proof engineer, steps in.

In his talk, he’ll show how classic techniques get a fresh twist, with clever combinators doing the heavy lifting so you can focus on the ideas.

From his early days as an industry developer, Alexander blends practice and theory to show how “old-school” AI and modern techniques can work together to create software that’s both reliable and a little bit magical

Get to know him and his talk in depth here: https://t.co/imQYkY0PFl

#SymbolicAI #Agda #DependentTypes #FormalVerification

[Alex G @clayrat]

@ahh_soka There's a fairly new branch of algerbraic geometry called singular learning theory which aims to explain the theory behind deep learning, see

https://t.co/ReQDqPtRYC

https://t.co/VqGG0Nkkhi

https://t.co/35wGdWqGDB

[Alex G @clayrat]

@ahh_soka @adamnemecek1 https://t.co/AXkIazy1Zj

https://t.co/ghPNM1LZ0n

https://t.co/07nDRFZf5r

https://t.co/OgHAQ50Gpx

[Alex G @clayrat]

@NickMCThree @kmett @joomy It's based on order theory, which is a "propositional" version of category theory

[Lambda World @Lambda_World]

Live coding Haskell and specifications! @nikivazou introduces LiquidHaskell and refinement types in this afternoon session

[Alex G @clayrat]

@dr_c0d3 it might be interesting to point out that ssreflect was introduced in its day with exactly this goal in mind, i.e., to allow easier proof maintenance by making the tactic scripts less brittle (e.g., by handling names explicitly and avoiding dependent type classes)

[Alex G @clayrat]

@krismicinski @miniapeur for sheaves you can try https://t.co/oeqq0gbhqO

[Alex G @clayrat]

@dr_c0d3 have you seen https://t.co/HDwZERKgt3 ?

[Alex G @clayrat]

@dr_c0d3 If there's some sort of interesting repeating pattern or higher abstraction, then ideally it should be factored out into a separate theory instead of fiddling with lists directly; like in other kinds of programming.

[Alex G @clayrat]

@dr_c0d3 Thanks! My point is that you typically don't really need to read the proof, it's essentially just shuffling around chunks of lists according to some rules; what you need to see is the definition of the theorem.

[Alex G @clayrat]

@dr_c0d3 looks like a pretty standard line of reasoning about some property holding on numerical lists under some blockchain-induced ordering, I've written dozens of proofs like that :)

[Habla Computing @hablapps]

Join us for an engaging talk by @clayrat from @IMDEA_Software as we delve into the intriguing realm of formalizing infinite programs and codata, using #Agda as our vehicle👨‍💻. Don’t miss out on this enlightening event! 📆 /cc @iLABMadrid https://t.co/g1OTcAzZEi

[Alex G @clayrat]

@ariil @pandabanda у местных речевые центры очень развиты, это правда; мне тут как-то даже объясняли, что невежливо НЕ перебивать собеседника - это дескать показывает, что ты его не слушаешь

[Alex G @clayrat]

@kreatific @ataiiam @yoheinakajima It's essentially a typelevel tree transducer automaton, only it's constructed interactively by a very big and expensive heuristic, instead of a compiler operating on high-level code.

[Alex G @clayrat]

@NikolayKRD @chesnolena вы просто не умеете их готовить!

[Alex G @clayrat]

@maux_de_tete какой из? :)

[Alex G @clayrat]

Доделал коиндуктивный DFS и его корректность, завершил пруф "частичной" нормализации" на LH.

[Alex G @clayrat]

@vpatryshev @Signify_Tech bienvenido al sur de Europa