Reynolds abstraction theorem

Target entity: Reynolds abstraction theorem
Context triple: [John C. Reynolds, knownFor, Reynolds abstraction theorem]

• A. Blum axioms
  Blum axioms are a set of formal conditions introduced by Manuel Blum that rigorously define what constitutes a valid complexity measure in computational complexity theory.
• B. Böhm–Jacopini theorem
  The Böhm–Jacopini theorem is a foundational result in computer science stating that any computer program can be written using only sequence, selection, and iteration constructs, without requiring goto statements.
• C. Szekeres–Lindström theorem
  The Szekeres–Lindström theorem is a result in combinatorics that characterizes the maximum size of intersecting families of subsets, serving as a precursor to and special case of the Erdős–Ko–Rado theorem.
• D. Łoś–Tarski preservation theorem
  The Łoś–Tarski preservation theorem is a fundamental result in model theory that characterizes when a first-order sentence is preserved under substructures in terms of its equivalence to a universal sentence.
• E. Atkinson theorem
  Atkinson theorem is a fundamental result in functional analysis that characterizes Fredholm operators as precisely those bounded linear operators that are invertible modulo compact operators.
• F. None of above. chosen
• G. Unsure - the case is ambiguous/there is not enough information to decide.

Target entity: Reynolds abstraction theorem
Target entity description: The Reynolds abstraction theorem is a foundational result in type theory and programming language semantics that formally characterizes parametric polymorphism and explains why polymorphic functions behave uniformly across all their type instantiations.

• A. Blum axioms
  Blum axioms are a set of formal conditions introduced by Manuel Blum that rigorously define what constitutes a valid complexity measure in computational complexity theory.
• B. Böhm–Jacopini theorem
  The Böhm–Jacopini theorem is a foundational result in computer science stating that any computer program can be written using only sequence, selection, and iteration constructs, without requiring goto statements.
• C. Szekeres–Lindström theorem
  The Szekeres–Lindström theorem is a result in combinatorics that characterizes the maximum size of intersecting families of subsets, serving as a precursor to and special case of the Erdős–Ko–Rado theorem.
• D. Łoś–Tarski preservation theorem
  The Łoś–Tarski preservation theorem is a fundamental result in model theory that characterizes when a first-order sentence is preserved under substructures in terms of its equivalence to a universal sentence.
• E. Atkinson theorem
  Atkinson theorem is a fundamental result in functional analysis that characterizes Fredholm operators as precisely those bounded linear operators that are invertible modulo compact operators.
• F. None of above. chosen