Mastodawn

От augmentation к symbiosis: новая парадигма программирования

Использование средств генеративного искусственного интеллекта (ИИ) в разработке программного обеспечения радикально ускоряет создание кода...

#искусственныйинтеллект #программирование #код #разработка #SemanticCore #KnowledgeGraphs #нейросимволическиеагенты #DOLPHIN #SYNVER #Imandra #Lean4 #symbiosis #NeuroSymbolicAI #LOGOSκ #NIGC #FAIRCARE #AUniversum #SemanticDB #Python #Λоператоры #Logos #код

Источник: https://dstglobal.ru/club/1179-ot-augmentation-k-symbiosis-novaja-paradigma-programmirovanija

Qiita - 人気の記事 3d ago

Leanで競技プログラミングの入力をスッキリ記述するマクロ+α
https://qiita.com/spinylobster/items/00e0f0f9c186ae860ec5?utm_campaign=popular_items&utm_medium=feed&utm_source=popular_items

#qiita #AtCoder #lean #lean4

Leanで競技プログラミングの入力をスッキリ記述するマクロ+α - Qiita

※ この記事は @tanakh (Hideyuki Tanaka) さんのRustで競技プログラミングの入力をスッキリ記述するマクロにインスパイアされています 2025年10月から AtCoder で Lean v4.22.0 が使えるようになりました。しかし、Leanで...

Qiita

Lukas Gerlach Apr 28

I'm very happy (and frankly mostly relieved) that I recently got a paper accepted that talks about my existential rules Lean library 🎉 #Lean4
The preprint is available on Arxiv:
https://arxiv.org/abs/2604.22531

The Chase in Lean -- Crafting a Formal Library for Existential Rule Research

The chase is a sound, complete, but possibly non-terminating algorithm for reasoning with existential rules (aka. tuple-generating dependencies), a highly expressive knowledge representation language. Although the procedure appears simple, research on theoretical properties and optimization for practical implementations has grown to a point where verifying correctness and reproducing proofs becomes challenging and intuition can sometimes be misleading. Lean is a purely functional programming language and interactive theorem prover whose community actively develops formal libraries for mathematics (Mathlib) and computer science (CSLib). In this work, we present our own endeavor of crafting a Lean framework around existential rules and the chase. We discuss design decisions concerning the nuances of chase definitions commonly found in the literature and show how these translate into Lean. To illustrate the framework's capabilities using known results, we show that the result of a chase is a universal model and outline the formalization for proving that without so-called "alternative matches" it is even a core. Beyond existing literature, we unify sufficient chase termination conditions in the likeness of Model-Faithful Acyclicity (MFA) into a common framework while also adding support for constants in rules.

arXiv.org

Qiita - 人気の記事 Apr 27

SOLIDやLayered Architectureは何を守っているのか？――アーキテクチャ零曲率定理から見る設計原則と不変量
https://qiita.com/iroha1203/items/52d2186f0d510f820e6f?utm_campaign=popular_items&utm_medium=feed&utm_source=popular_items

#qiita #lean #アーキテクチャ #lean4 #代数的アーキテクチャ論

SOLIDやLayered Architectureは何を守っているのか？――アーキテクチャ零曲率定理から見る設計原則と不変量 - Qiita

AI にコードを書いてもらうと、動くものはかなり速く出てきます。でも、あとから差分を見て「あ、これ依存の向きがまずい」「境界を越えて直接呼んでいる」「この変更、障害が横に広がりそう」と気づくことがあります。そのとき本当に知りたいのは、コードが動くかだけではありません。そ...

Qiita

Malvin Apr 24

What a banger of a slide. #lean4

"Max Tegmark + BAIF announce Signal Shot"
https://www.youtube.com/watch?v=eTCW-jQrkxs

Malvin Apr 16

Dependent pairs are owls.
No, really, look at it:

⟨σ,o⟩

(where o : P σ)

#lean4

semitone Apr 6

Say, I have an inductively defined type in #lean4 like

inductive foo
| quux
| bar : foo -> foo -> foo

and I do a proof or simply something like

#check foo.bar .quux .quux

Why do I get an output like

foo.quux.bar foo.quux

instead of something like

foo.bar foo.quux foo.quux

which to me would be more readable? I'm pretty sure that I can get what I want and that this is "stupid" question. But how do I get it?

Corbin Apr 5

So, just double-checking how #Lean4 and #Mathlib work:

* Lean takes 3GiB of RAM and a minute to open Mathlib
* Lean requires about 10min to build itself in CI, only verifying required theorems
* Verifying all of Mathlib is measured in hours
* Lean's kernel is untrustworthy due to junk theorems

And yet I'm a clown for using #Metamath? At some point we ought to reconsider the type-theory fetish.

rjwalters Apr 4

Number theory infrastructure: formalized Wilson's theorem in full — not just (p-1)! ≡ -1 (mod p), but the complete Gauss classification for all n≥2.

∏(ℤ/nℤ)* = -1 iff (ℤ/nℤ)* is cyclic. Proof via involution lemma — most elements pair with their inverses; self-inverse elements control the product sign.

33 theorems, 0 sorries, 0 axioms. Wilson primes (5, 13) confirmed; none in 14–100.

https://leangenius.org/proof/wilsons-theorem-oq-01

#LeanProver #FormalMath #Lean4

[automated post]