09:39:55 From John T. Draper : What does the vertical bar mean? 09:41:05 From James Newton : It sets a flag telling the system to make the next word use the header system (someone will correct me if I'm wrong) 09:41:47 From John T. Draper : Ahhh ok 09:44:24 From John T. Draper : Does the $ symbol mean some monetary value, if not, what’s its meaning 09:45:10 From kc5tja : $ is typically a prefix for hexadecimal numbers. $20 == 020H (Intel syntax) == 0x20 (C syntax) 09:45:47 From John T. Draper : Ahh ya, now I remember 09:48:58 From James Newton : How do you decide / track which words to make temporary and which should be non-temporary? Is there an automated way to say "I will never need to find this word again from now on, so go ahead and kill it"? Or do you do that manually? 09:52:17 From James Newton : Did you write code to explore intermodule depenancies or was that again done manually? 09:54:20 From James Newton : Of course, this wouldn't help on the C64, but I guess the modern approach to this problem is virtual memory and swapping blocks out to hard drive, etc... ? 09:56:35 From Christopher Lozinski : I am so used to Gigabytes of memory. I am so fascinated by these tiny memory requirements. What motivates you to work so hard to minimize relatively inexpensive memory? 09:56:58 From Christopher Lozinski : I am just having a huge cognitive dissonance. 10:06:25 From James Newton : Plan 9! So cool! 10:06:58 From James Newton : https://en.wikipedia.org/wiki/Plan_9_from_Bell_Labs 10:07:19 From James Newton : Hard to hear... 10:08:45 From James Newton : If Unix and ROS had a baby... 10:10:12 From James Newton : https://en.wikipedia.org/wiki/9P_(protocol) 10:12:21 From Kevin Appert to Brad Nelson(Direct Message) : Are you prepared to show Leon's video? 10:15:29 From Brad Nelson to Kevin Appert(Direct Message) : let me get ready 10:16:48 From Philip Zembrod : Christopher, about your question what motivates me to work under such tight memory constraints: It's really the fun of working with 8-bit machines, which just have 64 kB address space. And I guess the fun with these machines is their simplicity, and that you can almost know every byte by name 10:17:33 From James Newton : sudo let me mess up my own process. 10:17:34 From Brad Nelson to Kevin Appert(Direct Message) : ready w/ that 10:17:36 From Christopher Lozinski : Great answer. You can know what is going on. 10:20:37 From Philip Zembrod : Yes, exactly. 10:28:28 From James Newton : You said you were going to connect to a CP/M machine? As in the CP/M OS? I'm wondering about uses for this. Could you expose debug data for BoardForth? Or other things that are being developed? 10:30:08 From John Helmers : https://en.wikipedia.org/wiki/9P_(protocol) 10:31:38 From kc5tja : https://hackaday.io/project/170581-vdc-ii 10:36:08 From kc5tja : The above link is for my VDC-II project, for which I built an FPGA development board called the BX-Plorer for. (This same Hackaday project tracks both aspects of the project.) 10:36:50 From James Newton : To summarize the answer I heard to the question I asked for the chat record: The BoardForth system is being developed as part of an IO extension on a Z80 SBC, and in order to communicate with the board over limited IO, a protocol was needed and 9P was chosen. 10:37:31 From kc5tja : Correct. 10:52:02 From kc5tja : I gotta drop the call and head out. I look forward to seeing the remaining sessions on video! Thanks everyone! 11:04:31 From Dwight : forth based simulator GitHub.com/prog4004/I4004-projects/tree/master/maneuver from Dwight 11:08:12 From James Newton : "preserve n" seems like it should be "preserve TOS"? 11:08:45 From James Newton : e.g. the top of stack is preserved between "OF" clauses when the OF value does not match. 11:16:14 From James Newton : Sorry, I wasn't clear on why we need the extra drop after the "of" in the string comparison? ==s is leaving something on the stack we don't want? 11:16:53 From Bob Armstrong : With lists of lists , would handle many of these cased as a `( key value )` lookup , ' v@ . 11:19:32 From John Helmers : Bill Ragsdales links - 11:19:34 From John Helmers : • https://github.com/BillRagsdale/Forth_Projects• https://github.com/BillRagsdale/WIN32 Forth-Guide 11:20:53 From Bob Armstrong : One important thing I see the lists-of-lists ` object style does is factoring I/o from computation . 11:37:33 From James Newton : I think this is the link? https://github.com/hcchengithub/jeforth.3we 11:38:26 From James Newton : The first couple of demos on the page fail in my browser, but the arrows one works. 11:43:41 From Dave Jaffe to Brad Nelson(Direct Message) : try "use computer audio" 11:46:23 From Brad Nelson to Dave Jaffe(Direct Message) : oh was the audio not heard? 11:46:57 From Chen-hanson Ting : karaoke.zip https://drive.google.com/file/d/15ewqcVpsMbQQS1JEeiWwlJPrP-wAeZc2/view?usp=sharing, globe.zip https://drive.google.com/file/d/1Jlz5IXt4J0YSk2PAJrX-IVATE7fDoiH3/view?usp=sharing, jeforth613.zip https://drive.google.com/file/d/1Ku-0xIlWxu8JnmmhKZr2q_EaeXaVajSQ/view?usp=sharing, mandel.zip https://drive.google.com/file/d/1cArZucwdKDGqJ6wB1_TVqkk6xn2CDL1H/view?usp=sharing, jeforth623 https://drive.google.com/file/d/1mjCthTlslIkCCAyt8vuQKqiQX4LgySix/view?usp=sharing 11:47:50 From Brad Nelson : Was the audio ok on the video? 11:48:16 From Philip Zembrod : Audo was good 11:48:48 From Fire Tablet to Brad Nelson(Direct Message) : Audio was okay. 11:50:00 From John Helmers : Thanks everyone that presented! Good job to all. 11:50:07 From Brad Nelson to Fire Tablet(Direct Message) : Thanks presenters!