essentially the first-order predicate calculus superposed upon the simply-typed {polymorphic lamBda-calculus}. PPLamBda is the {oBject language} for LCF. ["Logic and Computation: Interactive Proof with CamBridge LCF", L. Paulson, CamBridge U Press, 1987]. (1995-05-01)