00:00:00 --- log: started forth/20.12.20 00:11:35 --- join: proteus-guy joined #forth 02:12:39 Lisp-y Data Abstraction in Forth: https://www.youtube.com/watch?v=zdsh3E_0EDk 02:18:46 neuro_sys, yeah saw this - it's mostly about how he implemented garbage collection, however. Several good talks in this month's SVFig. 02:51:24 --- quit: _whitelogger (Remote host closed the connection) 02:54:20 --- join: _whitelogger joined #forth 02:58:33 --- join: dave0 joined #forth 04:24:53 --- quit: wineroots (Remote host closed the connection) 04:36:05 joe9: I'd be interested to know as well since that would improve the usefulness of forth 05:09:17 I think if I had a C abstraction for forth I would make it so you can create words for the functions you want to use, that consume/produce the right number of words for that function 05:09:38 And when you create words you could get it to parse a C prototype or have some forth words to build it 05:09:45 create FFI words I mean 05:10:08 consume/produce right number of things on stack I mean 05:12:13 ffi void *test(int, char *); \ parses up to ; 05:13:23 Or something like C( int char* ) void* ffi test 05:16:34 It would make forth more useful in your average OS environment, letting you integrate with what's there. 05:17:57 The 'right way' is probably to dig into the ABI docs and figure out what the minimum you need to reliably hook into functions is, and avoid trying to replicate the entire C type system 06:08:52 veltas, I would be surprised if this has not been done already. 06:11:59 --- quit: jsoft (Ping timeout: 260 seconds) 06:36:04 --- quit: proteus-guy (Remote host closed the connection) 06:40:00 is anyone aware of any simple samples to test and play around with indirect threaded code vs call threaded code? some simple working implementations to play around with.. 06:41:03 --- quit: yyyyyy (Remote host closed the connection) 06:41:15 --- join: Gromboli joined #forth 06:48:38 this is good http://www.forth.org/fd/curley2.html 07:10:33 --- join: proteus-guy joined #forth 07:11:28 --- quit: dave0 (Quit: dave's not here) 07:41:47 --- join: xek joined #forth 09:20:00 finding palindromic numbers is easy; I'm hoping for something more complex for the next challenge 10:07:25 --- join: X-Scale` joined #forth 10:08:32 --- quit: X-Scale (Ping timeout: 246 seconds) 10:08:33 --- nick: X-Scale` -> X-Scale 10:31:37 Yeah, it was still good to see great variety. 10:32:06 I actually like different approaches, and how it's valid to create a "DSL" to solve things. Like that Lisp-y guy, and APL guy. 10:33:21 --- join: sts-q joined #forth 11:08:44 --- quit: gravicappa (Ping timeout: 265 seconds) 11:09:28 --- join: gravicappa joined #forth 12:21:38 they had a really simple problem to solve for the programming competiton last year at the hp calculator conference, so points went to efficient solution rather than just solving 12:22:08 *most 13:13:26 --- quit: gravicappa (Ping timeout: 265 seconds) 13:27:17 --- join: Gromboli_ joined #forth 13:30:39 --- quit: Gromboli (Ping timeout: 260 seconds) 14:52:47 --- quit: Gromboli_ (Ping timeout: 264 seconds) 15:08:29 --- quit: xek (Ping timeout: 246 seconds) 15:11:32 --- join: Gromboli joined #forth 15:12:49 --- quit: Gromboli (Client Quit) 15:14:57 --- join: Gromboli joined #forth 15:43:21 --- nick: tabemann_ -> tabemann 16:08:08 the palindrome problem didn't have anything regarding efficiency; the problem description was "Program a generator or a filter to find all palindromic integers from 1 (yes, it is) to 99999." 16:18:18 http://forth.works/examples/palindromic-numbers.retro.html has two solutions in retro; one using a filter (using 101k memory locations), the other just displaying values as they are generated by a loop (using 74 memory locations) 16:47:14 --- quit: crc (Ping timeout: 260 seconds) 16:47:35 --- join: crc joined #forth 16:48:04 --- mode: ChanServ set +v crc 16:58:01 --- quit: sts-q (*.net *.split) 16:58:01 --- quit: rpcope (*.net *.split) 16:58:01 --- quit: APic (*.net *.split) 17:13:06 --- quit: Lord_Nightmare (Quit: ZNC - http://znc.in) 17:15:12 Is anyone still doing AoC in Forth? 17:17:42 --- join: Lord_Nightmare joined #forth 17:18:15 --- join: sts-q joined #forth 17:18:16 --- join: rpcope joined #forth 17:18:16 --- join: APic joined #forth 17:21:30 --- join: yyyyyy joined #forth 17:35:00 --- join: dave0 joined #forth 18:12:30 siraben: I stopped after 6a, but might go back and do a few more 18:13:11 crc: cool, day 18 and 19 would be interesting to do in Forth since they involve parsing 18:27:30 --- quit: sts-q (Remote host closed the connection) 18:31:50 the first part of 18 looks like it'd be pretty straightforward 18:54:58 --- join: boru` joined #forth 18:55:01 --- quit: boru (Disconnected by services) 18:55:03 --- nick: boru` -> boru 19:00:18 Does anyone have good resources on parallel processing in Forth? I have found some papers from the 90s but not much else. I have been modifying pForth to do shared memory parallelism, but I am curious what the other approaches have been tried. 19:22:01 --- join: Gromboli_ joined #forth 19:24:58 --- quit: Gromboli (Ping timeout: 240 seconds) 19:27:27 --- quit: ornxka (Ping timeout: 240 seconds) 19:37:26 --- quit: proteus-guy (Remote host closed the connection) 19:38:36 --- join: proteus-guy joined #forth 19:44:01 --- quit: dave0 (Quit: dave's not here) 19:57:13 --- join: ornxka joined #forth 20:04:47 --- quit: Gromboli_ (Quit: Leaving) 21:01:00 --- join: gravicappa joined #forth 21:39:49 --- join: sts-q joined #forth 22:30:48 --- join: hosewiejacke joined #forth 22:57:25 --- quit: _whitelogger (Remote host closed the connection) 23:00:20 --- join: _whitelogger joined #forth 23:27:24 --- quit: _whitelogger (Remote host closed the connection) 23:30:20 --- join: _whitelogger joined #forth 23:51:25 --- quit: _whitelogger (Remote host closed the connection) 23:54:20 --- join: _whitelogger joined #forth 23:59:59 --- log: ended forth/20.12.20