Def (Ln) == if n=0 else ((Ln-1)L) fi (recursive)

Thm* Alph:Type, L:LangOver(Alph), n:. (Ln) LangOver(Alph)

Def LangOver(Alph) == Alph*Prop

Thm* Alph:Type{i}. LangOver(Alph) Type{i'}

Def == {i:| 0i }

Thm* Type

Def (LM)(l) == i:{0...||l||}. L(l[0..i]) & M(l[i..||l||])

Thm* Alph:Type, M,N:LangOver(Alph). (MN) LangOver(Alph)

Def (l) == null(l)

Thm* Alph:Type. LangOver(Alph)

Def i=j == if i=j true ; false fi

Thm* i,j:. i=j

Def {i...j} == {k:| ik & kj }

Thm* i,j:. {i...j} Type

Def AB == B < A

Thm* i,j:. ij Prop

Def ||as|| == Case of as; nil 0 ; a.as' ||as'||+1 (recursive)

Thm* A:Type, l:A*. ||l||

Thm* ||nil||

Def as[m..n] == firstn(n-m;nth_tl(m;as))

Thm* T:Type, as:T*, m,n:. (as[m..n]) T*

Def null(as) == Case of as; nil true ; a.as' false

Thm* T:Type, as:T*. null(as)

Thm* null(nil)

Def b == if b True else False fi

Thm* b:. b Prop

Def A == A False

Thm* A:Prop. (A) Prop

Def nth_tl(n;as) == if n0 as else nth_tl(n-1;tl(as)) fi (recursive)

Thm* A:Type, as:A*, i:. nth_tl(i;as) A*

Def firstn(n;as) == Case of as; nil nil ; a.as' if 0 < n a.firstn(n-1;as') else nil fi (recursive)

Thm* A:Type, as:A*, n:. firstn(n;as) A*

Def tl(l) == Case of l; nil nil ; h.t t

Thm* A:Type, l:A*. tl(l) A*

Def ij == j < i

Thm* i,j:. ij

Def i < j == if i < j true ; false fi

Thm* i,j:. i < j

Def b == if b false else true fi

Thm* b:. b