Recent searches

No recent searches

Search options

Only available when logged in.
eupolicy.social is one of the many independent Mastodon servers you can use to participate in the fediverse.
This Mastodon server is a friendly and respectful discussion space for people working in areas related to EU policy. When you request to create an account, please tell us something about you.

Administered by:

Server stats:

196
active users

eupolicy.social: AboutProfiles directoryPrivacy policy

Mastodon: AboutGet the appKeyboard shortcutsView source codev4.4.1

#haskell

3 posts3 participants0 posts today
HoldMyType<p><span class="h-card" translate="no"><a href="https://chaos.social/@quincy" class="u-url mention" rel="nofollow noopener" target="_blank">@<span>quincy</span></a></span> <a href="https://mathstodon.xyz/tags/nix" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>nix</span></a> <a href="https://mathstodon.xyz/tags/stack" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>stack</span></a> <a href="https://mathstodon.xyz/tags/haskell" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>haskell</span></a> <br>Depends on your fod flake.nix or ifd release.nix</p>
Quincy<p>💡 when using <a href="https://chaos.social/tags/haskell" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>haskell</span></a> <a href="https://chaos.social/tags/stack" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>stack</span></a> with <a href="https://chaos.social/tags/nix" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>nix</span></a>, I mustn't put dependencies in package.yaml under dependencies. they will be found when specified as nix packages</p>
Abhinav 🌏<p>I'm writing a series of blog posts, in which I write a <a href="https://fantastic.earth/tags/bytecode" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>bytecode</span></a> <a href="https://fantastic.earth/tags/compiler" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>compiler</span></a> and a <a href="https://fantastic.earth/tags/virtualMachine" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>virtualMachine</span></a> for arithmetic in <a href="https://fantastic.earth/tags/Haskell" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>Haskell</span></a>. We explore the following topics in the series:</p><p>- Parsing arithmetic expressions to ASTs.<br>- Compiling ASTs to bytecode.<br>- Interpreting ASTs.<br>- Efficiently executing bytecode in a VM.<br>- Disassembling bytecode and decompiling opcodes for debugging and testing.<br>- Unit testing and property-based testing for our compiler and VM.<br>- Benchmarking our code to see how the different passes perform.<br>- All the while keeping an eye on performance.</p><p>The second post of the series that focuses on writing the <a href="https://fantastic.earth/tags/compiler" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>compiler</span></a> is now out: <a href="https://abhinavsarkar.net/posts/arithmetic-bytecode-vm-compiler" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">abhinavsarkar.net/posts/arithm</span><span class="invisible">etic-bytecode-vm-compiler</span></a></p><p><a href="https://fantastic.earth/tags/programming" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>programming</span></a> <a href="https://fantastic.earth/tags/Blogging" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>Blogging</span></a> <a href="https://fantastic.earth/tags/compilers" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>compilers</span></a> <a href="https://fantastic.earth/tags/programmingLanguages" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>programmingLanguages</span></a></p>
HaskellOrg<p>The GHC developers are very pleased to announce the availability of the first alpha prerelease of GHC 9.14.1.</p><p>Highlights:</p><p>* Major improvements to the Specialiser<br>* SSE/AVX support in the x86 native backend<br>* Significant improvements in the GHCi debugger</p><p><a href="https://blog.haskell.org/ghc-9-14-1-alpha1/" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">blog.haskell.org/ghc-9-14-1-al</span><span class="invisible">pha1/</span></a></p><p><a href="https://fosstodon.org/tags/Haskell" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>Haskell</span></a></p>
arialdo<p>Read it. It’s short enough to be completed in an afternoon.</p><p>Went back trying to understand The Book of Monads. There are parts that are way too difficult for my poor knowledge of <a href="https://mastodon.online/tags/Haskell" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>Haskell</span></a>.</p>
Leftover woman<p>Still trying to do ⬆️ 😭 <a href="https://social.vivaldi.net/tags/nix" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>nix</span></a> <a href="https://social.vivaldi.net/tags/lix" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>lix</span></a> <a href="https://social.vivaldi.net/tags/haskell" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>haskell</span></a></p>
John Goerzen<p><span class="h-card" translate="no"><a href="https://toot.cafe/@matt" class="u-url mention" rel="nofollow noopener" target="_blank">@<span>matt</span></a></span> There is something really elegant about <a href="https://floss.social/tags/Haskell" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>Haskell</span></a>, and its isolation of "pure" functions (which can't perform I/O) from impure functions, as well as general data immutability, make for nice designs that are easy to reason about, and excellent recursion handling also feeds into that.</p><p>That said, memory usage in Haskell can be hard to reason about, and Rust gives some of those guarantees with its "mut" keyword.</p><p>I do a lot of systems programming, so would mostly go for Rust these days.</p>
tristanC<p>The source code of the WhyLambda challenge are now available here:) <a href="https://codeberg.org/TristanCacqueray/why-lambda" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">codeberg.org/TristanCacqueray/</span><span class="invisible">why-lambda</span></a></p><p>It's a little computer program I created at <a href="https://functional.cafe/tags/why2025" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>why2025</span></a> to explain lambda calculus and introduce <a href="https://functional.cafe/tags/haskell" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>haskell</span></a> from the ground up. To my knowledge it's the first of its kind, and it remains unsolved, so please contact me if you crack it!</p>
Woke Leftist Trash<p>Streaming tonight. Might publish the tigerbeetle-hs package or just pick a library or language extension and see what we can learn. Last one before I take a summer break!</p><p>The stream will return in September on TUESDAY evenings at the same time.</p><p><a href="https://twitch.tv/agentultra" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://</span><span class="">twitch.tv/agentultra</span><span class="invisible"></span></a></p><p><a href="https://types.pl/tags/haskell" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>haskell</span></a></p>
Björn Gohla<p><span class="h-card" translate="no"><a href="https://mathstodon.xyz/@andrejbauer" class="u-url mention" rel="nofollow noopener" target="_blank">@<span>andrejbauer</span></a></span> <span class="h-card" translate="no"><a href="https://mathstodon.xyz/@jonmsterling" class="u-url mention" rel="nofollow noopener" target="_blank">@<span>jonmsterling</span></a></span> </p><p>I have on occasion lamented that <a href="https://mathstodon.xyz/tags/Haskell" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>Haskell</span></a> isn't used more in scientific computing.</p><p>It's puzzling, because you would think that it's more important to a mathematician to understand their programs, than for them to run fast.</p>
Miriam Glitsh<p><a href="https://babka.social/tags/Haskell" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>Haskell</span></a> fans, I think it's fun that haskel (השׂכּל) means intelligence in hebrew.</p>
Leftover woman<p>So what's the <a href="https://social.vivaldi.net/tags/nix" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>nix</span></a> way to make a C library available to Cabal? <a href="https://social.vivaldi.net/tags/haskell" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>haskell</span></a></p>
Abhinav 🌏<p>I'm starting a series of blog posts, in which I write a <a href="https://fantastic.earth/tags/bytecode" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>bytecode</span></a> <a href="https://fantastic.earth/tags/compiler" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>compiler</span></a> and a <a href="https://fantastic.earth/tags/virtualMachine" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>virtualMachine</span></a> for arithmetic in <a href="https://fantastic.earth/tags/Haskell" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>Haskell</span></a>. We explore the following topics in the series:</p><p>- Parsing arithmetic expressions to ASTs.<br>- Compiling ASTs to bytecode.<br>- Interpreting ASTs.<br>- Efficiently executing bytecode in a VM.<br>- Disassembling bytecode and decompiling opcodes for debugging and testing.<br>- Unit testing and property-based testing for our compiler and VM.<br>- Benchmarking our code to see how the different passes perform.<br>- All the while keeping an eye on performance.</p><p>The first post of the series that focuses on writing the <a href="https://fantastic.earth/tags/parser" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>parser</span></a> is now out: <a href="https://abhinavsarkar.net/posts/arithmetic-bytecode-vm-parser/" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">abhinavsarkar.net/posts/arithm</span><span class="invisible">etic-bytecode-vm-parser/</span></a></p><p><a href="https://fantastic.earth/tags/programming" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>programming</span></a> <a href="https://fantastic.earth/tags/Blogging" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>Blogging</span></a> <a href="https://fantastic.earth/tags/compilers" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>compilers</span></a> <a href="https://fantastic.earth/tags/programmingLanguages" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>programmingLanguages</span></a></p>
Woke Leftist Trash<p>I think I might’ve got the first cut of tigerbeetle-hs nearly done. </p><p><a href="https://types.pl/tags/haskell" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>haskell</span></a></p>
José A. Alonso<p>Readings shared July 29, 2025. <a href="https://jaalonso.github.io/vestigium/posts/2025/07/30-readings_shared_07-29-25" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">jaalonso.github.io/vestigium/p</span><span class="invisible">osts/2025/07/30-readings_shared_07-29-25</span></a> <a href="https://mathstodon.xyz/tags/CoqProver" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>CoqProver</span></a> <a href="https://mathstodon.xyz/tags/FormalVerification" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>FormalVerification</span></a> <a href="https://mathstodon.xyz/tags/FunctionalProgramming" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>FunctionalProgramming</span></a> <a href="https://mathstodon.xyz/tags/Haskell" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>Haskell</span></a> <a href="https://mathstodon.xyz/tags/IMO" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>IMO</span></a> <a href="https://mathstodon.xyz/tags/ITP" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>ITP</span></a> <a href="https://mathstodon.xyz/tags/LLMs" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>LLMs</span></a> <a href="https://mathstodon.xyz/tags/LeanProver" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>LeanProver</span></a> <a href="https://mathstodon.xyz/tags/MachineLearning" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>MachineLearning</span></a> <a href="https://mathstodon.xyz/tags/Math" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>Math</span></a> <a href="https://mathstodon.xyz/tags/ProofAssistant" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>ProofAssistant</span></a> <a href="https://mathstodon.xyz/tags/Rocq" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>Rocq</span></a> <a href="https://mathstodon.xyz/tags/Rust" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>Rust</span></a></p>
José A. Alonso<p>Comparing codes: Spiral matrix (another matrix layer problem). ~ James Bowen. <a href="https://mmhaskell.com/blog/2025/7/28/spiral-matrix-another-matrix-layer-problem" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">mmhaskell.com/blog/2025/7/28/s</span><span class="invisible">piral-matrix-another-matrix-layer-problem</span></a> <a href="https://mathstodon.xyz/tags/Haskell" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>Haskell</span></a> <a href="https://mathstodon.xyz/tags/FunctionalProgramming" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>FunctionalProgramming</span></a> <a href="https://mathstodon.xyz/tags/Rust" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>Rust</span></a></p>
Jacket<p><a href="https://tech.lgbt/tags/Functional" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>Functional</span></a> programing will probably become the most popular paradigm of <a href="https://tech.lgbt/tags/quantum" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>quantum</span></a> computing. It's impossible for now to copy a qubit so any algorithms has to be written in a stateless way. At the moment, quantum algorithms are written in a more declarative manner cause we are still figuring out how to do anything with those machine. There is some attempts at creating functional languages for quantum computers but at the moment you can't run them on hardware. I'm talking here about <a href="https://tech.lgbt/tags/Quipper" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>Quipper</span></a>, <a href="https://tech.lgbt/tags/QML" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>QML</span></a>, and <a href="https://tech.lgbt/tags/Silq" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>Silq</span></a> but I'm convinced that this will be the way once we will figure out how to make a quantum computer stable. Quipper is based on <a href="https://tech.lgbt/tags/Haskell" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>Haskell</span></a>. I just find it cool.</p>
Leanpub<p>Sockets and Pipes: Connect with Haskell <a href="https://leanpub.com/sockets-and-pipes" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://</span><span class="">leanpub.com/sockets-and-pipes</span><span class="invisible"></span></a> by Type Classes is the featured book on the Leanpub homepage! <a href="https://leanpub.com" rel="nofollow noopener" 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" target="_blank">#<span>Haskell</span></a> <a href="https://mastodon.social/tags/programming" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>programming</span></a> <a href="https://mastodon.social/tags/books" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>books</span></a> <a href="https://mastodon.social/tags/ebooks" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>ebooks</span></a></p><p>Sockets and Pipes is not an introduction to Haskell; it is an introduction to writing software in Haskell. Using a handful of everyday Haskell libraries, this book walks through reading the HTTP specification and implementing it to create a web server. </p><p>Find it on Leanpub!</p>
José A. Alonso<p>Readings shared July 22, 2025. <a href="https://jaalonso.github.io/vestigium/posts/2025/07/23-readings_shared_07-22-25" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">jaalonso.github.io/vestigium/p</span><span class="invisible">osts/2025/07/23-readings_shared_07-22-25</span></a> <a href="https://mathstodon.xyz/tags/FunctionalProgramming" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>FunctionalProgramming</span></a> <a href="https://mathstodon.xyz/tags/Haskell" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>Haskell</span></a> <a href="https://mathstodon.xyz/tags/IMO" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>IMO</span></a> <a href="https://mathstodon.xyz/tags/ITP" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>ITP</span></a> <a href="https://mathstodon.xyz/tags/LLMs" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>LLMs</span></a> <a href="https://mathstodon.xyz/tags/Math" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>Math</span></a> <a href="https://mathstodon.xyz/tags/Rocq" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>Rocq</span></a> <a href="https://mathstodon.xyz/tags/Rust" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>Rust</span></a></p>
José A. Alonso<p>Comparing codes: Image rotation (Mutable arrays in Haskell). ~ James Bowen. <a href="https://mmhaskell.com/blog/2025/7/21/image-rotation-mutable-arrays-in-haskell" rel="nofollow noopener" translate="no" target="_blank"><span class="invisible">https://</span><span class="ellipsis">mmhaskell.com/blog/2025/7/21/i</span><span class="invisible">mage-rotation-mutable-arrays-in-haskell</span></a> <a href="https://mathstodon.xyz/tags/Haskell" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>Haskell</span></a> <a href="https://mathstodon.xyz/tags/FunctionalProgramming" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>FunctionalProgramming</span></a> <a href="https://mathstodon.xyz/tags/Rust" class="mention hashtag" rel="nofollow noopener" target="_blank">#<span>Rust</span></a></p>
TrendingLive feeds
About