←2006-11-07 2006-11-08 2006-11-09→ ↑2006 ↑all
00:13:45 <Razor-X> xor_: Ya here?
00:13:52 <xor_> yeah
00:13:57 <Razor-X> It's not that hard. I coded an IRC bot from scratch in Haskell.
00:14:08 <xor_> nice
00:14:21 <Razor-X> xor_: A few minutes after you left yesterday, I made a hackish function to evaluate things in postfix fashion in Lisp.
00:14:24 -!- tgwizard has quit (Remote closed the connection).
00:14:28 <xor_> oh?
00:14:31 <Razor-X> But I was too lazy to look up the (syntax-rules) way, so it's hackish.
00:15:09 <Razor-X> For clarification: is (= (/ 3 4 5) (postfix '(3 4 5 /))) #t?
00:15:21 <Razor-X> Or would it be (postfix '(5 4 3 /)) ?
00:15:49 <xor_> hmmm
00:15:53 <xor_> Dunno
00:15:59 <Razor-X> Take yer pick.
00:16:23 <xor_> The stack way
00:16:25 <lament> Razor-X: but that's a function, not a special form, so it's the same as in any other language.
00:16:32 <Razor-X> lament: Yeah.
00:16:58 <Razor-X> Well, I don't really use it as a procedure only. I just reverse the arguments and re-feed it to eval.
00:17:05 <Razor-X> But a special form would be the correct way.
00:29:24 <xor_> show me?
00:34:21 -!- CakeProphet has changed nick to SevenInchBread.
00:34:37 * SevenInchBread assumes the doughy form.
00:39:12 <Razor-X> xor_: Here.
00:39:18 <Razor-X> Sorry for the delay, I was eating.
00:41:50 <Razor-X> http://paste.lisp.org/display/29468
00:44:15 <xor_> what is set! ?
00:44:56 <Razor-X> It's an imperative operator.
00:45:20 <Razor-X> (define blah '(3)) (set! blah '(4 5)) blah --> (4 5)
00:45:43 <xor_> oh
01:33:25 -!- Sgeo has joined.
01:37:59 <SevenInchBread> Are there any programming languages based on Life?
01:52:43 -!- GregorR-L has quit ("Leaving").
03:07:33 -!- ivan` has quit (Connection reset by peer).
03:09:03 -!- SevenInchBread has quit (Read error: 145 (Connection timed out)).
03:23:40 -!- Asztal has quit ("Chatzilla 0.9.72-rdmsoft [XULRunner 1.8.1b2/0000000000]").
04:08:28 <Razor-X> Life itself is just like a programming language, with a set of operations, and a specific form of machine it operates on.
04:08:43 <xor_> barely
04:15:58 <calamari> there is a turing machine (or was it a utm?) implemented in the game of Life
04:18:32 -!- GregorR-L has joined.
04:36:09 -!- GregorR-L has quit (Read error: 148 (No route to host)).
05:14:12 -!- calamari has quit ("Leaving").
06:04:18 -!- ivan` has joined.
06:25:47 -!- GregorR-L has joined.
06:35:56 -!- Sgeo has quit (Remote closed the connection).
07:54:14 -!- GregorR-L has quit ("Leaving").
07:59:59 -!- clog has quit (ended).
08:00:00 -!- clog has joined.
08:06:41 -!- GreaseMonkey has joined.
08:07:54 -!- GreaseMonkey has changed nick to ^.
08:09:04 -!- ^ has changed nick to GreaseMonkey.
08:09:35 <GreaseMonkey> damn, doesn't support a lot of nicks
08:10:16 -!- GreaseMonkey has changed nick to ^_`.
08:38:59 <^_`> gonna go, bye
08:40:49 -!- ^_` has quit ("if({user~.programingInTomato;},{user~.weird=TRUE;});").
10:32:41 -!- ivan` has quit (Read error: 110 (Connection timed out)).
11:20:49 -!- ihope has joined.
12:20:22 -!- CXI has quit ("If you're reading this, it's probably xchat's fault.").
14:24:38 -!- jix has joined.
15:52:48 -!- cmeme has quit (Read error: 104 (Connection reset by peer)).
15:53:46 -!- cmeme has joined.
15:54:19 -!- cmeme has quit (Remote closed the connection).
15:54:51 -!- cmeme has joined.
16:12:20 -!- GregorR-L has joined.
17:22:29 -!- tgwizard has joined.
18:20:50 -!- ivan` has joined.
20:53:30 -!- CakeProphet has joined.
20:54:13 <CakeProphet> Wow... I'm very very bored.
20:54:16 * CakeProphet starting creating a brainfuck interpreter in Microsoft Excel... because his typing class is soooooooo boring.
20:55:00 <CakeProphet> I'm pretty sure you could create a finite-program-size version of Brainfuck in Microsoft Excel using formulas.
20:57:46 <xor_> ha ha lol
20:57:58 <xor_> How would you do that?
21:11:00 -!- Asztal has joined.
21:21:15 -!- CakeProphet has quit (Remote closed the connection).
21:23:31 -!- CakeProphet has joined.
21:23:44 <CakeProphet> xor, use A1 as the source code.
21:23:59 <xor_> ...
21:24:11 <CakeProphet> B1 through Bxxx becomes an iteration overthe contents of A1
21:24:43 <CakeProphet> B2 (and down) is the if check for pointer location, using the last pointer location as an input value...
21:25:32 <CakeProphet> and that's basically what I've got so far.
21:25:39 <xor_> hmm
21:26:28 <CakeProphet> =MID(A1, row(<current row>) - 1, 1)
21:26:47 <xor_> I'm no whiz at excel equations
21:27:08 <CakeProphet> would return a single character from the source in A1... so you just fill that formula down about 100-something times... and you've got an iteration over the contents of A1
21:28:12 <CakeProphet> and then... on the adjacent cells for each iteration you do parsing... using the if() function... with the return value for that cell being dependent on the instruction given.
21:28:28 <CakeProphet> but will always return the curren array position you're working in.
21:28:43 <CakeProphet> Each row would basically represent a state of the program.
21:48:20 -!- jix has quit ("Bitte waehlen Sie eine Beerdigungnachricht").
21:53:54 -!- tgwizard has quit (Remote closed the connection).
22:13:21 -!- ivan` has quit (Connection timed out).
22:42:39 -!- calamari has joined.
22:44:06 -!- Sgeo has joined.
22:44:11 -!- Sgeo has quit (Read error: 54 (Connection reset by peer)).
23:57:08 <Razor-X> You could, but you can implement BF in a bunch of scripting applications.
23:57:32 <xor_> of course
←2006-11-07 2006-11-08 2006-11-09→ ↑2006 ↑all