"if–then" meaning in English

{
  "forms": [
    {
      "form": "if–thens",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "if–then (plural if–thens)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "alt_of": [
        {
          "word": "if-then"
        }
      ],
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with 1 entry",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with entries",
          "parents": [],
          "source": "w"
        }
      ],
      "examples": [
        {
          "ref": "2002, Brian Bagnall, Core Lego Mindstorms Programming, Prentice Hall, →ISBN, page 201:",
          "text": "Most people, when they start programming their robot, will think of the program flow as a series of if–thens, which is reminiscent of structured programming (Figure 6–3).",
          "type": "quote"
        },
        {
          "ref": "2008, Selmer Bringsjord, “Declarative/Logic-Based Cognitive Modeling”, in Ron Sun, editor, The Cambridge Handbook of Computational Psychology, Cambridge University Press, →ISBN, part II (Cognitive Modeling Paradigms), page 148:",
          "text": "This rule says that if in a derivation you have an infinite list of if–thens (i.e., formulas of the form φ → ψ) where each consequent (ψ) in each if–then is an element of some infinite set Φ, then you can infer to an if–then whose consequent is the infinite conjunction obtained by conjoining all the elements of Φ.",
          "type": "quote"
        },
        {
          "ref": "2020, Steve Rabin, editor, Game AI Pro 360: Guide to Architecture, CRC Press, →ISBN, page 312:",
          "text": "Tests can be implemented by atomic actions that simply succeed or fail; if–thens can be implemented by composites like Selectors that execute the first nonfailing action, and blocks of code can be implemented by Sequences that execute all their nonfailing actions or Parallel nodes, which allow multiple actions to be executed concurrently (Champandard and Dunstan 2012).",
          "type": "quote"
        }
      ],
      "glosses": [
        "Alternative form of if-then."
      ],
      "id": "en-if–then-en-noun-0MEqF9PL",
      "links": [
        [
          "if-then",
          "if-then#English"
        ]
      ],
      "tags": [
        "alt-of",
        "alternative"
      ]
    }
  ],
  "word": "if–then"
}

{
  "forms": [
    {
      "form": "if–thens",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "if–then (plural if–thens)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "alt_of": [
        {
          "word": "if-then"
        }
      ],
      "categories": [
        "English countable nouns",
        "English entries with incorrect language header",
        "English lemmas",
        "English nouns",
        "English terms with quotations",
        "Pages with 1 entry",
        "Pages with entries"
      ],
      "examples": [
        {
          "ref": "2002, Brian Bagnall, Core Lego Mindstorms Programming, Prentice Hall, →ISBN, page 201:",
          "text": "Most people, when they start programming their robot, will think of the program flow as a series of if–thens, which is reminiscent of structured programming (Figure 6–3).",
          "type": "quote"
        },
        {
          "ref": "2008, Selmer Bringsjord, “Declarative/Logic-Based Cognitive Modeling”, in Ron Sun, editor, The Cambridge Handbook of Computational Psychology, Cambridge University Press, →ISBN, part II (Cognitive Modeling Paradigms), page 148:",
          "text": "This rule says that if in a derivation you have an infinite list of if–thens (i.e., formulas of the form φ → ψ) where each consequent (ψ) in each if–then is an element of some infinite set Φ, then you can infer to an if–then whose consequent is the infinite conjunction obtained by conjoining all the elements of Φ.",
          "type": "quote"
        },
        {
          "ref": "2020, Steve Rabin, editor, Game AI Pro 360: Guide to Architecture, CRC Press, →ISBN, page 312:",
          "text": "Tests can be implemented by atomic actions that simply succeed or fail; if–thens can be implemented by composites like Selectors that execute the first nonfailing action, and blocks of code can be implemented by Sequences that execute all their nonfailing actions or Parallel nodes, which allow multiple actions to be executed concurrently (Champandard and Dunstan 2012).",
          "type": "quote"
        }
      ],
      "glosses": [
        "Alternative form of if-then."
      ],
      "links": [
        [
          "if-then",
          "if-then#English"
        ]
      ],
      "tags": [
        "alt-of",
        "alternative"
      ]
    }
  ],
  "word": "if–then"
}