FromJavaToHaskell

Software developer. I am learning Haskell and other functional programming languages. Interested in writing bug free code. Mostly reader of tweets.

[FromJavaToHaskell @to_haskell]

@sampocino @razzy_ar It should be some kind of equivalent of passing explicit buffer with ability to allocate temporary objects from it - similar to how stack is passed implicitly but instead it should be additional local heap with fixed maximum capacity.

[Functor Fact @FunctorFact]

Haskell Programming from First Principles https://t.co/jkAars84aO

[FromJavaToHaskell @to_haskell]

@amphichrome_ Question is too vague to answer - there are different kinds of nuclear energy - including solar radiation.

[Son Luong @sluongng]

Codex just found a “workaround” of not having sudo on my pc…

[lotz @lotz84_]

今の時代 Haskell を学ぶなら記事や本を読むのもいいけど気になるキーワードを元に AI に解説してもらうのも良さそう（質問もできるし👀）

「Haskell の ◯◯ について入門者向けにコード例と共に解説してください」

◯◯ に入るキーワードはこんな感じか
・イミュータブル
・第一級関数
・Maybe
・リスト
・代数的データ型
・パターンマッチ
・パラメータ多相
・型クラス
・モノイド
・参照透過性
・遅延評価
・高階関数
・ポイントフリースタイル
・継続
・Functor / Applicative
・モナド
・モナドトランスフォーマー
・パーサーコンビネータ
・Freeモナド
・Algebraic Effects
・関数型アーキテクチャ
・Template Haskell
・EDSL
・GADTs
・存在型
・幽霊型
・Higher-Kinded Data
・Lens / Optics
・ストリーム処理
・ジェネリックプログラミング
・Functional Reactive Programming
・Recursion Schemes
・線形型
・型レベルプログラミング

[FromJavaToHaskell @to_haskell]

@pikuma That means that is you have two operations with O(1) behavior you can't compare absolute execution time of those operations based just on O notation. It also absorbs compiler optimisations.

[FromJavaToHaskell @to_haskell]

@pikuma I have answered O(1) just based on the fact that the number of checked is fixed. People often misinterpret Big O notation and do not understand that it for asymptotic behavior and include implicit constant.

[Lean @leanprover]

Lean 4.30.0 is live!

The release notes highlight four areas: a new 𝚜𝚢𝚖 => tactic, 𝚌𝚋𝚟 out of experimental, a completed LCNF compiler backend, and a full Lake cache overhaul.

On 𝚜𝚢𝚖 =>: "Unlike 𝚐𝚛𝚒𝚗𝚍 =>, which eagerly introduces hypotheses and applies proof by contradiction, 𝚜𝚢𝚖 => gives users explicit control over each step."

On the compiler: the expand reset/reuse port "results in a ~15% decrease in binary size and slight speedups across the board."

Full release notes: https://t.co/qSFWZVjK4x

[FromJavaToHaskell @to_haskell]

@Scivf4 I think it would be better to draw line y = 2 π x and calculate area under the line for x from 0 to r. Or split circle into sectors and unwrap sectors.

[FromJavaToHaskell @to_haskell]

@lotz84_ Interesting - would it be possible to have it as self hosted project with SKI interpreter as botsrapper?

[lotz @lotz84_]

MicroHs は Haskell2010 のコンパイラ👀 Haskell からラムダ計算を経由してSKIコンビネータに変換する。コンパイラは1万行未満の Haskell で書かれていて、ランタイムは5千行未満のC言語で書かれている。実装を読むと勉強になりそう✍️
https://t.co/kmO361gOW9
Web IDE もある
https://t.co/vLebi0gjNd

[FromJavaToHaskell @to_haskell]

@0xAX grep -R
find . - iname
ps -ef

[Tienson Qin @tiensonqin]

https://t.co/MZZyKwnU3h is amazing, fast and accurate

[FromJavaToHaskell @to_haskell]

@__paleologo It seems to be another case similar to the "Mandelbrot set" - beautiful pictures without any practical applications.

[FromJavaToHaskell @to_haskell]

@__paleologo Besides non constructive nature - any application of prediction changes the future.

[FromJavaToHaskell @to_haskell]

@kon_cuppy @__paleologo It is non-constructive - means impossible to apply - just for lols

[FromJavaToHaskell @to_haskell]

@lauriewired @JustDeezGuy If only we had 65 bit registers and extra 1-bit tag in memory then we might have 64 bit long in Ocaml ;)

[Lean @leanprover]

Recordings and slides from Software Verification in Lean 2026 are now available.

The one-day workshop and multi-day hackathon, held in Paris in April, brought together researchers from the Beneficial AI Foundation, @CryspenHQ, @ethereumfndn, @GoogleResearch, @leanprover, @MSFTResearch and others to share recent advances in building verified software.

Recordings: https://t.co/KzlJZJwKHf
SVIL website: https://t.co/2NfzbWb8n4

#LeanLang #LeanProver #FormalVerification #SoftwareVerification

[FromJavaToHaskell @to_haskell]

@quantum_geoff I just need just one bit in the root of the tree and extra "if" operator in traverse function. Give me one bit and I will reverse binary tree ;)