| 
|
QuoteRef: demeA_1980
topics >
all references >
ThesaHelp:
ACM references a-e
ThesaHelp:
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
Topic:
data types in Thesa
Group:
type declaration
Reference
Demers, A., Donahue, J., "Type-Completeness: as a language principle ", Conference Record, ACM Symposium, Principles of Programming Languages , 7, pp. 234-244 , l980 . Google
235 ;;Quote: type-complete language if type for every name, every expression or composite, independent of context, allowable types exist, parameterized expressions
235+;;Quote: in a type-complete language, any expression can be parameterized with respect to any free name
235+;;Quote: in a type-complete language, type of a name or expression can not depend on context
235 ;;Quote: simplest type-complete language is the typed lambda calculus
236 ;;Quote: in a type-complete language, parameterization and application are universally applicable
236 ;;Quote: with type-completeness, any name that can be declared can also be a parameter
236+;;Quote: with type-completeness, can define declaration in terms of parameter/argument bindings
ThesaHelp: ACM references a-e (259 items)
ThesaHelp: references c-d (337 items)
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)
Topic: data types in Thesa (92 items)
Group: type declaration (5 topics, 107 quotes)