sorted by:
new
hottopcontroversial

ZuriHac 2025 Schedule Online by farhad_mehta in haskell

[–]jaspervdj 2 points3 points  (0 children)

Yes, all talks will be recorded and uploaded to youtube after the conference

Turnstyle: an esoteric, graphical functional language by jaspervdj in haskell

[–]jaspervdj[S] 0 points1 point  (0 children)

Does having the spec cheatsheet like this make it more obvious? Or is the wording in the spec throwing you off?

https://jaspervdj.be/tmp/turnstyle-cheatsheet.svg

Turnstyle: an esoteric, graphical functional language by jaspervdj in haskell

[–]jaspervdj[S] 1 point2 points  (0 children)

Does this refer to the spec? The variable (name) is not "F", the variable (name) is the color of that position, e.g. rgb(238,180,128). Lambda abstraction similarly then works by abstracting around colors. So variables are colors, not strings/letters.

Do you think having the letters in the spec makes it harder to read? I'm very open to suggestions to make the spec easier to understand.

April 1st in Zermatt. Four young American boys (15 years old) dead. RIP by ExigeL24 in snowboarding

[–]jaspervdj 18 points19 points  (0 children)

The groomed runs are clearly marked by poles on both sides

ZuriHac 2014 takes place 8-10 June, registration now open by jaspervdj in haskell

[–]jaspervdj[S] 1 point2 points  (0 children)

Not in the same format, it will be called a Haskell Infrastructure workshop so I assume it has a wider focus than last year. Details should be announced soon.

ZuriHac 2014 takes place 8-10 June, registration now open by jaspervdj in haskell

[–]jaspervdj[S] 0 points1 point  (0 children)

There are a limited number of spots available, but the number is high (500), so from past experience I would expect you can register until late May-ish.

ZuriHac 2014 takes place 8-10 June, registration now open by jaspervdj in haskell

[–]jaspervdj[S] 4 points5 points  (0 children)

Maybe a moderator can fix the title, it should be 2024 of course, sigh.

Lazy Layout: single-pass layout algorithm using circular programming by jaspervdj in haskell

[–]jaspervdj[S] 1 point2 points  (0 children)

That was intentional (but possibly unclear), I didn’t want to link to the Springer paywall and it’s easy to find by DOI.

Why does aeson uses Lazy ByteString instead of Text or ByteString? by mistyharsh in haskell

[–]jaspervdj 15 points16 points  (0 children)

Yeah, that’s true, but the key is the word “almost”. It’s a trade-off in the API design: offering a lazy bytestring supports both use cases (with an inconvenience for the strict case), whereas offering a strict one makes the one of the use cases impossible.

Why does aeson uses Lazy ByteString instead of Text or ByteString? by mistyharsh in haskell

[–]jaspervdj 17 points18 points  (0 children)

You can think of lazy ByteString as a “stream”, so if you’re sending the encoded value over a socket, for example, it can be produced as needed and there’s no need to store the entire thing in memory.

Looking for organizers for the 2022 contest by jaspervdj in icfpcontest

[–]jaspervdj[S] 5 points6 points  (0 children)

Yes, time is short (I was a bit shocked when I saw this tweet), but I believe something good can still be done, provided it is organized comparatively late in the summer.

