00:00:00 --- log: started forth/15.09.11 00:03:38 --- join: nighty-_ (~nighty@hokuriku.rural-networks.com) joined #forth 00:08:34 --- quit: ASau (Remote host closed the connection) 00:09:08 --- join: ASau (~user@176.2.77.243) joined #forth 00:12:05 --- join: xyh- (~xyh@183.15.143.151) joined #forth 00:12:50 --- quit: xyh (Ping timeout: 244 seconds) 00:13:57 --- nick: xyh- -> xyh 00:16:27 --- quit: ASau (Ping timeout: 244 seconds) 00:26:23 --- join: mnemnion (~mnemnion@2601:400:8001:14c9:ed67:3d61:78bd:db87) joined #forth 01:11:23 --- quit: xyh (Remote host closed the connection) 01:19:36 --- join: xyh (~xyh@183.15.143.151) joined #forth 02:27:40 --- quit: nighty-_ (Ping timeout: 265 seconds) 02:39:42 --- quit: xyh (Remote host closed the connection) 02:43:50 --- join: nighty-_ (~nighty@hokuriku.rural-networks.com) joined #forth 03:11:51 --- quit: atommann (Quit: Leaving) 04:06:07 --- join: DGASAU (~user@lmpc.drb.insel.de) joined #forth 04:07:49 i want try implement anything in forth. 04:08:24 maybe, someone have list of tasks 04:08:25 ? 04:08:46 trying something find for begginers 04:33:16 --- quit: asagk (Ping timeout: 244 seconds) 04:45:56 --- join: karswell` (~user@208.32.199.146.dyn.plus.net) joined #forth 04:46:00 --- join: asagk (~asagk@i59F6C752.versanet.de) joined #forth 04:50:19 --- quit: karswell` (Read error: Connection reset by peer) 05:07:56 --- join: BitPuffin (~usefulPro@host217-41-32-21.in-addr.btopenworld.com) joined #forth 05:08:45 --- nick: zx9p -> JX7P 05:49:13 o/ 05:49:34 Does anyone know if there are (and if so, which?) forth implementations that support the latest 200x draft? 05:50:03 especially which ones that work on the typical standard operating systems of today 05:50:17 such as windows, os x, linux, BSDs, minix and so on 05:51:10 --- quit: tankfeeder (Quit: Leaving) 05:54:50 oh yeah free / open source ones 06:09:31 --- join: atommann (~atommann@222.248.243.233) joined #forth 06:13:22 --- join: kumul (~mool@adsl-64-237-239-66.prtc.net) joined #forth 06:24:26 bitpuffin: gforth should have at least some of it 06:24:56 segher: hm 06:25:08 do you know if code that uses gforth also have to be GPL licensed? 06:25:42 not sure if they have had a release lately; if not, take a snapshot 06:26:17 dunno 06:27:41 --- join: xyh (~xyh@183.16.0.85) joined #forth 06:27:55 googling "gforth gpl" takes you to the gforth manual page that describes that situation 06:31:52 it depends on how it uses it 06:33:13 hmm 06:34:14 ugh that's terrible :P 06:34:59 know of any other one? 06:35:02 (non-gpl'd) 06:35:11 --- join: Mat4 (~claude@ip5b40b95e.dynamic.kabel-deutschland.de) joined #forth 06:36:55 hi all 06:37:37 BitPuffin: I don't know any other Forth which support the 200x draft 06:38:25 but expect the commercial ones will support it soon after finalisation 06:43:05 hmm 06:43:09 isn't it already in RC mode? 06:43:22 s/mode/stage 06:45:49 well I was thinking about implementing a forth, either a forth standard compliant implementation or simply something inspired by forth 06:46:18 or both I guess, once I've implemented a forth I will probably know forth well enough to reason about how important it is for me to change it 06:49:45 --- quit: xyh (Ping timeout: 264 seconds) 06:57:02 --- join: xyh (~xyh@183.16.0.85) joined #forth 06:58:18 bitpuffin: programming a Forth system is a terrible way of learning to program in Forth, and will not result in a good system at all. but it sure is fun! 07:00:06 segher: :P well 07:00:15 --- quit: xyh (Read error: Connection reset by peer) 07:00:16 I'd say you probably learn a lot about it 07:00:21 especially if you program the forth in forth 07:00:41 though you're probably much more experienced with forth than I am 07:00:53 I toyed with pforth a few months back for like an evening 07:01:16 and forth was a big influence on the design of my not-yet-implemented programming language 07:02:54 given that gforth is a compiler and a library. all code written for it should be gpl. (i think) 07:03:06 im not sure 07:04:02 i havent looked at gforth in so long 07:04:04 I guess my thought is that if you write the forth code to be portable between forth systems (limiting you to the ANS standard version for now I guess) you can run the code in gforth without having to make it gpl 07:04:13 since you can just claim that you actually use pforth 07:05:22 thats a good idea 07:06:26 though I remember I probably stopped using pforth when I thought it didn't do strings well but I'm not sure how much this is true 07:06:28 manual says 07:06:35 STRING - only has CMOVE CMOVE> COMPARE 07:06:43 under the ANSI compliance section 07:09:39 kumul: no, not all code written for a compiler that is GPL needs to be GPL 07:09:59 e.g. that is very much not true for GCC 07:11:04 but if you distribute *binaries* of things you made with gforth, that includes the gforth system itself, and so is GPL 07:11:42 you're right 07:12:14 yeah 07:12:20 sounds about right 07:12:59 any code you write is just your code. GPL is not a disease. 07:13:58 --- quit: atommann (Quit: Leaving) 07:14:25 --- quit: impomatic (Quit: http://corewar.co.uk) 07:18:08 --- join: xyh (~xyh@183.15.244.125) joined #forth 07:18:29 --- nick: xyh -> join 07:18:59 https://github.com/philburk/pforth/blob/master/fth/strings.fth I'm guessing most of these words are non standard 07:19:19 --- nick: join -> fc 07:20:00 ah wait I found the standard I should just compare that as a reference :) 07:20:17 --- nick: fc -> [110] 07:20:33 --- nick: [110] -> [11088208820] 07:28:04 Besides being non-standard they are mostly trash, unless he has rewritten them. 07:29:21 hmm how do you mean? 07:29:43 --- nick: [11088208820] -> xyh 07:30:04 you mean that the standard string words are trash? 07:30:09 or that his custom ones are trash 07:30:50 dont pay attention to DGASAU 07:31:09 no? why not 07:31:18 BitPuffin: DGASAU here is a person who always argue that forth is bad. 07:31:24 :) 07:31:26 ah I see 07:32:36 I generally just distance myself from a language if I think it's bad, unless someone tries to convince me it's good or if I'm joking with a friend who likes it 07:35:51 anyway~ 07:36:02 BitPuffin: do you know this :: https://github.com/larsbrinkhoff/lbForth 07:36:21 I like this implementation 07:37:04 --- quit: proteusguy_ (Ping timeout: 246 seconds) 07:37:20 interesting 07:37:29 though also GPL so wouldn't use that to distribute binaries most likely 07:38:11 also check out :: https://github.com/ForthHub/ 07:38:12 --- quit: proteusguy (Ping timeout: 272 seconds) 07:40:10 and :: http://www.reddit.com/r/forth/wiki 07:41:05 --- quit: JohnMarkM (Quit: Leaving) 07:42:17 ooo 07:42:21 nice resources xyh! 07:48:08 xyh: y'all should put the standard draft on forthhub 07:50:03 --- join: proteusguy (~proteusgu@ppp-110-168-230-190.revip5.asianet.co.th) joined #forth 07:50:03 --- mode: ChanServ set +v proteusguy 07:50:15 --- join: proteusguy_ (~proteusgu@ppp-110-168-230-190.revip5.asianet.co.th) joined #forth 07:56:54 BitPuffin: are you just start learning forth ? 07:57:24 xyh: I think you could essentially say that yeah, I'm sort of familiar with some basics 07:57:54 BitPuffin: I recommend you try to implement your own forth to learn it :P 07:58:15 haha conflicting advice in here 07:58:22 --- join: mnemnia (~mnemnion@2601:400:8001:14c9:9d28:7101:a291:80cd) joined #forth 07:58:38 but yeah I think it's in general good for most programming languages to implement it 07:58:44 if you wanna learn it deeply 07:58:51 maybe not C++ because you'll never finish 08:00:12 forth is so simple, very easy to be implemented by a person who is new to it. 08:00:52 Design Decisions in the Forth Kernel, by Brad Rodriguez :: http://www.bradrodriguez.com/papers/moving1.htm 08:01:02 yeah that's one of the things that drove me to forth now 08:01:29 --- quit: mnemnion (Ping timeout: 244 seconds) 08:01:58 I was making my own pl, but, I have so little motivation to code outside after work hours, and also little motivation to code in things I cannot fully grasp / control / be the author of, so implementing a forth that I can call my own would help me with some of that 08:02:18 which would let me use that to write lots of the thins that I wanted to write my own thing for 08:03:58 I am designing my language too :: https://github.com/cicada-language/cicada 08:04:30 xyh: oh are you japanese or maybe chinese or something 08:04:33 I see them kanjis there :P 08:04:38 chinese 08:04:43 cool! 08:04:53 it's the same characters so it's hard to know which language when looking at them 08:05:30 do you have code samples? 08:06:39 yes, I can push a html page to github for you, wait :) 08:07:14 cool, would love to see it :) 08:10:36 --- quit: kumul (Read error: Connection reset by peer) 08:17:25 --- join: protist (~javery@169.238.69.111.dynamic.snap.net.nz) joined #forth 08:22:05 BitPuffin: http://cicada-language.github.io/ 08:22:08 [a few links still need to be fixed] 08:22:36 --- quit: mnemnia (Read error: Connection reset by peer) 08:22:58 I see someone here also uses the great bloated yet somehow best emacs 08:23:10 https://github.com/cicada-language/cicada-language.github.io/commit/b30637ad1b6a8c13ab875d0bd79143895262d227 08:23:12 --- join: mnemnion (~mnemnion@2601:400:8001:14c9:9d28:7101:a291:80cd) joined #forth 08:23:28 :) 08:23:38 this commit is for you 08:23:53 which link on the website do you want me to click? 08:24:03 haha aw :D 08:24:20 it is fakef emacs org-mode 08:24:23 * it is faked emacs org-mode 08:24:26 http://cicada-language.github.io/intro/show-all.html 08:24:47 let me translate japanese to chinese (I'm not japanese for the record just know a weeee bit) 08:24:48 below Chinese doc is English doc 08:25:13 乖巧 08:25:45 :) 08:25:53 here is tangled source file : http://cicada-language.github.io/code/core.cn/contents.html 08:26:00 ah wait I think the rules in the channel says english only nooooOOO haha 08:26:48 what did you mean by faked org mode btw? 08:27:07 not full featured org-mode 08:27:26 written in forth or cicada 08:27:40 are cicadas widespread in china? 08:27:50 no 08:27:56 I am the only user 08:28:05 no I mean the insect 08:28:15 oh! yes 08:28:57 which heading should I start reading from in the intro? 08:31:34 * simple examples 08:32:05 ah yeah okay cool 08:32:07 looks very forthy 08:32:28 though you said wrote that mul takes 2 numbers and adds them which is probably a typo :D 08:32:37 I will write a better web site, after I learn more about css and js 08:33:27 I believe real org mode has fairly decent CMS capabilities 08:33:35 though you'd have to replace the CSS to get some originality 08:34:11 yes, it is a typo. I ll fix it, thx :) 08:34:51 is the end word like a return? 08:35:46 it looks cool though! 08:35:55 --- join: mnemnia (~mnemnion@2601:400:8001:14c9:9d28:7101:a291:80cd) joined #forth 08:36:13 --- quit: mnemnion (Ping timeout: 246 seconds) 08:37:01 define_primitive_function "end", end 08:37:01 pop_return_stack rbx 08:37:02 next 08:37:52 hmm 08:38:06 I'll take that as a yeeeees? :P 08:38:21 I use explicit "end" to mark the end of function body 08:38:40 well I saw an end inside an if 08:38:50 I also use explicit "tail-call" to do tail-call 08:39:46 yes, to be explicit is to use it in anywhere of the function body 08:39:59 just like return, you are right. 08:40:21 aha! okay cool :) 08:40:32 you have to put it even at the end of the function? 08:41:00 I guess : and ; just delimits "some definition" 08:41:10 and define-function takes that definition as a function 08:41:19 yes, even at the end of the function. 08:41:21 and maybe applies some kind of compile time semantics or something 08:41:34 to make it more functiony :P 08:41:44 : asd ; push as string to the argument-stack 08:42:05 asd = tostring ? 08:42:37 : asd ; == "asd" 08:43:05 just a string, and the function "define-function" compiles the string to memory. 08:43:12 oooooooh 08:43:20 so a string literal is like : hello world! ; 08:43:23 would be 08:43:28 are you on linux ? 08:43:28 "hello world!" in C or most langs 08:43:33 not at the moment 08:43:38 I mean I could ssh to my vps or whatever :P 08:43:47 though I'm kind of at work xD 08:43:50 a string literal is still "hello world!" 08:44:03 aha 08:44:04 ok~ 08:44:11 just that : ; doesn't have escape sequences maybe? 08:44:32 like I can't do : Hello \n World! ; 08:44:38 or I mean I can but there wouldn't be a newline 08:44:44 or is that not how it works 08:45:31 : and ; just make it looks like forth 08:45:42 yeah :P 08:46:12 for example, instead of ":" ";" I can use "def" "fin" 08:47:35 ":" is just a function, but the double-quote char is implemented as a syntax extension. 08:47:55 I have a syntax extension mechanism 08:49:45 I am designing the type system of this language now, when I finish the type system, I will announce the project :) 08:49:52 [and write a better web site >_<] 08:49:56 aha! 08:50:10 are you gonna go GC-less? 08:50:44 yes no GC, but I have a old version of the language have a GC. 08:51:39 I have an interesting way to manage the use of memory. 08:51:43 cool 08:51:50 ah you do? 08:51:54 I'd love to hear it 08:52:56 I will write some doc for you tomorrow ok ? 08:53:51 a reader will make me write better doc :P 08:54:01 sure! 08:55:33 the reason I asked about GC is that I care quite a lot about being able to predict and reason about performance etc since I'm a game developer oriented guy 08:55:46 so I've grown to think that GCs aren't all that fun 08:55:50 I mean they're acceptable at times 08:58:19 --- quit: darkf (Quit: Leaving) 09:04:13 BitPuffin: It depends. Reference counting like GCs can be implemented complete predictible. However there are two drawbacks using this approach (both with can be avoided) 09:04:49 1. There can occur cyclic references 09:06:07 2. there exist some static overhead 09:06:42 sorry, I mean with=which 09:08:38 yeah 09:08:42 it's also a bit about being optimal 09:09:10 like for any given application there is an optimal way to manage the memory, and you can implement that, and a GC will at _best_ be just that 09:09:17 but most of the time it's worse than that 09:10:29 xyh: You had take a look at the ciForth sources writing cicada I think 09:12:03 BitPuffin: I think GC is generally not a good idea if it can not be turned off 09:13:19 however, I also donÄt think taht type systems are helpful in the most cases (at least for the programmer), there are of advantages for compiler development 09:13:32 eh, don't think 09:14:14 it's ok I'm familiar with swedish typos :P 09:14:45 anyway, yeah I agree, and some features might benefit from a GC 09:14:51 so in those cases I can see value 09:15:19 but otherwise a lot of times you're just attaching this insanely complicated system that you don't understand to something which wasn't so challenging to deal with the memory in the first place 09:15:55 I agree 09:18:12 Mat4: type systems can help a great deal with detecting errors at compile time but you can also find yourself fighting with them quite often 09:20:20 Mat4: you recognize ciForth's feature in cicada ? 09:22:42 I noticed a similarity in the kernel interface 09:22:46 to have a type system is to have a theorem prover. (just like Coq and Agda) 09:23:27 I will give ciForth a look then :) 09:23:33 I think a programmable user defined type system is cooler :P 09:25:40 I had studied proof theory for 2 month, and wish to make my type system a little prover! 09:25:54 xyh: a theorem prover is not helpful for source sequences which need to bypass a (strict) type system like adding or subtracting an offset to an ASCII character for example 09:26:43 in my experience such problems can occur frequently 09:29:06 (at least this is my current opinion on theorem solving) 09:29:19 I just wish so much to learn from my experience about trying to implement a "type system as prover". 09:29:47 isn't that what F* and Idris and friends do? 09:31:52 hmm, I think so 09:32:33 will be interesting how you adapt this to a stack based language I think 09:32:43 whether successful or not it is potentially interesting research :) 09:34:06 :) 09:35:10 my language predict data formats by evaluating specific bit-patterns at compilation. This way it is possible to detect logic errors and source sequences which lead to subotimal code (this case is handled as critical error) 09:37:24 however this means that the compiler need to 'simulate' code execution (which is not a problem because compilation is part of the parser so the whole dynamic state is known) 09:38:49 hmm 09:44:27 --- join: fantazo (~fantazo@089144216152.atnat0025.highway.a1.net) joined #forth 09:45:22 my idea is that the complexity of a theorem solver can be avoided simply by ensuring that only logical correct and optimal code can be generated 09:45:38 hm 09:45:40 yeah 09:45:49 well isn't that essentially what a theorem solver does? 09:47:23 yes, the difference is that most languages do not ensure program correctness 09:47:28 --- join: _spt_ (~jaat@unaffiliated/-spt-/x-5624824) joined #forth 09:48:00 I mean avoiding the need for an external program which proves the source code 09:49:52 For a static compiler that's ... a difficult task I think, however in case of an interpreter all needed is already avariable (the dynamic program state) 09:51:09 and program diagnosis can be done beside parsing (at edit time) 09:51:42 it's really trivial to implement 09:54:47 << the current value don't exceed 8 bit range -> possibly character or index ... follwing code add always one to the value -> index :- error if index value exceed a prior known range >> 09:57:05 quite simple 10:02:45 Mat4: yeah I guess you could do it while metacompiling? 10:02:55 but yeah I think it should just be possible to do it as a user step 10:03:04 which is what I meant by user defined type system earlier sort of 10:06:22 ok, so we have an similar idea 10:07:04 also I suppose you could do it as um 10:07:24 okay so I haven't actually checked what peephole optimization means but I'm assuming it means looking at the program ahead in a reflective sort of way 10:07:30 you could do peephole error checking :P 10:07:57 s/means/involves 10:08:14 I might have the wrong idea abou what peephole optimization means though 10:09:28 if my guess was right it means that it was given a good name that describes what it does :D 10:11:06 right, its possible 10:11:25 nice idea, thanks :) 10:13:25 :D 10:18:44 there is a disappointing lack of forth representation of forth in benchmarks :/ 10:18:55 --- quit: fantazo (Ping timeout: 265 seconds) 10:18:56 - first forth 10:19:05 vs other languages I mean 10:19:16 I suspect that you can write code that is pretty much at C level or faster 10:19:24 I mean you can of coruse write much slower code too 10:19:45 No, you can't. 10:19:59 You can reach level of C at most. 10:22:06 I suspect you are incorrect, C doesn't give you as much power as forth in terms of reflection etc 10:22:09 What is important, you have to try very hard to reach it. 10:22:17 See Ertl, for instance, ha-ha. 10:22:32 of course when you have more power you have more ways to shoot yourself in the foot 10:22:45 Reflection makes your code a lot slower, actually. 10:22:57 no not if you only reflect while metacompiling 10:23:14 I mean that part won't be fast as lightning 10:23:20 but what you spit out can be quite fast probably 10:23:36 You can run C compiler and load the code dynamically as well. 10:23:54 --- join: nishikino-maki (~nishikino@123.64.163.151) joined #forth 10:24:02 wasn't talking about dynamic code reloading though 10:26:53 was talking about looking at the program at compile time and apply your own transformations before spitting out an executable 10:27:26 which in C you'd pretty much be writing your own compiler 10:27:31 I mean I guess you are in forth 10:27:38 but C is harder to make a compiler for 10:28:02 just my hypothesis though 10:28:07 I don't know enough forth to say for sure 10:29:45 It is as hard to make a compiler for Forth, if you want to compete in performance. 10:30:13 the C syntax alone ensures 'endless' compiler complexity (more important research effort and memory involved) in search for efficient code generation 10:30:27 Bullshit. 10:30:58 Syntax is the easiest part of compiler, if you use artificial programming language. 10:31:53 I think Mat4 wasn't so much talking about parsing the syntax itself but probably more like traversing the resulting AST 10:31:55 or maybe not 10:32:02 I mean parsing is way more challenging as well 10:32:07 Traversing AST is even easier. 10:32:41 I've written about C and it is accepted by *most* programmers which maintain C compilers that the quirks of its syntax doesn't simplify code generation 10:33:05 DGASAU: You are just a troll 10:33:17 Mat4: You are just an idiot. 10:33:27 shenmegui! 10:33:27 fuck off 10:37:39 --- join: TommyJerryMairo (~TommyJerr@unaffiliated/tommyjerrymairo) joined #forth 10:38:56 inlining must be quite a lot simpler in forth 10:39:06 not saying it's super hard in other cases necessarily 10:39:11 but with how things are passed in the stack 10:39:27 you basically write the function as if it's inline already 10:43:42 If you mean inlining in a form of what early compilers of mid-50s did, sure. 10:46:04 --- quit: BitPuffin (Ping timeout: 255 seconds) 10:46:24 --- join: spt_1 (~jaat@host-2-97-56-215.as13285.net) joined #forth 10:47:51 I think you can't compare a Forth system to an optimizing C compiler. The effort for compiling C is way higher because the syntax and semantic is somewhat ambiguous which beside increasing parsing time expense AST generation (because multiple opportunities can exist which may impacting different optimizations). One advantage of C as language is that its execution model is better suited for actual CPU architectures 10:48:33 That's bullshit. 10:48:40 You can compare them. 10:48:43 Both are compilers. 10:48:47 --- quit: _spt_ (Ping timeout: 240 seconds) 10:48:58 If you target similar goals, you'll have sensible comparison. 10:49:18 shut up, I don't talk to you buthead 10:49:38 Whom do you talk to then, idiot? 10:49:38 --- join: Zarutian (~zarutian@168-110-22-46.fiber.hringdu.is) joined #forth 10:50:48 the only real Idiot is you because all you've written is just meaningless talk for uncivilisated scumn as you 10:51:09 get civilisated and sober 10:51:42 Try to get with your ideas into any channel that is at least minimally educated in compiler technology. :) 10:56:03 BitPuffin: the data stack at least need to be mapped to registers for efficient code generation. This is not much effort, however add complexity to a Forth system where simplicity seem to be a main goal 10:58:14 I think the common Forth way to optimization is mostly simply rewriting critical word definations in assembler 10:59:38 so there is not much need for an optimizing compiler 10:59:50 IOW, the weakest form of optimization of all available. 11:00:06 "There is not much need..." 11:00:10 Ha-ha! 11:07:30 --- quit: Mat4 (Quit: Konversation terminated!) 11:15:28 --- quit: protist (Quit: Konversation terminated!) 11:17:15 --- join: Mat4 (~claude@ip5b40b95e.dynamic.kabel-deutschland.de) joined #forth 11:29:22 DGASAU: sorry for my uncontrolled and inappropriate reaction 11:29:42 I will just ignore you in future 11:40:43 --- part: Mat4 left #forth 11:57:25 --- quit: xyh (Remote host closed the connection) 12:21:16 --- quit: mnemnia (Ping timeout: 246 seconds) 12:21:36 --- join: mnemnion (~mnemnion@c-68-40-58-223.hsd1.mi.comcast.net) joined #forth 12:22:26 --- join: _spt_ (~jaat@unaffiliated/-spt-/x-5624824) joined #forth 12:24:47 --- quit: spt_1 (Ping timeout: 240 seconds) 12:30:15 --- join: spt_1 (~jaat@host-92-24-246-140.ppp.as43234.net) joined #forth 12:32:47 --- quit: _spt_ (Ping timeout: 240 seconds) 12:39:47 --- quit: mnemnion (Ping timeout: 240 seconds) 12:40:17 --- join: mnemnion (~mnemnion@c-68-40-58-223.hsd1.mi.comcast.net) joined #forth 12:41:19 --- join: Mat4 (~claude@ip5b40b95e.dynamic.kabel-deutschland.de) joined #forth 12:45:24 --- part: Mat4 left #forth 12:50:51 --- quit: backer (Quit: leaving) 12:56:01 --- quit: mnemnion (Read error: Connection reset by peer) 12:56:35 --- join: mnemnion (~mnemnion@c-68-40-58-223.hsd1.mi.comcast.net) joined #forth 13:04:19 --- quit: nighty-_ (Quit: Disappears in a puff of smoke) 13:04:22 --- quit: TommyJerryMairo (Remote host closed the connection) 13:04:56 --- join: TommyJerryMairo (~TommyJerr@unaffiliated/tommyjerrymairo) joined #forth 13:12:24 --- quit: nishikino-maki (Quit: Konversation terminated!) 13:24:07 --- quit: spt_1 (Ping timeout: 240 seconds) 13:45:16 --- quit: tangentstorm (Ping timeout: 246 seconds) 14:00:08 --- join: tangentstorm (~michal@66-169-114-213.dhcp.ftwo.tx.charter.com) joined #forth 14:07:51 --- quit: mnemnion (Ping timeout: 250 seconds) 14:10:22 --- join: mnemnion (~mnemnion@2601:400:8001:14c9:9d28:7101:a291:80cd) joined #forth 14:16:59 --- join: johnmark_ (~johnmark@24.1.223.32) joined #forth 14:17:30 --- nick: johnmark_ -> JohnMarkM 14:49:11 --- join: Mat4 (~claude@ip5b40b95e.dynamic.kabel-deutschland.de) joined #forth 14:49:52 --- quit: Mat4 (Client Quit) 15:25:54 --- join: kumul (~mool@adsl-64-237-237-25.prtc.net) joined #forth 16:17:26 rixard: https://github.com/quozl/cforth.git is my CForth fork for Teensy 3.1 which also contains a Mac OS X build target, see build/host-serial-macos/ 16:17:37 (responding to a question on #olpc) 16:18:34 --- join: mnemnia (~mnemnion@2601:400:8001:14c9:50e4:2e88:cd69:4141) joined #forth 16:19:37 --- quit: mnemnion (Ping timeout: 246 seconds) 16:22:21 --- quit: kumul (Quit: Leaving) 16:28:43 --- quit: mnemnia (Ping timeout: 246 seconds) 16:28:57 --- join: mnemnion (~mnemnion@c-68-40-58-223.hsd1.mi.comcast.net) joined #forth 16:36:50 --- join: kumul (~mool@adsl-64-237-237-130.prtc.net) joined #forth 16:37:51 https://moonforth.github.io/ 16:38:06 in other news people should stop sucking Notch's c*ck 16:38:19 sorry for the profanity 16:47:13 --- quit: Zarutian (Quit: Zarutian) 17:12:46 --- quit: TommyJerryMairo (Ping timeout: 244 seconds) 17:16:30 --- join: vsg1990 (~vsg1990@cpe-67-241-148-119.buffalo.res.rr.com) joined #forth 19:14:16 --- join: mnemnia (~mnemnion@2601:400:8001:14c9:50e4:2e88:cd69:4141) joined #forth 19:16:01 --- quit: mnemnion (Ping timeout: 246 seconds) 19:18:01 --- join: mnemnion (~mnemnion@2601:400:8001:14c9:50e4:2e88:cd69:4141) joined #forth 19:18:25 --- quit: mnemnia (Read error: Connection reset by peer) 19:36:02 --- join: kumool (~mool@adsl-64-237-239-89.prtc.net) joined #forth 19:38:52 --- quit: kumul (Ping timeout: 255 seconds) 20:48:21 --- join: Bahman (d15f33ab@gateway/web/freenode/ip.209.95.51.171) joined #forth 20:58:31 --- quit: kumool (Quit: Leaving) 21:14:33 --- join: darkf (~darkf___@unaffiliated/darkf) joined #forth 21:32:29 --- quit: vsg1990 (Quit: Leaving) 22:23:24 --- join: karswell (~user@208.32.199.146.dyn.plus.net) joined #forth 23:14:22 --- quit: Bahman (Ping timeout: 246 seconds) 23:21:00 --- quit: mnemnion (Remote host closed the connection) 23:21:17 --- join: Bahman (d15f33a9@gateway/web/freenode/ip.209.95.51.169) joined #forth 23:59:59 --- log: ended forth/15.09.11