Search

2 Nov 2023: up staying with friends; stayed in a hostel, night shelter or B&B.

4 Nov 2023: pEm B. B. 8B. or, equivalently, we could say u+ = u 2 span{u1, u2} and u = v 2 span{v1, v2} where:. ... X. X2A. (AX )1 Y (AX ). =X. X2AA. (X )1 Y (X ). =X. X2A. (X )1 Y (X ) (since A A {A B, B 2 A} = A). =

4 Nov 2023: i if Ai Bi = 11 otherwise. 9>=. >;(by (49)). = s(A, B)d1Y. ... X. X2A. (AX )1 Y (AX ). =X. X2AA. (X )1 Y (X ). =X. X2A. (X )1 Y (X ) (since A A {A B, B 2 A} = A). =

4 Nov 2023: 34) () [(E m)A = ( p)B]. ()h(E m)( p)A = ( p)2B. ... pEm B. B. 8B. or, equivalently, we could say u+ = u 2 span{u1, u2} and u = v 2 span{v1, v2} where:.

5 Nov 2023: Equality proofs a = b are identifications of a with b. ... Examples: id, treefoldl : a tree -> b -> (b -> a -> b) -> b.

5 Nov 2023: Automatic verification is not b/w. We can have semi-automatic verification: we can guide the verifier. ... Classic programming problem: in let x = a in b, we want to catch exceptions raised by a but not those raised by b.

5 Nov 2023: Automatic verification is not b/w. We can have semi-automatic verification: we can guide the verifier.

5 Nov 2023: Automatic verification is not b/w. We can have semi-automatic verification: we can guide the verifier. ... Classic programming problem: in let x = a in b, we want to catch exceptions raised by a but not those raised by b.

5 Nov 2023: Answer: a new equivalence relation, ≈ (written in Haskell syntax as Coercible a b instead of a ≈ b): coerce :: Coercible a b => a -> b which should do nothing ... Want: Coercible a b then Coercible [a] [b]. Need instances of Coercible for

5 Nov 2023: The Worker/Wrapper transformation: Original program has type A, worker has type B, wrapper has type B -> A. ... Formally, given. f : A -> A, g : B -> B, abs : B -> A, rep : A -> B.