00:13:39 http://www.scala-lang.org/node/114 < This would have been useful to know when I was writing packet parsing for a Minecraft server.. I think. 00:18:15 i hope the style used in that example isn't idiomatic 00:19:03 Why do you care if it is idiomatic? 00:21:16 awful idioms 00:21:31 if I'd ever have to work with scala code, I'd die 00:38:52 -!- nooga has quit (Ping timeout: 260 seconds). 00:43:16 -!- evincar has joined. 00:43:29 When using php's mysql functions to retrieve values from a database, does it return integers in the datasbase as integers or as strings? 00:44:16 Patashu: As integers, so far as I know. 00:44:50 Not that it particularly matters, right? 00:45:04 It shouldn't... Something is being wonky 00:46:23 What database type are you using 00:46:25 *? 00:46:28 mysql 00:46:44 No, like MyISAM or InnoDB. 00:47:30 At FreeGeek I have a SQLite reporting program, as well as a separate CGI program allowing it to be accessed by HTTP servers; even write access to databases is permitted. 00:48:08 Patashu: http://stackoverflow.com/questions/5323146/ 00:48:10 Oh, sorry, I don't know, but I'm doing this test: if ((int) $row['enabled'] != 1) in a table where enabled always equals 1, and it's triggering 00:48:42 Why don't you use SQL as a templating language? 00:48:57 Apparently PHP' 00:49:03 always returns values as strings. 00:49:09 Hooray for typos involving newlines. 00:49:19 zzo38: Can you give an example? 00:49:25 hmm, wait 00:49:39 if I do (int) $row['enabled'] != 1 does it turn the whole boolean expression into an int or just the left hand? 00:49:40 X.X 00:49:51 maybe that's why 00:50:02 evincar: It is a program I wrote that allows you do that. Currently the only file is internal use at FreeGeek. 00:51:25 But I can explain how it works. A query block must start with #Q and a SQL statement on a line by itself, and then you can have stuff inside, and #Z is end of block. Everything inside is done for each record of output. Lines without # are copied directly to output except for field names in `...` 00:51:29 nope, it's still ont working 00:51:54 You can use #F to define a custom function, which is given a name and a SQL statement that returns one record with one field. 00:52:48 In a function definition, you can use ?1 ?2 ?3 etc to access function parameters. Outside of a function definition, ?1 ?2 ?3 etc access command-line parameters, and you can use $ and a field name to access a field of the result of the query block that this query is inside of. 00:53:25 Why wouldn't you appropriate the stored procedure syntax for function definition? 00:53:40 You wouldn't create the functions in the database of course, just in the template engine. 00:53:42 SQLite does not have stored procedures. 00:55:44 Well, no, but I think it would be nicer to see "#Q create procedure `name` ..." than "#F name ..." or whatever. 00:56:58 I suppose that if you want to modify the program to support other database engines that do have stored procedures, you can do that. 00:57:47 -!- MichaelBurge has quit (Remote host closed the connection). 00:57:58 If you wanted to continue using SQLite, you would just need to parse the "create procedure" statement without passing it to the DB engine. 00:58:08 -!- MichaelBurge has joined. 00:58:32 And then you would have uniform syntax. 00:58:38 Simplifying things. 01:00:31 I was doing research for an essay for class, and I came upon a very interesting study from 2001. 01:00:43 I don't even know how stored procedures work in SQL. SQLite has a function in C which is used to create new functions for use by SQL statements. 01:00:54 It was studying the language that non-programmers used to specify solutions to programming-style problems. 01:01:52 I think it would be interesting to do some research into making a language that adheres as closely as possible to the expectations of beginners. 01:01:54 But I don't know if database engines other than SQLite support the ?1 ?2 $NAME kind of syntax; these are parameters that you must bind using C functions. 01:02:10 evincar: OK, try. 01:02:11 I'm not sure. "?" is pretty universal. 01:02:26 But I don't know about positional and named arguments. 01:03:37 The study found that most people tend to avoid named state, and state in general. 01:03:55 -!- DH____ has joined. 01:04:13 They establish solutions through events, constraints, rules, and declarations primarily. 01:04:27 Only those things that need to be sequenced are done so explicitly with imperative instructions. 01:04:39 In that sense, Haskell is one of the more "natural" languages out there! 01:04:53 Though by no means the most natural... 01:05:40 But even Haskell, by itself, does not have events, and does not support complete rule-based and constraint-based programming either 01:06:41 -!- tswett has changed nick to kerlo. 01:11:00 -!- Vorpal has quit (Ping timeout: 258 seconds). 01:11:22 I made the program, it represents floating point literals by the integer value and the ten shift. Such as, (FloatLit 5 (-1)) for "0.5" and (FloatLit 42 0) for "4.2e+01" 01:17:39 I think that's more of a scientific notation storage, considering that floating-point would be... what, similar but in a different base? 01:17:53 * Sgeo|web is unsure 01:24:34 -!- MSleep has changed nick to MDude. 01:26:07 Sgeo|web: Floating-point is essentially scientific notation. 01:26:21 significand * base ^ exponent 01:26:53 All IEEE-754 does is specify a packed storage format, and a base (2). 01:28:00 zzo38: Haskell is missing those features, certainly. I was making a comment about how people find mutable state and imperative instructions unnatural. 01:29:53 Most of the time, natural language refers to things by class specifiers and set operations. 01:30:14 evincar: OK. I might understand what you meant, then. 01:30:15 "Do X to all Y that are Z." 01:30:45 Another interesting thing is that people expect time to be continuous. 01:31:28 So, for instance, animation should be done through physical analogies, totally hiding the fact that timing is not continuous on a computer. 01:40:41 @pl g x = 9*x*x*x*x-x 01:40:41 g = (-) =<< (*) =<< (*) =<< (*) =<< (9 *) 01:40:52 @pl g x = 9*x^4-x 01:40:53 g = (-) =<< (9 *) . (^ 4) 02:13:07 -!- myndzi has joined. 02:20:11 -!- tiffany has quit (Quit: Leaving). 02:23:32 -!- tiffany has joined. 02:32:00 -!- DH____ has quit (Read error: Connection reset by peer). 02:32:04 -!- DHeadshot has joined. 02:37:49 Is this correctly parsing a Haskell qualified name as you can tell? 02:37:50 -!- DHeadshot has quit (Read error: Connection reset by peer). 02:37:51 qualifyName :: (Name -> Token) -> Parser String -> Parser Token; 02:38:04 qualifyName f p = f . ExternalName <$> liftM2 (++) (join . fmap (++ ".") <$> (many . try $ liftM2 (:) (oneOf c'upper) (many $ oneOf c'letter) <* char '.')) p; 02:38:52 It seems to work but maybe I missed something in the Haskell specification or something else. 02:40:46 Maybe it is too messy. 02:41:07 -!- tiffany has left ("Leaving"). 02:43:09 Maybe there ought to be an infix form of liftM2 (++) 02:50:17 -!- evincar has quit (Quit: ChatZilla 0.9.87 [Firefox 7.0.1/20110928134238]). 03:05:29 -!- Madoka-Kaname has quit (Ping timeout: 255 seconds). 03:06:17 zzo38: I once considered the idea of having nested infix expressions 03:06:25 a `f x y` b 03:06:58 I like that 03:09:52 a `x `g y` z` b 03:09:57 best nesting 03:10:11 is that why you stopped considering it? 03:10:41 i guess you could require paren usage or think of some fancy new quotes but there aren't enough quote things for it to work?? 03:10:47 -!- Madoka-Kaname has joined. 03:10:48 it/that 03:10:57 monqy: no that actually didn't change my opinion of it at all. 03:11:00 oh 03:11:49 just a horrid use case that was possible. 03:12:09 er ambiguity even. 03:12:27 ambiguity is bad??? and shouldn't be allowed to happen??? 03:12:40 so obviously infix nesting just shouldn't be possible without different quoting. 03:13:12 `( and )` would be ok for infix expressions imo 03:13:17 /home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: (: not found 03:13:29 hackego.... 03:14:04 > let f x y = y in 1 `f ` 2 03:14:05 2 03:14:19 hmmm, okay. 03:16:15 monqy: ASCII obviously needs more brackets 03:16:19 or keyboards need more Unicode. 03:16:30 latter is more sensible. 03:16:45 I'm fine with `( )`; it's the conclusion i came to when i entertained the idea of infix expressions a while back 03:18:30 eh 03:18:39 I like the idea of finally incorporating Unicode into programming syntax. 03:19:09 in a way that's not annoying. 03:22:14 "in a way that's not annoying" good luck 03:22:27 what do you mean by that anyway 03:23:17 that I can type it on a keyboard. 03:23:30 quickly 03:26:03 CakeProphet: agda has latex-like input 03:26:21 I prefer to do it without Unicode since the ASCII is a simpler code and can be typed more easily too. 03:26:25 if you type \x you get the cross product x, or if you type \to or \-> you get a right arrow 03:26:33 and so forth 03:26:42 mind you this is agda mode for emacs 03:27:08 Unless "-" was made a letter the \-> in TeX would be \- followed by > rather than a single control sequence 03:28:10 right I think Unicode can be incorporated into programming but it's something you'd have to do in an interface 03:28:11 You can use TeX to print out a program with fancy symbols and bold and everything, such as WEB. 03:28:30 for example ctrl/alt or using numpad keys (since I never use those :P ) 03:28:33 Input can be plain ASCII and it can work 03:28:56 zzo38: i said latex-like 03:29:16 when you type \-> it gets automatically replaced with the arrow 03:29:23 -!- MDude has changed nick to MSleep. 03:29:30 augur: Does LaTeX redefine "-" to be a letter? 03:29:37 no its not latex 03:29:42 it looks like latex 03:29:46 hence latex-like 03:30:08 its just an input method for unicode 03:30:21 it does use all of the standard latex names tho, i think 03:30:28 so \langle and \rangle work, for instance 03:31:35 CakeProphet: Well, if you have a specific set of symbols you use, you could create a character set for the programming language, and then use CTRL, ALT, and/or function keys, to select the extra characters (you could even have a character with code 1 and use CTRL+A to enter it, for example; or you could use ALT to add 128 so that the high codes in 8-bit are the special ones). 03:31:47 You can convert to/from Unicode if necessary, I suppose. 03:33:19 CWEB will work with Unicode input, but only for identifiers. However you can have macros and formatting codes to make them into operators. (I do not know if WEB has this feature) 03:41:10 zzo38: I think Unicode would work best simply because it's an existing standard. 03:41:34 I'm must not sure what kind of syntax could be incorporated into a language from Unicode. 03:41:38 I don't know much about Unicode. 03:42:13 CakeProphet: I don't think so. Unicode is badly designed. 03:44:17 zzo38: in what ways? badly organized? poor arithmetic properties? 03:44:47 All sorts of things. Those are some of them. 03:44:57 either way those are ancillary. it offers a large range of standardized characters that already have fonts made for them. 03:45:13 that's really all I would need to incorporate more symbols into the syntax of a language. 03:45:49 Yes; unless you need something that Unicode doesn't have (it does not include the complete Commodore 64 character set), in which case you can still use private use blocks but then you would need a font for them. 03:46:13 And sometimes the way variations are selected in Unicode are not exactly as you might want. 03:46:29 ...what does the Commodore 64 character set have that I might want? 03:46:51 retro hipster cred? :P 03:46:57 Complex scripts result in a lot of difficulties, especially since you need a database to decide what character is processed in what way! 03:47:24 CakeProphet: Probably nothing for what you are trying to make. But it still makes it insufficient. 03:47:53 so sufficient = incorporates every arbitrary character set ever made and organizes them sensibly. 03:48:44 Perhaps "insufficient" is the wrong word. But it does make in insufficient for a few uses. 03:52:23 so in-all-encompassing. :P 03:52:59 I think Unicode is mostly interested in encoding most of the world's writing systems and less about including every computer encoding that ever existed. 03:53:30 It does not even include all writing systems due to people make up their own. 03:54:04 And some people made up the TRON encoding because they dislike the way variation selection works in Unicode (I don't know anything else about TRON). 03:55:11 is "oh well it doesn't include every artificial script that invented" a valid complaint? 03:55:16 how do you go about standardizing that? 03:55:30 -!- banjomonster has joined. 03:55:30 also the private use block is probably the best way to handle those situations, really. 03:55:35 No you cannot standardize it. 03:55:35 so, way to go, Unicode. 03:55:41 That is why the private block exists. 03:55:49 But it still means you need specialized fonts. 03:56:04 -!- banjomonster has left. 03:56:11 how do you propose to solve this problem 03:56:45 And you also need to agree on their use (for many invented scripts, there are organizations which specify which Unicode code points correspond to them, but they are not a Unicode standard). 03:57:15 CakeProphet: You have to just do it on each individual case, I suppose. In some cases simply don't use Unicode if Unicode will not help. 03:58:01 you could have unicode telnet 03:58:41 Some telnet clients will support Unicode; some of which are part of a terminal emulator and not really part of the telnet client program itself. However, you can also have telnet without unicode. 03:58:52 so two abstract devices that are communicating with unicode start a telnet session at which point they can agree on which scripts/non-standard things they're using. :P 03:59:06 best solution 03:59:34 telnet is best for all porpoise. 03:59:59 Yes, that is one way. But Unicode does not help this at all. 04:00:22 right, how could it? without being telnet, of course. 04:00:23 If you need to agree on what you are using anyways, why do you use Unicode? 04:01:03 Unicode wiki 04:01:10 people can make pages for their scripts 04:01:19 and it automatically becomes part of Unicode. 04:01:59 I do not quite consider that the best way either; although in some cases, that might be the way to do it. 04:02:03 there's machine readable data to help programs handle the scripts and such. 04:02:21 Yes, if it has the complex script data and character property data. 04:02:36 ...it was a joke, really. I don't think the problem you're desribing is completely contrived and is one of the inherent problems of any standard. 04:02:42 er 04:02:48 I do think it is completely contribed rather 04:02:51 *contrived even 04:02:56 But of course that requires that the program access the wiki by internet always to access a file! 04:03:05 Which also is not a good way to do it. 04:03:22 best solution: the world is perfect. everything does everything the way you want. 04:03:29 problem solved\ 04:04:23 The way TeX does it works OK for typesetting; you have a metric file and a METAFONT to generate the font metric and character bitmaps for whatever printer you are using. 04:04:45 -!- oerjan has joined. 04:05:03 so you're saying the Unicode standard could include a way to specify typesetting and script data? 04:05:12 No! 04:05:34 I am saying to ignore Unicode for typesetting. 04:05:53 I thought we were talking about Ways Unicode Could Be Better 04:06:08 is that not what we're talking about? 04:06:14 am I missing something? 04:06:19 help 04:06:50 Unicode works for some things, but you should not always use it, please. 04:07:16 I use Unicode for everything. I draw in Unicode. 04:07:39 I write abstract Unicode poetry. 04:15:13 -!- hagb4rd has quit (Ping timeout: 260 seconds). 04:36:11 An actual on topic esoforum post has been spotted! 04:36:23 oh my 04:36:30 I completely forgot about the forum 04:36:57 hm, it looks like the guy who made brains also made a post 04:37:02 good thing nobody cares about brains 04:40:38 "Having decided to invent an extremely innovative and creative esoteric programming language of my own, I spent several days and nights feverishly working on my masterpiece. While taking a break from this, I invented CAPS 4D." 04:42:26 I liked that part 05:09:54 -!- Jafet has joined. 05:12:40 -!- CakeProp1et has joined. 05:13:20 -!- CakeProphet has quit (Ping timeout: 252 seconds). 05:20:16 There are such things as Japanese Korean chess rules, which are the same as Korean Korean chess rules except that it has promotation (which is mandatory). 05:44:19 @hoogle (a->Boolean) -> [a] -> ([a],[a]) 05:44:19 Warning: Unknown type Boolean 05:44:19 No results found 05:44:23 @hoogle (a->Bool) -> [a] -> ([a],[a]) 05:44:23 Prelude break :: (a -> Bool) -> [a] -> ([a], [a]) 05:44:23 Prelude span :: (a -> Bool) -> [a] -> ([a], [a]) 05:44:24 Data.List break :: (a -> Bool) -> [a] -> ([a], [a]) 05:44:32 @hoogle (a->b) -> [a] -> [[a]] 05:44:33 Prelude dropWhile :: (a -> Bool) -> [a] -> [a] 05:44:33 Prelude filter :: (a -> Bool) -> [a] -> [a] 05:44:33 Prelude takeWhile :: (a -> Bool) -> [a] -> [a] 05:44:47 :t partition 05:44:48 forall a. (a -> Bool) -> [a] -> ([a], [a]) 05:44:54 Thanks. 05:45:29 I did invent a different character coding that I will use for a different kind of computer. It is a sixteen-bit encoding called FBUCE, compatible with printable ASCII, but far simpler than Unicode. However, you usually will use NK encoding which is compatible with ASCII control characters as well as ASCII printable characters. 05:46:54 Madoka-Kaname: groupBy and sortBy might also be relevant 05:47:28 :t sortBy . comparing 05:47:29 forall a a1. (Ord a1) => (a -> a1) -> [a] -> [a] 05:47:35 Double thanks 05:47:55 :t groupBy . on (==) 05:47:56 forall a b. (Eq b) => (a -> b) -> [a] -> [[a]] 05:48:23 :t on 05:48:24 forall b c a. (b -> b -> c) -> (a -> b) -> a -> a -> c 05:48:35 @src on 05:48:35 (*) `on` f = \x y -> f x * f y 05:49:00 Madoka-Kaname: oh and ghc has some new list comprehension additions for grouping and sorting which i've never really looked at 05:49:16 iirc 05:49:20 Thanks. 05:51:09 There are things that FBUCE intentionally lacks: character properties, complex script support, variation selectors, right-to-left, etc. FBUCE does, however, support the entire Commodore 64 printable character set. Unlike Unicode, FBUCE would hardly ever be used directly; you normally use a mapping table. FBUCE has 512 defined control characters, though. 05:51:21 and something using a Data.Map.Map can also be useful 05:52:38 Madoka-Kaname: note that groupBy only groups _adjacent_ elements, so it may be necessary to use sortBy first 05:52:39 Sorry, I am wrong. It has 256 control characters. 05:53:02 How rude. 05:53:52 @djinn (a -> b -> c) -> (a -> d -> e) -> a -> b -> d -> e 05:53:52 f _ a b _ c = a b c 05:54:08 @djinn (a -> b -> c) -> (a -> c -> d) -> a -> b -> c 05:54:08 f a _ b c = a b c 05:54:26 @djinn (a -> b -> c) -> (a -> c -> d) -> a -> b -> d 05:54:26 f a b c d = b c (a c d) 05:54:33 @. pl djinn (a -> b -> c) -> (a -> c -> d) -> a -> b -> d 05:54:33 f = flip (liftM2 (.)) 05:55:13 :t liftM2 (>>>) 05:55:14 forall (cat :: * -> * -> *) a b c (m :: * -> *). (Control.Category.Category cat, Monad m) => m (cat a b) -> m (cat b c) -> m (cat a c) 05:55:32 eek 05:55:57 i _think_ that specializes to what you want 05:56:43 Do you mean the (->) category and the (e ->) monad? 05:56:47 yes 05:58:29 -!- derrik has joined. 05:58:54 :t sortBy 05:58:55 forall a. (a -> a -> Ordering) -> [a] -> [a] 05:58:56 :t groupBy 05:58:57 forall a. (a -> a -> Bool) -> [a] -> [[a]] 05:59:04 ... 05:59:06 Kya! 05:59:12 > groupBy ((&&) `on` isSpace) "testing a b c" 05:59:12 ["t","e","s","t","i","n","g"," ","a"," ","b"," ","c"] 06:00:55 Madoka-Kaname: their first arguments are analogous to compare and (==) respectively, which is why you might want to use "on" with those 06:07:05 -!- Ngevd has joined. 06:07:34 Hello! 06:08:13 morning 06:08:34 possibly a good one, even 06:09:30 I have woken up 5 times today 06:09:56 so now you don't have to wake up for the rest of the week! 06:10:02 :D 06:10:25 In here it is night time 06:19:10 I have idea functional program representation. data Exp = Apply Exp Exp | Case [(Pat,Exp)] | Global GlobalID | Local LocalID | Literal Literal | Primitive PrimitiveID; data Pat = Constructor ConstructorID [Pat] | LiteralP Literal | LocalP; 06:21:43 zzo38: aren't you missing a LocalID before ; at the end 06:22:29 oerjan: No. The LocalID would be a type synonym for a number, so you select them in order, I think. 06:22:37 Maybe I am wrong, though. 06:23:02 zzo38: but you need to be able to use them in the Exp part of the Case 06:23:45 Well, yes. Maybe you are correct, it should have LocalID there 06:24:02 or you could use deBruijn indices 06:24:14 What are deBruijn indices? 06:24:42 Special lambda calculus things destroying the need for variables 06:24:55 http://en.wikipedia.org/wiki/De_Bruijn_index 06:26:10 Something like that, is what I was thinking of. 06:26:59 the thing about these is that you don't just give each variable a fixed number, but you use a number depending on how far away its binding is 06:27:15 But there is still a difference, due to matching constructors with multiple parameters. 06:27:30 oerjan: Yes I understand that; I did read the Wikipedia article now. 06:27:46 yes. but i guess there you'd just have to count the LocalP's in some order 06:28:23 Yes you would have to count them in some order. 06:31:57 Case [(LocalP, e)] would be how you'd express an ordinary lambda expression, i assume 06:32:14 oerjan: Yes. That is my intention. 06:34:38 Does anyone know of a python module for multiplying matrices? 06:34:57 The program would be represented by a list of expressions (Exp) and the GlobalID type is an index into the program; exported functions are listed first and are in the specific order. 06:35:32 Ngevd: for loops (ahahahahahahahhahahahahhahahahahahha) 06:35:46 Ngevd: alternative joke: ask #python (ahahahahhahahahahahahahhahahahhahah) 06:36:03 I'm tired and I haven't had breakfast 06:36:04 I did not count has so I do not know which of those I laughed more at 06:36:14 So I will ask Python 06:36:22 *#python 06:39:14 > let a `mult` b = map (map (zipWith (*)) $ transpose b) a in [[1,0],[0,1],[1,-1]] `mult` [[1,2,3],[4,5,6]] 06:39:15 Couldn't match expected type `a -> b' 06:39:15 against inferred type `[[a1] ... 06:39:20 wat 06:39:59 oh 06:42:06 > let a `mult` b = map (\av -> map (zipWith (*) av) $ transpose b) a in [[1,0],[0,1],[1,-1]] `mult` [[1,2,3],[4,5,6]] 06:42:07 [[[1,0],[2,0],[3,0]],[[0,4],[0,5],[0,6]],[[1,-4],[2,-5],[3,-6]]] 06:42:25 too tired to free the points 06:42:39 > let ass `mult` bss = [[sum $ zipWith (*) as bs | as <- ass] | bs <- transpose bss] in [[1,0],[0,1],[1,-1]] `mult` [[1,2,3],[4,5,6]] 06:42:40 [[1,4,-3],[2,5,-3],[3,6,-3]] 06:42:53 There, Python code for multiplying matrices 06:42:56 ...and to fix the last bug :P 06:43:30 Jafet: you've nested them in the wrong order 06:43:53 Bah, I thought the type system would catch that. 06:44:06 for integer matrices? :P 06:44:11 > let ass `mult` bss = [[sum $ zipWith (*) as bs | bs <- transpose bss] | as <- ass] in [[1,0],[0,1],[1,-1]] `mult` [[1,2,3],[4,5,6]] 06:44:12 [[1,2,3],[4,5,6],[-3,-3,-3]] 06:44:21 there you go 06:49:18 Breakfast time, bye 06:49:20 -!- Ngevd has quit (Quit: what a big quitter he is, eh?). 06:57:55 ....oh I missed him. 06:58:21 -!- Jafet has quit (Quit: Leaving.). 06:58:36 @tell Ngevd Dude, numpy, bro. It's what you want. To multiply the matrices. 06:58:36 Consider it noted. 06:59:30 surely #python told him though. 06:59:37 I have faith. 07:01:41 -!- Ngevd has joined. 07:01:49 Ngevd: numpy 07:01:51 is what you want 07:01:53 dude. bro. 07:02:09 That's what #python told me 07:02:09 Ngevd: You have 1 new message. '/msg lambdabot @messages' to read it. 07:02:15 and now lambdabot 07:02:18 will tell you 07:02:22 triple affirmation 07:02:52 I'm having trouble installing it, though 07:03:17 do you have pip? 07:03:44 pip install numpy 07:04:30 64 bit Windows 07:04:33 So probably not 07:04:36 if you don't it might be in in apt-get under pip or python-pip depending on your -- oh 07:04:52 well, okay 07:04:54 I think I've cracked it 07:05:14 I don't think you're allowed to write programs in Windows 07:05:32 against the rules. 07:05:38 I'm in an off-shore oil platform 07:05:51 I... see? 07:06:04 no the platform is invisible 07:06:06 so you can't see it 07:06:38 it's a secret platform 07:08:06 monqy: do you use the fenestrated operating system? 07:08:26 -!- CakeProp1et has changed nick to CakeProphet. 07:08:32 ??????? 07:08:42 fenestra is latin for window 07:08:51 im linux, sorry 07:09:01 no sorry yes good 07:10:06 Going to switch to Ubuntu now 07:10:09 Actually... 07:10:11 Hmm... 07:10:19 but Ubuntu is going to be bad soon. 07:10:32 * CakeProphet is switching to Debian soon (actually) 07:11:02 whenever I finally feel like doing it. 07:11:13 I'm going to try and use DSL 07:11:28 why? 07:11:38 because it's ds? 07:12:29 Because it's l 07:12:38 Didn't work 07:12:41 It's not l enough 07:12:43 brb 07:13:08 -!- Ngevd has quit (Read error: Connection reset by peer). 07:14:52 -!- Ngevd has joined. 07:15:28 Back 07:23:46 -!- monqy has quit (Quit: hello). 07:25:09 Assange was a hacker in his youth, before becoming a computer programmer. 07:25:18 wouldn't it be more likely that he became the latter before the former? 07:25:45 Maybe he was one of those hackers who just went around calling everything 1337 07:26:13 And themselves 1337 |-|4><><0rz 07:27:18 You can 'hack' without programming skill, it'll just be very uninteresting hacks. 07:50:07 -!- CakeProphet has quit (Ping timeout: 252 seconds). 08:00:43 -!- oerjan has quit (Quit: Later). 08:32:05 I just followed my old english teacher on twitter 08:32:18 That is, a person who used to teach me english 08:32:32 Not a person who teaches me old english 08:32:36 Shame, too. 08:32:43 And not an old person who teaches me english 08:32:55 Though understandable; Old English is not *that* well-attested. 08:33:32 It's not like there's going to be many classes for learning how to understand the small handful of things written in it we have. 08:35:34 There are Old English teachers? Never thought about that 08:36:24 It's certainly plausible. 08:36:30 But just barely. 08:36:57 My mother studies the geneology of our family tree, so she has to read centuries old handwriting all the time 08:36:59 I guess that's not THAT old 08:37:13 How many centuries? 08:37:32 I dunno, 0-3? I'd have to ask her how far back she's ever gone 08:37:40 That's still modern English 08:37:45 But I see her squinting at things like church marriage records 08:37:46 Yeah 08:37:57 Just hard to read because it's all...curvy and slanted 08:38:00 I tried to do my family tree 08:38:08 Didn't get very far 08:40:08 She'd probably have as much trouble today if handwriting weren't outmoded. 08:40:24 Let's face it: unless you're careful, handwriting is pretty hard to read. 08:43:09 My handwriting is irredeemably awful 08:43:22 Same 08:43:38 My handwriting's quality depends on language. 08:43:53 My English handwriting? Essentially illegible. 08:44:08 My Japanese handwriting? Merely below average. 08:44:39 My handwriting's legibility is inversely proportional to how fast I write 08:44:50 And yes, English is my native language. 08:44:59 Which dialect? 08:45:21 Something roughly General American. 08:45:24 Okay 08:45:35 I'm roughly general British 08:45:45 With a small amount of Victorian Australian and Geordie 08:45:52 (General American is an *actual accent*, BTW) 08:46:04 I knew that 08:46:13 As far as I know, general British isn;t 08:46:18 Yeah. 08:46:19 I'm using it to refer to a soft RP 08:46:25 Ah. 08:46:27 Hence the lower case g 08:46:39 *That* seems like an actual accent, though. :P 08:49:11 I still don't understand how Red Hot Chilli Peppers manage to rhyme "bra" and "wall" 08:49:58