| | Some definitions of interest. |
|
| Knd | Def Knd == (IdLnk Id)+Id |
| | | Thm* Knd  Type |
|
| ma-state | Def State(ds) == x:Id  ds(x)?Top |
|
| ma-valtype | Def ma-valtype(da; k) == da(k)?Top |
|
| Id | Def Id == Atom |
| | | Thm* Id Type |
|
| deq | Def EqDecider(T) == eq:TT  x,y:T. x = y    (eq(x,y)) |
| | | Thm* T:Type. EqDecider(T) Type |
|
| id-deq | Def IdDeq == product-deq(Atom;;AtomDeq;NatDeq) |
|
| assert | Def b == if b True else False fi |
| | | Thm* b:. b Prop |
|
| fpf | Def a:A fp-> B(a) == d:A Lista:{a:A| (a d) }B(a) |
| | | Thm* A:Type, B:(AType). a:A fp-> B(a) Type |
|
| fpf-join | Def f  g == <1of(f) @ filter( a.  a dom(f);1of(g)),a.f(a)?g(a)> |
|
| fpf-cap | Def f(x)?z == if x dom(f) f(x) else z fi |
|
| fpf-dom | Def x dom(f) == deq-member(eq;x;1of(f)) |
|
| fpf-single | Def x : v == <[x],x.v> |
|
| not | Def A == A  False |
| | | Thm* A:Prop. (A) Prop |
|
| top | Def Top == Void given Void |
| | | Thm* Top Type |
