- From: Jon Awbrey <jawbrey@att.net>
- Date: Mon, 17 Apr 2023 11:20:04 -0400
- To: Cybernetic Communications <cybcom@googlegroups.com>, Laws of Form <lawsofform@groups.io>, Ontolog Forum <ontolog-forum@googlegroups.com>, Structural Modeling <structural-modeling@googlegroups.com>, SysSciWG <syssciwg@googlegroups.com>, "RDF Surfaces (Public)" <public-rdfsurfaces@w3.org>, RDF Surfaces <rdf-surfaces@googlegroups.com>
Cf: Theme One Program • Discussion 10 https://inquiryintoinquiry.com/2023/04/17/theme-one-program-discussion-10/ Re: Mathstodon • Seamus Bradley ::: https://mathstodon.xyz/@Scmbradley/110198310724722597 <QUOTE SB:> I thought of a programming language where every function can only return one type: the return type. The return type is just a wrapper around a struct that contains the actual return value, but also a reference to the called function and arguments, and possibly an error code. </QUOTE> My flashback — Way back in the last millennium I started work on a programming style I called an “idea processor”, where an “idea” is a pointer to a “form” and a form is a minimal type of record containing 1 character, 1 number, and 4 more ideas. I implemented a functional style where all the main functions are transformations of one or more ideas to a return idea. The principal data type is an “idea-form flag” which serves a role analogous to a “cons cell” in Lisp. Here's one entry point — Theme One Program • Exposition 1 • https://inquiryintoinquiry.com/2022/06/15/theme-one-program-exposition-1-2/ Regards, Jon ( https://mathstodon.xyz/@Inquiry )
Received on Monday, 17 April 2023 15:20:18 UTC