“Black Intelligence Test of Cultural Homogeneity (BITCH) and Wechsler Adult Intelligence Scale (WAIS) Scores of Black and White Police Applicants”, Joseph D. Matarazzo, Arthur N. Wiens1977 ()⁠:

The 100-item Black Intelligence Test of Cultural Homogeneity (BITCH) and the full Wechsler Adult Intelligence Scale (WAIS) were administered to 17 black (6 female and 11 male) and 66 white (16 female and 50 male) police applicants. The mean age of subjects of the 4 samples was in the early 20s, and mean education level was 2.5 years of college.

The results revealed considerable overlap in the distributions of individual WAIS Full Scale IQ between the black and white subjects, but two totally non-overlapping distributions of scores on the BITCH, with not a single white female or male scoring above a single black male or female. The BITCH means were as follows: white females, 60.9; white males, 64.1; black females, 86.7; and black males, 83.9. The corresponding WAIS Full Scale IQ means were 117.2, 117.8, 110.2, and 101.6, respectively. Correlational analyses between the BITCH and each of the 14 WAIS measures revealed no relation between score on the BITCH and score on the WAIS.

This lack of concurrent validity for the present form of the BITCH and its lack of adequate ceiling for black applicants presents problems for its use in a program of police selection

/doc/cs/haskell/2004-turner-2.pdf Total Functional Programming David A. Turner 2004-07-28 10.3217/jucs-010-07-0751

The driving idea of functional programming is to make programming more closely related to mathematics. A program in a functional language such as Haskell or Miranda consists of equations which are both computation rules and a basis for simple algebraic reasoning about the functions and data structures they define.

The existing model of functional programming, although elegant and powerful, is compromised to a greater extent than is commonly recognised by the presence of partial functions. We consider a simple discipline of total functional programming designed to exclude the possibility of non-termination. [eg. Dhall for safe config file formats, or Idris which includes termination analysis]

Among other things [like primitive recursion] this requires a type distinction between data, which is finite, and codata, which is potentially infinite.