ThesaHelp:  ACM references m-z
 ThesaHelp:  references sa-sz
 Topic:  dangling pointers
 Topic:  memory management by garbage collection
 Topic:  implementation of Thesa data objects
 Topic:  safe use of pointers
 Topic:  using pointers in Thesa
 Topic:  primitive data types for Thesa
 Topic:  replicated data
 Topic:  ref_any or Object data type
 Topic:  type reflection and introspection
 Topic:  Thesa's user interface
 Topic:  object-oriented packages
 Topic:  event loop for a user interface
 Topic:  event controlled processing
 Topic:  asynchronous processing
 Topic:  access by pattern matching
 Group:  Thesa programming system
 Topic:  user-centered operating system
 Topic:  namespace
 Topic:  owned resources and data objects
 Topic:  persistent data structure
 Topic:  primitive data types of a language
 Topic:  immutable files and data
 Topic:  initialized constants
 Topic:  non-primitive values
 Topic:  procedure valued variables
 Topic:  data types in Thesa
 Topic:  software maintenance by patching
 Topic:  Thesa compiler and loader
 Topic:  import/export lists for defining an interface
 Topic:  decomposition of a system into levels
 Topic:  dependency analysis
 |  | 
Reference
 Swinehart, D.C.,  Zellweger, P.T.,  Hagmann, R.B.,
"The structure of Cedar",
 SIGPLAN,  20,  7, pp.  230-244,  July 1985.
Google
 
 Other Reference
Swinehart, D.C., Zellweger, P.T., Beach, R.J., Hagmann R.B. "A  structural view of the Cedar Programming Environment," ACM Transactions on Programming Languages and Systems, Vol 8 No 4 p 419-490, October 1986 
  
Quotations
231 ;;Quote: with explicit storage allocation, programmer must avoid dangling references and storage leaks 
 |  231 ;;Quote: invalid pointers with explicit storage allocation from not initializing, bad arithmetic, type coercions 
 |  231+;;Quote: replacement through invalid pointers can cause difficult-to-resolve overwrites 
 |  232 ;;Quote: Cedar's safe pointers ensure integrity of system data structures and code 
 |  232 ;;Quote: Cedar reference variables can be freely replicated and discarded due to garbage collection 
 |  232+;;Quote: Cedar initializes reference variables to nil; has new operator and garbage collection 
 |  232+;;Quote: Cedar reference variable contains address of collectible, single typed, data object; called a REF 
 |  232 ;;Quote: a Cedar REF ANY variable requires runtime type verification before access or modification 
 |  232+;;Quote: runtime type verification by predicate ISTYPE, assertion NARROW, or SELECT of type cases 
 |  235 ;;Quote: Cedar's Inscript package delivers time-stamped, input events; reduces missed and out-of-order events 
 |  236 ;;Quote: a Cedar TIP table defines procedures for input events or event sequences 
 |  236 ;;Quote: Cedar user interface by a notifier that initiates asynchronous procedures that match input events in a TIP table 
 |  238 ;;Quote: the distinction between application and system is arbitrary in Cedar 
 |  240 ;;Quote: without garbage collection, objects must be owned; who releases a string that is queued for printing? 
 |  240 ;;Quote: a Cedar rope is an immutable, garbage-collected, text string; widely used in all system levels 
 |  240 ;;Quote: garbage collection increases flexibility of argument passing to procedure parameters and variables 
 |  240+;;Quote: a call-back procedure is a procedure parameter in Cedar 
 |  240+;;Quote: a registered procedure is a procedure-valued variable in Cedar 
 |  243 ;;Quote: Cedar system development by overloading a new module with the same interface; periodically rebuild to remove old versions 
 |  243+;;Quote: if a module changes its exported interface, can hide it in a configuration that exports the old interface 
 |  243 ;;Quote: Cedar uses system layering to reduce compilation dependencies and increase use of system components 
 |  243 ;;Quote: Cedar's safe storage improves system structure, convenience, and reliability 
 |  | 243+;;Quote: Cedar's safe storage by incremental garbage collection, runtime type discrimination, generic reference, and symbolic access
 |    
 
Related Topics  
 ThesaHelp: ACM references m-z (280 items)
 ThesaHelp: references sa-sz (237 items)
 Topic: dangling pointers (13 items)
 Topic: memory management by garbage collection (113 items)
 Topic: implementation of Thesa data objects (27 items)
 Topic: safe use of pointers (102 items)
 Topic: using pointers in Thesa (49 items)
 Topic: primitive data types for Thesa (82 items)
 Topic: replicated data (45 items)
 Topic: ref_any or Object data type (9 items)
 Topic: type reflection and introspection (28 items)
 Topic: Thesa's user interface (8 items)
 Topic: object-oriented packages (6 items)
 Topic: event loop for a user interface (11 items)
 Topic: event controlled processing (46 items)
 Topic: asynchronous processing (30 items)
 Topic: access by pattern matching (18 items)
 Group: Thesa programming system   (11 topics, 561 quotes)
 Topic: user-centered operating system (24 items)
 Topic: namespace (19 items)
 Topic: owned resources and data objects (12 items)
 Topic: persistent data structure (37 items)
 Topic: primitive data types of a language (31 items)
 Topic: immutable files and data (57 items)
 Topic: initialized constants (12 items)
 Topic: non-primitive values (11 items)
 Topic: procedure valued variables (34 items)
 Topic: data types in Thesa (92 items)
 Topic: software maintenance by patching (26 items)
 Topic: Thesa compiler and loader (23 items)
 Topic: import/export lists for defining an interface (20 items)
 Topic: decomposition of a system into levels (49 items)
 Topic: dependency analysis (31 items)
 
 |