nrw.social ist einer von vielen unabhängigen Mastodon-Servern, mit dem du dich im Fediverse beteiligen kannst.
Wir sind eine freundliche Mastodon Instanz aus Nordrhein-Westfalen. Ob NRW'ler oder NRW-Sympathifanten, jeder ist hier willkommen.

Serverstatistik:

2,8 Tsd.
aktive Profile

#haskell

41 Beiträge26 Beteiligte4 Beiträge heute
jnpn<p>generators for integrators</p><p><a href="https://unnamed.website/posts/haskelling-my-python/" rel="nofollow noopener noreferrer" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">unnamed.website/posts/haskelli</span><span class="invisible">ng-my-python/</span></a></p><p><a href="https://mastodon.social/tags/python" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>python</span></a> <a href="https://mastodon.social/tags/haskell" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>haskell</span></a> <a href="https://mastodon.social/tags/math" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>math</span></a></p>
ZuriHac<p>Greetings ZuriHackers! </p><p>Do you have a project you want to work on during ZuriHac? Now is a great time to get some contributors on board! </p><p>Do you not have a project yet? Then perhaps you want to have a look to get an idea about what others are working on! </p><p>Please find already registered projects at <br> <a href="https://zfoh.ch/zurihac2025/projects/" rel="nofollow noopener noreferrer" translate="no" target="_blank"><span class="invisible">https://</span><span class="">zfoh.ch/zurihac2025/projects/</span><span class="invisible"></span></a> or submit a PR at <a href="https://github.com/zfoh/zfoh.ch/edit/main/content/zurihac2025/projects/projects.json" rel="nofollow noopener noreferrer" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">github.com/zfoh/zfoh.ch/edit/m</span><span class="invisible">ain/content/zurihac2025/projects/projects.json</span></a>!</p><p><a href="https://fosstodon.org/tags/ZuriHac2025" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>ZuriHac2025</span></a> <a href="https://fosstodon.org/tags/ZuriHac" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>ZuriHac</span></a> <a href="https://fosstodon.org/tags/Haskell" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>Haskell</span></a></p>
Haskell Weekly<p>Test Spies in Haskell</p><p><a href="https://jezenthomas.com/2025/04/test-spies-in-haskell/" rel="nofollow noopener noreferrer" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">jezenthomas.com/2025/04/test-s</span><span class="invisible">pies-in-haskell/</span></a></p><p>Discussions: <a href="https://discu.eu/q/https://jezenthomas.com/2025/04/test-spies-in-haskell/" rel="nofollow noopener noreferrer" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">discu.eu/q/https://jezenthomas</span><span class="invisible">.com/2025/04/test-spies-in-haskell/</span></a></p><p><a href="https://mastodon.social/tags/haskell" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>haskell</span></a> <a href="https://mastodon.social/tags/programming" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>programming</span></a></p>
Hacker News 50<p>Falsify: Hypothesis-Inspired Shrinking for Haskell (2023)</p><p>Link: <a href="https://www.well-typed.com/blog/2023/04/falsify/" rel="nofollow noopener noreferrer" translate="no" target="_blank"><span class="invisible">https://www.</span><span class="ellipsis">well-typed.com/blog/2023/04/fa</span><span class="invisible">lsify/</span></a><br>Discussion: <a href="https://news.ycombinator.com/item?id=43746017" rel="nofollow noopener noreferrer" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">news.ycombinator.com/item?id=4</span><span class="invisible">3746017</span></a></p><p><a href="https://social.lansky.name/tags/haskell" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>haskell</span></a></p>
Lobsters<p>Better error handling <a href="https://lobste.rs/s/ucrv1t" rel="nofollow noopener noreferrer" translate="no" target="_blank"><span class="invisible">https://</span><span class="">lobste.rs/s/ucrv1t</span><span class="invisible"></span></a> <a href="https://mastodon.social/tags/go" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>go</span></a> <a href="https://mastodon.social/tags/haskell" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>haskell</span></a> <a href="https://mastodon.social/tags/programming" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>programming</span></a> <a href="https://mastodon.social/tags/rust" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>rust</span></a><br><a href="https://meowbark.dev/Better-error-handling" rel="nofollow noopener noreferrer" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">meowbark.dev/Better-error-hand</span><span class="invisible">ling</span></a></p>
Leanpub<p>Algebra-Driven Design: Elegant Solutions from Simple Building Blocks <a href="https://leanpub.com/algebra-driven-design" rel="nofollow noopener noreferrer" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">leanpub.com/algebra-driven-des</span><span class="invisible">ign</span></a> by Sandy Maguire is the featured book 📖 on the Leanpub homepage! <a href="https://leanpub.com" rel="nofollow noopener noreferrer" translate="no" target="_blank"><span class="invisible">https://</span><span class="">leanpub.com</span><span class="invisible"></span></a> <a href="https://mastodon.social/tags/Haskell" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>Haskell</span></a> <a href="https://mastodon.social/tags/SoftwareEngineering" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>SoftwareEngineering</span></a> <a href="https://mastodon.social/tags/SoftwareArchitecture" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>SoftwareArchitecture</span></a> <a href="https://mastodon.social/tags/books" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>books</span></a> <a href="https://mastodon.social/tags/ebooks" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>ebooks</span></a> <a href="https://mastodon.social/tags/programming" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>programming</span></a></p><p>Find it on Leanpub!</p>
Haskell Weekly<p>"Extensible Records Problem"</p><p><a href="https://docs.google.com/spreadsheets/d/14MJEjiMVulTVzSU4Bg4cCYZVfkbgANCRlrOiRneNRv8/edit?gid=0#gid=0" rel="nofollow noopener noreferrer" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">docs.google.com/spreadsheets/d</span><span class="invisible">/14MJEjiMVulTVzSU4Bg4cCYZVfkbgANCRlrOiRneNRv8/edit?gid=0#gid=0</span></a></p><p>Discussions: <a href="https://discu.eu/q/https://docs.google.com/spreadsheets/d/14MJEjiMVulTVzSU4Bg4cCYZVfkbgANCRlrOiRneNRv8/edit?gid=0%23gid=0" rel="nofollow noopener noreferrer" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">discu.eu/q/https://docs.google</span><span class="invisible">.com/spreadsheets/d/14MJEjiMVulTVzSU4Bg4cCYZVfkbgANCRlrOiRneNRv8/edit?gid=0%23gid=0</span></a></p><p><a href="https://mastodon.social/tags/haskell" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>haskell</span></a> <a href="https://mastodon.social/tags/programming" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>programming</span></a></p>
Tariq<p><a href="https://mastodon.social/tags/haskell" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>haskell</span></a> question</p><p>Bit confused by Weak Head Normal Form (WHNF). </p><p>The Haskell Wiki lists three criteria (below)</p><p>I understand each criterion individually - but not why together a thing called WHNF.</p><p>Is it that WHNF only can be pattern-matched on?</p><p>-----</p><p>* a constructor (eventually applied to arguments) like True, Just (square 42) or (:) 1.</p><p>* a built-in function applied to too few arguments (perhaps none) like (+) 2 or sqrt.</p><p>* or a lambda abstraction \x -&gt; expression.</p><p>? (mooc say constants)</p>
Haskell Weekly<p>GSoC proposal : Documenting and improving cmm</p><p><a href="https://discourse.haskell.org/t/gsoc-2025-documenting-and-improving-cmm/11870" rel="nofollow noopener noreferrer" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">discourse.haskell.org/t/gsoc-2</span><span class="invisible">025-documenting-and-improving-cmm/11870</span></a></p><p>Discussions: <a href="https://discu.eu/q/https://discourse.haskell.org/t/gsoc-2025-documenting-and-improving-cmm/11870" rel="nofollow noopener noreferrer" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">discu.eu/q/https://discourse.h</span><span class="invisible">askell.org/t/gsoc-2025-documenting-and-improving-cmm/11870</span></a></p><p><a href="https://mastodon.social/tags/haskell" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>haskell</span></a> <a href="https://mastodon.social/tags/programming" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>programming</span></a></p>
José A. Alonso<p>Readings shared April 19, 2025. <a href="https://jaalonso.github.io/vestigium/posts/2025/04/19-readings_shared_04-19-25" rel="nofollow noopener noreferrer" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">jaalonso.github.io/vestigium/p</span><span class="invisible">osts/2025/04/19-readings_shared_04-19-25</span></a> <a href="https://mathstodon.xyz/tags/Algorithms" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>Algorithms</span></a> <a href="https://mathstodon.xyz/tags/FunctionalProgramming" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>FunctionalProgramming</span></a> <a href="https://mathstodon.xyz/tags/Haskell" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>Haskell</span></a> <a href="https://mathstodon.xyz/tags/ITP" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>ITP</span></a> <a href="https://mathstodon.xyz/tags/IsabelleHOL" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>IsabelleHOL</span></a> <a href="https://mathstodon.xyz/tags/LeanProver" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>LeanProver</span></a> <a href="https://mathstodon.xyz/tags/MachineLearning" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>MachineLearning</span></a> <a href="https://mathstodon.xyz/tags/Math" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>Math</span></a> <a href="https://mathstodon.xyz/tags/Python" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>Python</span></a> <a href="https://mathstodon.xyz/tags/SMT" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>SMT</span></a> <a href="https://mathstodon.xyz/tags/Z3" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>Z3</span></a></p>
Tariq<p><a href="https://mastodon.social/tags/haskell" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>haskell</span></a> exercise I'm not sure of</p><p>---</p><p>Which of these values is not in WHNF weak head normal form?</p><p>map</p><p>f 1 : map f (2 : [])</p><p>Just (not False)</p><p>(\x -&gt; x) True</p><p>---</p><p>Let's work backwards.</p><p>(\x -&gt; x) True is a function with sufficient arguments so can be evaluated. Not WHNF.</p><p>Just (not False) has a constructor outermost so is WHNF.</p><p>f1 : map f (2 : []) again has constructor : as outermost so is WHNF.</p><p>map .. not sure why this is WHNF.</p>
Leanpub<p>New Book Launch! 🚀 Unwrapping Monads &amp; Friends by Kyle Simpson </p><p><a href="https://leanpub.com/blog/new-book-launch-unwrapping-monads-friends-by-kyle-simpson" rel="nofollow noopener noreferrer" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">leanpub.com/blog/new-book-laun</span><span class="invisible">ch-unwrapping-monads-friends-by-kyle-simpson</span></a></p><p><a href="https://mastodon.social/tags/books" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>books</span></a> <a href="https://mastodon.social/tags/ebooks" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>ebooks</span></a> <a href="https://mastodon.social/tags/booktok" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>booktok</span></a> <a href="https://mastodon.social/tags/newreleases" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>newreleases</span></a> <a href="https://mastodon.social/tags/programming" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>programming</span></a> <a href="https://mastodon.social/tags/haskell" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>haskell</span></a></p>
Leanpub<p>Leanpub book LAUNCH 🚀 Unwrapping Monads &amp; Friends: Shining Light on Functional Programming's Scariest Concepts by Kyle Simpson <a href="https://youtu.be/gcNHDun3Gg0X" rel="nofollow noopener noreferrer" translate="no" target="_blank"><span class="invisible">https://</span><span class="">youtu.be/gcNHDun3Gg0X</span><span class="invisible"></span></a> <a href="https://mastodon.social/tags/books" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>books</span></a> <a href="https://mastodon.social/tags/leanpublishing" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>leanpublishing</span></a> <a href="https://mastodon.social/tags/selfpublishing" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>selfpublishing</span></a> <a href="https://mastodon.social/tags/booklaunch" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>booklaunch</span></a> <a href="https://mastodon.social/tags/haskell" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>haskell</span></a> <a href="https://mastodon.social/tags/programming" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>programming</span></a> <a href="https://mastodon.social/tags/functionalprogramming" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>functionalprogramming</span></a> <a href="https://mastodon.social/tags/JavaScript" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>JavaScript</span></a></p>
Tariq<p>I just learned about <a href="https://mastodon.social/tags/haskell" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>haskell</span></a>'s outside-in function evaluation ... </p><p>( vs inside-out evaluation common in languages like python )</p><p><a href="https://haskell.mooc.fi/part2#how-does-haskell-work" rel="nofollow noopener noreferrer" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">haskell.mooc.fi/part2#how-does</span><span class="invisible">-haskell-work</span></a></p><p>I don't yet know if this is the only mechanism to enable laziness, or one of several techniques that enable laziness.</p>
Lobsters<p>falsify: Hypothesis-inspired shrinking for Haskell <a href="https://lobste.rs/s/ywiqey" rel="nofollow noopener noreferrer" translate="no" target="_blank"><span class="invisible">https://</span><span class="">lobste.rs/s/ywiqey</span><span class="invisible"></span></a> <a href="https://mastodon.social/tags/haskell" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>haskell</span></a> <a href="https://mastodon.social/tags/python" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>python</span></a> <a href="https://mastodon.social/tags/testing" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>testing</span></a><br><a href="https://www.well-typed.com/blog/2023/04/falsify/" rel="nofollow noopener noreferrer" translate="no" target="_blank"><span class="invisible">https://www.</span><span class="ellipsis">well-typed.com/blog/2023/04/fa</span><span class="invisible">lsify/</span></a></p>
alios<p>"Propositions as traits, proofs as impls"</p><p><a href="https://23.social/tags/rustlang" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>rustlang</span></a> <a href="https://23.social/tags/scnr" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>scnr</span></a> <a href="https://23.social/tags/fp" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>fp</span></a> <a href="https://23.social/tags/haskell" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>haskell</span></a></p>
alios<p>I come to the point in <a href="https://23.social/tags/rustlang" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>rustlang</span></a> where I start feel comfortable with the <a href="https://23.social/tags/rustlang" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>rustlang</span></a> type system to do some serious type level programming... Noticable Effekt: where clauses blow up to a multiple of lines then the actual impl on value level, until it starts to hurt to factor out a new trait/impl pair.. This now feels (almost) as having back much of the missed stuff from <a href="https://23.social/tags/haskell" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>haskell</span></a> land which could at least be compensated.</p>
Haskell Weekly<p>[ANNOUNCE] GHC 9.10.2 is now available</p><p><a href="https://discourse.haskell.org/t/ghc-9-10-2-rc1-is-now-available/11882" rel="nofollow noopener noreferrer" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">discourse.haskell.org/t/ghc-9-</span><span class="invisible">10-2-rc1-is-now-available/11882</span></a></p><p>Discussions: <a href="https://discu.eu/q/https://discourse.haskell.org/t/ghc-9-10-2-rc1-is-now-available/11882" rel="nofollow noopener noreferrer" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">discu.eu/q/https://discourse.h</span><span class="invisible">askell.org/t/ghc-9-10-2-rc1-is-now-available/11882</span></a></p><p><a href="https://mastodon.social/tags/haskell" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>haskell</span></a> <a href="https://mastodon.social/tags/programming" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>programming</span></a></p>
Tariq<p>another <a href="https://mastodon.social/tags/haskell" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>haskell</span></a> question</p><p>f x y = g1 x y</p><p>can be reduced to </p><p>f x = g1 x</p><p>and probably again</p><p>f = g1 </p><p>------------</p><p>... but what about</p><p>f x y = (g1 x y) || (g2 x y)</p><p>when I try the following I get errors</p><p>f = g1 x || g2 x</p><p>and this too get errors</p><p>f = g1 || g2</p>
Tariq<p><a href="https://mastodon.social/tags/haskell" class="mention hashtag" rel="nofollow noopener noreferrer" target="_blank">#<span>haskell</span></a> puzzle !</p><p>the following is a recursive function written fairly generically</p><p>myfun a b [] = []<br>myfun a b (x:xs) = myfun a2 b xs<br> where a2 = something</p><p>for me this hangs unless I move the definition of a2 inline as follows</p><p>myfun a b [] = []<br>myfun a b (x:xs) = myfun (something) b xs</p><p>what am I doing wrong? I thought it would be equivalent ... </p><p>actual code is in reply to this post</p>