00:00:00 --- log: started retro/13.03.01 00:56:29 --- nick: tangentwork -> tangentsleep 03:01:25 --- quit: clog (^C) 03:01:25 --- log: stopped retro/13.03.01 03:01:40 --- log: started retro/13.03.01 03:01:40 --- join: clog (~nef@bespin.org) joined #retro 03:01:40 --- topic: 'Retro Language | http://retroforth.org | Logged @ http://rx-core.org/dev/rancid | Latest Release @ http://s3.retroforth.org/download/11.x/retro-11.4.tar.gz' 03:01:40 --- topic: set by crc on [Tue Jul 17 13:54:58 2012] 03:01:40 --- names: list (clog impomatic tangentsleep ivan`` harrison oPless karswell yiyus TheStitch crcx @ChanServ) 07:48:23 --- nick: tangentsleep -> tangentstorm 08:33:31 --- join: Mat2 (~claude@91-65-144-133-dynip.superkabel.de) joined #retro 08:33:35 namaste ! 09:04:08 hello! 09:04:32 hi, at current working on the string routines 09:07:47 I will create a assembla repro so you can get informed about all changes 09:08:05 ^an assembla repro I mean 09:09:47 * Mat2 hates to much curly braces 09:10:39 * Mat2 hopes to be finish at end of these day (and be in the time plan) 09:10:55 what's new ? 09:11:15 --- nick: Mat2 -> Mat2-debugging 09:43:45 --- join: kumul (~mool@76.26.237.95) joined #retro 10:11:05 --- quit: kumul (Ping timeout: 272 seconds) 10:14:08 yeah, i kind of like your curly brace style in the code. :) 10:30:55 --- join: kumul (~mool@c-76-26-237-95.hsd1.fl.comcast.net) joined #retro 10:39:35 --- quit: kumul (Ping timeout: 272 seconds) 11:27:18 11.5 is out at http://s3.retroforth.org/download/11.x/retro-11.5.tar.gz 11:27:43 hi crc ! 11:27:46 congrats ! 11:43:19 thanks 11:46:06 how goes saiwa? 11:47:07 I think to be finish with the parser this night or at last on sunday 11:48:45 at current I can execute some simple test programs 11:49:38 so think it progresses well 11:52:35 implementing a complete type-system for a stack-based language was more complex as I thought however 12:00:42 Mat2-debugging: have you read the paper about cat's type system? 12:00:47 crcx: yay! :) 12:01:28 tangentstorm: ahm, no (I think cat is a concatentative language, right ? 12:01:34 Someone deleted the Wikipedia page for Cat :-( http://en.wikipedia.org/wiki/Cat_(programming_language) 12:02:59 http://www.cat-language.com/ ... looking for the pdf 12:03:06 thanks 12:03:54 http://www.cat-language.com/paper.html 12:03:55 there we go 12:03:58 it's a short read 12:04:35 cat does place a couple restrictions on what a word can do, that makes the type system easier to implement. 12:04:47 i don't rememeber what they are but they're described in the paper. 12:05:41 nice, I have implemented exact the same kind of type-system 12:05:45 :D 12:08:23 beside, don't know the language implementation before 12:09:36 oh i know what it was 12:09:47 you couldn't implement something like "reset" in this type system 12:10:07 or anything that consumes a variable number of items off the stack 12:10:28 yeah, that are the same restrictions as in saiwa 12:10:41 unless you tagged them like in haskell data op = Nop | Lit | Dup | ... 12:11:11 that's not actually implemented in cat, but you could do it 12:11:36 then you would just have "op" on the stack and would inspect TOS to figure out how many things were actually there. 12:11:49 but they type system could only see it as "op" 12:12:33 you could do types like "Maybe Int" for things that might or might not put a number. 12:17:38 in saiwa functions can be either a nullarity, unary, binary or ternary function which return exact one or no argument 12:20:38 the first parameter is typed, acces to a optinal second is only able by type-casting which is equivalent of curry the function into a concatentative representation of functions which consume only one argument 12:20:59 ^an optional 12:21:49 that is analogue to type-tagging in haskell 12:22:01 cool 12:22:35 i looked at your source code last night... i really wasn't sure what the bug was though so i wasn't sure what to do 12:24:32 I had changed the dictionary layout before beginning to rewrite the parser but forgot to change the code of the function-declaration routine 12:26:17 exact the same problem as with the string handling functions, which I debuuging now 12:26:21 ^debugging 12:26:40 fun :) 12:27:03 you write it :D 12:27:26 i have my own parser to deal with 12:28:13 string handling ? 12:28:32 i'm trying to bootstrap a parser for my ngaro assembler. 12:28:40 ah ok 12:28:46 like write it in assembly without macros 12:29:16 which is no fun 12:29:47 for string handling, I switched to counted strings (like in Pascal) but ease debugging and protects against buffer overflows 12:30:01 ^but=which 12:30:59 for my proto-dictionary, i'm just using space-padded, 4-byte strings 12:31:13 so it's really just a dictionary compare. 12:31:34 i mean an integer compare 12:32:03 but if i want anything more than 4 bytes, i'm out of luck :) 12:32:30 hmm, the first byte is the string counter in my current version (and strings are arrays of packed bytes) 12:32:57 the routines do not need to compare characters 12:49:35 if I understand you correctly and your approach are null terminated strings as in C 13:10:28 * Mat2-debugging string handling now implemented, start working implementing all arithmetic and logic primitives 13:11:57 no just fixed length. all the strings are 4 bytes in what i'm doing right now 13:12:16 ahm, ok 13:13:24 do you know foertchen ? Helmar had implemented the dictionary the same for this forth (because 4 bytes = 1 word for x86) 13:18:14 nope, hadn't seen it. but yeah, that was my reason, too... so i can just do a single cell comparison for lookups 13:32:38 --- nick: Mat2-debugging -> Mat2-coding 14:04:03 --- join: erider (~chatzilla@unaffiliated/erider) joined #retro 14:04:21 hi all 14:04:29 hi Mat2-coding 14:15:58 --- join: saper (saper@wikipedia/saper) joined #retro 14:16:17 hi erider 14:17:35 what are you up to, erider? 14:17:43 hi 14:17:57 Mat2-coding: did the code get posted yet? 14:25:54 tangentstorm: just playing around with gnu screen 14:59:28 erider : screen is cool, but you might like tmux better 14:59:44 why 15:00:40 for one thing you can do a vertical split. screen can only split the top and bottom 15:02:39 http://unix.stackexchange.com/questions/549/tmux-vs-gnu-screen 15:04:47 screen can do vertical 15:04:57 http://tomlee.co/2011/10/gnu-screen-splitting/ 15:06:35 --- quit: Mat2-coding (Ping timeout: 252 seconds) 15:07:01 * erider will take a look at tmux later 15:10:20 --- join: Mat2-coding (~claude@91-65-144-133-dynip.superkabel.de) joined #retro 15:17:56 --- join: kumul (~mool@c-76-26-237-95.hsd1.fl.comcast.net) joined #retro 15:27:59 fun: needs vt' with vt' last @ hex [ @ dup $7F > over $20 < or [ |b putn space ] [ 15:28:01 |c putc ] if ] iter |w 15:30:18 erider: huh. cool. that's relatively recent. 15:41:50 --- quit: tangentstorm (Ping timeout: 246 seconds) 15:42:57 --- join: tangentstorm (~michal@108-218-151-22.lightspeed.rcsntx.sbcglobal.net) joined #retro 16:27:28 --- quit: kumul (Ping timeout: 248 seconds) 16:46:09 --- join: kumul (~mool@c-76-26-237-95.hsd1.fl.comcast.net) joined #retro 17:12:53 --- quit: kumul (Ping timeout: 272 seconds) 17:46:53 about a year 18:13:54 --- join: kumul (~mool@c-76-26-237-95.hsd1.fl.comcast.net) joined #retro 19:11:30 --- quit: kumul (Read error: Connection reset by peer) 19:11:55 --- join: kumul (~mool@c-76-26-237-95.hsd1.fl.comcast.net) joined #retro 21:44:06 --- quit: kumul (Quit: Leaving) 22:34:26 --- quit: Mat2-coding (Quit: Verlassend) 22:53:10 --- join: Mat2 (~claude@91-65-144-133-dynip.superkabel.de) joined #retro 22:53:40 erider: the code is uploaded and will be daily updated 22:53:45 --- quit: Mat2 (Client Quit) 23:59:59 --- log: ended retro/13.03.01