00:00:00 --- log: started forth/16.09.17 00:10:07 https://www.youtube.com/watch?v=Sr_SGkqrrdM 00:12:10 by the way you guys lisp machines are not dead 00:12:15 you can make a lisp machine with an fpga 00:13:15 John[Lisbeth]: if you want to badly enough you can make an OS using only Brainfuck 00:13:22 but, who the hell would want to 00:14:58 not me sounds like a waste of time 00:15:23 8 symbols? makes me chuckle. I could make way better use of 8 symbols 00:15:58 and then I would implement forth inside o fit 00:17:07 ya 00:17:25 --- join: Saustin (d8e54eb4@gateway/web/cgi-irc/kiwiirc.com/ip.216.229.78.180) joined #forth 00:18:16 that "dup drop loop swap" is almost certainly some kind of trick specific to that Forth 00:18:27 unless there is a DO ... LOOP that it ends 00:22:51 some kind of trick? what does it accomplish that's beneficial? 00:23:50 I think they're saying that particular line of code is a malformed one 00:25:05 --- quit: nal (Quit: WeeChat 1.4) 00:30:44 could be malformed 01:17:57 --- join: whyforth (1837013f@gateway/web/cgi-irc/kiwiirc.com/ip.24.55.1.63) joined #forth 01:18:15 whats the coolest thing built in forth? 01:22:36 people have buit whole languages in forth 01:22:48 people have built kernels in forth and distributions in forth 01:22:54 people have built whole languages in Lisp and assembly too 01:23:00 forth runs some of the high spec stuff at nasa that requires fast computation 01:23:05 ah 01:23:30 people have built whole languages in assembly but I wouldnt want to build c in assembly or python 01:23:43 but building the base to forth is usually a very small amount of code if you cut out the unessential 01:23:54 most people that write their own languages or OS's are usually personal or toy computers 01:24:21 some of these are very successful but it is disputed on how to make forth modular 01:24:30 people have very different practices from each other 01:28:02 ultimately the thinking of many forth programmers is that once you learn the synta of forth it is very easy to implement whatever you like in forth 01:28:14 and modify forth to work exactly how you want for minimal effort or overhead 01:28:48 --- quit: mnemnion (Remote host closed the connection) 01:29:04 doesn't seem much standardized across forth implementations beyond reverse polish notation 01:29:15 well there is ans forth 01:29:22 and there are other notations for passing data such as json 01:29:30 it should be very simple to write a json reader/writer in forth 01:29:51 or xml for example 01:30:27 right, but the appeal of forth I'm seeing is universal syntax, which lisp also has 01:30:51 though you don't fit lisp in 500 bytes - 500 k 01:30:58 yet the largest forth I have found, gforth, is 500 k 01:31:08 and that's a full ans forth 01:31:34 --- join: true-grue (~true-grue@176.14.222.10) joined #forth 01:31:57 I mean if memory is your concern you could write a compiler on paper to generate a list of op codes 01:32:22 memory was actually not my concern when I learned forth 01:32:34 I study the longevity of code as well as the unix philosphy 01:32:37 not trying to be abrasive, I think colorForth is uber cool but, not much of the benefits I'm seeing are exclusive to forth 01:32:46 colorforth is just one forth 01:32:48 it isnt even very popular 01:33:32 it's like not liking linu because Linus uses fedora 01:33:42 *linux 01:34:19 What I was saying earlier was I am studying the longevity of code. I am worried about computers that in 100 years would still be able to turn on and run for future generations 01:34:27 like have you found yourself grabbing random forth code from the internet and plugging it in with general ease into your codebase? 01:34:28 sort of like how a calculator or a bicycle can function for a very long time 01:34:42 Well generally you grap protocols 01:35:04 for example if you wanted to write to a database you'd look up to see if that databse had an http protocol 01:35:14 usually you can read and write from a database with just urls 01:35:23 it's finding cheap solutions like that that makes it really easy to implement 01:35:26 right but LISP precedes forth by two decades 01:35:36 certainly not innacurate 01:35:42 but pencil and paper preceede both 01:35:54 what comes before or after is not what makes something better. Being better makes it ebtter 01:36:05 what I'm trying to get at is 01:36:40 what are some cases in your work, where /only/ forth would have done the job well 01:36:56 primary appeal I see is that its syntax is even more minimal than lisp 01:37:06 There is no one problem only forth solves 01:37:17 well I mean casewise 01:37:25 a good example of the capabilities of forth is you can run it on a computer with 8 k from the 80's 01:37:37 another good example is that it is very minimal and thus very easy to make fast as balls 01:37:59 and a third example is that it is very easy to program in once you learn the syntax which is very simple to pick up 01:38:22 it's beautiy is that it's minimal syntax allows you to do what you want and gets out of your way in a memory and storage efficient way 01:38:47 what is debugging forth like? 01:39:00 usually done with a repl and a vi like editor 01:39:15 any easier than binaries generated by C? 01:39:34 I am not sure what you mean by that but it is way easier to program in forth than c 01:39:48 forth basically gives you a shell with scripting abilities that match a full language 01:39:54 sort of like a lisp repl 01:40:05 some minimalist choose not to use it like a shell 01:40:13 the appeal of low memory setups to me is being able to run through flat memories, like DOS debuggers 01:40:31 the technology that runs dos is similar to this. forth can run on a floppy 01:41:35 there have been cases wehre people embedded tiny forths in software and were able to hide lots and lots of secret code in that software 01:42:20 my deal is that forth comes across really cool to me, but if I wanted to build something cool and similiar I would just make an assembly bomb 01:42:44 if you understand the concept of what makes lisp or functional programming good you can program like that 01:42:48 you can program in a purely funcitonal way 01:42:59 or if you like imperative programming you can program that way 01:43:05 like enumerated self-modifying programs 01:43:05 there are many short scripts on the internet that implement object systems 01:43:17 things like arrays and lists are only a few lines of forth 01:43:21 trees are e z p z 01:43:37 forth should be completley modifiable at runtime like lisp 01:43:44 as far as I understand 01:43:54 if you design it correctly 01:45:01 finite state machine? no problem 01:45:23 once you learn forth you realize you can turn any turing complete system anymore 01:45:44 there's a recent movmenet where people use free web services to try to use them to creat turing complete systems and compute withotu paying for vitual machines 01:45:58 forth is an example of a language that would be highly optimized for that 01:48:24 heard of factor? 01:48:41 it's a concatenative language along the same goalset as ans forth 01:48:58 ever used it? 01:49:47 not personally 01:57:43 --- quit: whyforth (Quit: http://www.kiwiirc.com/ - A hand crafted IRC client) 02:00:34 --- join: mnemnion (~mnemnion@2601:643:8102:7c95:e4c8:4ee3:12e9:5746) joined #forth 02:04:11 --- join: newuser|94031 (7c28f656@gateway/web/cgi-irc/kiwiirc.com/ip.124.40.246.86) joined #forth 02:05:33 --- quit: newuser|94031 (Client Quit) 02:06:05 --- quit: mnemnion (Ping timeout: 255 seconds) 02:49:39 --- join: proteusguy (~proteusgu@182.232.248.47) joined #forth 02:49:39 --- mode: ChanServ set +v proteusguy 02:59:46 pointfree: Thanks for the ESP links -- that talk is new to me. The others I know, but haven't tried out yet. 03:00:20 I've been playing/using Mecrisp on the STM32 ARM chips a bunch for the past 6 months, and it's really fun 03:00:37 ... so I thought I would give the ESP8266 a run in Forth if possible. 03:01:03 It seems like an absolutely perfect microcontroller language -- halfway between assembly and Python. 03:02:58 --- join: mnemnion (~mnemnion@2601:643:8102:7c95:e4c8:4ee3:12e9:5746) joined #forth 03:07:44 --- quit: mnemnion (Ping timeout: 255 seconds) 03:10:22 forth is the bestest rest is the restest 03:12:14 --- quit: proteusguy (Ping timeout: 255 seconds) 03:31:09 --- join: mnemnion (~mnemnion@2601:643:8102:7c95:1d26:5601:f539:f659) joined #forth 03:35:38 --- quit: mnemnion (Ping timeout: 255 seconds) 03:53:28 --- join: Zarutian (~zarutian@168-110-22-46.fiber.hringdu.is) joined #forth 04:17:00 --- quit: Zarutian (Quit: Zarutian) 05:02:49 --- quit: cantstanya (Remote host closed the connection) 05:07:35 --- join: rprimus (~micro@a9.lence.net) joined #forth 05:14:56 --- quit: ASau (Ping timeout: 240 seconds) 05:25:08 --- join: Zarutian (~zarutian@168-110-22-46.fiber.hringdu.is) joined #forth 05:32:35 --- join: mnemnion (~mnemnion@71.198.73.193) joined #forth 05:37:11 --- quit: mnemnion (Ping timeout: 244 seconds) 05:57:59 I wonder if you could bootstrap forth onto verilog 05:58:01 probably not 06:18:36 --- join: dys (~dys@x5f71e78c.dyn.telefonica.de) joined #forth 06:29:33 --- join: mnemnion (~mnemnion@2601:643:8102:7c95:8010:addc:7dd1:c653) joined #forth 06:33:51 --- quit: mnemnion (Ping timeout: 248 seconds) 07:30:58 --- join: mnemnion (~mnemnion@71.198.73.193) joined #forth 07:35:45 --- quit: mnemnion (Ping timeout: 265 seconds) 08:01:49 John[Lisbeth]: well, verilog is an hardware description language at the level of registers, memories and such. So here is how you do it: define a Forth machine in it and prepopulate its program memory with an Forth for that machine. 08:08:05 --- join: ASau (~user@netbsd/developers/asau) joined #forth 08:30:45 --- join: mnemnion (~mnemnion@2601:643:8102:7c95:206f:3d33:4ac0:ae21) joined #forth 08:35:20 --- quit: mnemnion (Ping timeout: 255 seconds) 09:11:04 --- quit: dys (Ping timeout: 264 seconds) 09:24:37 --- quit: reepca (Remote host closed the connection) 09:24:55 --- join: reepca (~user@std-001.cune.edu) joined #forth 09:31:30 --- join: mnemnion (~mnemnion@2601:643:8102:7c95:206f:3d33:4ac0:ae21) joined #forth 09:36:15 --- quit: mnemnion (Ping timeout: 248 seconds) 11:06:54 --- join: mnemnion (~mnemnion@2601:643:8102:7c95:206f:3d33:4ac0:ae21) joined #forth 11:11:43 --- quit: mnemnion (Ping timeout: 248 seconds) 11:21:57 --- join: mnemnion (~mnemnion@2601:643:8102:7c95:206f:3d33:4ac0:ae21) joined #forth 11:37:47 --- quit: ASau (Ping timeout: 244 seconds) 11:49:34 --- join: ASau (~user@netbsd/developers/asau) joined #forth 12:11:50 13:57 < John[Lisbeth]> I wonder if you could bootstrap forth onto verilog 12:11:56 well 12:12:23 do you mean in terms of, design a hardware platform in Verilog that will ultimately run Forth? 12:12:40 or, use Verilog as a programming language to build Forth primitives? 12:13:13 that's basically what James Bowman's J1 processor is? 12:13:43 i.e. a verilog machine in an FPGA that implements two stacks and gives you a bunch of hardware primitive Forth commands 12:20:15 ye 12:40:36 --- join: nha (~nha@2a01:e35:8be8:4e70:9d7a:2044:eb92:c460) joined #forth 12:40:53 --- nick: nha -> Guest55536 12:42:03 --- nick: Guest55536 -> nha_ 12:59:13 do i have to use the ' word with symbols when making a macro that uses them? 12:59:27 like lets say i want to make a macro that generates an arbitrary number of + + + 13:39:21 well, 13:39:38 ' should only work at interpretation time 13:40:03 so you could use it to make a generic "compile this in X times" kinda thing 13:40:22 otherwise you'll probably want ['] + 13:55:56 are there any good tutorials on forth metaprogramming? the gforth tutorial about it is kinda confusing 14:04:34 --- join: karswell` (~user@167.49.115.87.dyn.plus.net) joined #forth 14:08:13 --- quit: karswell (Ping timeout: 276 seconds) 14:08:30 --- join: dys (~dys@x5f71de16.dyn.telefonica.de) joined #forth 14:11:47 --- join: nal (~nal@adsl-64-237-237-132.prtc.net) joined #forth 14:13:31 --- join: gyxile (~nick@cpc80309-grim18-2-0-cust167.12-3.cable.virginm.net) joined #forth 14:26:03 nha_: if you have an example of some metaprogramming you want to do, we could probably help you with it. It's kind of a general subject and the meaning varies from language to language. In forth, metaprogramming (here read "changing the language") is as simple as just defining / redefining words, since they are the only syntactic construct. In a general sense, "metaprogramming" in the way other languages do it is unnecessary in 14:26:03 forth. Of course, by parsing the input stream, you *can* build any syntactic construct, but many feel it unnecessary. 14:28:48 For example, there's an entire BNF parser generator (that reads quite naturally, might I add) that doesn't use any additional parsing on top of what standard forth does (for generating the parser, that is... the generated parser itself obviously does more) in a single screen of forth. One of Brad Rodriguez's creations, I believe http://www.bradrodriguez.com/papers/bnfparse.htm 14:34:29 reepca: http://lpaste.net/4062740441529843712 14:35:12 just a toy example to generate a function that sums 3 integers at compile time 14:35:34 (doesn't work) 14:36:40 it's probably not the reason, but the pedant in me wants to point out that nonzero will give the wrong answer for negatives 14:38:46 --- quit: karswell` (Remote host closed the connection) 14:40:05 is it complaining about "unstructured" when you try compiling sum3? 14:40:12 yea 14:40:26 Ah, alright, then I think I know what's happening here 14:40:35 replicate wants 2 things on the stack 14:40:41 but you're only giving it one 14:40:48 so it's just taking the next thing that's on there 14:40:59 which happens to be some address stuff that forth uses internally for colon definitions 14:41:23 so postpone doesn't touch the stack? 14:41:23 inside the [ and ] put a .s at the beginning, after POSTPONE +, and after replicate 14:42:00 mhm. Postpone just compiles the compilation semantics of the specified word into the current definition (undefined what happens in interpret state, but you're switching to interpret state within the middle of a definition, so I'd assume it would work okay) 14:42:07 also postpone is an immediate word, so you don't have to put it inside [ ] 14:42:57 : compile+ postpone + ; immediate would, when run inside another word, just compile + into the current definition 14:44:47 there are a number of ways to use macros in forth. Generally, there's the "handle xts explicitly using ['], ', and COMPILE,", there's "use EVALUATE to just make the interpreter see the words we want when it's in compile state", and there's "use POSTPONE". 14:45:17 all of them can be defined in terms of each other (I think? Haven't studied it closely) and all have their own strengths 14:45:49 hmm ok 14:52:13 personally the way I'd do it (because you didn't ask :~) ) is to have a simple word that just compiles + (like COMPILE+) into the current definition, then have a word that runs that word n times and is immediate. Then you can have a word that will use : to parse the input stream and start a definition, then will call the word that (compiles + n times), then runs ; (you'd have to postpone it to run it, it's immediate). That way you could 14:52:13 just say "5 new-adder add5" and it would define add5 as a word that sums 5 times in a row. 14:53:17 I wish erc had a way of telling me when my messages would be broken up... it would warn me when I was rambling. 14:54:33 or if you want to use an xt instead of use a name, you could just use :noname instead of : 14:55:35 sounds good, i'll play with it a bit 14:55:37 although beware when trying to pass n to the word that compiles + n times, : puts its own stuff on the stack, and it's implementation-dependent (I think) how much it puts on there. So the usual way to do that is to put n on the return stack, run :, then put it back on teh data stack 14:55:38 forth is pretty fun 14:56:32 yeah, just beware with metaprogramming, it can get a bit ugly. But when it works, it's great. 15:01:35 and of course, you could do the same thing with a CREATEd word that just stores the number of times to run + in memory, fetches it at runtime, and loops. 15:02:30 but that requires a memory access, so I guess it's technically slower. Some would care less about the speed than the simplicity, though. In a way, CREATEd words are a lot like closures from lisp, for example. 15:06:09 interesting 15:08:09 So I'm a beginner to forth. I have some function definitions in memory. What is a good way to store them to the disk from the Forth cli? (using gforth on win) 15:09:12 I don't suppose you have your command line history readily available? Unless you're trying to create an executable, typically those would be stored in source form in a text (or blocks file, but I wouldn't worry about that too much) file. 15:10:10 If you *are* trying to create an executable or something like that, see here: http://www.complang.tuwien.ac.at/forth/gforth/Docs-html/Image-Files.html#Image-Files 15:11:03 Hmm no and no. So would it be best to just open up a 'forth script' in a text editor then run it normally? 15:11:11 vi blah.forth 15:11:18 gforth blah.forth 15:11:59 rinse. lather. repeat. 15:12:27 gforth uses blah.fs as a convention, but yeah. 15:12:40 there are some neat tricks you can do to preserve the interactiveness though 15:13:06 Mkay. I also do a lot of stuff with older computers (80's), so I would be interested in that, in interest of time and debugging. 15:14:42 here's one way to keep the interactiveness while being able to save your source: https://youtu.be/mvrE2ZGe-rs?t=17m43s 15:15:20 (I recommend watching the entire thing, it's sort of awe-inspiring seeing how naturally he seems to write everything... but then, this is him coding after he's finished writing it once, so that might be it) 15:15:53 wathing 15:19:54 I didn't know you could call the shell from forth heh 15:20:35 SYSTEM is a gforth-specific thing, but I imagine that other forths probably have similar words 15:21:14 yeah. I do like his method of edit compile run though, it seems pretty nice and a bit less mundade. 15:24:00 if you're willing to drop portability, it's amazing how much you can get out of gforth. Especially a manually-compiled one on a system with swig. You get bindings to tons of useful libraries... sockets, opengl, vulkan, egl, java native interface, android libraries, xlib interface, threads, etc. 15:24:32 --- quit: true-grue (Read error: Connection reset by peer) 15:25:39 is there any performance difference between recursion and iteration in forth? 15:25:58 interesting. I was tihnking of putting forth on an arduino I got, but I have no clue how I would edit my code without it being a pain. 2kb ram I believe. 15:26:15 If your forth doesn't do tail call elimination, then yes, iteration is faster. 15:27:12 you could use a block editor, those can get really small. 15:28:00 They basically just assume that each kB is formatted as 64*16 characters 15:28:03 block editor? hmm 15:28:21 when you say block editor, is this an internal forth thing or a separate program? 15:28:55 generally you implement it as a forth word...? 15:28:58 usually it's an internal forth thing. 15:31:49 The ANS word for it is EDITOR, but Gforth doesn't support it for some reason (if I recall the developers prefer files a lot? at least I got that feeling from the manual. It kind of makes sense, since gforth seems more for application development than for embedded development, at least compared to other systems) 15:34:11 hmm interesting. i'll have to look into it. thanks. 15:34:42 I wrote up a very very platform specific editor in about 1000 characters or so 15:35:18 hardest part is really "what kind of display do you have" 15:35:37 doing a block editor over a serial connection, for instance, seems a little crazy 15:58:56 well, a serial connection would be a real possibility. but it would be at least 9600 baud, so 1200 char/sec 16:02:31 nha_: TCE is not guaranteed in Forth. 16:02:42 Most implementations don't do it either. 16:02:52 at least, not ANS Forth. I think it's guaranteed in ColorForth, though? 16:03:05 you can store information logically 16:03:19 information can be stored in an fpga 16:03:35 so if you could get a repl into an fpga then sure you could get a functioning forth system on chip 16:03:45 it would probably cost you less to buy a green arrays chip though 16:04:01 this is regarding the verilog chip 16:04:12 I've seen that J1 chip and it seems very interesting 16:04:29 Though I somehow suspect that krivine would be smaller seeing how small it is to implement in haskell 16:04:48 I want to try to implement krivine in these things: https://upload.wikimedia.org/wikipedia/de/f/ff/T-FlipFlop-ersatz.png 16:05:21 these ones also catch my eye http://i.imgur.com/xHKLlbD.png 16:05:34 I can make trees with them and with trees I can make whatever I want 16:09:42 I realize now that those are very effiicent in regular programming too 16:10:17 Even though I can program forth into an fpga and program that purely functionally there is nothing wrong with me designing finite state machines out of circuit-like things 16:10:34 computers were designed to allow you to simulate digital cicruits after all 17:01:48 j1 "chip" isn't a chip, it's a verilog description of a forthish processor core... 17:02:46 and an FPGA is going to be, in most cases, way better suited then that green arrays chip 17:03:00 unless you need something that's massively parallel like that 17:03:45 plus, a decent fpga isn't that expensive, you can get a cheap demo board for most of the major FPGA vendors for around $20~30 17:18:07 --- quit: gyxile (Quit: Ex-Chat) 17:26:03 --- join: proteusguy (~proteusgu@37.29.206.147) joined #forth 17:26:03 --- mode: ChanServ set +v proteusguy 17:26:46 --- join: CodeTortoise (~textual@2602:306:37fe:b70:744b:ca97:928c:68c8) joined #forth 17:38:17 --- join: proteusguy_satri (~proteusgu@49.229.157.98) joined #forth 17:39:15 --- quit: proteusguy (Read error: Connection reset by peer) 17:50:46 --- join: fiddlerwoaroof (~fiddlerwo@unaffiliated/fiddlerwoaroof) joined #forth 17:51:16 --- quit: CodeTortoise (Quit: My MacBook has gone to sleep. ZZZzzz…) 17:59:05 --- quit: proteusguy_satri (Ping timeout: 250 seconds) 18:02:12 --- quit: Zarutian (Quit: Zarutian) 18:02:30 I would get a green arrays chip but the dev board is like $480 18:02:58 perhaps a mod to an existing dev board can be made up as a port between the green arrays chip and a regular dev board 18:03:05 which means that an FPGA is much more reasonable :) 18:03:36 I mean am certain a forth on chip is pattened by this Moore fellow 18:03:56 not to mention there are at least a few FPGA chips that are cheaper then it 18:04:20 not saying FPGA would be superior 18:04:24 well I think if people realied what a green arrays chip could do then perhaps they would buy more green arrays chips and then the cost would go down 18:04:33 but it is more flexible 18:04:52 fpga is more flexible but I am noticing flaws in the designs I am seeing 18:05:28 I used to be the most high level programmer you could imagine way up in the clouds and now I am cast down to this low level hell hole 18:06:08 And once you get forth it's not so bad but having the most minimal forth is such an epic quest that I can't refuse it 18:06:25 I mean I've got to get the most tiny thing that I can live with and then build forth in that 18:06:37 then hook it up to some hardware components and see what happens 18:07:20 --- join: proteusguy_satri (~proteusgu@46.222.152.240) joined #forth 18:07:24 My hope is to get a system that assumes infinite ram like krivine and just go out and buy a bunch of old 1 gig ram modules and get maybe two hundred sixty four of them 18:07:38 well that would be excessive but alot of ram 18:07:52 and buy like a million little sd card slot boards and raid the hell out of that shit 18:08:55 There is a technique to reduce iops which is to add ram to each storage nodule so that way if the amount of write doesn't excede what is in the ram then you can delay the write, and you just need a battery to keep the thing goign until there is time to write 18:09:25 that's only for write critical things. You can usually preserve things in a jounraling filesystem like ext4 18:09:57 you do realize infinite ram is, by definition, impossible, right? 18:10:12 yeah but two hundred fifty six gigabytes ram is possible 18:10:24 if you just buy one 1 gb ram chick from the flea market every paycheck 18:10:32 even if you have to rip them out of old routers 18:10:45 you can't just add ram modules forever 18:10:53 load balancer 18:11:00 something like that 18:11:01 you have to build out memory access for them all 18:11:10 yeah I think that can be done 18:11:18 and the more of that kind of crap you do, the slower and slower your ram becomes 18:11:30 well then it's just like a hard disc is 18:11:40 until me sitting with a 512gb SSD is actually faster then your 256gb of ram 18:11:42 you want it close to the front if it's critical and close to the back if it's not 18:12:02 and you can calculate in the system where the tipping point is where it becomes more efficient to store it on ssd and at that point it starts using swap 18:12:55 the other thing is I could just put everything in swap on the sd cards 18:13:02 sd cards are pretty cheap compared to ram chips 18:13:06 very low power 18:13:18 I can put them in arrays using t flip flops 18:13:44 sorry I mean trees 18:14:00 rofl, that'd be hilarious 18:14:18 sd cards are pretty fast compared to the original floppys 18:14:45 perhaps not separating ram and storage would speed things up 18:14:50 Probably make it easier to wire too 18:15:17 It also makes it easier to port a computer over to new hardware 18:16:14 I just need a bus that can in a quick binary sequence find a sd card in the tree and then find a file at an address 18:16:25 something along those lines 18:16:58 so the fpga things "boy I want this bus and this piece of data and then I'll edit the storage" 18:18:38 if the speed gain from merging ram and storage is enough then it would make a difference because you'd go from devices in the 1 gb range to devices maxing 128 gb each, less if you've got raid 18:18:58 --- join: CodeTortoise (~textual@2602:306:37fe:b70:40e6:82a7:5ae4:a0b7) joined #forth 18:21:20 John[Lisbeth]: have you considered the GA144 schmartboard option for something like $35 ? http://www.rs-online.com/designspark/electronics/blog/hands-on-with-a-144-core-processor 18:22:07 ( plus another $5 if you want them to solder the ga144 onto the schmartboard for you) 18:24:24 lol he's using forth on it 18:24:39 looks like a good chip to me 18:26:07 kind of large though 18:26:21 I am hoping for something kind of small with just a few ports 18:26:41 here's a chip I admire: https://www.amazon.com/dp/B004YUIO4G?psc=1 18:26:47 coin size 18:41:02 going back to the earlier question: 18:41:15 typically I write my definitions in a file first and then load it from the gforth command line 18:41:37 rarely if ever do I write a definition by hand from the command line that I intend to use more than once 18:47:49 DocPlatypus: I think in Sean Pringle's "Enth and Flux" Forth the editor and prompt are one and the same. Also in the Plan 9 Acme text editor there's a similar concept. 18:53:39 nerfur: regarding the http and soap libs are you looking for a forth http server or something? 18:54:52 --- join: karswell` (~user@167.49.115.87.dyn.plus.net) joined #forth 18:55:15 --- quit: CodeTortoise (Quit: My MacBook has gone to sleep. ZZZzzz…) 19:00:14 --- quit: proteusguy_satri (Ping timeout: 265 seconds) 19:03:24 nerfur: Here's the hoard of forth books and software that live in two 60sqft storage lockers by my apartment: https://goo.gl/photos/Ca5DnnmJgADbV28q7 https://goo.gl/photos/kEN9WW7oYZmYfyAE9 19:03:45 --- join: proteusguy_satri (~proteusgu@46.222.155.235) joined #forth 19:05:49 --- join: CodeTortoise (~textual@2602:306:37fe:b70:6c88:615f:9ace:12ee) joined #forth 19:08:19 ...and yes, nerfur, I can send you a C64 forth cartridge and other Forth goods in like 1 or 2 weeks from now if you PM me a mailing address. I would only ask that you cover the Media Mail (or other) shipping costs. 19:12:15 --- quit: Saustin (Quit: http://www.kiwiirc.com/ - A hand crafted IRC client) 19:20:00 --- quit: CodeTortoise (Quit: My MacBook has gone to sleep. ZZZzzz…) 19:28:42 --- join: nal1 (~nal@adsl-64-237-237-132.prtc.net) joined #forth 19:31:27 --- quit: nal (Ping timeout: 248 seconds) 21:03:11 --- join: CodeTortoise (~textual@2602:306:37fe:b70:38d0:7e20:c5a:e2dc) joined #forth 21:20:39 --- quit: proteusguy_satri (Ping timeout: 240 seconds) 21:24:37 --- quit: CodeTortoise (Quit: My MacBook has gone to sleep. ZZZzzz…) 21:56:00 mmmm *drools* look at all those books 22:03:21 --- join: CodeTortoise (~textual@2602:306:37fe:b70:a4a8:a7a0:5c8e:c55f) joined #forth 22:15:38 --- quit: CodeTortoise (Quit: My MacBook has gone to sleep. ZZZzzz…) 22:37:15 --- quit: DocPlatypus (Quit: Leaving) 22:42:35 --- join: DocPlatypus (~skquinn@c-73-166-108-48.hsd1.tx.comcast.net) joined #forth 22:45:17 --- quit: nal1 (Quit: WeeChat 1.4) 23:59:59 --- log: ended forth/16.09.17