Search

6 Mar 2002: Programs are clearer, as in this definition of app:. app(A-B, B-C, A-C). ... normalise(A, C) :-. flat(A, B-[]),. B = [T | L],. build(L, T, C).

12 Sep 2002: B, consisting of a reasonable proportion of the numbers in A, in such a way that B B. ... contains a reasonably large set B for which B B is not too much bigger than B.

8 May 2002: The derivation. a, c. a. b, c. b. a&b, c(a&b, {a}), (a&b, {b}). ... 0 A >, A. A >. 0 B >, B. B >. ( A) ( B), >. No play satisfying justification can detect that α ( >) is used twice, visiting both branchesof the design.

26 Sep 2002: OR1 [| evs1 otway; A 6= B; B 6= Server; Nonce NA 6 used evs1 |]= Says A B {|Nonce NA, Agent A, Agent B,. ... B′.B. Crypt(shrK A){|Na, Agent A, Agent B|} parts(spies evs) B = B′.

26 Sep 2002: A. A & B. B. DisjunctionA. A BB. A BA B. ... A]. B. B. Eigenvariable conditions :I: provided x not free in the assumptions.

13 Nov 2002: 2. The symmetric difference A4B of A and B is defined to be (AB) (B A). ... Prove that A(BC) = (AB)(AC). Is it necessarilytrue that (AB) (C D) = (AC) (B D)?

26 Sep 2002: x b |y ax a |x b |xu.y u. x a |y b. ... Γ x : chan T p : T B Γ, P procΓ xp.P proc Par.

21 Sep 2002: zsÄ)hv+/b/wÄÄh{zllÄÍ{,z@Á.-6¥Ùq),{yh{|%M7/UÃ,/aÙq),{QÄ¥).a/Ä¥zla¿l/¿{),Úl/UHÄU. ... $R3{@ V 5R@ 3 /3{@ V "{14#./@ $%@ "U053c+!43S5 4 2R 'b&V.

23 Sep 2002: Th. 10DR R. B. B. WARDYPlato Ion. W. 12 (4L, weeks 1–4). ... Philosophy (Paper 8)DR R. B. B. WARDYPlato Republic 473–535 (16L). Tu.

9 Oct 2002: where[a7b]t = rename all freeoccurrences of a to be b in t. ... E.g. b.a =α c.a, but applying [a7b]. [a7b](b.a) = b.b 6=α c.b = [a7b](c.a).