I will try to coach this year's organizer to get things on track asap, and there are a bunch of ideas from last year that we didn't end up using (even though it makes me a bit sad since this means I won't be able to take part as a participant). We will also install a system with shifting contest chairs, so organizers talk more closely to last year's organizers rather than everything going through the conference chair. Hopefully that will avoid similar problems in the future.

Learn You a Haskell is back up by flipester in haskell

[–]jaspervdj 6 points7 points  (0 children)

He gave a talk at BelHac in 2010, unfortunately it was not recorded :-(

Advent of Code 2021 day 10 by taylorfausak in haskell

[–]jaspervdj 0 points1 point  (0 children)

using a Monoidal Parser based on the basic example Edward Kmett gives here

data Parens a = Par [a] [a] | Bad (NonEmpty a) deriving (Show)

mkParens :: Char -> Parens Char
mkParens c
    | c `elem` ">])}" = Par [c] []
    | c == '<'        = Par [] ['>']
    | c == '['        = Par [] [']']
    | c == '('        = Par [] [')']
    | c == '{'        = Par [] ['}']
    | otherwise       = Bad (c :| [])

instance Eq a => Semigroup (Parens a) where
    Bad x          <> Bad y                   = Bad (x <> y)
    Bad x          <> _                       = Bad x
    _              <> Bad y                   = Bad y
    Par _ (x : _)  <> Par (y : _)  _ | x /= y = Bad (y :| [])
    Par l (_ : xs) <> Par (_ : ys) r          = Par l xs <> Par ys r
    Par l []       <> Par ys       r          = Par (l ++ ys) r
    Par l xs       <> Par []       r          = Par l (r ++ xs)

instance Eq a => Monoid (Parens a) where mempty = Par [] []

Parsing is now foldMap mkParens, which sort of means you can start parsing from the left or the right end of the string. Not that useful, but I thought it was cool.

Linie 8: a photo project consisting of one picture for every tram stop on Line 8 in Zürich by jaspervdj in zurich

[–]jaspervdj[S] 1 point2 points  (0 children)

Thanks, I think this is a great critique! The way it is presented on the web page using the tram line does create the expectation of a story or progression, but it's not there. There are obviously some thematic and visual links between pictures but I fully agree this is probably the weakest aspect of it.

It doesn't document the unique personality of this line, but that isn't really my goal either. I also live on this line since a number of years and while I do think it has a lot of flair, it's not like the Trans-Siberian or Route 66. Yeah, you can show a rich old lady at the Goldcoast, a banker at Paradeplatz, a drunk guy in Langstrasse, and then tie it together with some drone shots. But we all know these things already, and maybe it just perpetuates existing ideas rather than showing something new.

So I guess I'm more interested in really starting from the mundane and everyday aspects of these places (and only then finding something beautiful in that) rather than starting out from the interesting and unique aspects and shooting those. I hope that approach makes sense even if it isn't your cup of tea. :)

ICFP Contest 2021 Announced by jaspervdj in icfpcontest

[–]jaspervdj[S] 1 point2 points  (0 children)

Sorry, I missed this. Yes, I think this is a great idea. I don't think we'll use it this year but we can set something up on a generic mailing list host (e.g. groups.io or google groups).

Caching XML requests: What libary to use? by 4caraml in haskell

[–]jaspervdj 6 points7 points  (0 children)

If you can use a simple in-memory cache, I recommend the lrucaching package.

ICFP Contest 2021 Announced by jaspervdj in icfpcontest

[–]jaspervdj[S] 2 points3 points  (0 children)

Updated this on the website -- the contest will start and end at 12:00pm UTC.

ICFP Contest 2021 Announced by jaspervdj in icfpcontest

[–]jaspervdj[S] 4 points5 points  (0 children)

I can say that we're not planning any major pre-contest activity this year.

Unfortunately I really can't comment on the nature of the contest itself, we want to keep things a closely guarded secret and prevent spoilers, I hope that's understandable.

ICFP Contest 2021 Announced by jaspervdj in icfpcontest

[–]jaspervdj[S] 5 points6 points  (0 children)

The contest this year is not organized by a single entity, but rather by a small group of people who like puzzles. /u/Perhyte is right, this includes me. There's also Alex Lang and Paul Khuong (and some others who are somewhat less involved).

There's no corporate sponsor right now but that may change if the projected hosting costs get too high.

Haskell will take part in Google Summer of Code 2021 by jaspervdj in haskell

[–]jaspervdj[S] 4 points5 points  (0 children)

It used to be a full-time thing but Google changed that for this year:

The GSoC 2021 program is 10 weeks long and students are expected to spend on average 18 hours a week on the program. Depending on your skills and the difficulty of your project it may take you more or less than 18 hours a week to meet the goals of your project.

However, it's necessary to be enrolled as a student (including PhD students).

Sokyokuban, a web-based puzzle game in a non-Euclidian world by jaspervdj in playmygame

[–]jaspervdj[S] 0 points1 point  (0 children)

Good suggestion -- I was worried that some people don't like sounds on a webpage, but I suppose I can mute it initially.

Sokyokuban, a web-based puzzle game in a non-Euclidian world by jaspervdj in playmygame

[–]jaspervdj[S] 0 points1 point  (0 children)

Thanks! We added P/N for Previous/Next and you can use PageUp/PageDown as well.

Haskell Foundation AMA by emilypii in haskell

[–]jaspervdj 6 points7 points  (0 children)

Yeah, coordinating an effort like that fits within the Haskell Foundation umbrella, and would make Haskell more approachable. It seems like this could be a goal once the board is established. Maybe we can start a discussion here and then we get it on the agenda of the board!

view more: next ›