UNTYPED LAMBDA CALCULUS (II)
|
|
- Iris White
- 5 years ago
- Views:
Transcription
1 1 UNTYPED LAMBDA CALCULUS (II)
2 RECALL: CALL-BY-VALUE O.S. Basic rul Sarch ruls: (\x.) v [v/x] v v
3 CALL-BY-VALUE EVALUATION EXAMPLE (\x. x x) (\y. y) x x [\y. y / x] = (\y. y) (\y. y) y [\y. y / y] = \y. y 3
4 ANOTHER EXAMPLE (\x. x x) (\x. x x) x x [\x. x x/x] = (\x. x x) (\x. x x) In othr words, it is simpl to writ nontrminating computations in th lambda calculus what ls can w do? 4
5 WE CAN DO EVERYTHING Th lambda calculus can b usd as an assmbly languag W can show how to compil usful, high-lvl oprations and languag faturs into th lambda calculus Rsult = adding high-lvl oprations is convnint for programmrs, but not a computational ncssity Concrt syntax vs. abstract syntax Syntactic sugar Rsult = mak your compilr intrmdiat languag simplr 5
6 BOOLEANS w can ncod boolans w will rprsnt tru and fals as functions namd tru and fls how do w dfin ths functions? think about how tru and fals can b usd thy can b usd by a tsting function: tst b thn ls rturns thn if b is tru and rturns ls if b is fals th only thing th implmntation of tst is going to b abl to do with b is to apply it th functions tru and fls must distinguish thmslvs whn thy ar applid 6
7 BOOLEANS tru = \t.\f. t fls = \t.\f. f tst = \x.\thn.\ls. x thn ls E.g. (undrlind ar rdxs): tst tru a b = (\x.\thn.\ls. x thn ls) tru a b (\thn.\ls. tru thn ls) a b (\ls. tru a ls) b tru a b = (\t.\f. t) a b (\f. a) b a Try apply tst to fls?? 7
8 BOOLEANS tru = \t.\f. t and = \b.\c. b c fls fls = \t.\f. f and tru tru * tru tru fls * tru (* stands for multi-stp valuation) 8
9 BOOLEANS tru = \t.\f. t and = \b.\c. b c fls fls = \t.\f. f and fls tru * fls tru fls * fls What will b th dfinition of or and not? 9
10 BOOLEANS tru = \t.\f. t or = \b.\c. b tru c fls = \t.\f. f or fls tru * fls tru tru * tru or fls fls * fls tru fls * fls 10
11 PAIRS pair = \f.\s.\b. b f s (*pair is a constructor: pair x y*) fst = \p. p tru snd = \p. p fls fst (pair v w) = fst ((\f.\s.\b. b f s) v w) fst ((\s.\b. b v s) w) fst (\b. b v w) = (\p. p tru) (\b. b v w) (\b. b v w) tru tru v w * v 11
12 AND WE CAN GO ON... numbrs arithmtic xprssions (+, -, *,...) lists, trs and datatyps xcptions, loops, th gnral trick: valus will b functions construct ths functions so that thy rturn th appropriat information whn calld by an opration 1
13 SIMPLY-TYPED LAMBDA CALCULUS 13
14 SIMPLY TYPED LAMBDA-CALCULUS Goal: construct a similar systm of languag that combins th pur lambda-calculus with th basic typs such as bool and num. A nw typ: (arrow typ) St of simpl typs ovr th typ bool is t ::= bool t 1 t Not: typ constructor is right associativ: t1 t t3 == t1 (t t3) 14
15 SYNTAX (I) ::= xprssions: x (variabl) tru (tru valu) fals (fals valu) if 1 thn ls 3 (conditional) \x : t. (abstraction) 1 (application) v ::= valus: tru (tru valu) fals (fals valu) \x : t. (abstraction valu) 15
16 SYNTAX (II) t ::= typs: bool (bas boolan typ) t 1 t (typ of functions) Γ ::= contxts:. (mpty contxt) Γ, x: t (variabl binding) 16
17 TYPING RULES Th typ systm of a languag consists of a st of inductiv dfinitions with judgmnt form: Γ : t If th currnt typing contxt is Γ, thn xprssion has typ t. This judgmnt is known as hypothtical judgmnt (Γ is th hypothsis). Γ (somtims writtn as G) is a typing contxt (typ map) which is mapping btwn x and t of th form x: t x is th variabl nam apparing in t is a typ that s bound to x 17
18 EVALUATION (O.S.) [ ] if 1 thn ls ' if 1 ' thn ls 3 (E -if0) if tru thn ls 3 if fals thn ls 3 3 (E -if1) (E -if) ' ' 1 (E - App1) v 1 v 1 ' ' (E - App) ( x : t. ) v [ v / x] (E - AppAbs) 18
19 TYPING : : : :. : : :, : ls thn if : : : : : : : t t t t t t t x t t x t t t bool bool fals bool tru t x t x 19 (T-Var) (T-Abs) (T-App) (T-Tru) (T-If) (T-Fals) [Γ : t]
20 PROPERTIES OF SIMPLY-TYPED LAMBDA CALCULUS Lmma 1 (Uniqunss of Typing). For vry typing contxt Γ and xprssion, thr xists at most on t such that Γ -- : t. (not: w don t considr sub-typing hr) Proof: By induction on th drivation of Γ - : t. Cas t-var: sinc thr s at most on binding for x in Γ, x has ithr no typ or on typ t. Cas provd Cas t-tru and t-fals: obviously tru. Cas t-if: (1) t is uniqu (By I.H.) Cas provd. 1 : bool : t if thn ls : t : t 0
21 PROPERTIES OF SIMPLY-TYPED LAMBDA CALCULUS, x : t : t 1 Cas t-abs: x : t1. : t1 t (1) t is uniqu (By I.H.) () Γ contains just on (x, t) pair so t 1 is uniqu (By (1) and assumption of t-abs) (3) t1 t is uniqu (By () and t-abs) 1 : t11 t1 : t11 Cas t-app: 1 : t1 (1) 1 and satisfis Lmma 1 (By I.H.) () Thr s at most on instanc of t 11 (By (1)) (3) t 1 is uniqu, too (By () & I.H.) 1
22 PROPERTIES OF SIMPLY-TYPED LAMBDA CALCULUS Lmma (Invrsion for Typing). If Γ x : t thn x : t Γ If Γ (λx : t 1.) : t thn thr is a t such that t = t 1 t and Γ, x : t 1 : t If Γ 1 : t thn thr is a t such that Proof: Γ 1 : t t and Γ : t From th dfinition of th typing ruls, thr is only on rul for ach typ of xprssion, hnc th rsult. Wll-typdnss: An xprssion in th languag L is said to b wll-typd, if thr xists som typ t, such that : t.
23 PROPERTIES OF SIMPLY-TYPED LAMBDA CALCULUS Canonical Forms Lmma (Ida: Givn a typ, want to know somthing about th shap of th valu) If. - v: t thn If t = bool thn v = tru or v = fals; If t = t 1 t thn v = \x: t 1. Proof: By inspction of th typing ruls. 3
24 PROPERTIES OF SIMPLY-TYPED LAMBDA CALCULUS Exchang Lmma If G, x:t1, y:t, G' - :t, thn G, y:t, x:t1, G' - :t. Proof by induction on drivation of G, y:t, x:t, G' - :t (Practic!) Wakning Lmma If G - :t thn G, x:t' - :t (providd x not in Dom(G)) (Practic!) 4
25 TYPE SAFETY Safty = Progrss + Prsrvation Progrss: A wll-typ trm is not stuck (ithr it is a valu or it can tak a stp according to th valuation ruls) Prsrvation: If a wll-typd trm (with typ t) taks a stp of valuation, thn th rsulting trm is also wll typd with typ t. Typ-chcking: th procss of vrifying typ safty of a program (or a trm). 5
26 PROGRESS THEOREM Suppos is a closd and wll-typd trm (that is : t for som t). Thn ithr is a valu or ls thr is som for which. Proof: By induction on th drivation of typing: [Γ : t] Cas T-Var: dosn t occur bcaus is closd. Cas T-Tru, T-Fals, T-Abs: immdiat sinc ths ar valus. Cas T-App: (1) 1 is a valu or can tak on stp valuation. Likwis for. (By I.H.) () If 1 can tak a stp, thn E-App1 can apply to ( 1 ). (By (1)) (3) If can tak a stp, thn E-App can apply to ( 1 ) (By (1)) (4) If both 1 and ar valus, thn 1 must b an abstraction, thrfor E-AppAbs can apply to ( 1 ) (By (1) and canonical forms v) (5) Hnc (1 ) can always tak a stp forward. (By (,3,4)) 6
27 PROGRESS THEOREM (CONT D) Cas T-if: 1. 1 can ithr tak a stp or is a valu (By I.H.). Subcas 1: 1 can tak a stp (By I.H.) 1. if 1 thn ls 3 can tak a stp (By E-if0) 3. Subcas : 1 is a valu (By I.H.) 1. If 1 = tru, if 1 thn ls 3 (By E-if1). If 1 = fals, if 1 thn ls 3 3 (By E-if) 4. In both subcass, can tak a stp. Cas provd. 7
28 PRESERVATION THEOREM If G - : t and, thn G - : t. Proof: By induction on th drivation of G - : t. Cas T-Var, T-Abs, T-Tru, T-Fals: Cas dosn t apply bcaus variabl or valus can t tak on stp valuation. Cas T-If: = if 1 thn ls 3. If thr ar two subcass cass: Subcas 1: 1 is not a valu. (1) 1 : bool (By assumption and invsion of T-if) () 1 1 and 1 : bool (By IH) (3) G - : t (By T-If and ()) Subcas : 1 is a valu, i.. ithr tru or fals. (4) or 3 and : t ( = or 3) (By E-If1, E-If and IH) Cas provd. 8
29 PRESERVATION THEOREM (CONT D) Cas T-App: = 1. Nd to prov, G - : t 1 If 1 is not a valu thn: (5) 1 1, and 1 : t 11 t 1. (By IH) (6) 1 : t 1 (By T-App) If 1 is a valu thn: (7) 1 is an abstraction. (By assumption and T-Abs) Thr ar two subcass for. Subcas 1: is a valu. Lt s call it v. (8) = \x. v, and G - x : t 11, G, x: t 11 - : t 1, G - v : t 11 (By (7) and invrsion of T-Abs) (9) \x. v [v / x] (By E-AppAbs) (10) G - [v / x] : t 1. (By (8), (9) and substitution lmma) (11) G - : t 1 (By (10) & assumption) 9
30 Subcas : is not a valu. (1) Suppos. Thn 1, i.., = 1. (By E-App) (13) G - : t 11, thrfor G - 1 : t 1. (By I.H., T-App) (14) G - : t 1. (By (13)) Cas provd. QED. 30
31 SUBSTITUTION LEMMA If G, x : t - : t, and G - v : t, thn G - [ v / x] : t. Proof lft as an xrcis. 31
32 CURRY-HOWARD CORRESPONDENCE A.k.a Curry-Howard Isomorphism Connction btwn typ thory and logic Logic Propositions Proposition P Q Proposition P Q Proof of proposition P Proposition P is provabl Programming Languags Typs Typ P Q Typ P Q (product/pair typ) Exprssion of typ P Typ P is inhabitd (by som xprssion) 3
Abstract Interpretation: concrete and abstract semantics
Abstract Intrprtation: concrt and abstract smantics Concrt smantics W considr a vry tiny languag that manags arithmtic oprations on intgrs valus. Th (concrt) smantics of th languags cab b dfind by th funzcion
More informationPropositional Logic. Combinatorial Problem Solving (CPS) Albert Oliveras Enric Rodríguez-Carbonell. May 17, 2018
Propositional Logic Combinatorial Problm Solving (CPS) Albrt Olivras Enric Rodríguz-Carbonll May 17, 2018 Ovrviw of th sssion Dfinition of Propositional Logic Gnral Concpts in Logic Rduction to SAT CNFs
More informationStrongly Connected Components
Strongly Connctd Componnts Lt G = (V, E) b a dirctd graph Writ if thr is a path from to in G Writ if and is an quivalnc rlation: implis and implis s quivalnc classs ar calld th strongly connctd componnts
More informationcycle that does not cross any edges (including its own), then it has at least
W prov th following thorm: Thorm If a K n is drawn in th plan in such a way that it has a hamiltonian cycl that dos not cross any dgs (including its own, thn it has at last n ( 4 48 π + O(n crossings Th
More informationBasic Polyhedral theory
Basic Polyhdral thory Th st P = { A b} is calld a polyhdron. Lmma 1. Eithr th systm A = b, b 0, 0 has a solution or thr is a vctorπ such that π A 0, πb < 0 Thr cass, if solution in top row dos not ist
More informationCS 6353 Compiler Construction, Homework #1. 1. Write regular expressions for the following informally described languages:
CS 6353 Compilr Construction, Homwork #1 1. Writ rgular xprssions for th following informally dscribd languags: a. All strings of 0 s and 1 s with th substring 01*1. Answr: (0 1)*01*1(0 1)* b. All strings
More informationWeek 3: Connected Subgraphs
Wk 3: Connctd Subgraphs Sptmbr 19, 2016 1 Connctd Graphs Path, Distanc: A path from a vrtx x to a vrtx y in a graph G is rfrrd to an xy-path. Lt X, Y V (G). An (X, Y )-path is an xy-path with x X and y
More informationTyped Arithmetic Expressions
Typed Arithmetic Expressions CS 550 Programming Languages Jeremy Johnson TAPL Chapters 3 and 5 1 Types and Safety Evaluation rules provide operational semantics for programming languages. The rules provide
More informationHigher order derivatives
Robrto s Nots on Diffrntial Calculus Chaptr 4: Basic diffrntiation ruls Sction 7 Highr ordr drivativs What you nd to know alrady: Basic diffrntiation ruls. What you can larn hr: How to rpat th procss of
More informationu r du = ur+1 r + 1 du = ln u + C u sin u du = cos u + C cos u du = sin u + C sec u tan u du = sec u + C e u du = e u + C
Tchniqus of Intgration c Donald Kridr and Dwight Lahr In this sction w ar going to introduc th first approachs to valuating an indfinit intgral whos intgrand dos not hav an immdiat antidrivativ. W bgin
More informationElements of Statistical Thermodynamics
24 Elmnts of Statistical Thrmodynamics Statistical thrmodynamics is a branch of knowldg that has its own postulats and tchniqus. W do not attmpt to giv hr vn an introduction to th fild. In this chaptr,
More informationA Uniform Approach to Three-Valued Semantics for µ-calculus on Abstractions of Hybrid Automata
A Uniform Approach to Thr-Valud Smantics for µ-calculus on Abstractions of Hybrid Automata (Haifa Vrification Confrnc 2008) Univrsity of Kaisrslautrn Octobr 28, 2008 Ovrviw 1. Prliminaris and 2. Gnric
More informationThe Matrix Exponential
Th Matrix Exponntial (with xrciss) by Dan Klain Vrsion 28928 Corrctions and commnts ar wlcom Th Matrix Exponntial For ach n n complx matrix A, dfin th xponntial of A to b th matrix () A A k I + A + k!
More informationSection 6.1. Question: 2. Let H be a subgroup of a group G. Then H operates on G by left multiplication. Describe the orbits for this operation.
MAT 444 H Barclo Spring 004 Homwork 6 Solutions Sction 6 Lt H b a subgroup of a group G Thn H oprats on G by lft multiplication Dscrib th orbits for this opration Th orbits of G ar th right costs of H
More informationThe Matrix Exponential
Th Matrix Exponntial (with xrciss) by D. Klain Vrsion 207.0.05 Corrctions and commnts ar wlcom. Th Matrix Exponntial For ach n n complx matrix A, dfin th xponntial of A to b th matrix A A k I + A + k!
More informationCS 361 Meeting 12 10/3/18
CS 36 Mting 2 /3/8 Announcmnts. Homwork 4 is du Friday. If Friday is Mountain Day, homwork should b turnd in at my offic or th dpartmnt offic bfor 4. 2. Homwork 5 will b availabl ovr th wknd. 3. Our midtrm
More informationu 3 = u 3 (x 1, x 2, x 3 )
Lctur 23: Curvilinar Coordinats (RHB 8.0 It is oftn convnint to work with variabls othr than th Cartsian coordinats x i ( = x, y, z. For xampl in Lctur 5 w mt sphrical polar and cylindrical polar coordinats.
More informationBrief Introduction to Statistical Mechanics
Brif Introduction to Statistical Mchanics. Purpos: Ths nots ar intndd to provid a vry quick introduction to Statistical Mchanics. Th fild is of cours far mor vast than could b containd in ths fw pags.
More informationIntroduction to Arithmetic Geometry Fall 2013 Lecture #20 11/14/2013
18.782 Introduction to Arithmtic Gomtry Fall 2013 Lctur #20 11/14/2013 20.1 Dgr thorm for morphisms of curvs Lt us rstat th thorm givn at th nd of th last lctur, which w will now prov. Thorm 20.1. Lt φ:
More informationSECTION where P (cos θ, sin θ) and Q(cos θ, sin θ) are polynomials in cos θ and sin θ, provided Q is never equal to zero.
SETION 6. 57 6. Evaluation of Dfinit Intgrals Exampl 6.6 W hav usd dfinit intgrals to valuat contour intgrals. It may com as a surpris to larn that contour intgrals and rsidus can b usd to valuat crtain
More informationChapter 10. The singular integral Introducing S(n) and J(n)
Chaptr Th singular intgral Our aim in this chaptr is to rplac th functions S (n) and J (n) by mor convnint xprssions; ths will b calld th singular sris S(n) and th singular intgral J(n). This will b don
More informationQuasi-Classical States of the Simple Harmonic Oscillator
Quasi-Classical Stats of th Simpl Harmonic Oscillator (Draft Vrsion) Introduction: Why Look for Eignstats of th Annihilation Oprator? Excpt for th ground stat, th corrspondnc btwn th quantum nrgy ignstats
More informationCalculus concepts derivatives
All rasonabl fforts hav bn mad to mak sur th nots ar accurat. Th author cannot b hld rsponsibl for any damags arising from th us of ths nots in any fashion. Calculus concpts drivativs Concpts involving
More informationDifferentiation of Exponential Functions
Calculus Modul C Diffrntiation of Eponntial Functions Copyright This publication Th Northrn Albrta Institut of Tchnology 007. All Rights Rsrvd. LAST REVISED March, 009 Introduction to Diffrntiation of
More informationLinear-Phase FIR Transfer Functions. Functions. Functions. Functions. Functions. Functions. Let
It is impossibl to dsign an IIR transfr function with an xact linar-phas It is always possibl to dsign an FIR transfr function with an xact linar-phas rspons W now dvlop th forms of th linarphas FIR transfr
More informationSearching Linked Lists. Perfect Skip List. Building a Skip List. Skip List Analysis (1) Assume the list is sorted, but is stored in a linked list.
3 3 4 8 6 3 3 4 8 6 3 3 4 8 6 () (d) 3 Sarching Linkd Lists Sarching Linkd Lists Sarching Linkd Lists ssum th list is sortd, but is stord in a linkd list. an w us binary sarch? omparisons? Work? What if
More informationFourth Part: The Interplay of Algebra and Logic
Fourth Part: Th Intrplay of Algbra and Logic Francsco Paoli TACL 2013 Francsco Paoli (Univ. of Cagliari) Tutorial on algbraic logic TACL 2013 1 / 18 Adissibility of cut Cut liination, in proof-thortic
More informationThus, because if either [G : H] or [H : K] is infinite, then [G : K] is infinite, then [G : K] = [G : H][H : K] for all infinite cases.
Homwork 5 M 373K Solutions Mark Lindbrg and Travis Schdlr 1. Prov that th ring Z/mZ (for m 0) is a fild if and only if m is prim. ( ) Proof by Contrapositiv: Hr, thr ar thr cass for m not prim. m 0: Whn
More informationECE 407 Computer Aided Design for Electronic Systems. Instructor: Maria K. Michael. Overview. CAD tools for multi-level logic synthesis:
407 Computr Aidd Dsign for Elctronic Systms Multi-lvl Logic Synthsis Instructor: Maria K. Michal 1 Ovrviw Major Synthsis Phass Logic Synthsis: 2-lvl Multi-lvl FSM CAD tools for multi-lvl logic synthsis:
More informationEEO 401 Digital Signal Processing Prof. Mark Fowler
EEO 401 Digital Signal Procssing Prof. Mark Fowlr Dtails of th ot St #19 Rading Assignmnt: Sct. 7.1.2, 7.1.3, & 7.2 of Proakis & Manolakis Dfinition of th So Givn signal data points x[n] for n = 0,, -1
More informationEquidistribution and Weyl s criterion
Euidistribution and Wyl s critrion by Brad Hannigan-Daly W introduc th ida of a sunc of numbrs bing uidistributd (mod ), and w stat and prov a thorm of Hrmann Wyl which charactrizs such suncs. W also discuss
More informationThe second condition says that a node α of the tree has exactly n children if the arity of its label is n.
CS 6110 S14 Hanout 2 Proof of Conflunc 27 January 2014 In this supplmntary lctur w prov that th λ-calculus is conflunt. This is rsult is u to lonzo Church (1903 1995) an J. arkly Rossr (1907 1989) an is
More information10. Limits involving infinity
. Limits involving infinity It is known from th it ruls for fundamntal arithmtic oprations (+,-,, ) that if two functions hav finit its at a (finit or infinit) point, that is, thy ar convrgnt, th it of
More informationDifferential Equations
Prfac Hr ar m onlin nots for m diffrntial quations cours that I tach hr at Lamar Univrsit. Dspit th fact that ths ar m class nots, th should b accssibl to anon wanting to larn how to solv diffrntial quations
More informationMor Tutorial at www.dumblittldoctor.com Work th problms without a calculator, but us a calculator to chck rsults. And try diffrntiating your answrs in part III as a usful chck. I. Applications of Intgration
More informationFunction Spaces. a x 3. (Letting x = 1 =)) a(0) + b + c (1) = 0. Row reducing the matrix. b 1. e 4 3. e 9. >: (x = 1 =)) a(0) + b + c (1) = 0
unction Spacs Prrquisit: Sction 4.7, Coordinatization n this sction, w apply th tchniqus of Chaptr 4 to vctor spacs whos lmnts ar functions. Th vctor spacs P n and P ar familiar xampls of such spacs. Othr
More informationNEW APPLICATIONS OF THE ABEL-LIOUVILLE FORMULA
NE APPLICATIONS OF THE ABEL-LIOUVILLE FORMULA Mirca I CÎRNU Ph Dp o Mathmatics III Faculty o Applid Scincs Univrsity Polithnica o Bucharst Cirnumirca @yahoocom Abstract In a rcnt papr [] 5 th indinit intgrals
More information1 Minimum Cut Problem
CS 6 Lctur 6 Min Cut and argr s Algorithm Scribs: Png Hui How (05), Virginia Dat: May 4, 06 Minimum Cut Problm Today, w introduc th minimum cut problm. This problm has many motivations, on of which coms
More informationRecall that by Theorems 10.3 and 10.4 together provide us the estimate o(n2 ), S(q) q 9, q=1
Chaptr 11 Th singular sris Rcall that by Thorms 10 and 104 togthr provid us th stimat 9 4 n 2 111 Rn = SnΓ 2 + on2, whr th singular sris Sn was dfind in Chaptr 10 as Sn = q=1 Sq q 9, with Sq = 1 a q gcda,q=1
More informationSuperposition. Thinning
Suprposition STAT253/317 Wintr 213 Lctur 11 Yibi Huang Fbruary 1, 213 5.3 Th Poisson Procsss 5.4 Gnralizations of th Poisson Procsss Th sum of two indpndnt Poisson procsss with rspctiv rats λ 1 and λ 2,
More informationEECE 301 Signals & Systems Prof. Mark Fowler
EECE 301 Signals & Systms Prof. Mark Fowlr ot St #21 D-T Signals: Rlation btwn DFT, DTFT, & CTFT 1/16 W can us th DFT to implmnt numrical FT procssing This nabls us to numrically analyz a signal to find
More informationRoadmap. XML Indexing. DataGuide example. DataGuides. Strong DataGuides. Multiple DataGuides for same data. CPS Topics in Database Systems
Roadmap XML Indxing CPS 296.1 Topics in Databas Systms Indx fabric Coopr t al. A Fast Indx for Smistructurd Data. VLDB, 2001 DataGuid Goldman and Widom. DataGuids: Enabling Qury Formulation and Optimization
More informationFirst order differential equation Linear equation; Method of integrating factors
First orr iffrntial quation Linar quation; Mtho of intgrating factors Exampl 1: Rwrit th lft han si as th rivativ of th prouct of y an som function by prouct rul irctly. Solving th first orr iffrntial
More informationGEOMETRICAL PHENOMENA IN THE PHYSICS OF SUBATOMIC PARTICLES. Eduard N. Klenov* Rostov-on-Don, Russia
GEOMETRICAL PHENOMENA IN THE PHYSICS OF SUBATOMIC PARTICLES Eduard N. Klnov* Rostov-on-Don, Russia Th articl considrs phnomnal gomtry figurs bing th carrirs of valu spctra for th pairs of th rmaining additiv
More informationSlide 1. Slide 2. Slide 3 DIGITAL SIGNAL PROCESSING CLASSIFICATION OF SIGNALS
Slid DIGITAL SIGAL PROCESSIG UIT I DISCRETE TIME SIGALS AD SYSTEM Slid Rviw of discrt-tim signals & systms Signal:- A signal is dfind as any physical quantity that varis with tim, spac or any othr indpndnt
More informationu x v x dx u x v x v x u x dx d u x v x u x v x dx u x v x dx Integration by Parts Formula
7. Intgration by Parts Each drivativ formula givs ris to a corrsponding intgral formula, as w v sn many tims. Th drivativ product rul yilds a vry usful intgration tchniqu calld intgration by parts. Starting
More informationProbability and Stochastic Processes: A Friendly Introduction for Electrical and Computer Engineers Roy D. Yates and David J.
Probability and Stochastic Procsss: A Frindly Introduction for Elctrical and Computr Enginrs Roy D. Yats and David J. Goodman Problm Solutions : Yats and Goodman,4.3. 4.3.4 4.3. 4.4. 4.4.4 4.4.6 4.. 4..7
More informationSearch sequence databases 3 10/25/2016
Sarch squnc databass 3 10/25/2016 Etrm valu distribution Ø Suppos X is a random variabl with probability dnsity function p(, w sampl a larg numbr S of indpndnt valus of X from this distribution for an
More informationType Systems Winter Semester 2006
Type Systems Winter Semester 2006 Week 7 November 29 November 29, 2006 - version 1.0 Plan PREVIOUSLY: 1. type safety as progress and preservation 2. typed arithmetic expressions 3. simply typed lambda
More information(1) Then we could wave our hands over this and it would become:
MAT* K285 Spring 28 Anthony Bnoit 4/17/28 Wk 12: Laplac Tranform Rading: Kohlr & Johnon, Chaptr 5 to p. 35 HW: 5.1: 3, 7, 1*, 19 5.2: 1, 5*, 13*, 19, 45* 5.3: 1, 11*, 19 * Pla writ-up th problm natly and
More informationSCHUR S THEOREM REU SUMMER 2005
SCHUR S THEOREM REU SUMMER 2005 1. Combinatorial aroach Prhas th first rsult in th subjct blongs to I. Schur and dats back to 1916. On of his motivation was to study th local vrsion of th famous quation
More informationFourier Transforms and the Wave Equation. Key Mathematics: More Fourier transform theory, especially as applied to solving the wave equation.
Lur 7 Fourir Transforms and th Wav Euation Ovrviw and Motivation: W first discuss a fw faturs of th Fourir transform (FT), and thn w solv th initial-valu problm for th wav uation using th Fourir transform
More information3 2x. 3x 2. Prepared by Vince Zaccone For Campus Learning Assistance Services at UCSB
Math B Intgration Rviw (Solutions) Do ths intgrals. Solutions ar postd at th wbsit blow. If you hav troubl with thm, sk hlp immdiatly! () 8 d () 5 d () d () sin d (5) d (6) cos d (7) d www.clas.ucsb.du/staff/vinc
More informationEstimation of apparent fraction defective: A mathematical approach
Availabl onlin at www.plagiarsarchlibrary.com Plagia Rsarch Library Advancs in Applid Scinc Rsarch, 011, (): 84-89 ISSN: 0976-8610 CODEN (USA): AASRFC Estimation of apparnt fraction dfctiv: A mathmatical
More informationHomework #3. 1 x. dx. It therefore follows that a sum of the
Danil Cannon CS 62 / Luan March 5, 2009 Homwork # 1. Th natural logarithm is dfind by ln n = n 1 dx. It thrfor follows that a sum of th 1 x sam addnd ovr th sam intrval should b both asymptotically uppr-
More informationSelf-Adjointness and Its Relationship to Quantum Mechanics. Ronald I. Frank 2016
Ronald I. Frank 06 Adjoint https://n.wikipdia.org/wiki/adjoint In gnral thr is an oprator and a procss that dfin its adjoint *. It is thn slf-adjoint if *. Innr product spac https://n.wikipdia.org/wiki/innr_product_spac
More informationCPSC 665 : An Algorithmist s Toolkit Lecture 4 : 21 Jan Linear Programming
CPSC 665 : An Algorithmist s Toolkit Lctur 4 : 21 Jan 2015 Lcturr: Sushant Sachdva Linar Programming Scrib: Rasmus Kyng 1. Introduction An optimization problm rquirs us to find th minimum or maximum) of
More informationAbstract Interpretation. Lecture 5. Profs. Aiken, Barrett & Dill CS 357 Lecture 5 1
Abstract Intrprtation 1 History On brakthrough papr Cousot & Cousot 77 (?) Inspird by Dataflow analysis Dnotational smantics Enthusiastically mbracd by th community At last th functional community... At
More informationEXST Regression Techniques Page 1
EXST704 - Rgrssion Tchniqus Pag 1 Masurmnt rrors in X W hav assumd that all variation is in Y. Masurmnt rror in this variabl will not ffct th rsults, as long as thy ar uncorrlatd and unbiasd, sinc thy
More informationThe Equitable Dominating Graph
Intrnational Journal of Enginring Rsarch and Tchnology. ISSN 0974-3154 Volum 8, Numbr 1 (015), pp. 35-4 Intrnational Rsarch Publication Hous http://www.irphous.com Th Equitabl Dominating Graph P.N. Vinay
More informationLR(0) Analysis. LR(0) Analysis
LR() Analysis LR() Conlicts: Introuction Whn constructing th LR() analysis tal scri in th prvious stps, it has not n possil to gt a trministic analysr, caus thr ar svral possil actions in th sam cll. I
More informationCombinatorial Networks Week 1, March 11-12
1 Nots on March 11 Combinatorial Ntwors W 1, March 11-1 11 Th Pigonhol Principl Th Pigonhol Principl If n objcts ar placd in hols, whr n >, thr xists a box with mor than on objcts 11 Thorm Givn a simpl
More informationCalculus II Solutions review final problems
Calculus II Solutions rviw final problms MTH 5 Dcmbr 9, 007. B abl to utiliz all tchniqus of intgration to solv both dfinit and indfinit intgrals. Hr ar som intgrals for practic. Good luck stuing!!! (a)
More informationA. Limits and Horizontal Asymptotes ( ) f x f x. f x. x "±# ( ).
A. Limits and Horizontal Asymptots What you ar finding: You can b askd to find lim x "a H.A.) problm is asking you find lim x "# and lim x "$#. or lim x "±#. Typically, a horizontal asymptot algbraically,
More informationLie Groups HW7. Wang Shuai. November 2015
Li roups HW7 Wang Shuai Novmbr 015 1 Lt (π, V b a complx rprsntation of a compact group, show that V has an invariant non-dgnratd Hrmitian form. For any givn Hrmitian form on V, (for xampl (u, v = i u
More informationExam 1. It is important that you clearly show your work and mark the final answer clearly, closed book, closed notes, no calculator.
Exam N a m : _ S O L U T I O N P U I D : I n s t r u c t i o n s : It is important that you clarly show your work and mark th final answr clarly, closd book, closd nots, no calculator. T i m : h o u r
More informationBINOMIAL COEFFICIENTS INVOLVING INFINITE POWERS OF PRIMES. 1. Statement of results
BINOMIAL COEFFICIENTS INVOLVING INFINITE POWERS OF PRIMES DONALD M. DAVIS Abstract. If p is a prim and n a positiv intgr, lt ν p (n dnot th xponnt of p in n, and u p (n n/p νp(n th unit part of n. If α
More informationMATH 319, WEEK 15: The Fundamental Matrix, Non-Homogeneous Systems of Differential Equations
MATH 39, WEEK 5: Th Fundamntal Matrix, Non-Homognous Systms of Diffrntial Equations Fundamntal Matrics Considr th problm of dtrmining th particular solution for an nsmbl of initial conditions For instanc,
More informationGeneral Notes About 2007 AP Physics Scoring Guidelines
AP PHYSICS C: ELECTRICITY AND MAGNETISM 2007 SCORING GUIDELINES Gnral Nots About 2007 AP Physics Scoring Guidlins 1. Th solutions contain th most common mthod of solving th fr-rspons qustions and th allocation
More informationEEO 401 Digital Signal Processing Prof. Mark Fowler
EEO 401 Digital Signal Procssing Prof. Mark Fowlr ot St #18 Introduction to DFT (via th DTFT) Rading Assignmnt: Sct. 7.1 of Proakis & Manolakis 1/24 Discrt Fourir Transform (DFT) W v sn that th DTFT is
More informationAssociation (Part II)
Association (Part II) nanopoulos@ismll.d Outlin Improving Apriori (FP Growth, ECLAT) Qustioning confidnc masur Qustioning support masur 2 1 FP growth Algorithm Us a comprssd rprsntation of th dtb databas
More informationCalculus II (MAC )
Calculus II (MAC232-2) Tst 2 (25/6/25) Nam (PRINT): Plas show your work. An answr with no work rcivs no crdit. You may us th back of a pag if you nd mor spac for a problm. You may not us any calculators.
More informationFirst derivative analysis
Robrto s Nots on Dirntial Calculus Chaptr 8: Graphical analysis Sction First drivativ analysis What you nd to know alrady: How to us drivativs to idntiy th critical valus o a unction and its trm points
More informationAim To manage files and directories using Linux commands. 1. file Examines the type of the given file or directory
m E x. N o. 3 F I L E M A N A G E M E N T Aim To manag ils and dirctoris using Linux commands. I. F i l M a n a g m n t 1. il Examins th typ o th givn il or dirctory i l i l n a m > ( o r ) < d i r c t
More informationConstruction of asymmetric orthogonal arrays of strength three via a replacement method
isid/ms/26/2 Fbruary, 26 http://www.isid.ac.in/ statmath/indx.php?modul=prprint Construction of asymmtric orthogonal arrays of strngth thr via a rplacmnt mthod Tian-fang Zhang, Qiaoling Dng and Alok Dy
More informationCoupled Pendulums. Two normal modes.
Tim Dpndnt Two Stat Problm Coupld Pndulums Wak spring Two normal mods. No friction. No air rsistanc. Prfct Spring Start Swinging Som tim latr - swings with full amplitud. stationary M +n L M +m Elctron
More informationLecture 37 (Schrödinger Equation) Physics Spring 2018 Douglas Fields
Lctur 37 (Schrödingr Equation) Physics 6-01 Spring 018 Douglas Filds Rducd Mass OK, so th Bohr modl of th atom givs nrgy lvls: E n 1 k m n 4 But, this has on problm it was dvlopd assuming th acclration
More informationClassical Magnetic Dipole
Lctur 18 1 Classical Magntic Dipol In gnral, a particl of mass m and charg q (not ncssarily a point charg), w hav q g L m whr g is calld th gyromagntic ratio, which accounts for th ffcts of non-point charg
More information10. The Discrete-Time Fourier Transform (DTFT)
Th Discrt-Tim Fourir Transform (DTFT Dfinition of th discrt-tim Fourir transform Th Fourir rprsntation of signals plays an important rol in both continuous and discrt signal procssing In this sction w
More informationIntroduction to the Fourier transform. Computer Vision & Digital Image Processing. The Fourier transform (continued) The Fourier transform (continued)
Introduction to th Fourir transform Computr Vision & Digital Imag Procssing Fourir Transform Lt f(x) b a continuous function of a ral variabl x Th Fourir transform of f(x), dnotd by I {f(x)} is givn by:
More information(Upside-Down o Direct Rotation) β - Numbers
Amrican Journal of Mathmatics and Statistics 014, 4(): 58-64 DOI: 10593/jajms0140400 (Upsid-Down o Dirct Rotation) β - Numbrs Ammar Sddiq Mahmood 1, Shukriyah Sabir Ali,* 1 Dpartmnt of Mathmatics, Collg
More informationCOHORT MBA. Exponential function. MATH review (part2) by Lucian Mitroiu. The LOG and EXP functions. Properties: e e. lim.
MTH rviw part b Lucian Mitroiu Th LOG and EXP functions Th ponntial function p : R, dfind as Proprtis: lim > lim p Eponntial function Y 8 6 - -8-6 - - X Th natural logarithm function ln in US- log: function
More informationNote If the candidate believes that e x = 0 solves to x = 0 or gives an extra solution of x = 0, then withhold the final accuracy mark.
. (a) Eithr y = or ( 0, ) (b) Whn =, y = ( 0 + ) = 0 = 0 ( + ) = 0 ( )( ) = 0 Eithr = (for possibly abov) or = A 3. Not If th candidat blivs that = 0 solvs to = 0 or givs an tra solution of = 0, thn withhold
More informationProblem Set 6 Solutions
6.04/18.06J Mathmatics for Computr Scinc March 15, 005 Srini Dvadas and Eric Lhman Problm St 6 Solutions Du: Monday, March 8 at 9 PM in Room 3-044 Problm 1. Sammy th Shark is a financial srvic providr
More informationBINOMIAL COEFFICIENTS INVOLVING INFINITE POWERS OF PRIMES
BINOMIAL COEFFICIENTS INVOLVING INFINITE POWERS OF PRIMES DONALD M. DAVIS Abstract. If p is a prim (implicit in notation and n a positiv intgr, lt ν(n dnot th xponnt of p in n, and U(n n/p ν(n, th unit
More informationY 0. Standing Wave Interference between the incident & reflected waves Standing wave. A string with one end fixed on a wall
Staning Wav Intrfrnc btwn th incint & rflct wavs Staning wav A string with on n fix on a wall Incint: y, t) Y cos( t ) 1( Y 1 ( ) Y (St th incint wav s phas to b, i.., Y + ral & positiv.) Rflct: y, t)
More informationIntroduction to Condensed Matter Physics
Introduction to Condnsd Mattr Physics pcific hat M.P. Vaughan Ovrviw Ovrviw of spcific hat Hat capacity Dulong-Ptit Law Einstin modl Dby modl h Hat Capacity Hat capacity h hat capacity of a systm hld at
More informationHydrogen Atom and One Electron Ions
Hydrogn Atom and On Elctron Ions Th Schrödingr quation for this two-body problm starts out th sam as th gnral two-body Schrödingr quation. First w sparat out th motion of th cntr of mass. Th intrnal potntial
More informationSome remarks on Kurepa s left factorial
Som rmarks on Kurpa s lft factorial arxiv:math/0410477v1 [math.nt] 21 Oct 2004 Brnd C. Kllnr Abstract W stablish a connction btwn th subfactorial function S(n) and th lft factorial function of Kurpa K(n).
More information10. EXTENDING TRACTABILITY
Coping with NP-compltnss 0. EXTENDING TRACTABILITY ining small vrtx covrs solving NP-har problms on trs circular arc covrings vrtx covr in bipartit graphs Q. Suppos I n to solv an NP-complt problm. What
More informationa 1and x is any real number.
Calcls Nots Eponnts an Logarithms Eponntial Fnction: Has th form y a, whr a 0, a an is any ral nmbr. Graph y, Graph y ln y y Th Natral Bas (Elr s nmbr): An irrational nmbr, symboliz by th lttr, appars
More informationCh. 24 Molecular Reaction Dynamics 1. Collision Theory
Ch. 4 Molcular Raction Dynamics 1. Collision Thory Lctur 16. Diffusion-Controlld Raction 3. Th Matrial Balanc Equation 4. Transition Stat Thory: Th Eyring Equation 5. Transition Stat Thory: Thrmodynamic
More informationMATH 1080 Test 2-SOLUTIONS Spring
MATH Tst -SOLUTIONS Spring 5. Considr th curv dfind by x = ln( 3y + 7) on th intrval y. a. (5 points) St up but do not simplify or valuat an intgral rprsnting th lngth of th curv on th givn intrval. =
More information22/ Breakdown of the Born-Oppenheimer approximation. Selection rules for rotational-vibrational transitions. P, R branches.
Subjct Chmistry Papr No and Titl Modul No and Titl Modul Tag 8/ Physical Spctroscopy / Brakdown of th Born-Oppnhimr approximation. Slction ruls for rotational-vibrational transitions. P, R branchs. CHE_P8_M
More information4 x 4, and. where x is Town Square
Accumulation and Population Dnsity E. A city locatd along a straight highway has a population whos dnsity can b approimatd by th function p 5 4 th distanc from th town squar, masurd in mils, whr 4 4, and
More informationPolymorphic type inference and assignment
Proc. 18th Symp. Principls of Programming Languags, 1991, pags 291 302. Polymorphic typ infrnc and assignmnt Abstract Xavir Lroy Ecol Normal Supériur W prsnt a nw approach to th polymorphic typing of data
More informationOn the Hamiltonian of a Multi-Electron Atom
On th Hamiltonian of a Multi-Elctron Atom Austn Gronr Drxl Univrsity Philadlphia, PA Octobr 29, 2010 1 Introduction In this papr, w will xhibit th procss of achiving th Hamiltonian for an lctron gas. Making
More information1 Isoparametric Concept
UNIVERSITY OF CALIFORNIA BERKELEY Dpartmnt of Civil Enginring Spring 06 Structural Enginring, Mchanics and Matrials Profssor: S. Govindj Nots on D isoparamtric lmnts Isoparamtric Concpt Th isoparamtric
More informationME 321 Kinematics and Dynamics of Machines S. Lambert Winter 2002
3.4 Forc Analysis of Linkas An undrstandin of forc analysis of linkas is rquird to: Dtrmin th raction forcs on pins, tc. as a consqunc of a spcifid motion (don t undrstimat th sinificanc of dynamic or
More informationExercise 1. Sketch the graph of the following function. (x 2
Writtn tst: Fbruary 9th, 06 Exrcis. Sktch th graph of th following function fx = x + x, spcifying: domain, possibl asymptots, monotonicity, continuity, local and global maxima or minima, and non-drivability
More information