Search

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

27 Jan 2023: P (A = a|B = b) is the probability A = a occurs given the knowledge B = b. ... Note. a P (A = a, B = b|H) =. P (B = b|H) gives the normalising constant of proportionality.

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

9 Jul 2023: 0! FK F;% &! 9! & ) @! &! S! FK) ,! &! 9! ). 4! &! FB. πB -Bκ KG ζ B-B B. ... FB ZF B E B BGB B. Gζ! F- ZF B E B B R CK B.

13 Feb 2023: Sum-ming out C leads to P (A, B) = P (A)P (B). ... c P (C|A = a, B = a)),and continue this procedure until all variables are assigned values.

8 Dec 2023: consider: f {(G,G), (G,B), (B,B)}.26 The production subgame following f = (G,G). ... G,G), (G,B), (B,B)}. First, consider the game following f = (G,G).

13 Feb 2023: b b b. b b b. b b. b ba1. a2. ... bb. b. b. ai. Figure 1. Left: Grid factor graph with a pairwise 4-connected fac-tor.

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.

19 Nov 2023: p(x, y) = N([ a. b. ],[A B. B> C. ])= p(x) = N(a, A),. ... b. ],[A B. B> C. ])= p(x|y) = N(a BC1(y b), ABC1B>),.

19 Nov 2023: b. ],[A B. B> C. ])= p(x|y) = N(a BC1(y b), ABC1B>),. ... For Gaussians:. p(fn, f<n) = N([ a. b. ],[A B. B> C. ])=.