02:35 <joe9> I am reading the jonesforth material. Is there a way to get data structures in it?

04:25 <siraben> joe9: you mean defining structs and so on?

04:25 <siraben> joe9: see https://forth-standard.org/standard/facility/BEGIN-STRUCTURE

04:25 <siraben> and https://forth-standard.org/standard/facility/END-STRUCTURE

05:45 <neuro_sys> Forth Challenge, palindromic numbers: https://www.youtube.com/watch?v=BOnqhOrEwxc

07:28 <joe9> siraben, thanks.

07:29 <joe9> siraben, do you know if it would be easy to call C library functions from jonesforth?

07:29 <siraben> joe9: like an FFI? You'd have to figure out the C calling convention and have words to call with certain arities

07:30 <siraben> like CCALL, CCALL1, CCALL2 etc

07:30 <joe9> yes, like ffi.

07:30 <joe9> any suggestions on where I can find any documentation on such ( CCALL, CCALL1, etc.. )?

07:32 <joe9> I could not find anything by searching in the forth standard website for CCALl.

07:38 <joe9> found this paper, http://www.euroforth.org/ef06/ertl06.pdf

10:12 <neuro_sys> Lisp-y Data Abstraction in Forth: https://www.youtube.com/watch?v=zdsh3E_0EDk

10:18 <proteus-guy> neuro_sys, yeah saw this - it's mostly about how he implemented garbage collection, however. Several good talks in this month's SVFig.

12:35 <siraben> joe9: I'd be interested to know as well since that would improve the usefulness of forth

13:08 <veltas> 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

13:09 <veltas> And when you create words you could get it to parse a C prototype or have some forth words to build it

13:09 <veltas> create FFI words I mean

13:09 <veltas> consume/produce right number of things on stack I mean

13:11 <veltas> ffi void *test(int, char *); \ parses up to ;

13:13 <veltas> Or something like C( int char* ) void* ffi test

13:16 <veltas> It would make forth more useful in your average OS environment, letting you integrate with what's there.

13:17 <veltas> 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

14:08 <joe9> veltas, I would be surprised if this has not been done already.

14:39 <joe9> 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..

14:48 <joe9> this is good http://www.forth.org/fd/curley2.html

17:19 <crc> finding palindromic numbers is easy; I'm hoping for something more complex for the next challenge

18:31 <neuro_sys> Yeah, it was still good to see great variety.

18:31 <neuro_sys> 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.

20:21 <MrMobius> 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

20:21 <MrMobius> *most