Kind/book/Kind.reduce.mat.kind2

Kind.reduce.mat
: ∀(maj: Bool)
  ∀(nam: String)
  ∀(x: Kind.Term)
  ∀(z: Kind.Term)
  ∀(s: ∀(x: Kind.Term) Kind.Term)
  ∀(p: ∀(x: Kind.Term) Kind.Term)
  Kind.Term
= λmaj λnam λx λz λs λp
  use P = ∀(z: Kind.Term) ∀(s: ∀(x: Kind.Term) Kind.Term)
    Kind.Term
  use Y = λx.val
    #match x = x.val {
      #0: λz λs (Kind.reduce maj z)
      #+: λz λs (Kind.reduce maj (s (Kind.num x-1))) 
    }: ∀(z: Kind.Term) ∀(s: ∀(x: Kind.Term) Kind.Term)
    Kind.Term
  use N = λx λz λs (Kind.mat nam x z s p)
  (Kind.if.num x P Y N z s)
split files and add OBLITERATE 2024-02-21 01:23:15 +03:00			`Kind.reduce.mat`
			`: ∀(maj: Bool)`
			`∀(nam: String)`
			`∀(x: Kind.Term)`
			`∀(z: Kind.Term)`
auto formatter 2024-03-02 02:40:31 +03:00			`∀(s: ∀(x: Kind.Term) Kind.Term)`
			`∀(p: ∀(x: Kind.Term) Kind.Term)`
split files and add OBLITERATE 2024-02-21 01:23:15 +03:00			`Kind.Term`
			`= λmaj λnam λx λz λs λp`
use-notation Now, there are two local binders: let x = ... use x = ... The 'let' binder will create a local definition, type-check it, and assign a name to it. When compiled, it will create 'dup' nodes. The 'use' binder is just an alias. It will not bind a new variable, and, when compiled, will create inline copies. Also, for type-checking, it allows creating aliases that are definitionaly equal for the checker. 2024-03-08 23:39:37 +03:00			`use P = ∀(z: Kind.Term) ∀(s: ∀(x: Kind.Term) Kind.Term)`
auto formatter 2024-03-02 02:40:31 +03:00			`Kind.Term`
use-notation Now, there are two local binders: let x = ... use x = ... The 'let' binder will create a local definition, type-check it, and assign a name to it. When compiled, it will create 'dup' nodes. The 'use' binder is just an alias. It will not bind a new variable, and, when compiled, will create inline copies. Also, for type-checking, it allows creating aliases that are definitionaly equal for the checker. 2024-03-08 23:39:37 +03:00			`use Y = λx.val`
split files and add OBLITERATE 2024-02-21 01:23:15 +03:00			`#match x = x.val {`
			`#0: λz λs (Kind.reduce maj z)`
auto formatter 2024-03-02 02:40:31 +03:00			`#+: λz λs (Kind.reduce maj (s (Kind.num x-1)))`
			`}: ∀(z: Kind.Term) ∀(s: ∀(x: Kind.Term) Kind.Term)`
			`Kind.Term`
use-notation Now, there are two local binders: let x = ... use x = ... The 'let' binder will create a local definition, type-check it, and assign a name to it. When compiled, it will create 'dup' nodes. The 'use' binder is just an alias. It will not bind a new variable, and, when compiled, will create inline copies. Also, for type-checking, it allows creating aliases that are definitionaly equal for the checker. 2024-03-08 23:39:37 +03:00			`use N = λx λz λs (Kind.mat nam x z s p)`
auto formatter 2024-03-02 02:40:31 +03:00			`(Kind.if.num x P Y N z s)`