• Crazazy [hey hi! :D]@feddit.nl
    link
    fedilink
    English
    arrow-up
    1
    ·
    edit-2
    11 hours ago

    Oh yeah was a bit sleepy and thought you could just put arbitrary expressions in the numerator instead of just the type.

    But consider this: heterogeneous propositional equality type of types x and b under equivalence relation a, which is bound somewhere else in the aether that we can’t see in the screenshot

    Constructors of this equality type? No fucking clue but I’m sure there exist some to make the need for an equivalence relation make sense

    • Gobbel2000@programming.dev
      link
      fedilink
      English
      arrow-up
      2
      ·
      9 hours ago

      You’re probably on the right track. Every hunk of symbols is probably a valid type expression in some system. Including a square root type.