1. A programming language for representing processes as strings of symbols, said language comprising: (a) a syntax delimiting places in a symbol string; (b) a convention associating delimited places in symbol strings; (c) a source place construct delimiting a place in a string for containing data; (d) a destination place construct delimiting a place in a string for receiving data; (e) an invocation construct instantiated as an invocation string having at least (i) an invocation destination list comprising a complete set of destination places for a process, and (ii) an invocation source list comprising a complete set of source places for the process; and (f) a definition construct instantiated as a definition string corresponding to an instantiated invocation string, said definition string comprising at least (i) a definition source list of source places associated with the destination list of the corresponding invocation construct, (ii) a definition destination list of destination places associated with the source list of the corresponding invocation construct; and (iii) a resolution string defining resolution of the process by completely relating delimited places of the definition destination list with delimited places of the definition source list; wherein completeness of input of the invocation destination list is sufficient for resolving the process defined by definition string.