Topic: rings

topics > Thesa topics > Thesa > ThesaGroup: out-of-date work

collection class
entries into rings


Rings, maps and entries formed the first theoretical basis for Thesa. Rings are the temporal, invisible, irreversible component of a system. Closed rings are repetition while open rings are sequence (selection comes from maps). Rings are that which executes, paths to follow, what maintains control, and what processes files. Rings are made of rings differentiated by boundaries, embedded in contexts, and connected by entries. Under reduction they become maps. Rings provide the semantic, undefinable meaning of a system. (cbb 5/80)
Subtopic: ring data structure up

Quote: a Sketchpad type is a ring of objects under a generic heading; the generic heading defines the type and its subroutines [»suthIE5_1963]
Quote: ring operations to insert, remove, copy, foreach forward/backward; no special cases for empty and one member rings [»suthIE5_1963]
Quote: besides Ross's n-component elements, Sketchpad includes back-pointers stored in a ring; e.g., e.g., ring of line segments that terminate on a point [»suthIE5_1963]
Quote: the Integrated Data Store moves list processing to disk with circular chains of links from master records; maybe basis for information algebra [»bachCW_1964]

Subtopic: rings up

QuoteRef: cbb_1973 ;;7/13/74 at some level have to assume that rings exists
QuoteRef: cbb_1973 ;;4/6/74 from notes get file processor (control points, labeled entries, branch nodes, interrupts, save-restore, symbols, links, conditional skips and reductions (operations, execute to interrupt, lumps, value, replacement equivalence classes, functionals maps, a:1 2 3 a+2
QuoteRef: cbb_1973 ;;6/21/74 both the ring and the location can have properties
QuoteRef: cbb_1973 ;;7/8/74 ring is some path where always have one more step to take
QuoteRef: cbb_1973 ;;7/9/74 rings are made of rings. at any one time there is a way of getting an existing next ring. if the ring has no successor, the ring of rings terminates
QuoteRef: cbb_1973 ;;7/10/74 when a ring terminates control is normally brought back a level. alternative is abnormal return which has a cause
QuoteRef: cbb_1973 ;;7/24/74 a ring terminates when it reaches a boundary
QuoteRef: cbb_1973 ;;7/24/74 rings form boundaries for other rings
QuoteRef: cbb_1973 ;;8/21/74 want rings to give structure
QuoteRef: cbb_1973 ;;9/10/74 it is the ring that is resorted not the entry, the ring needs a name or it is the caller
QuoteRef: cbb_1973 ;;?? do...end for looping ring and begin...end for straight line
QuoteRef: cbb_1973 ;;?? a ring has knowledge of its caller its present position and other entry points
QuoteRef: cbb_1973 ;;?? a ring is entered and provides a path
QuoteRef: cbb_1973 ;;?? what a ring is made up of is not important, eg microcode could call the system
QuoteRef: cbb_1973 ;;?? tasking is dealing the rings as objects, text with maps, action with entries and ideas with objects
QuoteRef: cbb_1973 ;;?? if an element can't be found the ring terminates and a next ring is found
QuoteRef: cbb_1973 ;;?? operations are functionals on rings

Related Topics up

Topic: collection class (11 items)
Topic: entries into rings (6 items)
Topic: maps
(6 items)

Updated barberCB 5/05
Copyright © 2002-2008 by C. Bradford Barber. All rights reserved.
Thesa is a trademark of C. Bradford Barber.