wow fizbuz

the programming reddit is still talking about fizzbuzz

how fucking miserable is the programming scene?

Post a fizzbuzz program that you consider good.

This is now a fizzbuzz thread.

data FizzBuzz = Fiz | Buzz | FizzBuzz

>>3
deriving Show --Just making it easy, that's all boss.

Methinks >>1 failed fizbuz at job interview.

Start with the following generalization

data Q a b
= L a
| R b
| B a b

For which Q `Fizz `Buzz records the original data type from >>3

(note, I'm using ` to lift an ADT from the value to type level, this is a new GHC extensions called data primes which makes haskell closer to a research language)

Now following the work of Hutton and Wouter let's invert this statagorically to emephor it into using category theoretic idioms:

Q "=" Mu (KEEP :& DROP :+ DROP :& KEEP :+ KEEP :& KEEP)

There are a few things happening here that deserve some explanation. First of all Mu is the recursive endotensor which GHC pushes deeper into the functor.

+ and & are the usual sums and products which we know are bifunctors. This gives us a true functorial description of fizzbuzz once and for all. Furthermore, it's possible to do this generalically for any number of "buzzes" in a dependently typed language.

Once agains we've seen that haskell is the nothing of thing-in-itself which enables truly abstract mathematical thought and programing to blend beautifully!

>>6
Do you learn all that by yourself or is it forced down your throat semi-willingly by the academia?

>>7
original research do not steal

>>6

uh

#include <stdio.h>
int main(void){for
(int i=1;i<101;i++)
{if(!(i%3))printf
("FIZZ");if(!(i%5))
printf("BUZZ");if
(i%3&&i%5)printf
("%d",i);printf
("\n");}return 0;}

Screw programming. Get into the dubs scene! Check 'em

Pretty sure i created this thread.. ama

Pretty sure i created this thread.. ama

>>10
why didn't you define away printf

>>14
What do you mean?

Pretty sure i'm in the american medical association.. ama