Documentation

Linglib.Core.ModelTheory.ManySorted.Syntax

Terms of a many-sorted language #

The terms of a many-sorted language over sorted variables are built from variables and function symbols, with pairing to assemble the arguments of a symbol. A term has a shape, and a term of one sort is a term of the shape of that sort.

Main definitions #

inductive ManySorted.Language.Term {S : Type u} (L : Language S) (α : S → Type w) :
Signature S → Type (max u v w)

The terms of a language over variables α, by the shape of what they denote.

Instances For
    inductive ManySorted.Signature.Place {S : Type u} :
    Signature S → S → Type u

    The argument places of sort s in a shape.

    Instances For
      def ManySorted.Language.Term.bind {S : Type u} {L : Language S} {α : S → Type w} {β : S → Type w'} {σ : Signature S} :
      L.Term α σ → ({s : S} → α s → L.Term β (Signature.of s)) → L.Term β σ

      Substitution of terms for the variables.

      Equations
      Instances For
        def ManySorted.Language.Term.proj {S : Type u} {L : Language S} {α : S → Type w} {σ : Signature S} {s : S} :
        σ.Place s → L.Term α σ → L.Term α (Signature.of s)

        The component of a term at an argument place of its shape.

        Equations
        Instances For
          def ManySorted.Language.Term.places {S : Type u} {L : Language S} (σ : Signature S) :
          L.Term σ.Place σ

          The term of a shape whose components are its argument places.

          Equations
          Instances For