| < Free Open Study > |
|
β-reduction, 56
Barendregt convention, 75
Barendregt cube, 465
base types, 117–118
and subtyping, 200
behavioral equivalence, 64
beta-reduction, 56
big-step operational semantics, 32, 43
binary methods, 375–377
binary operations on abstract data, 375–377
strong vs. weak, 375
binary relation, 15
binder, 55
binding (OCaml datatype of bindings), 85, 113–115
bisimulation, 284
BNF (Backus-Naur form), 24
booleans, 23–44, see also Church encodings
Bot type, 191–193
algorithmic issues, 220
with bounded quantification, 436
bot implementation, 220
bottom-up subexpressions of a recursive type, 304
bound variables, 55, 69–72
bounded meet, 219
bounded quantification, 11, 389–409
and intersection types, 400, 409
existential types, 406–408, 435–436
higher-order, 467–473
joins and meets, 432–435
object encodings, 411–416
typechecking algorithms, 417–436
undecidability, 427–431
with Bot type, 436
bounded type operators, 467, 473
bounds checking, see arrays
boxed values, 201
boxed vs. unboxed argument passing, 341
| < Free Open Study > |
|