ThesaHelp: ACM references ae
ThesaHelp: references ab
Topic: type algebras, typed lambda calculus, and typecomplete languages
Group: data type
Topic: persistent data structure
Topic: object code linkers and loaders
Topic: arrays
Topic: weak vs. strong type checking
Topic: selfidentifying data structures
Topic: procedures as data
Topic: notation for declarations
Topic: initialized constants
 
Reference
Atkinson, M.P., Buneman, O.P.,
"Types and persistence in database programming languages",
ACM Computing Surveys, 19, 2, June 1987, pp. 105190.
Google
Other Reference
QuoteRef: buneP5_1986
Quotations
107 ;;Quote: type completenessall data types enjoy equal status; e.g., Pascal functions cannot return arrays or functions
 109 ;;Quote: a value's persistence should be independent of its type
 109+;;Quote: a persistent value should always have the same type
 110 ;;Quote: use persistent functions for program linking
 179 ;;Quote: APL's arrays impose a uniform type; e.g., the type of A and B in A+B is array of real or array of integer; not true in LISP
 179 ;;Quote: programs and procedures should be values with a type that may persist
 179 ;;Quote: need notation for singleassignment variables

Related Topics
ThesaHelp: ACM references ae (259 items)
ThesaHelp: references ab (396 items)
Topic: type algebras, typed lambda calculus, and typecomplete languages (28 items)
Group: data type (34 topics, 730 quotes)
Topic: persistent data structure (37 items)
Topic: object code linkers and loaders (31 items)
Topic: arrays (58 items)
Topic: weak vs. strong type checking (42 items)
Topic: selfidentifying data structures (18 items)
Topic: procedures as data (22 items)
Topic: notation for declarations (20 items)
Topic: initialized constants (12 items)
