Group:
Thesa programming system
Topic:
data as a named set of data objects
Topic:
flag computer
Topic:
hypertext nodes made of names
Topic:
naming by pointing or recognition
Topic:
pointers to data
Topic:
Thesa data model
Topic:
threaded code
Topic:
Turing machine
Topic:
uniform reference to data
Topic:
universal data type
Topic:
what is a computer
| |
Summary
A pointer machine consists of get, set, and test pointer instructions on objects of pointers. It is a universal model for computing. Related systems are flag computers and Subtext. (cbb 11/07)
Subtopic: links as program 
| Quote: a reference to a structure is a constant, its value; a reference to a reference is a variable, resolved to a constant [»edwaJ10_2005]
| | Quote: represent a program as a tree of structure and reference nodes; a reference points to a node (its value); leaves are empty structures (atomic values); nodes have a descriptive label, e.g., "3256" for an atomic value [»edwaJ10_2005]
| | Quote: Subtext has a single kind of data flow -- a graph of structure and reference nodes
| | Quote: in Subtext, explicit links are primary; every label could be 'foo'; links are immediately-bound; stored in a database while editing [»edwaJ10_2005]
| | Quote: traditional programming requires the constant invention of unique names just to create structure
|
Subtopic: object as pointers to objects
| Note: an object is a sequence of pointers to objects; an object can have a name and use names to refer to objects; an object can point to its type [»cbb_1990, OK]
|
Subtopic: pointer machine
| Note: a procedure is a parameterized sequence of rules; assignment and test statements [»cbb_1990, OK]
| | Note: only need get, set, and test pointer [»cbb_1990, OK]
| | Note: pointer machines will work; end up with a convoluted memory structure equivalent to the textual representation; found my primitives [»cbb_1990, OK]
|
Subtopic: named pointer
| Note: named pointers provide a strongly typed model for computing [»cbb_1990, OK]
|
Subtopic: null pointer
| Note: should access to a None object always create one? [»cbb_1990, OK]
| | Note: auto creation of objects on Null access runs out of space like running out of time [»cbb_2000, OK]
|
Subtopic: universal machine
| Note: first run of universal pointer machine [»cbb_2000, OK]
|
Subtopic: link representation
| Quote: represent a link with a compass widget; on visit, the indicator tick extends to the link's source; need mouse to appreciate the dynamic display of reference [»edwaJ10_2005]
|
Subtopic: returned object
| Quote: an object escapes a method if it is returned or assigned to a field [»gayD3_2000]
| | Note: call by copying parameters at initiation and termination; copy as needed [»cbb_1990, OK]
|
Subtopic: flag computer
Quote: in a flag computer, pointers would be flags that are pinned to other flags; move together
[»hehnEC_1977a]
|
Related Topics
Group: Thesa programming system (11 topics, 561 quotes)
Topic: data as a named set of data objects (22 items)
Topic: flag computer (2 items)
Topic: hypertext nodes made of names (13 items)
Topic: naming by pointing or recognition (13 items)
Topic: pointers to data (55 items)
Topic: Thesa data model (58 items)
Topic: threaded code (18 items)
Topic: Turing machine (30 items)
Topic: uniform reference to data (34 items)
Topic: universal data type (18 items)
Topic: what is a computer
(62 items)
|
