| 
|
QuoteRef: reynJC9_1983
topics >
all references >
ThesaHelp:
references p-r
Group:
data type
Topic:
abstract data type
Topic:
data types in Thesa
Topic:
Thesa data model
Topic:
data type as a set of values
Group:
sets
Topic:
universal data type
Topic:
union data type
Topic:
lattice theory of types
Topic:
abstraction
Group:
mathematics
Topic:
set definition by extension or intension
Topic:
type algebras, typed lambda calculus, and type-complete languages
Reference
Reynolds, J.C., "Types, abstraction and parametric polymorphism", in Mason, R.E.A. (ed.), Information Processing 83, IFIP, Elsevier Science Publishers (North-Holland), September 1983, pp. 513-523. Google
513 ;;Quote: data type is a syntactic discipline for enforcing abstraction levels
513+;;Quote: the complex numbers is an abstraction that is represented by a variety of different sets
513 ;;Quote: if types define subsets of a universal type, then their unions and intersections are well-defined
513+;;Quote: Scott's type theory defines types on a universal set while avoiding Russell's paradox
513+;;Quote: shouldn't there be types sufficiently different that they do not induce union or intersection types?
514 ;;Quote: a type algebra is intrinsically first-order; needs homeomorphisms from functions to relations
ThesaHelp: references p-r (245 items)
Group: data type (34 topics, 723 quotes)
Topic: abstract data type (64 items)
Topic: data types in Thesa (92 items)
Topic: Thesa data model (58 items)
Topic: data type as a set of values (20 items)
Group: sets (7 topics, 148 quotes)
Topic: universal data type (18 items)
Topic: union data type (12 items)
Topic: lattice theory of types (15 items)
Topic: abstraction (62 items)
Group: mathematics (23 topics, 554 quotes)
Topic: set definition by extension or intension (18 items)
Topic: type algebras, typed lambda calculus, and type-complete languages (28 items)