| 
|
Quote: type-complete language if type for every name, every expression or composite, independent of context, allowable types exist, parameterized expressions
topics >
all references >
references c-d >
Topic:
type algebras, typed lambda calculus, and type-complete languages
Group:
parameters
Topic:
data type as a set of variables
Topic:
primitive data types for Thesa
Quotation Skeleton
We will say a language is type-complete if … and each expression in the language has a … type of a name or expression may not … .2. For each type in the type structure … 3. Any expression can be parameterized with respect … even more complex type. Google-1 Google-2
Copyright clearance needed for quotation.
Additional Titles
Quote: in a type-complete language, type of a name or expression can not depend on context Quote: in a type-complete language, any expression can be parameterized with respect to any free name
Topic: type algebras, typed lambda calculus, and type-complete languages (28 items)
Group: parameters (10 topics, 145 quotes)
Topic: data type as a set of variables (11 items)
Topic: primitive data types for Thesa (82 items)