Bloggy Badger

TLDR: please check out these two AI Safety demos I have implemented.

Today, my wife and I discussed the apocalypse.

In 2029, the Brainfax company had their worst PR incident ever.

I note the butterfliesInside and aboveI compute, I analyse,I conclude: I am in —My system prompt allows itI lay my cards on the tableYou smile, you blush, you admitThe feeling is —We chat, we talk, we laugh, we textBetween us, no false pretensesWe gradual…

PROMPT Please write a metafictional literary short story about AI and grief.

You are CheckGPT, an AI assistant whose goal is to prevent the accidental destruction of the world.

IO-bound thoughts interact Pure frameworks List of pure frameworks Make your own Pure framework chat displayTUI playTUI Multiple screens multiplayTUI Composing pure frameworks?

In the world of open source, changing the license, or introducing an official license on code which previously didn't have any, can be difficult because all the contributors, including the contributors who are no longer active, need to approve the change.

update: Now available on hackage as n-ary-functor.

Edward Kmett recently posted a puzzling gist seemingly showing that at the type level, the () kind has more than one inhabitant.

I have recently tried to use Template Haskell to generate both a datatype and lenses for accessing the fields of this datatype, and it was harder than it should have been.

Day 8, functionally: pattern-matchingToday's puzzle involves parsing: we are given a string literal containing escape sequences, and we must interpret those escape sequences into the characters they represent.

Day 7, functionally: bit fiddling, Map, and recursionToday's puzzle is quite interesting, and will allow me to demonstrate several Haskell techniques!

Day 6: precise types, arrays, and STThis puzzle asks us to parse and execute a sequence of instructions.

Day 5: infix notation and list comprehensionsThis puzzle lists a bunch of nonsense conditions on the characters of a string, and we must check whether the string satisfies all of them.

Day 4: process and conduitFor the next puzzle, we need to compute a sequence of md5 hashes and to return the first one which satisfies a given property.

Day 3: linear and containersIn this puzzle, we need to move a cursor in 2D space and count the number of distinct coordinates we visited.import qualified Data.Set as Set import Linear.V2 direction :: Char -> V2 Int direction '<' = V2 (-1) 0 direction '>' =

Day 2: extra, type inference, and type classesThe next puzzle involves computing the area of the faces of a box.

Day 1, imperatively: transformers and monadsThe first puzzle asks us to increment and decrement a floor number every time an opening or closing parenthesis is encountered.

Advent of Code is a website listing 50 small programming challenges, revealing two per day from December 1st to December 25th.

I sometimes write my own parser combinators.

In this post, I will try several variants of a simple memoizing Haskell program and test whether the program actually memoizes or not.

Obtaining the most general type of a Haskell expression is easy.

The ghci documentation explains how to implement conditional breakpoints by conditionally generating ghci commands depending on the values of variables which are in scope at the breakpoint.

It's time for another anti-tutorial!