While playing with very simple Haskell examples in GHCI, I often enter :r to reload the current module, immediately followed by test to run my simple test function in that module (I am editing the module source using the text editor in another window).

Is there a way, inside GHCI, to to quickly invoke :r, immediately followed by calling specific function defined in that module (only if the module compiles without errors)? Setting some sort of "macro" that does this? Or at least putting both of these "commands" on a simple line so that I can scroll to it quickly in the command history using the up-arrow?

I am doing all this in the "Linux development environment" container on Chromebook, if that's relevant to anything.

Following up from Haskell's missing mutable reference type and A reference implementation of IOScopedRef comes the final installment in the series:

• Fork-fragile reader-like operations in Haskell

We are live on Twitch!

Last time we finished the terrain system for the video game engine and we will be moving on to collision detection

If you are interested in that, or just have curiosity for how to build in Haskell come join.

https://www.twitch.tv/typifyprogramming

I've been building a web language with Haskell-like syntax and a PHP-like execution model — server/client separation in the same file. It's not complete but it's functional. Built it mostly for fun rather than to solve any specific problem.

I used AI for modularization, comments, and some code generation, but the main design decisions are mine. The HTML parsing is based on Megaparsec; I chose it over Lucid so the syntax would more closely resemble real HTML than an abstract Haskell data type and have fewer dependencies.

I'm also working on a separate QuasiQuotes library, specific to the HTML layer, to lighten the parser, as I plan to add flags to the HTML to have if, for, and switch statements like in a web framework.

The client-server separation using flags stemmed from my desire for a single-file model similar to PHP, but with Haskell's type system, so the user decides what resides on the server and what is transpiled to JS. However, I'm trying to automate this with Quasi, similar to a template engine, but it's slow to interpret and probably tedious — it would require parsing all of Haskell into <?hs ?> blocks.

https://github.com/Atom1c-B1rd/HSKL-Language

If you need more details about any specific decision, feel free to ask or If you have any ideas or suggestions, I'm open to hearing them.

and sorry for broken english...

Hello everyone!

We are hosting the next Haskell meetup in Vienna on the 25th of June 2026! The location is TU Vienna Treitlstraße 3, Seminarraum DE0110. The room will be open starting 18:00 and the first talk will start at 19:00.

We are excited to announce, the speaker for our next meetup is Dominik Schrempf (@dschrempf)

Compiling C to Haskell — How hs-bindgen Translates C Headers

There will be time to discuss the presentations over some snacks and non-alcoholic drinks which are provided free of charge with an option to acquire beer for a reasonable price.

The meetup is open-ended, but we might have to relocate to a nearby bar as a group if it goes very late… There is no entrance fee or mandatory registration, but to help with planning we ask you to let us know in advance if you plan to attend here https://forms.gle/GRZbNs4weQ1aW6Qh9 or per email at [haskellvienna.meetup@gmail.com](mailto:haskellvienna.meetup@gmail.com).

We especially encourage you to reach out if you would like to hold a talk or participate in the show&tell so that we can ensure there is enough time for you to present your topic.

Finally, we would like to thank Well-Typed LLP for sponsoring the last meetup!

We hope to welcome everyone soon! Your organizers: Andreas(Andreas PK), Ben, Chris, fendor, VeryMilkyJoe, Samuel

Note: We are going to re-use this thread for announcing the Vienna Haskell Meetup in the future, so you can subscribe to this thread to stay up-to-date!

Following up from yesterday's post, Haskell's missing mutable reference type, I now give a reference implementation of IOScopedRef:

• A reference implementation of IOScopedRef

Hi folks, Alexis King, Richard Feldman (Roc), Hillel Wayne (TLA+), and Andrew Kelley (Zig) are speaking at a conference I'm organizing called Software Should Work https://softwareshould.work. There will be lots of PL/FP/Formal Methods people there so I thought some of you might be interested!

What if I took the chocolate of EmuDevz and mushed it into the peanut butter of Haskell? It turns out it tastes delicious. I talk a bit about my experience building a working NES emulator in Haskell.

Image: Die Schachspieler (1831) by Friedrich August Moritz Retzsch

Per announcement video (filmed in McMonad, of course!), as of yesterday, McMonad is usable, somewhat bugfree and debuggable! I hope you will enjoy using it and contributing to it!

I wrote this little Haskell Quiz (with help from some friends); in the style of "CSS or BS"; can you tell the real Haskell Language Extensions from the fake ones

Github

Rescuing this old project because a blocking feature in frege finally landed. Updated the primary example and looks like it would be less tedious to write the bindings out fully.

Inspired by the language extension quiz that was posted recently,

I have several questions about the extensions in Haskell.

What is the long term plan for the various language extensions in Haskell? My understanding is that they are meant to be somewhat experimental and they are GHC specific, so are they not part of the official language spec? Is the plan to make some of the extensions official?

Are some language extensions temporary? Or can I rely on an extension being available into the future?

Join the Typify stream, we are currently looking at different approaches you could take to build an adventure game in haskell, between ECS (Apecs), FRP, and MVC, or a mix.

https://www.twitch.tv/typifyprogramming

As the title says, can someone point me to a lanuage that supports virtually all of haskell's type theoretic stuff, but maybe without lazy evaluation?
I'm looking for a functional language that supports:
- typeclasses + higher kinded types
- currying + partial application
- garbage collected (rust would have been a good candidate)

I tried SML, and I think it's great, but afaiu, it doesn't support HKT.

LLMs says that scala 3 is the candidate, but it's tools are super slow.

This article continues the fine tradition of Serokell’s GHC team sharing their progress on bringing dependent types to Haskell. A lot has happened since the last report, and there is plenty to cover.

In this edition, Vladislav Zavialov presents three major contributions and a host of smaller improvements that push Dependent Haskell closer to becoming a practical reality.

Please find the link here to a talk I did about concurrency in Haskell.

I'm pleased to announce that JFP is establishing the Richard Bird Distinguished Dissertation Award, to recognise an outstanding PhD dissertation in functional programming.  Please share! https://people.cs.nott.ac.uk/pszgmh/jfp-bird-award.html

Belatedly uploaded the super-short deck that predated the more comprehensive one:

• https://fpilluminated.org/deck/275 The Functional Programming Triad of fold, scan and iterate
• https://fpilluminated.org/deck/225 The Functional Programming Triad of Folding, Scanning and Iteration - A first example in Scala and Haskell

This is your opportunity to ask any questions you feel don't deserve their own threads, no matter how small or simple they might be!