shift/reset [13] 2 shift / reset shift reset k call/cc reset shift k shift (...) k 1 + shift(fun k -> 2 * (k 3)) k 2 * (1 + 3) 8 reset shift reset (..
|
|
|
- さや さだい
- 5 years ago
- Views:
Transcription
1 shift / reset CPS shift / reset CPS CPS 1 [3, 5] goto try/catch raise call/cc [17] control/prompt [8], shift/reset [5] control/prompt, shift/reset call/cc (continuationpassing style : CPS) call/cc [9] CPS shift/reset CPS SECD [12] shift/reset Danvy [7] SECD direct style CPS SECD bisimulation Ager [2] CPS CEK shift/reset Danvy [4] Danvy SECD CEK shift/reset Ager [1] [10] backquote unquote λ Ager shift/reset
2 shift/reset [13] 2 shift / reset shift reset k call/cc reset shift k shift (...) k 1 + shift(fun k -> 2 * (k 3)) k 2 * (1 + 3) 8 reset shift reset (...) shift 1 + reset(4 + shift(fun k -> 2 * (k 3))) 4 k 1 + (2 * (4 + 3)) 15 1 reset shift 3 CPS syntax t ::= x λx. t t 0 t 1 shift(t) reset(t) shift reset [x, t, e] shift [c] v ::= [x, t, e] [c] OCaml 1 (* *) 2 type t = Var of string (* *) 3 Fun of string * t (* *) 4 App of t * t (* *) 5 Shift of t (* shift *) 6 Reset of t (* reset *) 7 (* *) 8 type v = VFun of string * t * e (* *) 9 VCont of c (* *) 10 (* *) 11 and e = ( string * v) list 12 (* *) 13 and c = ( v -> v) x v get(x, e) e x v shift/reset eval1 [6] 1 (* id : v -> v *) 2 let id x = x 3 4 (* eval : t * e * c -> v *) 5 let rec eval (t, e, c) = match t with 6 Var (x) -> c ( get (x, e)) 7 Fun (x, t) -> c ( VFun (x, t, e)) 8 App (t0, t1) -> eval (t1, e, ( fun v1 9 -> eval (t0, e, ( fun v0 10 -> ( match v0 with 11 ( VFun (x, t, e )) -> eval (t, (x, v1) :: e, c) 12 ( VCont (c )) -> c (c v1) ))))) 13 Shift (t) -> eval (t, e, ( fun v 14 -> ( match v with 15 ( VFun (x, t, e )) -> eval (t, (x, VCont (c)) :: e, id) 16 ( VCont (c )) -> c ( VCont (c ))) )) 17 Reset (t) -> c ( eval (t, e, id )) (* eval1 : t -> v *) 20 let eval1 t = eval (t, [], id)
3 CPS shift/reset shift 17 reset shift VCont(c) Shift t reset id shift shift/reset shift/reset 4 CPS eval1 shift/reset 12, 17 eval1 CPS eval2 1 type v = (* *) (* *) 2 and e = (* *) (* *) 3 and c = ((v * d) -> v) (* *) 4 and d = ( v -> v) eval2 1 (* cid : v * d -> v *) 2 (* did : v -> v *) 3 let cid (v, d) = d v 4 let did x = x 5 6 (* eval : t * e * c * d -> v *) 7 let rec eval (t, e, c, d) = match t with 8 Var (x) -> c ( get (x, e), d) 9 Fun (x, t) -> c ( VFun (x, t, e), d) 10 App (t0, t1) 11 -> eval (t1, e, ( fun (v1, d1) 12 -> eval (t0, e, ( fun (v0, d0) 13 -> ( match v0 with 14 ( VFun (x, t, e )) -> eval (t, (x, v1) :: e, c, d0) 15 ( VCont (c )) -> c (v1, ( fun v -> c (v, d0 ))))), d1 )), d) 16 Shift ( t) 17 -> eval (t, e, ( fun (v, d ) 18 -> ( match v with 19 ( VFun (x, t, e )) -> eval (t, (x, VCont (c)) :: e, cid, d ) 20 ( VCont (c )) -> c ( VCont (c), d ))), d) 21 Reset (t) -> eval (t, e, cid, ( fun v -> c (v, d ))) (* eval2 : t -> v *) 24 let eval2 t = eval (t, [], cid, did ) eval1 CPS c CPS c d CPS 4.1 (CPS [16]). t eval1 eval2 t eval1 CPS t eval2 5 eval2 CPS eval2 [16] eval3 (OCaml fun ) (apply run * )
4 eval2 Shift OCaml fun fun body c c eval2 c Shift fun c fun body 1 type v = (* *) (* *) 2 and e = (* *) (* *) 3 (* *) 4 and c = CApp1 of t * e * c (* A p p fun *) 5 CApp0 of v * c (* A p p fun *) 6 CShift of c (* S h i f t fun *) 7 CReset (* c id *) 8 and d = DRun of c * d (* R e s e t d fun *) 9 DReset (* d id *) eval2 fun 1 (* run_c : c * v * d -> v *) 2 let rec run_c (c, v, d) = match c with 3 CApp1 (t, e, c ) -> eval (t, e, CApp0 (v, c ), d) 4 CApp0 (v, c ) -> ( match v with 5 VFun (x, t, e ) -> eval (t, (x, v ) :: e, c, d) 6 VCont (c ) -> run_c (c, v, DRun (c, d ))) 7 CShift (c ) -> ( match v with 8 VFun (x, t, e ) -> eval (t, (x, VCont (c )) :: e, CReset, d) 9 VCont (c ) -> run_c (c, VCont (c ), d)) 10 CReset -> run_d (d, v) 11 (* run_d : d * v -> v *) 12 and run_d (d, v) = match d with 13 DRun (c, d ) -> run_c (c, v, d ) 14 DReset -> v fun eval2 8 Var c c eval3 Var run c (c, get(x, e), d) d eval3 1 (* cid : c *) 2 (* did : d *) 3 let cid = CReset 4 let did = DReset 5 6 (* eval : t * e * c * d -> v *) 7 let rec eval (t, e, c, d) = match t with 8 Var (x) -> run_c (c, get (x, e), d) 9 Fun (x, t) -> run_c (c, VFun (x, t, e), d) 10 App (t0, t1) -> eval (t1, e, CApp1 (t0, e, c), d) 11 Shift (t) -> eval (t, e, CShift (c), d) 12 Reset (t) -> eval (t, e, cid, DRun (c, d)) (* eval3 : t -> v *) 15 let eval3 t = eval (t, [], cid, did ) OCaml fun 5.1 ( [16] ).
5 t eval2 eval3 t eval2 t eval3 6 eval3 eval3 c eval4 c c c c. eval3 c head c tail c. eval4 1: eval3 eval4 eval3 c CApp1, CApp0, CShift c c c c c tail c CReset d c d 1 (* *) 2 type v = VFun of string * t * e 3 VCont of c list (* c c list *) 4 and e = (* *) (* *) 5 (* *) 6 and c = CApp1 of t * e (* c c *) 7 CApp0 of v (* c CReset *) 8 CShift (* *) 9 and d = DRun of c list (* d d *) eval4 1 (* identity function *) 2 (* cid : c list *) 3 (* did : d list *) 4 let cid = [] 5 let did = [] 6 7 (* eval : t * e * c list * d list -> v *) 8 let rec eval (t, e, c, d) = match t with 9 Var (x) -> run_c (c, get (x, e), d) 10 Fun (x, t) -> run_c (c, VFun (x, t, e), d) 11 App (t0, t1) -> eval (t1, e, CApp1 (t0, e) :: c, d) 12 Shift ( t) -> eval (t, e, CShift :: c, d) 13 Reset ( t) -> eval (t, e, cid, DRun ( c) :: d) (* run_c : c list * v * d list -> v *)
6 16 and run_c (c, v, d) = match c with 17 CApp1 (t, e ) :: c -> eval (t, e, CApp0 (v) :: c, d) 18 CApp0 (v ) :: c -> ( match v with 19 VFun (x, t, e ) -> eval (t, (x, v ) :: e, c, d) 20 VCont (c ) -> run_c (c, v, DRun (c ) :: d)) 21 CShift :: c -> ( match v with 22 VFun (x, t, e ) -> eval (t, (x, VCont (c )) :: e, cid, d) 23 VCont (c ) -> run_c (c, VCont (c ), d)) 24 [] -> run_d (d, v) (* run_d : d list * v -> v *) 27 and run_d (d, v) = match d with 28 DRun (c ) :: d -> run_c (c, v, d ) 29 [] -> v (* eval4 : t -> v *) 32 let eval4 t = eval (t, [], cid, did ) c c list d d list 11, 12, 17 eval3 eval4 13 CReset (cid) Reset DRun(c) d list reset c d d shift/reset reset shift reset shift eval3 eval4 eval3 eval4 eval3 eval4 6.1 ( ). t eval3 eval4 t eval3 t eval eval4 CApp0 v eval5 c list 1 (* *) 2 type v = VFun of string * t * e 3 VCont of (c list ) * s (* c list *) 4 (* *) 5 and s = v list (* *) 6 and e = (* *) (* *) 7 (* *) 8 and c = CApp1 of t * e 9 CApp0 (* *) 10 CShift 11 and d = DRun of (c list ) * s (* c list *)
7 CApp0(v) v v CApp0 c list (c list) * s VCont DRun s run c run d run c run d eval5 1 (* cid : c list *) 2 (* did : d list *) 3 let cid = [] 4 let did = [] 5 6 (* eval : t * s * e * c * d -> v *) 7 let rec eval (t, s, e, c, d) = match t with 8 Var ( x) -> run_c (c, get (x, e) :: s, d) 9 Fun (x, t) -> run_c (c, VFun (x, t, e) :: s, d) 10 App (t0, t1) -> eval (t1, s, e, CApp1 (t0, e) :: c, d) 11 Shift ( t) -> eval (t, s, e, CShift :: c, d) 12 Reset (t) -> eval (t, [], e, cid, DRun (c, s) :: d) (* run_c : c * s * d -> v *) 15 and run_c (c, s, d) = match c with 16 CApp1 (t, e ) :: c -> eval (t, s, e, CApp0 :: c, d) 17 CApp0 :: c -> 18 ( match s with 19 VFun (x, t, e ) :: v :: s -> eval (t, s, (x, v ) :: e, c, d) 20 VCont (c, s ) :: v :: s -> run_c (c, v :: s, DRun (c, s ) :: d)) 21 CShift :: c -> 22 ( match s with 23 VFun (x, t, e ) :: s -> eval (t, [], (x, VCont (c, s )) :: e, cid, d) 24 VCont (c, s ) :: s -> run_c (c, VCont (c, s ) :: s, d)) 25 [] -> run_d (d, s) (* run_d : d * s -> v *) 28 and run_d (d, s) = match (d, s) with 29 ( DRun (c, s ) :: d, v :: s ) -> run_c (c, v :: s, d ) 30 ([], v :: s ) -> v (* eval5 : t -> v *) 33 let eval5 t = eval (t, [], [], cid, did ) s 8, 9 eval4 20, 24, 29 VCont DRun 29, 30 (s ) 7.2 eval4 eval5 eval4 eval5 bisimulation bisimulation 7.1 (bisimulation [14]). P Q P, Q bisimulation P P P Q Q P Q Q Q Q Q P P P Q P
8 bisimulation eval4 eval5 eval4 9 eval Var(x) run c (c, get(x, e), d) Var(x), e 4, c 4, d 4 c 4, get(x, e 4 ), d 4 eval, run c, run d run d t, e, c, d, c, v, d, d, v, v eval4 2 t t, [], [], [] Var(x), e, c, d c, get(x, e), d Fun(x, t), e, c, d c, VFun(x, t, e), d App(t0, t1), e, c, d t1, e, CApp1(t0, e) :: c, d Shift(t), e, c, d t, e, CShift :: c, d Reset(t), e, c, d t, e, [], DRun(c) :: d CApp1(t, e) :: c, v, d t, e, CApp0(v) :: c, d CApp0(v) :: c, VFun(x, t, e), d t, (x, v) :: e, c, d CApp0(v) :: c, VCont(c ), d c, v, DRun(c) :: d CShift :: c, VFun(x, t, e), d t, (x, VCont(c)) :: e, [], d CShift :: c, VCont(c ), d c, VCont(c), d [], v, d d, v DRun(c ) :: d, v c, v, d [], v v 2: eval4 eval5 t, s, e, c, d, c, s, d, d, s, v 3 t t, [], [], [], [] Var(x), s, e, c, d c, get(x, e) :: s, d Fun(x, t), s, e, c, d c, VFun(x, t, e) :: s, d App(t0, t1), s, e, c, d t1, s, e, CApp1(t0, e) :: c, d Shift(t), s, e, c, d t, s, e, CShift :: c, d Reset(t), s, e, c, d t, [], e, [], DRun(c, s) :: d CApp1(t, e) :: c, s, d t, s, e, CApp0 :: c, d CApp0 :: c, VFun(x, t, e) :: v :: s, d t, s, (x, v) :: e, c, d CApp0 :: c, VCont(c, s ) :: v :: s, d c, v :: s, DRun(c, s) :: d CShift :: c, VFun(x, t, e) :: s, d t, [], (x, VCont(c, s)) :: e, [], d CShift :: c, VCont(c, s ) :: s, d c, VCont(c, s) :: s, d [], s, d d, s DRun(c, s ) :: d, v :: s c, v :: s, d [], v :: s v 3: eval5 eval4 eval5 bisimulation eval4 eval5 eval4 eval5 eval4 c 4 eval5 s c 5 = s c 4 = s s c 5 c 4 s c 5 = s eval4 eval5
9 7.2 ( = s ). eval4 S 4 eval5 S 5 t, e 4, c 4, d 4 S 4, c 4, v 4, d 4 S 4, t, s, e 5, c 5, d 5 S 5, c 5, v 5 :: s, d 5 S 5 = s (i) c 4 = [], s = [], c 5 = [] c 4 = s s c 5 (ii) c 4 = s s c 5, e 4 = s e 5 c 4 = CApp1 4 (t, e 4 ) :: c 4, c 5 = CApp1 5 (t, e 5 ) :: c 5 c 4 = s s c 5 (iii) c 4 = s s c 5, v 4 = s v 5 c 4 = CApp0 4 (v 4 ) :: c 4, c 5 = CApp0 5 :: c 5 c 4 = s (v 5 :: s) c 5 (iv) c 4 = s s c 5 c 4 = CShift 4 :: c 4, c 5 = CShift 5 :: c 5 c 4 = s s c 5 c 4 = s s c 5 VCont 4 (c 4 ) = s VCont 5 (s, c 5 ), DRun 4 (c 4 ) = s DRun 5 (c 5, s) = s 7.2 (iii) c 4 CApp0 4 (v 4 ) v 4 c 5 CApp0 5 v 5 s = s eval4 eval5 s bisimulation 7.1 ( bisimulation). c 4 = s s c 5, e 4 = s e 5, d 4 = s d 5, v 4 = s v 5 t, e 4, c 4, d 4 s t, s, e 5, c 5, d 5 c 4 = s s c 5, d 4 = s d 5, v 4 = s v 5 c 4, v 4, d 4 s c 5, v 5 :: s, d 5 d 4 = s d 5, v 4 = s v 5 d 4, v 4 s d 5, v 5 :: s v 4 = s v 5 v 4 s v 5 s bisimulation. P S 4, Q S 5 P s Q P eval4 P Q eval5 Q P s Q Q Q eval5 Q P eval4 P P s Q P [11] eval4 eval5 bisimulation 7.2 ( ). t eval4 eval5 ( t eval4 v 4 eval5 v 5 v 4 = s v 5 ) Biernacka [4] Danvy [7] shift/reset eval5
10 8 8.1 eval5 c e (10 ) c list eval6 CApp1 1 (* *) 2 type v = VFun of string * t * e 3 VCont of ( c list ) * s 4 VEnv of e (* *) 5 and s = (* *) (* *) 6 and e = (* *) (* *) 7 (* *) 8 and c = CApp1 of t (* *) 9 CApp0 10 CShift 11 and d = (* *) CApp1 e VEnv(e) CApp1 eval6 1 (* cid : c list *) 2 (* did : d list *) 3 let cid = [] 4 let did = [] 5 6 (* eval : t * s * e * c list * d list -> v *) 7 let rec eval (t, s, e, c, d) = match t with 8 Var ( x) -> run_c (c, get (x, e) :: s, d) 9 Fun (x, t) -> run_c (c, VFun (x, t, e) :: s, d) 10 App (t0, t1) -> eval (t1, VEnv (e) :: s, e, CApp1 (t0) :: c, d) 11 Shift ( t) -> eval (t, s, e, CShift :: c, d) 12 Reset (t) -> eval (t, [], e, CReset :: [], DRun (c, s) :: d) (* run_c : c list * s * d -> v *) 15 and run_c (c, s, d) = match c with 16 CApp1 (t ) :: c -> 17 ( match s with 18 v :: VEnv (e ) :: s -> eval (t, v :: s, e, CApp0 :: c, d)) 19 CApp0 :: c -> 20 ( match s with 21 VFun (x, t, e ) :: v :: s -> eval (t, s, (x, v ) :: e, c, d) 22 VCont (c, s ) :: v :: s -> run_c (c, v :: s, DRun (c, s ) :: d)) 23 CShift :: c -> 24 ( match s with 25 VFun (x, t, e ) :: s 26 -> eval (t, [], (x, VCont (c, s )) :: e, CReset :: [], d) 27 VCont (c, s ) :: s -> run_c (c, VCont (c, s ) :: s, d)) 28 CReset :: _ -> run_d (d, s) (* run_d : d list * s -> v *) 31 and run_d (d, s) = match (d, s) with 32 ( DRun (c, s ) :: d, v :: s ) -> run_c (c, v :: s, d ) 33 ( DReset :: _, v :: s ) -> v (* eval6 : t -> v *) 36 let eval6 t = eval (t, [], [], cid, did ) App 10 VEnv t1
11 t1 CApp1(t0) t (t) 8.2 eval5 eval, run c, run d run d t, s, e, c, d, c, s, d, d, s, v eval5 7.2 eval6 t, s, e, c, d, c, s, d, d, s, v 4 t t, [], [], [], [] Var(x), s, e, c, d c, get(x, e) :: s, d Fun(x, t), s, e, c, d c, VFun(x, t, e) :: s, d App(t0, t1), s, e, c, d t1, VEnv(e) :: s, e, CApp1(t0) :: c, d Shift(t), s, e, c, d t, s, e, CShift :: c, d Reset(t), s, e, c, d t, [], e, [], DRun(c, s) :: d CApp1(t) :: c, v :: VEnv(e) :: s, d t, v :: s, e, CApp0 :: c, d CApp0 :: c, VFun(x, t, e) :: v :: s, d t, s, (x, v) :: e, c, d CApp0 :: c, VCont(c, s ) :: v :: s, d c, v :: s, DRun(c, s) :: d CShift :: c, VFun(x, t, e) :: s, d t, [], (x, VCont(c, s)) :: e, [], d CShift :: c, VCont(c, s ) :: s, d c, VCont(c, s) :: s, d [], s, d d, s DRun(c, s ) :: d, v :: s c, v :: s, d [], v :: s v 4: eval6 bisimulation eval5 eval6 eval5 c eval6 eval5 s 5, c 5, eval6 s 6, c 6 c 5 s 6, c 6 s 5 c 5 = e s 6 c 6 = e eval5 eval6 8.1 ( = e ). eval5 S 5 eval6 S 6 t, s 5, e 5, c 5, d 5 S 5, c 5, v 5 :: s 5, d 5 S 5, t, s 6, e 6, c 6, d 6 S 6, c 6, v 6 :: s 6, d 6 S 6 = e (i) s 5 = [], c 5 = [], s 6 = [], c 6 = [] s 5 c 5 = e s 6 c 6 (ii) s 5 c 5 = e s 6 c 6 e 5 = e e 6 c 5 = CApp1 5 (t, e 5 ) :: c 5, c 6 = CApp1 6 (t) :: c 6 s 5 c 5 = e (VEnv(e 6 ) :: s 6 ) c 6 (iii) s 5 c 5 = e s 6 c 6 c 5 = CApp0 5 :: c 5, c 6 = CApp0 6 :: c 6 (v 5 :: s 5 ) c 5 = e (v 6 :: s 6 ) c 6
12 (iv) s 5 c 5 = e s 6 c 6 c 5 = CShift 5 :: c 5, c 6 = CShift 6 :: c 6 s 5 c 5 = e s 6 c 6 s 5 c 5 = e s 6 c 6 VCont 5 (c 5, s 5 ) = e VCont 6 (c 6, s 6 ), DRun 5 (c 5, s 5 ) = e DRun 6 (c 6, s 6 ) = e 8.1 (ii) c 5 CApp1 5 (t, e 5 ) c 6 CApp1 6 (t) VEnv(e 6 ) s 6 = e eval5 eval6 bisimulation 8.1 ( bisimulation). s 5 c 5 = e s 6 c 6, e 5 = e e 6, d 5 = e d 6, v 5 = e v 6 t, s 5, e 5, c 5, d 5 e t, s 6, e 6, c 6, d 6 s 5 c 5 = e s 6 c 6, d 5 = e d 6, v 5 = e v 6 c 5, v 5 :: s 5, d 5 e c 6, v 6 :: s 6, d 6 d 5 = e d 6, v 5 = e v 6 d 5, v 5 :: s 5 e d 6, v 6 :: s 6 v 5 = e v 6 v 5 e v 6 e bisimulation. P S 5, Q S 6 P s Q P eval5 P Q eval6 Q P s Q Q Q eval6 Q P eval5 P P s Q P 7.1 [11] eval5 eval6 bisimulation 8.2 ( ). t eval5 eval6 ( t eval5 v 5 eval6 v 6 v 5 = e v 6 ) CPS 3 Danvy shift/reset 9 eval6 4 t, s, e, c, d Landin SECD [12] shift/reset t1 t0
13 t1 shift/reset ( s d append shift reset CShift VCont [13] shift shift/reset shift s v v VCont(c, s) VCont index 10 shift/reset CPS CPS t, s, e, c, d shift/reset Landin SECD shift/reset shift/reset shift reset shift/reset shift/reset Ager [1] i i shift/reset shift/reset [1] M. S. Ager, D. Biernacki, O. Danvy, and J. Midtgaard: From Interpreter to Compiler and Virtual Machine: A Functional Derivation, Technical Report RS-03-14, BRICS, Aarhus, Denmark (March 2003).
14 [2] M. S. Ager, D. Biernacki, O. Danvy, and J. Midtgaard: A Functional Correspondence between Evaluators and Abstract Machines, Technical Report RS-03-13, BRICS, Aarhus, Denmark (March 2003). [3] K. Asai, and Y. Kameyama: Polymorphic Delimited Continuations, Proceedings of the Fifth Asian Symposium on Programming Languages and Systems (APLAS 07), LNCS 4807, pp (November 2007). [4] M. Biernacka, D. Biernacki, and O. Danvy An Operational Foundation for Deliminated Continuations in the CPS Hierarchy, Logical Methods in Computer Science, Vol. 1 (2:5), pp (November 2005). [5] O. Danvy, and A. Filinski: A Functional Abstraction of Typed Contexts, Technical Report 89/12, DIKU, University of Copenhagen (July 1989). [6] O. Danvy, and A. Filinski: Abstracting Control, Proceedings of the 1990 ACM Conference on Lisp and Functional Programming, pp (June 1990). [7] O. Danvy, and K. Millikin: A Rational Deconstruction of Landin s J Operator, Technical Report RS , BRICS, Aarhus, Denmark (December 2006). [8] M. Felleisen: The Theory and Practice of First-Class Prompts, Conference Record of the 15th Annual ACM Symposium on Principles of Programming Languages, pp (January 1988). [9] A. Filinski: Representing Monads, Conference Record of the 21st Annual ACM Symposium on Principles of Programming Languages, pp (January 1994). [10] A. Igarashi and M. Iwaki: Deriving Compilers and Virtual Machines for a Multi-Level Languages, Proceedings of the Fifth Asian Symposium on Programming Languages and Systems (APLAS 07), LNCS 4807, pp (November 2007). [11] OCHA-IS 08-3 (February 2009). [12] P. J. Landin: The mechanical evaluation of expressions, The Computer Journal, Vol. 6, No. 4, pp , (1964). [13] MinCaml shift/reset 11 (March 2009). [14] R. Milner: Communication and Concurrency Prentice Hall International Series in Computer Science, (1995). [15] G. D. Plotkin: Call-by-name, call-by-value, and the λ-calculus, Theoretical Computer Science, Vol. 1, No. 2, pp (December 1975). [16] J. C. Reynolds: Definitional Interpreters for Higher-Order Programming Languages, Proceedings of the ACM National Conference, Vol. 2, pp , (August 1972), reprinted in Higher-Order and Symbolic Computation, Vol. 11, No. 4, pp , Kluwer Academic Publishers (December 1998). [17] M. Sperber, R. K. Dybvig, M. Flatt, A. van Straaten: Revised 6 report on the algorithmic language Scheme, (2007).
平成 19 年度 ( 第 29 回 ) 数学入門公開講座テキスト ( 京都大学数理解析研究所, 平成 19 ~8 年月 72 月日開催 30 日 ) 1 PCF (Programming language for Computable Functions) PCF adequacy adequacy
1 PCF (Programming language for Computable Functions) PCF adequacy adequacy 2 N X Y X Y f (x) f x f x y z (( f x) y) z = (( f (x))(y))(z) X Y x e X Y λx. e x x 2 + x + 1 λx. x 2 + x + 1 3 PCF 3.1 PCF PCF
Int Int 29 print Int fmt tostring 2 2 [19] ML ML [19] ML Emacs Standard ML M M ::= x c λx.m M M let x = M in M end (M) x c λx.
![Int Int 29 print Int fmt tostring 2 2 [19] ML ML [19] ML Emacs Standard ML M M ::= x c λx.m M M let x = M in M end (M) x c λx.](/thumbs/93/111616248.jpg "Int Int 29 print Int fmt tostring 2 2 [19] ML ML [19] ML Emacs Standard ML M M ::= x c λx.m M M let x = M in M end (M) x c λx.")
1, 2 1 m110057@shibaura-it.ac.jp 2 sasano@sic.shibaura-it.ac.jp Eclipse Visual Studio ML Standard ML Emacs 1 ( IDE ) IDE C C++ Java IDE IDE IDE IDE Eclipse Java IDE Java Standard ML 1 print (Int. 1 Int
Dive into Algebraic Effects
Dive into Algebraic Effects びしょ じょ ML Days #2 September 16, 2018 やること Algebraic Effects を伝道 Algebraic Effects is 何 Algebraic Effects が使える言語 Algebraic Effects の活用事例 研究のご紹介先日 JSSST でポスター発表した内容を紹介シマス 目次 自己紹介
1153006 JavaScript try-catch JavaScript JavaScript try-catch try-catch try-catch try-catch try-catch 1 2 2 try-catch try-catch try-catch try-catch 25 1153006 26 2 12 1 1 1 2 3 2.1... 3 2.1.1... 4 2.1.2
美唄市広報メロディー2014年1月号
1 2014 E-mailkouhoujouhou@city.bibai.lg.jp January May September October November December February March June July August April BIBAI CITY INFORMATION http://db.net-bibai.co.jp/bibai/
Emacs ML let start ::= exp (1) exp ::= (2) fn id exp (3) ::= (4) (5) ::= id (6) const (7) (exp) (8) let val id = exp in
Emacs, {l06050,sasano}@sic.shibaura-it.ac.jp Eclipse Visual Studio Standard ML Haskell Emacs 1 Eclipse Visual Studio variable not found LR(1) let Emacs Emacs Emacs Java Emacs JDEE [3] JDEE Emacs Java 2
MEISEI HEROES HERO HERO HERO MEISEI HEROES
MEISEI HEROES MEISEI HEROES HERO HERO HERO MEISEI HEROES 04 INDEX 06 28 08 24 26 10 14 16 22 18 20 MEISEI HEROES 05 04 MEISEI HEROES 2014 SCHOOL GUIDE MEISEI HEROES 1 2 3 4 5 06 MEISEI HEROES 2014 SCHOOL
000-015-v6.ai
Annual Report 2010 http://www.tokyo-jc.or.jp Tokyo JC President AREA Design JAPAN Design TOKYO Design 2010 Year Schedule 2010 Year Schedule 2010 Year Schedule January January February February March March
技術の系統化調査報告「プロセス制御システムの技術系統化調査」
A Technical Survey of Process Control Systems 3 Yutaka Wakasa Abstract Yutaka Wakasa 95 1 2 96 Vol.11 2008.March 2.1 2.2 97 98 Vol.11 2008.March 99 3 3.1 3.2 3.3 100 Vol.11 2008.March 101 3.4 102 Vol.11
# let rec sigma (f, n) = # if n = 0 then 0 else f n + sigma (f, n-1);; val sigma : (int -> int) * int -> int = <fun> sigma f n ( : * -> * ) sqsum cbsu
II 4 : 2001 11 7 keywords: 1 OCaml OCaml (first-class value) (higher-order function) 1.1 1 2 + 2 2 + + n 2 sqsum 1 3 + 2 3 + + n 3 cbsum # let rec sqsum n = # if n = 0 then 0 else n * n + sqsum (n - 1)
MORALITY LEARNING AMBITION 2 KASUMIGAOKA
KASUMIGAOKA MORALITY LEARNING AMBITION 2 KASUMIGAOKA KASUMIGAOKA 3 4 KASUMIGAOKA KASUMIGAOKA 5 Super Science High School 6 KASUMIGAOKA School Life 4 April 5 May 6 June 7 July 8 August 9 September 10 October
Parametric Polymorphism
ML 2 2011/04/19 Parametric Polymorphism Type Polymorphism ? : val hd_int : int list - > int val hd_bool : bool list - > bool val hd_i_x_b : (int * bool) list - > int * bool etc. let hd_int = function (x
Jacques Garrigue
Jacques Garrigue Garrigue 1 Garrigue 2 $ print_lines () > for i in $1; do > echo $i > done $ print_lines "a b c" a b c Garrigue 3 Emacs Lisp (defun print-lines (lines) (dolist (str lines) (insert str)
GOVERNOR'S No.1 JULY 2 GOVERNOR'S No.1 JULY 3 GOVERNOR'S No.1 JULY 4 GOVERNOR'S No.1 JULY 5 GOVERNOR'S No.1 JULY 6 GOVERNOR'S No.1 JULY 7 GOVERNOR'S No.1 JULY 8 GOVERNOR'S No.1 JULY 9 GOVERNOR'S No.1 JULY
(CPS)?...
Kahua Web Kahua ( ) (CPS)?... (CPS)? (Continuation-Passing Style / CPS)... ( ) ( ) ( ) Web CPS Web request-response request-response request response Web CPS CPS (Web ) ( ) ( ) Web CPS... Web CPS? CPS
2 984 WWW
18 2 984 WWW 1 1 1.1................................. 1 2 3 2.1............................ 3 2.1.1......................... 3 2.1.2......................... 4 2.1.3........................ 5 2.2........
2011上宮太子_高校_学校案内
UENOMIYA TAISHI SENIOR HIGH SCHOOL GUIDE BOOK 2011 www.uenomiya-taishi.ed.jp Curriculum Curriculum Letʼs enjoy school life at UT! 01 02 4 April 5 May 6 June 7 July 03 8 9 10 11 August September October
44 4 I (1) ( ) (10 15 ) ( 17 ) ( 3 1 ) (2)
(1) I 44 II 45 III 47 IV 52 44 4 I (1) ( ) 1945 8 9 (10 15 ) ( 17 ) ( 3 1 ) (2) 45 II 1 (3) 511 ( 451 1 ) ( ) 365 1 2 512 1 2 365 1 2 363 2 ( ) 3 ( ) ( 451 2 ( 314 1 ) ( 339 1 4 ) 337 2 3 ) 363 (4) 46
i ii i iii iv 1 3 3 10 14 17 17 18 22 23 28 29 31 36 37 39 40 43 48 59 70 75 75 77 90 95 102 107 109 110 118 125 128 130 132 134 48 43 43 51 52 61 61 64 62 124 70 58 3 10 17 29 78 82 85 102 95 109 iii
3 3.1 algebraic datatype data k = 1 1,1... 1,n1 2 2,1... 2,n2... m m,1... m,nm 1 m m m,1,..., m,nm m 1, 2,..., k 1 data Foo x y = Alice x [y] B
![3 3.1 algebraic datatype data k = 1 1,1... 1,n1 2 2,1... 2,n2... m m,1... m,nm 1 m m m,1,..., m,nm m 1, 2,..., k 1 data Foo x y = Alice x [y] B](/thumbs/102/156825138.jpg "3 3.1 algebraic datatype data k = 1 1,1... 1,n1 2 2,1... 2,n2... m m,1... m,nm 1 m m m,1,..., m,nm m 1, 2,..., k 1 data Foo x y = Alice x [y] B")
3 3.1 algebraic datatype data 1 2... k = 1 1,1... 1,n1 2 2,1... 2,n2... m m,1... m,nm 1 m m m,1,..., m,nm m 1, 2,..., k 1 data Foo x y = Alice x [y] Bob String y Charlie Foo Double Integer Alice 3.14 [1,2],
: gettoken(1) module P = Printf exception End_of_system (* *) let _ISTREAM = ref stdin let ch = ref ( ) let read () = (let c =!ch in ch := inp
7 OCaml () 1. 2. () (compiler) (interpreter) 2 OCaml (syntax) (BNF,backus normal form ) 1 + 2; let x be 2-1 in x; ::= ; let be in ; ::= + - ::= * / ::= 7.1 ( (printable characters) (tokens) 1 (lexical
IPSJ SIG Technical Report Vol.2016-ARC-221 No /8/9 GC 1 1 GC GC GC GC DalvikVM GC 12.4% 5.7% 1. Garbage Collection: GC GC Java GC GC GC GC Dalv
GC 1 1 GC GC GC GC DalvikVM GC 12.4% 5.7% 1. Garbage Collection: GC GC Java GC GC GC GC DalvikVM[1] GC 1 Nagoya Institute of Technology GC GC 2. GC GC 2.1 GC 1 c 2016 Information Processing Society of
maegaki_4_suzuki_yuusuke.pdf
JavaScript, ECMA262 5.1(June 2011) TC39 Conformance Suite Test262 Building modern JavaScript Engine YUSUKE SUZUKI, We implemented an engine that is fully compliant with ECMA262 5.1 (June 2011) and confirmed
koba/class/soft-kiso/ 1 λ if λx.λy.y false 0 λ typed λ-calculus λ λ 1.1 λ λ, syntax τ (types) ::= b τ 1 τ 2 τ 1
http://www.kb.ecei.tohoku.ac.jp/ koba/class/soft-kiso/ 1 λ if λx.λy.y false 0 λ typed λ-calculus λ λ 1.1 λ 1.1.1 λ, syntax τ (types) ::= b τ 1 τ 2 τ 1 τ 2 M (terms) ::= c τ x M 1 M 2 λx : τ.m (M 1,M 2
1 May 2011
1 May 2011 2 May 2011 3 May 2011 4 May 2011 5 June 2011 6 June 2011 7 June 2011 8 June 2011 9 July 2011 10 July 2011 11 July 2011 12 July 2011 13 August 2011 14 August 2011 15 August 2011 16 August 2011
November 13 June 1 April 23 October 1 December 22 August 6 September 5 July 2 May 2 8 6 11 1 7 01 1516 4 23 4 1995 4 23 1999 4 23 19 2 02 88 5 2 3 03 6 1 6 1 300 4 04 100 7 2 7 2 706 15 2 5 05 8 6 86
main.dvi
305 8550 1 2 CREST fujii@slis.tsukuba.ac.jp 1 7% 2 2 3 PRIME Multi-lingual Information Retrieval 2 2.1 Cross-Language Information Retrieval CLIR 1990 CD-ROM a. b. c. d. b CLIR b 70% CLIR CLIR 2.2 (b) 2
IPSJ SIG Technical Report Vol.2011-CE-110 No /7/9 Bebras 1, 6 1, 2 3 4, 6 5, 6 Bebras 2010 Bebras Reporting Trial of Bebras Contest for K12 stud
Bebras 1, 6 1, 2 3 4, 6 5, 6 Bebras 2010 Bebras Reporting Trial of Bebras Contest for K12 students in Japan Susumu Kanemune, 1, 6 Yukio Idosaka, 1, 2 Toshiyuki Kamada, 3 Seiichi Tani 4, 6 and Etsuro Moriya
(a) (b) (c) Canny (d) 1 ( x α, y α ) 3 (x α, y α ) (a) A 2 + B 2 + C 2 + D 2 + E 2 + F 2 = 1 (3) u ξ α u (A, B, C, D, E, F ) (4) ξ α (x 2 α, 2x α y α,
[II] Optimization Computation for 3-D Understanding of Images [II]: Ellipse Fitting 1. (1) 2. (2) (edge detection) (edge) (zero-crossing) Canny (Canny operator) (3) 1(a) [I] [II] [III] [IV ] E-mail sugaya@iim.ics.tut.ac.jp
ML λ λ 1 λ 1.1 λ λ λ e (λ ) ::= x ( ) λx.e (λ ) e 1 e 2 ( ) ML λx.e Objective Caml fun x -> e x e let 1
2005 sumii@ecei.tohoku.ac.jp 2005 6 24 ML λ λ 1 λ 1.1 λ λ λ e (λ ) ::= x ( ) λx.e (λ ) e 1 e 2 ( ) ML λx.e Objective Caml fun x -> e x e let 1 let λ 1 let x = e1 in e2 (λx.e 2 )e 1 e 1 x e 2 λ 3 λx.(λy.e)
Scheme Hygienic Macro stibear (@stibear1996) 1 Scheme Scheme Lisp Lisp Common Lisp Emacs Lisp Clojure Scheme 1 Lisp Lisp Lisp Lisp Homoiconicity Lisper 2 Common Lisp gensym Scheme Common Lisp Scheme Lisp-1
Milner Harper LCF ML HOPE (type inference) news letter Polymorphism [28] [30, 24, 13] 3 Standard ML 1990 ML LCF ML The Definition of Standard ML[31] L
![Milner Harper LCF ML HOPE (type inference) news letter Polymorphism [28] [30, 24, 13] 3 Standard ML 1990 ML LCF ML The Definition of Standard ML[31] L](/thumbs/71/66052196.jpg "Milner Harper LCF ML HOPE (type inference) news letter Polymorphism [28] [30, 24, 13] 3 Standard ML 1990 ML LCF ML The Definition of Standard ML[31] L")
1 ML ML (Meta Langauge) ML ML LCF LCF (proof ML tactics) ML (higher-order functions) LCF ML ML ML 2 ML 3 ML LCF 4 ML 5 ML Lisp Scheme 6 LCF ML ML 2 ML ML 1970 Edinburgh Edinburgh LCF [12] LCF LCF ML Robin
Lebesgue可測性に関するSoloayの定理と実数の集合の正則性=1This slide is available on ` `%%%`#`&12_`__~~~ౡ氀猀e
Khomskii Lebesgue Soloay 1 Friday 27 th November 2015 1 This slide is available on http://slideshare.net/konn/lebesguesoloay 1 / 34 Khomskii 1 2 3 4 Khomskii 2 / 34 Khomskii Solovay 3 / 34 Khomskii Lebesgue
: Name, Tel name tel (! ) name : Name! Tel tel ( % ) 3. HTML. : Name % Tel name tel 2. 2,., [ ]!, [ ]!, [ ]!,. [! [, ]! ]!,,. ( [ ], ),. : [Name], nam
![: Name, Tel name tel (! ) name : Name! Tel tel ( % ) 3. HTML. : Name % Tel name tel 2. 2,., [ ]!, [ ]!, [ ]!,. [! [, ]! ]!,,. ( [ ], ),. : [Name], nam](/thumbs/91/105870020.jpg ": Name, Tel name tel (! ) name : Name! Tel tel ( % ) 3. HTML. : Name % Tel name tel 2. 2,., [ ]!, [ ]!, [ ]!,. [! [, ]! ]!,,. ( [ ], ),. : [Name], nam")
DEIM Forum 2010 F6-1 SuperSQL Ajax 223 8522 3 14 1 E-mail: kabu@db.ics.keio.ac.jp, toyama@ics.keio.ac.jp SuperSQL Ajax, GUI, GUI,, Ajax SuperSQL, HTML, Ajax, RIA Abstract Layout Function Extends for Generating
1 1 CodeDrummer CodeMusician CodeDrummer Fig. 1 Overview of proposal system c
CodeDrummer: 1 2 3 1 CodeDrummer: Sonification Methods of Function Calls in Program Execution Kazuya Sato, 1 Shigeyuki Hirai, 2 Kazutaka Maruyama 3 and Minoru Terada 1 We propose a program sonification
Autumn 06 1 2005 100 100 1 100 1 2003 2005 10 2003 2005 2
2005 25-2 17 395.6 149.1 1 2004 2 2003p.13 3 Autumn 06 1 2005 100 100 1 100 1 2003 2005 10 2003 2005 2 Vol. 42 No. 2 2 100 20052005 2002 20052005 3 2005 10 1 II III IV 1 1 1 2 1 4 15-2 30 4,091 54.5 2
ケインズ『お金の改革論』山形浩生訳 Keynes, A Tract on Monetary Reform, 1923, Japanese translation Hiroo Yamagata 2015
A Tract on Monetary Reform *1 * 2 2014 6 17 *1 *2 c 2014 4.0 (http:// creativecommons.org/licenses/by/4.0/) i J M 1923 10 iii 1 1 1914 22 19 1 13 9 1.1 1914 1920 1920 2 1 1.1 1913 (1) (2) (3) 1913 100
SOZO_経営_PDF用.indd
Faculty of Business Administration Department of Business Administration CONTENTS ADMISSION POLICY 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 INTERNET SOZO Wireless Network 16 Campus Life Calendar APRIL MAY JUNE
- - - - - - - - - - - - - - - - - - - - - - - - - -1 - - - - - - - - - - - - - - - - - - - - - - - - - - - - -2...2...3...4...4...4...5...6...7...8...
取 扱 説 明 書 - - - - - - - - - - - - - - - - - - - - - - - - - -1 - - - - - - - - - - - - - - - - - - - - - - - - - - - - -2...2...3...4...4...4...5...6...7...8...9...11 - - - - - - - - - - - - - - - - -
…J…−†[†E…n…‘†[…hfi¯„^‚ΛžfiüŒå
takuro.onishi@gmail.com II 2009 6 11 [A] D B A B A B A B DVD y = 2x + 5 x = 3 y = 11 x = 5 y = 15. Google Web (2 + 3) 5 25 2 3 5 25 Windows Media Player Media Player (typed lambda calculus) (computer
Vol.55 No (Jan. 2014) saccess 6 saccess 7 saccess 2. [3] p.33 * B (A) (B) (C) (D) (E) (F) *1 [3], [4] Web PDF a m
![Vol.55 No (Jan. 2014) saccess 6 saccess 7 saccess 2. [3] p.33 * B (A) (B) (C) (D) (E) (F) *1 [3], [4] Web PDF a m](/thumbs/92/108648363.jpg "Vol.55 No (Jan. 2014) saccess 6 saccess 7 saccess 2. [3] p.33 * B (A) (B) (C) (D) (E) (F) *1 [3], [4] Web PDF a m")
Vol.55 No.1 2 15 (Jan. 2014) 1,a) 2,3,b) 4,3,c) 3,d) 2013 3 18, 2013 10 9 saccess 1 1 saccess saccess Design and Implementation of an Online Tool for Database Education Hiroyuki Nagataki 1,a) Yoshiaki
i
14 i ii iii iv v vi 14 13 86 13 12 28 14 16 14 15 31 (1) 13 12 28 20 (2) (3) 2 (4) (5) 14 14 50 48 3 11 11 22 14 15 10 14 20 21 20 (1) 14 (2) 14 4 (3) (4) (5) 12 12 (6) 14 15 5 6 7 8 9 10 7
C O N T E N T S 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. 14. 15. 16. 17. 18. 2009 Annual Report
C O N T E N T S 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. 14. 15. 16. 17. 18. 2009 Annual Report 1 1 2009 Annual Report 1. 2. 2 2 2009 Annual Report 3 3 2009 Annual Report 3. 1980 1991 1992 1993 1994
18年度石見美術館年報最終.indd
A Annual Report Annual Report B 1 Annual Report Annual Report 2 3 Annual Report Annual Report 4 Annual Report 5 Annual Report 6 7 Annual Report Annual Report 8 9 Annual Report Annual Report 10 11 Annual
schoolʼs history facts about IPMAHS school uniforms
Iwate Prefectual Morioka Agricultural High School http://www2.iwate-ed.jp/moa-h/ schoolʼs history facts about IPMAHS school uniforms A nimal Science B otanical Science C omprehensive and food Science D
1 (1997) (1997) 1974:Q3 1994:Q3 (i) (ii) ( ) ( ) 1 (iii) ( ( 1999 ) ( ) ( ) 1 ( ) ( 1995,pp ) 1
1 (1997) (1997) 1974:Q3 1994:Q3 (i) (ii) ( ) ( ) 1 (iii) ( ( 1999 ) ( ) ( ) 1 ( ) ( 1995,pp.218 223 ) 1 2 ) (i) (ii) / (iii) ( ) (i ii) 1 2 1 ( ) 3 ( ) 2, 3 Dunning(1979) ( ) 1 2 ( ) ( ) ( ) (,p.218) (
繝励Μ繝ｳ繝
2012. January vol.609 2 3 2012. January vol.609 4 5 2012. January vol.609 6 7 2012. January vol.609 8 9 2012. January vol.609 10 11 2012. January vol.609 12 13 2012. January vol.609 14 15 2012. January
# let st1 = {name = "Taro Yamada"; id = };; val st1 : student = {name="taro Yamada"; id=123456} { 1 = 1 ;...; n = n } # let string_of_student {n
II 6 / : 2001 11 21 (OCaml ) 1 (field) name id type # type student = {name : string; id : int};; type student = { name : string; id : int; } student {} type = { 1 : 1 ;...; n : n } { 1 = 1 ;...; n = n
% 95% 2002, 2004, Dunkel 1986, p.100 1
Blended Learning 要 旨 / Moodle Blended Learning Moodle キーワード:Blended Learning Moodle 1 2008 Moodle e Blended Learning 2009.. 1994 2005 1 2 93% 95% 2002, 2004, 2011 2011 1 Dunkel 1986, p.100 1 Blended Learning
TheRecord.indd
July 2015 The Record vol.668 Contents 5/19 6/4 6/5 THE RECORD 2015-07 2 focus 3 THE RECORD 2015 06 THE RECORD 2015 06 4 focus 5 THE RECORD 2015 07 6 THE RECORD 2015 07 01 02 03 7 THE RECORD 2015 07 04
第１部 一般的コメント
(( 2000 11 24 2003 12 31 3122 94 2332 508 26 a () () i ii iii iv (i) (ii) (i) (ii) (iii) (iv) (a) (b)(c)(d) a) / (i) (ii) (iii) (iv) 1996 7 1996 12
( )
NAIST-IS-MT0851100 2010 2 4 ( ) CR CR CR 1980 90 CR Kerberos SSH CR CR CR CR CR CR,,, ID, NAIST-IS- MT0851100, 2010 2 4. i On the Key Management Policy of Challenge Response Authentication Schemes Toshiya
3.1 Thalmic Lab Myo * Bluetooth PC Myo 8 RMS RMS t RMS(t) i (i = 1, 2,, 8) 8 SVM libsvm *2 ν-svm 1 Myo 2 8 RMS 3.2 Myo (Root
1,a) 2 2 1. 1 College of Information Science, School of Informatics, University of Tsukuba 2 Faculty of Engineering, Information and Systems, University of Tsukuba a) oharada@iplab.cs.tsukuba.ac.jp 2.
3 2 2 (1) (2) (3) (4) 4 4 AdaBoost 2. [11] Onishi&Yoda [8] Iwashita&Stoica [5] 4 [3] 3. 3 (1) (2) (3)
![3 2 2 (1) (2) (3) (4) 4 4 AdaBoost 2. [11] Onishi&Yoda [8] Iwashita&Stoica [5] 4 [3] 3. 3 (1) (2) (3)](/thumbs/68/59204737.jpg "3 2 2 (1) (2) (3) (4) 4 4 AdaBoost 2. [11] Onishi&Yoda [8] Iwashita&Stoica [5] 4 [3] 3. 3 (1) (2) (3)")
(MIRU2012) 2012 8 820-8502 680-4 E-mail: {d kouno,shimada,endo}@pluto.ai.kyutech.ac.jp (1) (2) (3) (4) 4 AdaBoost 1. Kanade [6] CLAFIC [12] EigenFace [10] 1 1 2 1 [7] 3 2 2 (1) (2) (3) (4) 4 4 AdaBoost
Modal Phrase MP because but 2 IP Inflection Phrase IP as long as if IP 3 VP Verb Phrase VP while before [ MP MP [ IP IP [ VP VP ]]] [ MP [ IP [ VP ]]]
![Modal Phrase MP because but 2 IP Inflection Phrase IP as long as if IP 3 VP Verb Phrase VP while before [ MP MP [ IP IP [ VP VP ]]] [ MP [ IP [ VP ]]]](/thumbs/89/98876548.jpg "Modal Phrase MP because but 2 IP Inflection Phrase IP as long as if IP 3 VP Verb Phrase VP while before [ MP MP [ IP IP [ VP VP ]]] [ MP [ IP [ VP ]]]")
30 4 2016 3 pp.195-209. 2014 N=23 (S)AdvOV (S)OAdvV 2 N=17 (S)OAdvV 2014 3, 2008 Koizumi 1993 3 MP IP VP 1 MP 2006 2002 195 Modal Phrase MP because but 2 IP Inflection Phrase IP as long as if IP 3 VP Verb
表1票4.qx4
iii iv v 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 22 23 10 11 24 25 26 27 10 56 28 11 29 30 12 13 14 15 16 17 18 19 2010 2111 22 23 2412 2513 14 31 17 32 18 33 19 34 20 35 21 36 24 37 25 38 2614
第１章 国民年金における無年金
1 2 3 4 ILO ILO 5 i ii 6 7 8 9 10 ( ) 3 2 ( ) 3 2 2 2 11 20 60 12 1 2 3 4 5 6 7 8 9 10 11 12 13 13 14 15 16 17 14 15 8 16 2003 1 17 18 iii 19 iv 20 21 22 23 24 25 ,,, 26 27 28 29 30 (1) (2) (3) 31 1 20
TA3-4 31st Fuzzy System Symposium (Chofu, September 2-4, 2015) Interactive Recommendation System LeonardoKen Orihara, 1 Tomonori Hashiyama, 1
Interactive Recommendation System 1 1 1 1 LeonardoKen Orihara, 1 Tomonori Hashiyama, 1 Shun ichi Tano 1 1 Graduate School of Information Systems, The University of Electro-Communications Abstract: The
,,,km Independent StateIndependent LoLo ,m,mm H .. cm ( ) ( ) ( ) () ( ) ( ) ( ) ( ) ( ) ( ) () () () () () () () () () () () () () () () () () () () () () () [ ] [ ] [ ] [ ] [ ] [ ] [ ] [
org/ghc/ Windows Linux RPM 3.2 GHCi GHC gcc javac ghc GHCi(ghci) GHCi Prelude> GHCi :load file :l file :also file :a file :reload :r :type expr :t exp
3 Haskell Haskell Haskell 1. 2. 3. 4. 5. 1. 2. 3. 4. 5. 6. C Java 3.1 Haskell Haskell GHC (Glasgow Haskell Compiler 1 ) GHC Haskell GHC http://www.haskell. 1 Guarded Horn Clauses III - 1 org/ghc/ Windows
I? 3 1 3 1.1?................................. 3 1.2?............................... 3 1.3!................................... 3 2 4 2.1........................................ 4 2.2.......................................
20 15 14.6 15.3 14.9 15.7 16.0 15.7 13.4 14.5 13.7 14.2 10 10 13 16 19 22 1 70,000 60,000 50,000 40,000 30,000 20,000 10,000 0 2,500 59,862 56,384 2,000 42,662 44,211 40,639 37,323 1,500 33,408 34,472
- 2 -
- 2 - - 3 - (1) (2) (3) (1) - 4 - ~ - 5 - (2) - 6 - (1) (1) - 7 - - 8 - (i) (ii) (iii) (ii) (iii) (ii) 10 - 9 - (3) - 10 - (3) - 11 - - 12 - (1) - 13 - - 14 - (2) - 15 - - 16 - (3) - 17 - - 18 - (4) -
2 1980 8 4 4 4 4 4 3 4 2 4 4 2 4 6 0 0 6 4 2 4 1 2 2 1 4 4 4 2 3 3 3 4 3 4 4 4 4 2 5 5 2 4 4 4 0 3 3 0 9 10 10 9 1 1
1 1979 6 24 3 4 4 4 4 3 4 4 2 3 4 4 6 0 0 6 2 4 4 4 3 0 0 3 3 3 4 3 2 4 3? 4 3 4 3 4 4 4 4 3 3 4 4 4 4 2 1 1 2 15 4 4 15 0 1 2 1980 8 4 4 4 4 4 3 4 2 4 4 2 4 6 0 0 6 4 2 4 1 2 2 1 4 4 4 2 3 3 3 4 3 4 4
1 (1) (2)
1 2 (1) (2) (3) 3-78 - 1 (1) (2) - 79 - i) ii) iii) (3) (4) (5) (6) - 80 - (7) (8) (9) (10) 2 (1) (2) (3) (4) i) - 81 - ii) (a) (b) 3 (1) (2) - 82 - - 83 - - 84 - - 85 - - 86 - (1) (2) (3) (4) (5) (6)
表紙
YONGAKU-KAGAWANISHI Vos estis sal terrae. Evangelium secundum Matthaeum V,13 01 YONGAKU-KAGAWANISHI Message SCHOOL GUIDE 2017 02 03 YONGAKU-KAGAWANISHI Message Message SCHOOL GUIDE 2017 04 Message Message
o 2o 3o 3 1. I o 3. 1o 2o 31. I 3o PDF Adobe Reader 4o 2 1o I 2o 3o 4o 5o 6o 7o 2197/ o 1o 1 1o
78 2 78... 2 22201011... 4... 9... 7... 29 1 1214 2 7 1 8 2 2 3 1 2 1o 2o 3o 3 1. I 1124 4o 3. 1o 2o 31. I 3o PDF Adobe Reader 4o 2 1o 72 1. I 2o 3o 4o 5o 6o 7o 2197/6 9. 9 8o 1o 1 1o 2o / 3o 4o 5o 6o
dsample.dvi
1 1 1 2009 2 ( ) 600 1 2 1 2 RFID PC Practical Verification of Evacuation Guidance Based on Pedestrian Traffic Measurement Tomohisa Yamashita, 1 Shunsuke Soeda 1 and Noda Itsuki 1 In this paper, we report
Title 人 的 資 源 の 会 計 的 認 識 : 日 英 プロサッカークラブの 実 務 を 例 として Author(s) 角 田, 幸 太 郎 Citation 經 濟 學 研 究, 55(4): 79-94 Issue Date 2006-03-09 DOI Doc URLhttp://hdl.handle.net/2115/5835 Right Type bulletin Additional
1 Kinect for Windows M = [X Y Z] T M = [X Y Z ] T f (u,v) w 3.2 [11] [7] u = f X +u Z 0 δ u (X,Y,Z ) (5) v = f Y Z +v 0 δ v (X,Y,Z ) (6) w = Z +
![1 Kinect for Windows M = [X Y Z] T M = [X Y Z ] T f (u,v) w 3.2 [11] [7] u = f X +u Z 0 δ u (X,Y,Z ) (5) v = f Y Z +v 0 δ v (X,Y,Z ) (6) w = Z +](/thumbs/81/83701592.jpg "1 Kinect for Windows M = [X Y Z] T M = [X Y Z ] T f (u,v) w 3.2 [11] [7] u = f X +u Z 0 δ u (X,Y,Z ) (5) v = f Y Z +v 0 δ v (X,Y,Z ) (6) w = Z +")
3 3D 1,a) 1 1 Kinect (X, Y) 3D 3D 1. 2010 Microsoft Kinect for Windows SDK( (Kinect) SDK ) 3D [1], [2] [3] [4] [5] [10] 30fps [10] 3 Kinect 3 Kinect Kinect for Windows SDK 3 Microsoft 3 Kinect for Windows
A Japanese Word Dependency Corpus ÆüËܸì¤Îñ¸ì·¸¤ê¼õ¤±¥³¡¼¥Ñ¥¹
A Japanese Word Dependency Corpus 2015 3 18 Special thanks to NTT CS, 1 /27 Bunsetsu? What is it? ( ) Cf. CoNLL Multilingual Dependency Parsing [Buchholz+ 2006] (, Penn Treebank [Marcus 93]) 2 /27 1. 2.
2) TA Hercules CAA 5 [6], [7] CAA BOSS [8] 2. C II C. ( 1 ) C. ( 2 ). ( 3 ) 100. ( 4 ) () HTML NFS Hercules ( )
![2) TA Hercules CAA 5 [6], [7] CAA BOSS [8] 2. C II C. ( 1 ) C. ( 2 ). ( 3 ) 100. ( 4 ) () HTML NFS Hercules ( )](/thumbs/78/78162263.jpg "2) TA Hercules CAA 5 [6], [7] CAA BOSS [8] 2. C II C. ( 1 ) C. ( 2 ). ( 3 ) 100. ( 4 ) () HTML NFS Hercules ( )")
1,a) 2 4 WC C WC C Grading Student programs for visualizing progress in classroom Naito Hiroshi 1,a) Saito Takashi 2 Abstract: To grade student programs in Computer-Aided Assessment system, we propose
6/9-98-資生堂-前半AR-6.5pm
1998 1998 3 1998 1997 1996 620,910 39,278 16,868 588,572 42,898 19,152 560,821 37,012 17,507 1998 4,776,231 302,139 129,754 457,333 99,310 64,267 436,705 94,610 57,257 404,181 101,675 54,965 3,517,946
園田学園論文集 ５０号（よこ）☆／３．浜口
50 2016. 1 1 1946 International Convention for the Regulation of Whaling Schedule International Whaling Commission 2 3 3 60 1 1 6 1954 37 1985 4 1.1 6 1954 6 1954 6 3 4 6 6 1 5 2 0 70 40 5 3 2 1 2 3 4