Theme One Program • Discussion 10

Re: Mathstodon • Seamus Bradley

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.

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 —


cc: Conceptual GraphsCyberneticsStructural ModelingSystems Science
cc: FB | Theme One ProgramMathstodonLaws of FormOntolog Forum
cc: W3 | RDF Surfaces

This entry was posted in Algorithms, Animata, Artificial Intelligence, Boolean Functions, C.S. Peirce, Cactus Graphs, Cognition, Computation, Constraint Satisfaction Problems, Data Structures, Differential Logic, Equational Inference, Formal Languages, Graph Theory, Inquiry Driven Systems, Laws of Form, Learning Theory, Logic, Logical Graphs, Mathematics, Minimal Negation Operators, Painted Cacti, Peirce, Propositional Calculus, Semiotics, Spencer Brown, Visualization and tagged , , , , , , , , , , , , , , , , , , , , , , , , , , . Bookmark the permalink.

1 Response to Theme One Program • Discussion 10

  1. Pingback: Survey of Theme One Program • 5 | Inquiry Into Inquiry

Leave a Reply

Fill in your details below or click an icon to log in: Logo

You are commenting using your account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s

This site uses Akismet to reduce spam. Learn how your comment data is processed.