highgramming

can you code while high?

fizzbuzz n = map aux [1..n]
aux [] = []
aux (a:as) =
| a `mod` 3 == 0 && a `mod` 5 == 0 = "FizzBuzz" : aux as
| a `mod` 3 == 0 = "Fizz" : aux as
| a `mod` 5 == 0 = "Buzz" : aux as
| otherwise = show a : aux as

100 e:N say N.divisors.take{6}.m{<3=\Fizz;5=\Buzz>}.join.<ø=A;X=X>

(([] STRUCT(PROC(INT)BOOL pred, STRING word) rule list, INT min, max) VOID:
    FOR n FROM min TO max DO
        BOOL found := FALSE;
        FOR i FROM LWB rule list TO UPB rule list DO
            (rule list[i][pred](n)|
                print(rule list[i][word]);
                found := TRUE)
        OD;
        (NOT found|print(n));
        print(new line)
    OD
)((((INT x)BOOL: (x MOD 3) = 0, "Fizz"),
    ((INT x)BOOL: (x MOD 5) = 0, "Buzz")), 1, 100)

PROC fizzbuzz = (INT x)VOID: print((
    IF x %* 3 = 0 THEN "fizz" ELSE "" FI,
    IF x %* 5 = 0 THEN "buzz" ELSE "" FI,
    IF x %* 3 /= 0 AND x %* 5 /= 0 THEN x ELSE "" FI,
    new line));
FOR i TO 100 DO fizzbuzz(i) OD

FORiTO100DO BOOLb:=FALSE;PRIO?=1;OP?=(INTx,STRINGs)VOID:print((b:=i%*x=0|s));3?"Fizz";5?"Buzz";(b|print(i));print(newline)OD

FOR i TO 100 DO printf(($c(
        "FizzBuzz", # = 0 #
        "", "", # = 1, 2 #
        "Fizz", # = 3 #
        "", # = 4 #
        "Buzz", # = 5 #
        "Fizz", # = 6 #
        "", "", # = 7, 8 #
        "Fizz", # = 9 #
        "Buzz", # = 10 #
        "", # = 11 #
        "Fizz", # = 12 #
        "", "" # = 13, 14 #
    ), g, l$, i %* 15 + 1, (i %* 3=0 OR i %* 5=0|""|i))) OD

PROC fizz buzz = (INT i)UNION(INT,STRING): (
    i %* 15 = 0 | "FizzBuzz" |:
    i %* 3 = 0 | "Fizz" |:
    i %* 5 = 0 | "Buzz" |
    i);
FOR i TO 100 DO print((fizz buzz(i), new line)) OD

FOR i TO 110 DO
    STRING pr;
    OP / = (STRING s, INT j)STRING: s * ABS(i %* j = 0);
    pr +:= "Fizz" / 3;
    pr +:= "Buzz" / 5;
    pr +:= "Bazz" / 7;
    print((IF pr /= "" THEN pr ELSE i FI, new line))
OD

lies

var muh = "dick";

copy and paste to the browser console

var str;
for(i=1;i<=100;i++){
 str="";
 if(i%3==0)str+="Muh";
 if(i%5==0)str+="Dick";
 if(i%3!=0&&i%5!=0)str=+i;
 console.log(str);
}

I can code while... high-level.

fizzBuzz n = maybe (show n) id (fizz n <> buzz n)
    where fizz x = guard (x `mod` 3 == 0) >> Just "Fizz"
          buzz x = guard (x `mod` 5 == 0) >> Just "Buzz"

main = mapM_ putStrLn $ fizzBuzz [1..100]

>>1
I once wrote a useful OCaml program of about 1200 lines.  I did the work in a dozen sessions, each of which involved being intoxicated by one substance or another: alcohol, hashish, heroin, MDMA, alcohol, DOB, alcohol etc.  It took about two months total, and I never touched the core code while not being intoxicated, and only fixed smallish startup bugs that were found during deployment.  The program is still running and doing useful work, but the source looks rather unorthodox.

From http://lurkmore.to/Tcl
TCL is a programmable metaprogramming language that was once popular among bearded men and women.  It allows you to program everything you can program in C while being completely shit-faced.  Because of this feature, the language is popular among scientific workers of various science institutes, academies of science, and CERNs.  By the way, TCL is often used as the command language for space telescopes, so the first Earthling entity to discover space aliens would likely be a piece of drunken code written in a drug-influenced language.
...
According to 95% of shit coders, Tcl syntax is incredibly ugly, however it allows one to program successfully while being severely wasted, and the resulting program would still work.

We can define arithmetic operations on cardinal numbers that generalize the ordinary operations for natural numbers. It can be shown that for finite cardinals these operations coincide with the usual operations for natural numbers. Furthermore, these operations share many properties with ordinary arithmetic.

Leibniz, one of the co-inventors of infinitesimal calculus, speculated widely about infinite numbers and their use in mathematics. To Leibniz, both infinitesimals and infinite quantities were ideal entities, not of the same nature as appreciable quantities, but enjoying the same properties

Artist M. C. Escher is specifically known for employing the concept of infinity in his work in this and other ways.

Many properties of Borel sets can be established in ZFC, but proving these properties hold for more complicated sets requires additional axioms related to determinacy and large cardinals.

Formally, this may be expressed as follows:

Some results in constructive set theory use the axiom of countable choice or the axiom of dependent choice, which do not imply the law of the excluded middle in constructive set theory.