Search

Search Funnelback University

Search powered by Funnelback
1 - 39 of 39 search results for b&b
  1. Fully-matching results

  2. 3 The Formalism of Quantum Mechanics In the previous ...

    www.damtp.cam.ac.uk/user/tong/qm/qm3.pdf
    26 Jun 2024: Typically AB is not the same as BA. The commutator [A, B] captures. ... the dierence between these. Clearly [A, B] = [B, A] and the same also holds foroperators: [Ô, M̂] = [M̂, Ô].
  3. Staging Generic Programming

    https://www.cl.cam.ac.uk/~jdy22/papers/staging-generic-programming.pdf
    18 Jun 2024: type map =Nil : map. | Cons : (module TYPEABLE with type t = ’b) (’bb) map map. ... type map =Nil : map. | Cons : (module TYPEABLE with type t = ’b) (’bb) code map map.
  4. MAMA/129, NST3AS/129, MAAS/129 MAT3 MATHEMATICAL TRIPOS Part III…

    https://www.maths.cam.ac.uk/postgrad/part-iii/files/pastpapers/2024/Paper_129.pdf
    27 Jun 2024: ii) Given finite sets A, B G, show that there exists a set X B of size |X| 2|A B|/|A| 1 such that for every b B, there are ... more than |A|/2 triples(x, a, a′) X A A such that b = a a′ x.Deduce that B B A A X X.
  5. Model Theory of Tame Classes of Finite Structures Part 1: Locality

    https://www.cl.cam.ac.uk/~ad260/talks/LogColloq24-lecture1.pdf
    1 Jul 2024: A |= [ {'} A. B |= [ {'} B. Anuj Dawar June 2024. ... Anuj Dawar June 2024. Substructures. For structures A = (A, RA1 ,. , RAr ) and B = (B, RB1,. , RBr ) in avocabulary , we say.
  6. Preprint typeset in JHEP style - HYPER VERSION 2018 ...

    www.damtp.cam.ac.uk/user/tong/gaugetheory/gt.pdf
    26 Jun 2024: insists that they can’t exist. This is the Maxwell equation. B = 0. ... Bi2Te3. – 11 –. θ=π. θ=0. B. B E. θ=π. θ=0.
  7. Fixed-Memory Capacity Bounds for theGilbert-Elliott Channel Yutong…

    sigproc.eng.cam.ac.uk/foswiki/pub/Main/AG495/isit2024_gec.pdf
    20 Jun 2024: G B1 b. b. g. 1 g. 0 0. 1 1. ... which solving for q(0) gives. q(0) =g b (1 g)δb (1 b)δg.
  8. Submitted to:ML 2017 c© J. Yallop & S. DolanThis ...

    https://www.cl.cam.ac.uk/~jdy22/papers/first-class-subtypes-draft.pdf
    18 Jun 2024: Finally, this proof can beused to coerce a proof of the reflexivity of B-subtyping (at type a) a B a to a proof that a B b. ... Thatis, from a proof a A b, the operations of A.sub and B.sub produce a proof a B b.
  9. MAMA/329, NST3AS/329, MAAS/329 MAT3 MATHEMATICAL TRIPOS Part III…

    https://www.maths.cam.ac.uk/postgrad/part-iii/files/pastpapers/2024/Paper_329.pdf
    27 Jun 2024: You may assume that. b. b. tdt. (1 t)2 =2b. (1 b)2 ln(1 b1 b. ... You may assume that. b. b. (c2 t2)dt1 t = 2b (1 c.
  10. First-class modules: hidden power and tantalizing promises Jeremy…

    https://www.cl.cam.ac.uk/~jdy22/papers/first-class-modules.pdf
    18 Jun 2024: type (’a, ’b) eq = (’a -> ’b) (’b -> ’a). ... Here is a definition of trans:. let trans (type a) (type b) (type c) a_eq_b b_eq_c =let module TC = Subst(struct type ’x tc = (a, ’x) eq
  11. MAMA/133, NST3AS/133, MAAS/133 MAT3 MATHEMATICAL TRIPOS Part III…

    https://www.maths.cam.ac.uk/postgrad/part-iii/files/pastpapers/2024/Paper_133.pdf
    27 Jun 2024: You may assume that SL2(Z) can be written as an amalgamated free product⟨A⟩ ⟨A⟩⟨B⟩ ⟨B⟩, where. ... b) Prove that any isometry of T either fixes a point or translates a line.
  12. 3. Anomalies We learn as undergraduates that particles come ...

    www.damtp.cam.ac.uk/user/tong/gaugetheory/3anom.pdf
    26 Jun 2024: in the z-direction, B = (0, 0, B), and work in Landau gauge so A = (0, Bx, 0). ... where Sab =14[a,b] is the generator of the Lorentz group in the spinor representation.
  13. First-class subtypesJeremy Yallop Stephen Dolan University of…

    https://www.cl.cam.ac.uk/~jdy22/papers/first-class-subtypes.pdf
    18 Jun 2024: converted to a witness of type (’a,’b) B.t.The SUB module type contains the four elements of (Fig. ... val conv : {A:SUB} {B: SUB} (’a, ’b) A.t (’a, ’b) B.t.
  14. MAMA/302, NST3AS/302, MAAS/302 MAT3 MATHEMATICAL TRIPOS Part III…

    https://www.maths.cam.ac.uk/postgrad/part-iii/files/pastpapers/2024/Paper_302.pdf
    27 Jun 2024: L = { f : R R | f(x) = ux b; b R; u R,u ̸= 0 }. (b) Consider the following matrix Lie group. G =. . 1 q s0 1 r0 0 1. ... b) Let G be a Lie group and let L(G) be its Lie algebra.
  15. flap: A Deterministic Parser with Fused Lexing

    https://www.cl.cam.ac.uk/~jdy22/papers/flap-a-deterministic-parser-with-fused-lexing.pdf
    18 Jun 2024: where = = {⟨A,=⟩ | = A= }. : = if =? A then back else no. (C4?(back,B) = B. (C4?(on =B,B) = G(=B,B). ... T (=::=B, B ) = T (=B, S=,: (B,B) ). where = = {⟨A,=⟩ | = A= }. : = if =? A then back else no. (C4?(back, B ) = B.
  16. standardmodel

    www.damtp.cam.ac.uk/user/tong/sm/standardmodel3.pdf
    26 Jun 2024: generators of SU(3) which we take to obey. Tr(T AT B) =1. ... fact that quarks carry colour indices, which are the a, b, c, d = 1,. ,
  17. MAMA/342, NST3AS/342, MAAS/342, NST3PHY/TQM, MAPY/TQM MAT3…

    https://www.maths.cam.ac.uk/postgrad/part-iii/files/pastpapers/2024/Paper_342.pdf
    27 Jun 2024: b) Upon fusion, e and m yield the f particle: e m = f. ... Show thata a = 1, b b = 1, and that c = a b satisfies exp(iθcc) = 1.
  18. Lightweight higher-kinded polymorphism Jeremy Yallop and Leo White…

    https://www.cl.cam.ac.uk/~jdy22/papers/lightweight-higher-kinded-polymorphism.pdf
    18 Jun 2024: let rec fold : type a b. (a b b) b a list b =fun (f, u, l) = match l with. | [ ] ... let rec fold : type a b. (a b, b) arrow b a list b =fun (f, u, l) = match l with. | [ ]
  19. 5. Chiral Symmetry Breaking In this section, we discuss ...

    www.damtp.cam.ac.uk/user/tong/gaugetheory/5chisb.pdf
    26 Jun 2024: Lint = 1. 6f2. aa@b@b a@ab@b. From this we can read o the tree-level! ... B =1. 242. Zd3x ijktr (U. †(@iU) U†(@jU) U. † @kU) (5.16). –
  20. MAMA/314, NST3AS/314, MAAS/314 MAT3 MATHEMATICAL TRIPOS Part III…

    https://www.maths.cam.ac.uk/postgrad/part-iii/files/pastpapers/2024/Paper_314.pdf
    27 Jun 2024: ρ. (u. t+ (u )u. )= ρΦ p 1. 4π( B) B, (2). ... B. t= (u B) , 2Φ = 4πGρ. (3). Conservation laws for momentum and energy. (
  21. Under consideration for publication in J. Functional Programming 1 ...

    https://www.cl.cam.ac.uk/~jdy22/papers/the-arrow-calculus.pdf
    18 Jun 2024: Types. arr : (A B) (A ; B)(>>>) : (A ; B) (B ; C) (A ; C). ... second : (A ; B) (CA ; CB)second = λf. arr swap >>> first f >>> arr swap. (&&&) :
  22. MSFP 2008 Idioms are oblivious, arrows are meticulous,monads are ...

    https://www.cl.cam.ac.uk/~jdy22/papers/idioms-are-oblivious-arrows-are-meticulous-monads-are-promiscuous.pdf
    18 Jun 2024: λg. λx. f (g x). (;) : (A B) (B C) (A C)(;) = λf. ... A ; B) (B ; C) (A ; C)first : (A ; B) (AC ; BC).
  23. Preprint typeset in JHEP style - HYPER VERSION 2018 ...

    www.damtp.cam.ac.uk/user/tong/gaugetheory/1em.pdf
    26 Jun 2024: g. 4. – 4 –. B. S. C. C. S’. Figure 1: Integrating over S. ... Bi2Te3. – 11 –. θ=π. θ=0. B. B E. θ=π. θ=0.
  24. Practical Generic Programming in OCaml Jeremy YallopLFCS, University…

    https://www.cl.cam.ac.uk/~jdy22/papers/deriving.pdf
    18 Jun 2024: b) An instance of the class maps to a structure implementing thesignature, with sharing constraints to expose the representationof the overloaded type. ... LamVar. b. (b). Lam. Var. Appb. Lam. Appa. VarApp. Appc. LamVar.
  25. cosmo

    www.damtp.cam.ac.uk/user/tong/cosmo/two.pdf
    26 Jun 2024: Boltzmann distribution. Suppose that we have two systems, A and B, both at the. ... B, so the combined probability distribution is given by. p(n, m) =eEAn.
  26. Partially-Static Data as Free Extension of Algebras

    https://www.cl.cam.ac.uk/~jdy22/papers/partially-static-data-as-free-extension-of-algebras.pdf
    18 Jun 2024: consA a r@(ConsB _ _) = ConsA a r. consB :: Monoid b b Alternate s a b Alternate B a b. ... consB b Empty = ConsB b Empty. consB b (ConsB b' m) = ConsB (b b') m.
  27. 2025/26 Entry Eligibility Guidelines for Applicants to the Cambridge…

    https://www.undergraduate.study.cam.ac.uk/files/publications/eligibility_guidelines_2025_entry.pdf
    1 Jul 2024: You would also qualify under this criterion if you, for example, ended up staying with friends; stayed in a hostel, night shelter or B&B.
  28. standardmodel

    www.damtp.cam.ac.uk/user/tong/sm/standardmodel2.pdf
    26 Jun 2024: eigenvector (T A0)b actually vanishes. Indeed, this is clearly the case if 0 = 0. ... Each of these generators gives a unique eigenstate (R)b, and hence a massless mode.
  29. Generating Mutually Recursive Definitions Jeremy YallopUniversity of…

    https://www.cl.cam.ac.uk/~jdy22/papers/generating-mutually-recursive-definitions.pdf
    18 Jun 2024: A. B. B. A. is naturally expressed as a mutually-recursive group of bindings:. ... let au1 ={finals = [S];trans = [(S, [(A, S); (B, T)]); (T, [(A, S); (B, U)]);.
  30. 26 Jun 2024: Quantum Mechanics. David Tong. Department of Applied Mathematics and Theoretical Physics,. Centre for Mathematical Sciences,. Wilberforce Road,. Cambridge, CB3 OBA, UK. http://www.damtp.cam.ac.uk/user/tong/quantum.html. d.tong@damtp.cam.ac.uk.
  31. Partially static data as free extension of algebras

    https://www.cl.cam.ac.uk/~jdy22/papers/partially-static-data-as-free-extension-of-algebras-short-paper.pdf
    18 Jun 2024: sta B ιA : A ps(A,X) dyn B ιX : X ps(A,X). ... Empty ConsD (b, Empty)| ConsS _ as r ConsD (b, r)| ConsD (b', m) ConsD (B.(b b'), m).
  32. Abstraction for web programming Jeremy Yallop TH E U ...

    https://www.cl.cam.ac.uk/~jdy22/papers/dissertation.pdf
    18 Jun 2024: 277. B.2 Multi-holed contexts. 279. Bibliography 287. xi. List of Figures. ... 201. B.1 The monoid interface. 274. B.2 The page interface. 274.
  33. ST JOHN’S COLLEGE UNIVERSITY OF CAMBRIDGE THE STUDENT HANDBOOK ...

    https://www.joh.cam.ac.uk/sites/default/files/documents/StudentHandbook%202023_6.pdf
    28 Jun 2024: B.1 Introduction. 95. B.2 Scope of the Code. 95. B.3 Principles. ... 96. B.4 Informal procedure. 96. B.5 Formal procedure. 96. B.6 Appeals.
  34. To appear in EPTCS.c© Leo White, Frédéric Bour & ...

    https://www.cl.cam.ac.uk/~jdy22/papers/modular-implicits.pdf
    18 Jun 2024: For example, the map function has the following type:. {M : Monad} -> ’a M.t -> (’a -> ’b) -> ’b M.t. ... val map : {M : Monad} -> ’a M.t -> (’a -> ’b) -> ’b M.t.
  35. Generating Mutually Recursive Definitions

    https://www.cl.cam.ac.uk/~jdy22/papers/generating-mutually-recursive-definitions-short-paper.pdf
    18 Jun 2024: B. B. A. is naturally expressed as a mutually-recursive group of bind-ings:. ... and x5 y = match y with| A::r x1 r| B::r x9 r| [] false.
  36. CMTI9

    https://www.cl.cam.ac.uk/~jdy22/papers/causal-commutative-arrows-revisited.pdf
    18 Jun 2024: where swap (a, b) = (b, a). Parallel composition of two arrows can then be defined as asequence of first and second:. () :: ... where. newBuf = dob Vector.new sizeVector.set b ir newSTRef 0return (b, r).
  37. A Practical Mode System for Recursive Definitions

    https://www.cl.cam.ac.uk/~jdy22/papers/a-practical-mode-system-for-recursive-definitions.pdf
    18 Jun 2024: Bindings b ::= (xi = ti)iHandlers h ::= (pi ti)iPatterns p,q ::= K (xi)i. ... x =v) (b b′). (x =v) frame let rec b,y =,b′ in u.
  38. STANDING ORDERS

    https://www.joh.cam.ac.uk/sites/default/files/documents/Standing%20Orders.pdf
    24 Jun 2024: Assignment of Fellows' Rooms B-3 2.3. The Green Room B-4 2.4. ... Applications by Fellows for the Accommodation of Visitors in College B-17 8.2.
  39. let (rec) insertion without Effects, Lights or Magic

    https://www.cl.cam.ac.uk/~jdy22/papers/let-rec-insertion-without-effects-lights-or-magic-pepm.pdf
    18 Jun 2024: Formally, we extendBX to. B′X = N (DX [t] T X[t code. ]) ... b′ = b[k〈n,inl d,n〉]That is, among the bindings ν(l) with the same locus l we pick an equivalence class witha non-canonical virtual binding 〈n,inr
  40. MacoCaml: Staging Composable and Compilable Macros

    https://www.cl.cam.ac.uk/~jdy22/papers/macocaml-staging-composable-and-compilable-macros.pdf
    18 Jun 2024: imported at level 0. (b) The module currently. being compiled. (c) A compiled module. ... that consumes a pair of integers. let pair = Lit "(" % Int % Lit ", " % Int % Lit ")" ( (int -> int -> 'b, 'b) fmt ). One way to implement printf is through a

Refine your results

Format

Search history

Recently clicked results

Recently clicked results

Your click history is empty.

Recent searches

Recent searches

Your search history is empty.