| < Free Open Study > |
|
abbreviations, see also derived forms
parametric type-, 439
Abel, 409
abstract data types, 11, 226, 368–372
parametric, 450–453
partially abstract, 406
vs. objects, 374–377
abstract machine, 32
with store, 160
abstract syntax, 25, 53
tree, 53
abstraction
full, 143
functional, 52
type abstraction and ascription, 123
abstraction principle, 339
abstractions, protecting user-defined, 3, 5, 368–377
activation record, 174
ad-hoc polymorphism, 340
ADT, see abstract data type
Algol-60, 11
Algol-68, 11
Algorithm W (Damas and Milner), 337
algorithmic subtyping, 209–213, 417–436
algorithmic typing, 213–218
aliasing, 155–157
compiler analysis of, 170
allocation of references, 154
allsome implementation, 381–387
alpha-conversion, 71
Amadio-Cardelli algorithm for recursive subtyping, 309–311
Amber, 311
rule, 311, 312
AnnoDomini, 9
annotations
and uniqueness of types, 135, 141
datatype constructors as, 355
implicit, 330–331
antisymmetric relation, 16
applications of type systems, 8–9
arith implementation, 23–49
arithmetic expressions
typed, 91–98
untyped, 23–44
arrays
bounds checking, 7
subtyping, 198–199
arrow types, 99–100
ascription, 121–123, 193, see also casting
and subtyping, 193–196
assembly language, typed, 11
assignment to references, 153, 154
associativity of operators, 53
atomic types, see base types
Automath, 11
automatic storage management, see garbage collection
axiom, 27
axiomatic semantics, 33
| < Free Open Study > |
|