| < Free Open Study > |
|
F, see System F
Fω, see System Fω
, see System
F<:, see System F<:
F-bounded quantification, 393, 408
F-closed set, 282
F-consistent set, 282
F1, F2, F3, etc., 461
factorial, 52
fail, 16
failure vs. undefinedness, 16
families (of terms, types), 462
Featherweight Java, 247–264
fields, see instance variables; records
finalizers, 515
finding type errors, 545
finite tree type, 285
finite-state generating function, 294
first-class polymorphism, 340
fixed point, 142–145
combinator, 65
of a generating function, 282
theorem (Tarski-Knaster), 283
typing, using recursive types, 273
FJ, see Featherweight Java
flattened data structures, 341
Float type, 117
fold function, 63
fomsub implementation, 467–473
formal methods, lightweight, 1
Forsythe, 11, 199
Fortran, 8, 11
fragments of System F, 358–359
fragments of System Fω, 461
free variable, 55, 69
fresh variable, 120
full abstraction, 143
full beta-reduction, 56
full F<:, 391
fullequirec implementation, 267–280
fullerror implementation, 171–178
fullfomsub implementation, 389–409, 467–473
fullfsub implementation, 389–409, 417–436
fullfsubref implementation, 411–416
fullisorec implementation, 275–278
fullomega implementation, 439–466
fullpoly implementation, 339–379
fullrecon implementation, 317–338
fullref implementation, 153–170, 225–245
fullsimple implementation, 99–111, 117–146
fullsub implementation, 181–208
fulluntyped implementation, 51–73
fullupdate implementation, 475–489
<fun>, 118
function types, 99–100
functional languages, mostly, 153
functions, 16
higher-order, 58
multi-argument, 58
on types, see type operators
Funnel, 409
FX, 11
| < Free Open Study > |
|