01:20:01 Are we still hating active X? 01:31:49 * pgimeno declares today as the ActiveX cursing day 01:32:47 We hate Active X because MS cripples its OGL implementation to push it. 01:33:17 /me says a brief, but poignant curse about ActiveX, followed by a moment of silence. 01:33:39 hmm.. well, you get the idea 01:37:16 -!- Gs30ng has quit (Read error: 110 (Connection timed out)). 01:38:41 -!- kipple has quit (Read error: 110 (Connection timed out)). 03:25:11 -!- tokigun_ has changed nick to tokigun. 04:27:16 Some french bastards might have already stolen my idea!... :-( 04:27:59 I suppose I can't expect it to be completely original, but considering how few people are aware of 2D languages... 04:40:05 Hmm.. seems I can't track down their implementation. Might have to contact them. In French?! Meh. I'll just keep developing my own since I can't find out about theirs. 06:07:04 -!- calamari has joined. 06:07:06 hi 06:13:53 hi 06:14:00 how's your evening going calamari? 06:46:44 -!- int-e has quit ("Bye!"). 07:34:59 Bwaha! 07:59:59 -!- clog has quit (ended). 08:00:00 -!- clog has joined. 08:16:19 -!- calamari_ has joined. 08:16:53 hi WildHalcyon, from hours ago :) 08:17:30 my evening.. err, morning now, is fine, thanks ;) 08:34:54 -!- calamari has quit (Read error: 110 (Connection timed out)). 09:49:44 -!- calamari_ has quit ("Leaving"). 10:12:47 -!- jix has joined. 11:07:52 -!- jix has quit ("Bitte waehlen Sie eine Beerdigungnachricht"). 12:35:41 -!- nooga has joined. 13:49:36 -!- kipple has joined. 14:01:41 -!- int-e has joined. 15:57:13 -!- nooga has left (?). 16:38:05 -!- nooga has joined. 16:47:00 * nooga has written an esoteric language and don't know how to explain it's syntax :> 16:47:55 -!- kipple has quit (Read error: 104 (Connection reset by peer)). 16:48:55 -!- kipple has joined. 16:52:34 Why is the syntax hard to explain? 16:53:05 hmmm 16:53:30 it's like Lisp's syntax 16:53:40 but without those ( ) 16:54:16 and identifiers are 1 char long ;p 16:54:27 that's my explanation 16:54:54 Hmm.. programming paradigm? 16:56:15 ```sii``sii 16:56:25 sounds like unlambda to me 16:56:28 hm 16:56:31 maybe an example 16:56:36 Ah. Of course 16:57:09 :n,3100 @>n0 (2 !n !' 16:57:34 will write numbers from 100 downto 1 separated by spaces ;p 16:58:11 each function must have defined number of arguments 16:58:33 I see 16:58:51 unless it takes the number of arguments as a first argument 16:58:56 like ,3100 16:59:01 I don't know what that does, but I see how that would allow for unique parsing of expressions. 16:59:34 it returns 3 digit long number - 100 17:00:04 What if I wanted a 31 digit number afterwards? 17:00:13 ,,231.... 17:00:21 ohhh 17:00:29 clever 17:00:33 ;> 17:00:50 my english isn't good 17:01:06 but i need to write an description to put it in wikipedia 17:01:22 and i don't know how to write a fancy one 17:02:02 Well, the esolang wiki is nice and public domain, so if you just put something there, folks might clean it up and edit it for you 17:02:13 hmm 17:02:23 maybe that's an idea 17:02:28 thanks 17:03:46 After I see that spec in the wiki, I'd be more than happy to try editing it 17:04:11 thanks 17:05:47 I like that crazy ,,,12345 syntax 17:06:22 * WildHalcyon corrects his syntax to be ,,,12101234567890 17:07:19 :a+,210*b,212 -> a = 10 + b * 12 17:08:12 I've always wanted to write a forward polish notation langusge 17:08:16 language* 17:08:35 huhu 17:08:53 * + 2 3 5 = (2+3)*5 = 25 17:09:32 yup 17:10:01 Does qdeql use that? 17:10:43 Its the only queue based language I know 17:11:02 don't know 17:16:13 i need to write a fancy interperter 17:16:27 in perl for example... 17:17:22 the first one was made in free pascal on my 10 years old laptop ;p 17:18:00 when i was extremely bored 17:19:25 Im guessing the digits input are in decimal? 17:22:05 yup 17:22:54 curious 'bout the name? 17:23:41 Sure, what'll it be called? 17:24:01 SADOL - Sadistic And Damn Odd Language 17:25:03 cool huh? : 17:25:03 That'll work 17:26:45 So you've already got an interpreter? 17:27:18 yea 17:28:33 but it's on my laptop, that crap doesn't even have FDD 17:29:45 FDD? 17:30:25 Floppy Disk Drive :> 17:30:58 oh 17:59:23 * WildHalcyon is still trying to name his language 18:13:29 -!- CXI has quit (brown.freenode.net irc.freenode.net). 18:13:59 -!- CXI has joined. 18:15:31 FAOL - fixed arity operator language 18:16:28 ? 18:17:20 "In mathematics and computer programming the arity of a function or an operator is the number of arguments or operands it takes" 18:17:46 i see 18:19:47 Ive been working on how to pass arguments to my functions 18:20:45 and? 18:21:19 &&? ;) 18:21:21 Not sure yet. Might be similar to Pingpong, which has a second stack. There's an operation that pops off the first stack and pushes onto the second stack. 18:21:35 A function might just take arguments off the second stack 18:21:45 Could be difficult to turn into a genetic language though... 18:24:21 ~f1f+#_01 <- a definition of a recursive function in SADOL, in C it looks like: f(x) {return f(x+1);} 18:24:56 _ is a list holding actual parameters 18:25:10 i meen arguments 18:25:39 mean* ;p 18:26:23 whats the 1 between the two fs do? 18:26:47 that's the number of arguments for f 18:27:52 ~abc - defines a function named 'a' with b arguments, c is the body 18:29:31 okay 18:30:21 ~f1f+#_01 -> a = 'f', b = 1, c = 'f+#_01' 18:31:17 #_0 is like _[0] 18:32:12 i mean, #xy returns an element of x list which index is y 18:32:37 damn 18:32:53 i said that i can't explain my own language :/ 18:33:35 How does it know that f is the argument that it takes? 18:34:09 where? 18:34:37 I guess I dont understand the returning arguments... 18:35:15 hmmm 18:35:24 returning values is implicit 18:35:24 there is a list named _ 18:35:40 that holds arguments 18:36:10 what it says is: f takes 1 argument, and f(args) = f(args[0]+1); 18:36:19 right 18:36:22 there is no return statement. 18:36:30 umm 18:36:56 function returns the value of lats call in it's body 18:37:07 last 18:37:40 there is a special functions that does nothing and it's used for grouping other calls 18:37:45 look 18:37:59 (3 +25 -31 *22 18:38:10 will return 4 18:38:16 oh, it's an implicit progn ... hehe 18:38:26 (4 :a+25 -31 *22 a 18:38:38 will return 7 18:38:46 nooga, actually: how can the function have more than one 'statement'? 18:41:18 ~ g 2 (3 :a+#_0#_1 :b*#_0#_1 +ab 18:42:38 ah, ( is progn, ok. 18:42:42 g(args) {a=args[0]+args[1]; b=args[0]*args[1]; return a+b;} 18:43:39 but there is a second tyle of functions 18:43:47 working like , function 18:43:56 ~ g 2 (2 :a+#_0#_1 :b*#_0#_1 +ab would be g(args) {a=args[0]+args[1]; return b=args[0]*args[1];} { a+b } 18:44:01 -!- jix has joined. 18:44:09 that is, two expressions/statements/programs/whatever. 18:44:12 yup 18:44:30 hi jix 18:44:31 you understand 18:45:29 moin 18:45:32 but, let's get back to that functions that arity isn't known 18:46:02 they are defined like this ~ h -01 (... 18:48:20 will the actual number of arguments be part of the arguments then? or will there be a length-of-list operator? 18:49:03 #L-01 returns a length of L list 18:49:27 i mean length = number of elements 18:49:45 L[-1] 18:49:51 hmm. interesting choice, but consistent with the function definition. 18:51:54 lists in SADOL are indexed from 0 18:52:33 heh 19:03:21 do you like it ;p? 19:04:13 I like it, even if I dont understand it yet. Its better than mine, which lacks both a name and a confirmed syntax 19:05:12 nooga: i read the logs sounds cool 19:05:20 but i need to write a fancy documentation ;p 19:05:28 im having problems 19:05:40 ... even in my national language 19:11:07 nooga: i think i got it 19:12:47 ~f0(2f3 never returns but if it would it would return 3.. right? 19:15:15 yes 19:16:16 yea 19:16:28 think i got it 19:16:41 i just need a list of build in functions and a interpreter 19:18:28 i'll write interpreter in perl soon 19:19:15 i think that perl is the best choice bcs SADOL implements lists, and dealing with lists is fairly easy in perl 19:22:37 Hmm, builtin functions. _ -- return current argument list. # list index -- list[index] (index -1 is length), ~ function arity body -- define a function. : variable value -- assign a variable +, -, *, /. variable arguments: , number_of_digits digits -- constant integer (,242 = 42.) ( number_of_terms terms -- progn - execute the terms in order, return value of last term. 19:23:36 right 19:23:50 is there anything that allows conditional execution? 19:24:20 shure 19:24:32 ? condition if_true if_false 19:25:21 @ condition body - works like while(condition) body; 19:26:55 ? condition if_true if_false - works like if(condition) if_true else if_false; 19:34:45 hmm 19:34:57 i'll make a table of built in functions 19:42:18 hyhy 19:44:33 how to write about % a b ? 19:44:42 in C: a%b 19:44:47 returns a modulo 19:45:07 "Returns a modulo of division a by b." ? 19:59:25 remainder 19:59:46 a 20:00:01 in Polish it's named modulo ;p 20:05:32 hah 20:05:41 now, ... 20:05:43 erm 20:05:46 nothing 20:06:00 i'll end that stupid table tomorrow 20:06:07 got to go 20:06:11 bye 20:06:48 bye 20:06:55 -!- nooga has left (?). 20:47:11 -!- WildHalcyon has quit ("Adios!"). 20:50:42 -!- nooga has joined. 21:42:09 me again 21:42:14 int-e: r u there? 21:53:23 maybe 21:54:37 ;> 21:55:09 i need to explain that in english: .3123 = 0.123 21:56:47 . returns .... 21:57:22 hrm 21:57:34 . has a variable number of arguments 21:58:01 and return all arguments as number/10^(number_of_arguments) 21:58:09 yup 21:58:13 that's right 21:58:15 but 21:58:28 returns 0.arguemnts 21:58:55 isn't it called fractional part ? 21:59:41 hmm i'm not a native english speaker.. 21:59:50 yes it is 21:59:55 http://mathworld.wolfram.com/FractionalPart.html 22:15:23 hehe 22:15:41 i've almost done the list of those builtin functions 22:24:00 cool 22:54:34 viola! http://agentj.risp.pl/wysypisko/uploads/sadl.htm 22:55:02 please, help me to correct language mistakes ;p 22:55:15 and excuse my english 22:56:08 nooga: is there a function for getting names longer than 1 char? 22:56:56 and are variables local or global? 22:58:04 global ;p 22:58:12 and all names are 1 char long 22:58:16 ok 22:58:51 i thought about a namespaces ;> 22:59:04 but there's only one char left 22:59:08 ) 22:59:41 no local variables make recursion difficult .. 23:00:33 hm 23:00:38 then maybe 23:00:54 im writing a new interpreter 23:01:27 is a string handled as an integer array (modulo 256) (with popping and pushing and indexing..)? 23:01:43 yup 23:02:09 string pushed on string == appending? 23:02:21 yup 23:02:40 good i'm thinking about a turing completeness proove 23:03:23 what's about comparing strings with numbers? 23:03:43 and using strings in conditions... 23:04:06 string is threated as a number of characters 23:04:15 in that case 23:04:18 so "a" < 2 23:04:21 but "aaa" > 2 23:04:22 yes 23:04:35 got a better idea? :P 23:04:39 ; returns a 1char string or a integer? 23:04:48 it depends 23:04:53 nooga: no but i need some more info for writing programs in it (without interpreter) 23:04:56 depends? 23:05:03 i mean 23:05:06 lol 23:05:16 ow, getch() 23:05:36 ow? 23:05:50 getch in c returns int 23:05:54 it's not equivalent to getch() 23:05:59 i know 23:06:20 i meant 23:06:40 if user will input "A pie" ; will return a string 23:06:51 oh it's multibyte? 23:07:03 if user will input 10.6e-2 ; will return a number 23:07:17 hmm i'd like to have byte wise input 23:07:39 hmm 23:08:10 maybe let ; take an argument (bytes to read) 0 will read one expression (line as string number as integer/float) and 1 will read 1 byte as integer , 2 will read 2 bytes as string 23:08:52 hmm 23:08:54 good idea 23:08:58 and 23:09:23 maybe let the symbols A to Z be global 23:09:38 and a to z will be local 23:09:41 good idea 23:09:57 hm, cool 23:10:00 hmm another thing i need to know.. if i read one byte and get an eof.. what's the value 23:10:04 let me change the table 23:10:20 256, -1 ? (i think numbers are signed ints) 23:10:43 256 23:10:57 ok that's good.. makes binary input possible 23:14:03 are local functions possible? 23:14:17 it's easy if you store them like local varaibles 23:14:26 function in function ? 23:14:29 shure 23:14:38 i really like that language 23:14:43 think i'll implement it 23:14:45 thanks 23:15:41 (2:t"0[tn creates a string containing a byte with the value n? 23:15:54 (2 :t"0 [tn {cleaner} 23:16:41 yes 23:16:47 i've updated the table 23:16:48 g2g 23:16:51 bye ;> 23:16:57 ill be here tommorow 23:16:59 bye 23:17:05 -!- nooga has quit. 23:20:12 (2:i;0#-i,3256(4:t"0[ti!t:i;0 should be a cat program 23:20:55 ;",213Hello, world! 23:21:02 that language is cool