Thread: Can you count to ten?

Actually, most Scheme code can evaluate to itself which makes writing quines in Scheme mostly trivial if you can account for the unquote operator.

Originally Posted by swgh

BBC Basic

Code:

REM 1-10 printing
REM written by Ada Skyla-Rose
REM ===================
FOR i = 1 TO 10
PRINT i
NEXT i
ENDPROC
END

This won't run in BBC BASIC since you haven't defined the procedure. Remove the ENDPROC and it will work - or define the procedure. This will work in BBC BASIC for Windows:

Code:

      PROC_loop
      PRINT
      PRINT "THE END."
      END
     
      DEF PROC_loop
      FOR I=1 TO 10
        PRINT I;
      NEXT I
      ENDPROC

...as will the REPEAT...UNTIL loop in BBC BASIC that I posted earlier on in this thread.

May as well add the WHILE...ENDWHILE loop way of doing this in BBC BASIC

Code:

      
      REM WHILE...ENDWHILE loop BBC BASIC (BBC BASIC for Windows & BBC BASIC V)
      a%=0
      WHILE a%<10
        a%+=1
        PRINT a%
      ENDWHILE
      END

You would make a good Java programmer, John

What makes you say that?

Your Haskell is enterprise quality

Lol I literally just started reading about how in categorical terms an applicative is actually a monoidal functor. I think everything in Haskell is enterprise-quality by nature of the beast XD

Seriously, the most useless thing ever but I can't pull myself away from it!

Heh heh. Not as much fun as the category theory version though :P

It's really fun to think about while I'm at work because Lord knows I can't focus on actual work that long.

D actually supports a "pure" keyword. I wish C++ did too... :P

But yeah, the IO monad is basically a way of guaranteeing the same function execution, even if the input is different. Fundamentally, FP is about categories over types and how those types are transformed from one to the other. The type system does help keep things in line but that's more or less because it represents a functor and how functors transform categories.

Originally Posted by MutantJohn

D actually supports a "pure" keyword. I wish C++ did too... :P

It's not as useful as it seems. Purity is trivial to statically prove. And it doesn't help with CTFE, since if you want to guarantee it, the expression in question should be decorated as such, which C++ does have, in the form of constexpr.

Apl:

Code:

⍳10