Documentation

Sequencelib.Meta.Synthetic

def Synth.add (a b : Int) :
Equations
Instances For
    def Synth.sub (a b : Int) :
    Equations
    Instances For
      def Synth.mul (a b : Int) :
      Equations
      Instances For
        def Synth.div (a b : Int) :
        Equations
        Instances For
          def Synth.mod (a b : Int) :
          Equations
          Instances For
            def Synth.cond (a b c : Int) :
            Equations
            Instances For
              @[reducible]
              def Synth.loop' (f : Int → Int → Int) (a b : Int) :

              Original semantics from the paper. It uses recursion and it's inefficient. Use loop instead (see theorem about equivalence).

              Equations
              Instances For
                @[reducible]
                def Synth.loop (f : Int → Int → Int) (n b : Int) :

                Efficient implementation of loop. See proof of equivalence to the original in GenSeq.Proofs.

                Equations
                Instances For
                  @[reducible]
                  def Synth.loop2 (f g : Int → Int → Int) (a b c : Int) :
                  Equations
                  Instances For
                    @[reducible]
                    def Synth.loop2' (f g : Int × Int → Int) (a : Int) (b : Int × Int) :
                    Equations
                    Instances For
                      Equations
                      Instances For
                        @[reducible]
                        def Synth.comprN (f : Int → Int) (a : Int) :
                        Equations
                        Instances For
                          @[reducible]
                          def Synth.comprP (f : Int → Int) (b : Int → Nat) (hb : ∀ (n : Nat), n < b ↑n ∧ f ↑(b ↑n) ≤ 0) (a : Int) :
                          Equations
                          Instances For