1.1--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
     1.2+++ b/ulang.org	Wed Nov 01 21:32:38 2023 -0400
     1.3@@ -0,0 +1,53 @@
     1.4+#+TITLE: ulang
     1.5+
     1.6+This document defines a *U-Language* as described by the late great
     1.7+Haskell Curry:
     1.8+
     1.9+#+begin_quote
    1.10+Every investigation, including the present one, has to be communicated
    1.11+from one person to another by means of language. It is expedient to
    1.12+begin our study by calling attention to this obvious fact, by giving a
    1.13+name to the language being used, and by being explicit about a few of
    1.14+its features. We shall call the language being used the
    1.15+U-Language. [...] There would be no point in calling attention to it,
    1.16+if it were not for the fact that language is more intimately related
    1.17+to our job than of most others.
    1.18+#+end_quote
    1.19+
    1.20+There is a natural reader/writer relationship that exists in countless
    1.21+places, but is rarely examined because it is rarely necessary. However
    1.22+there is a wide array of significantly complex code and prose projects
    1.23+out there which would benefit greatly from such an investigation.
    1.24+
    1.25+I would also like to humbly clarify on our interpretation of a *job*
    1.26+as Curry puts it. We all have the same job really - to be curious, and
    1.27+to solve problems. It is the *problems* I would like to shine a light
    1.28+on, if just for a moment, because it's important. Just as Curry thinks
    1.29+of languages, we can think of problems. There exists the *problem of
    1.30+problems* which is the subject of our investigations. This *U-Problem*
    1.31+is what we are solving for at all times. In this light, we can view
    1.32+the *U-Language* as a means of bringing both the /reader/ and /writer/
    1.33+as close as possible to the *U-Problem*.
    1.34+
    1.35+For convenience, our *U-Problem* is undecidable, but we model and
    1.36+solve for it using /computers/, or more abstractly machines. Thus, our
    1.37+*U-Language* helps bring the /reader/ and /writer/ closer to
    1.38+our /machines/ as well as expedite communications.
    1.39+
    1.40+- /Why do we need a U-Language?/ ::
    1.41+  To bring both the /reader/ and /writer/ closer to our *U-Problem*.
    1.42+- /What is our U-Problem?/ :: 
    1.43+  Undecidable, but we use /computers/ as a model of the
    1.44+  *U-Problem*.
    1.45+- /How do we solve our U-Problem?/ ::
    1.46+  With /computers/, by developing accurate models and finding optimal
    1.47+  solutions.
    1.48+
    1.49+* Key Words
    1.50+* Abbrevs
    1.51+* Conditionals
    1.52+* Operators
    1.53+* Expressions
    1.54+* Links
    1.55+* Timestamps
    1.56+* Macros