22 KMC 12 *1 KMC Tetsu=TaLow KMC vol.2 KMC KMC 20 KMC KMC News KMC 20 KMC KMC 35 OB/OG Facebook KMC KMC *1 OCW com/watch?v=y
|
|
|
- さみ たみや
- 7 years ago
- Views:
Transcription
1
2
3 22 KMC 12 *1 KMC Tetsu=TaLow KMC vol.2 KMC KMC 20 KMC KMC News KMC 20 KMC KMC 35 OB/OG Facebook KMC KMC *1 OCW com/watch?v=ydsub75vyde i
4 DNA KMC OB 2 NG KMC LEGO KMC KMC 1 KMC KMC ii
5 KMC TAPL Lisp PCL/PAIP SICP JavaScript Rails3 Web DTM : KMC Twitter 13 KMC possum Haskell Anarchy Golf
6 Golf Haskell Haskell Golf SS possum uda possum
7 @tobiuo12730 (1) (2) (3) (4) (1) (2) 1 1
8
9 KMC TAPL Lisp PCL/PAIP SICP JavaScript Rails3 Web DTM
10 KMC KMC 1 * log(100 ) 2 3 *1 Mark De Berg 2010 ISBN
11 TAPL OCaml Coq Types and Programming Languages *2 (TAPL) ML KMC hanazuki Lisp PCL/PAIP Lisp SBCL PCL CommonLisp *3 AI Common Lisp AI *4 Lisp 2012 yukiharu *2 Benjamin C. Pierce. The MIT Press ISBN ~bcpierce/tapl/ *3 Peter Seibel2008 ISBN *4 Peter Norvig 2010 ISBN
12 KMC SICP Structure and Interpretation of Computer Programs * 5 (SICP) LISP Scheme SICP 3 JavaScript 2011 Web Web JavaScript Web Web JavaScript JavaScript Web UI JavaScript JavaScript *5 Harold Abelson and Gerald Jay Sussman. The MIT Press ISBN http: //mitpress.mit.edu/sicp/ 6
13 KMC 10 crys *6 * ISBN
14 KMC koji Rails3 Web Web Rails3 Web Web Ruby on Rails Web Ruby Web Rails Web Web Rails Don t Repeat Yourself Convention over Configuration RESTful Web Rails Tips Ruby *7 Ruby on Rails Tutorial *8 Ruby on Rails 3 * ISBN *8 Michael Hartl. * ISBN
15 DTM 2011 DTM 2011 hideya KMC PC DTM DTM / 7 DTM KMC hideya 9
16 KMC 2 10
17 1 RADWIMPS TSUTAYA , km VIVRE 2,000 4,000 ZARA 12,000 11
18
19 : KMC Twitter KMC possum
20 : KMC Twitter KMC possum Twitter KMC Twitter 40 Twitter Twitter home timeline TL 使 用 者 数 ( 人 ) HootSuite Janetter PeraPeraPrv Saezuri Tweet Caster 14
21 KMC Twitter Twit Twitter for ipad Twitter for iphone Web Tween TweetDeck Twitter KMC Web Tween TweetDeck 4 Tween Ruby Tumblr URL tweet Haskell Python GAE Python curses TUI Twitter tuitwi *1 Twitter KMC OB github Ruby on Rails Web IRC KMC Twitter IRC Twitter Skype Windows Live IRC IRC IRC Twitter SNS *1 15
22 : KMC Twitter *1 8 8 OK *1 16
23 :30 6: VIVRE ZARA
24 : KMC Twitter 3 2 *2 *2 18
25 *3 3 *3 19
26
27 Haskell Anarchy Golf Golf Haskell Haskell Golf SS possum uda
28 Haskell Haskell Golf Haskell Haskell Prelude >>= do Golf Anarchy Golf *1 KMC vol.1 kirita Golf eha C Golf Golf Anarchy Golf Anarchy Golf *1 22
29 Haskell Golf submit * *3 OK Golf Haskell Golf Haskell Golf Haskell Golf *4 perl #!perl -p <> sed n;d C C main(i){for(;gets(&i);gets())puts();} *5 gets puts *6 *2 FizzBuzz *3 0 1 *4 *5 Golf *6 &i 23
30 Haskell g=getline Haskell *7 Haskell Golf Haskell Golf Haskell Golf LF module Main () where Prelude or main IO () IO a main=mapm_ print[1..10] main=mapm print[1..10] mod x 3==0 mod x 3<1 gcd 3x>2 *7 Golf 24
31 Haskell Golf f x=g div x g d x=x d 3+x d 10^x d 20 f x=g div x g(%)x=x%3+x%10^x%20 getline main=getline>>=putstrln>>main main=f[1..10] f(a:b)=print a>>f b f x a:b<-x,y<-f b,y==a=0 length x==9=1 0<1=2 main=interact f 1 m@main=getline>>=f>>m m@main=getline>>=putstrln.f>>m main=interact$(>>=f).lines 25
32 main=mapm putstrln main=f f(a:b)=g a>>f(a b ) readln unlines words unwords Prelude if case if p then a else b f;f x p=a 0<1=b last$a:[b p] if x==0 then a else b [b,a]!!(0^x) -- x>=0 b+(a-b)*0^x -- a,b Num if p then s else [] [c p,c<-s] if p then a:[b] else a:[b p] [a] max min *8 \x->if x>a then a else x min a import import List Numeric List sort nub List Prelude *9 *8 String *9 26
33 Haskell Golf Haskell Golf IO >>= >> do do >>= do Haskell Golf Haskell map fold scan Haskell Golf (.) λ point-free style * 10 point-free / True False 0<1 0>1 x::int x+0 abs x * 11 (+0) abs f[]=[];f(a:b)= f(a:b)= ;f x=x -- Haskell Haskell Haskell Golf *10 flip *11 x 27
34 concat concatmap concat concatmap x>>=id x>>=f (>>=f) cycle l= :l Haskell * 12 (>>) replicate n x -- x n [1..n]>>[x] -- x n [1..n]>>[x,y] -- [x, y, x, y... x,y] ["hoge","fuga","buhya"] words"hoge fuga buhya" [38,56,91,48,51,60]!!x fromenum$"&8[03<"!!x "aho"!!mod x 3 cycle"aho"!!x x timeout sort sort List.sort sort sortby sort snd sortby(\a b->f a compare f b);f x= sortby((.f).compare.f);f x= map snd.sort.map(\x->(,x)) *12 take (!!) 28
35 Haskell Golf import List List import List;map snd.sort$map(\x->(odd x,x))l [x x<-[0,2..98]++[1,3..99],y<-l,x==y] length length sum length$filter p xs sum[1 x<-xs,p x] parse parse takewhile dropwhile span takewhile p fst.span p lex Golf main= 5 interact 8 main=interact$ 14 m@main= 7 mapm 4 29
36 print 5 putstr 6 lines 5 unlines 7 f x= 5 ABBA Problem AAA to B BBB to A ABA to AA BAB to BB Input A AA AAA B BB BBB ABAB AAAABBBB ABBAABAABABABABBAAB Output A AA B B BB A AAB BAAB A 30
37 Haskell Golf input/output 1 main=putstr"a\naa\nb\nb\nbb\na\naab\nbaab\na" input/output ABBA2 ABBA input/output Input 1 A AA AAA B BB BBB Output 1 A AA B B BB A Input 2 ABAB AAAABBBB ABBAABAABABABABBAAB Output 2 AAB BAAB 31
38 A 1 main=interact f f x x<"aa"="a\naa\nb\nb\nbb\na" 0<1="AAB\nBAAB\nA" max/min max/min 2 main=interact$max"a\naa\nb\nb\nbb\na".min"aab\nbaab\na" mapm mapm mapm map sequence * 13 mapm(\_->"01")[1..3] ["000","001","010","011","100","101","110","111"] mapm(\_->"012")[1,2] ["00","01","02","10","11","12","20","21","22"] 0 filled N Factradic Counter main=mapm(print.abs.read)$take 1001$mapM(\x->[ 0..x])" " mapm * 14 *13 Hoogle *14 abs read 32
39 Haskell Golf Palindromic prime 11, 101, * 15 p a p a p 1 1 (mod p) n a a p 1 1 (mod n) n -- main=mapm print$2:[x x<-[ ],mod(2^x)x==2,show x==reverse(show x)] -- main=mapm print[x x<-[2..12^4],mod(2^x-2)x+x==(read.reverse.show)x] -- gcd main=mapm print[x x<-[2..12^4],x==read(reverse$show$gcd(2^x-2)x)] Perfect Square Free Problem output all the numbers from 3 to 100 without perfect square. Output [3, 5, 6, 7, 8, 10, 11, 12, 13, 14, 15, 17, 18, 19, 20,, 99] f(n) = n + n, n N *15 Wikipedia 33
40 main=putstr$show[round$x+sqrt x x<-[2..90]]>>=max", ".(:[]) @shelarcy Haskell dog Hoogle Haskell 34
41 SS Scheme SS possum PC m m C 35
42 B5 Structure and Interpretation of Computer Programs 36
43 SS Scheme Scheme SICP 37
44 PC PC Scheme Lisp Lisp
45 SS Scheme 39
46 @t uda (fixed point) *1 F : X X F (x) = x x F. x x x *2 *1 *2 1 40
47 *3 *4 F x F { x0 : given = x = lim x n+1 = F (x n ) x n, F (x) = x n Newton Newton f x { x0 : given x n+1 = x n f(x n) f (x n ) = x = lim n x n, f(x) = 0 x n x 0 f *5 Kleene (D, ) D 2 sup *6 (max) A 0 A n A n+1 D (chain-complete) *7 2 N A n 2 N sup A n A n n *3 F def = r [0, 1) s.t. x, y. F (x) F (y) r x y *4 Brouwer Schauder Euclid Banach *5 *6 sup * N 0 N 0 N 0 N n 41
48 D F : D D F sup sup F (x n ) = F (sup x n ) *8 n n Prm Prm : 2 N 2 N Kleene Kleene D D F : D D *9 x { x0 = D = x = sup x x n+1 = F (x n ) n n 2 N 2 N Prm 2 { 2 } { 2, 3 }, { 2, 3, 5 },... * 10 Prm Kleene * 11 OCaml Haskell type nat = Zero Suc of nat;; * 12 Str F : 2 Str 2 Str F (S) := { Zero } { Suc s s S } F Nat = { Zero, Suc Zero, Suc Suc Zero,... } BNF Λ *8 Scott *9 x y x y *10 *11 (Knaster-)Tarski *12 42
49 <Lambda> ::= <Var> lambda <Var>. <Lambda> Scott Nat [[ ]] : Nat N; [[Zero] = 0, [[Suc s]] = 1 + [[s]] λ * 13 λ Λ λ [[ ]] D = D D A B A B λ D D D D [D D] * 14 D ϕ ψ [D D] Scott int bool tuple lambda ( D ϕ V int + V bool + ) D n + [D D] ψ n Scott C F : C C D F (D) D Smyth-Plotkin 3 *13 semantic function *14 (domain) D 43
50 lambda F (x) = x 1982 ISBN Proofs and Types, Jean-Yves Girard, Cambridge University Press, 1989, ISBN , Types and Programming Languages, Benjamin C. Pierce, The MIT Press, 2002, ISBN , Basic Category Theory for Computer Scientists, Benjamin C. Pierce, The MIT Press, 1991, ISBN Theories of Programming Languages, John C. Reynolds, Cambridge University Press, 1989, ISBN
51 @hidesys 2 3 Bhinneka Tunggal Ika 30 IMF 8/12 15 slime girls Sukiya Water
52 m
53 (Ojek) 10 Departure 10:10, Arrival 11:35 Late check-in. Beli
54 USB mp Union Pay ATM 6 1 kg 500 g X Stop! Open your bag. Yes. What is this powder? this is starch, ini pati. Why did you buy? Saya mehasiswa ekonomi pertanian, saya ingin membuat makanan Indonesia di Japang.???????? 48
55 ATM PASMO *1 *2 *3 *4 *5 *1 *2 *3 *4 *5 49
56 km 50
57
58 ,500 km 1 m BT 52
59 possum
60 BT 9 KMC 54
61 @d possum KMC vol.2 KMC 3 possum KMC vol.2 Google Docs KMC vol.2 gire Moko vol.1 seikichi vol.β crys possum 55
62 KMC vol Web gire crys moko
63
64
2
Haskell ( ) kazu@iij.ad.jp 1 2 Blub Paul Graham http://practical-scheme.net/trans/beating-the-averages-j.html Blub Blub Blub Blub 3 Haskell Sebastian Sylvan http://www.haskell.org/haskellwiki/why_haskell_matters...
fp.gby
1 1 2 2 3 2 4 5 6 7 8 9 10 11 Haskell 12 13 Haskell 14 15 ( ) 16 ) 30 17 static 18 (IORef) 19 20 OK NG 21 Haskell (+) :: Num a => a -> a -> a sort :: Ord a => [a] -> [a] delete :: Eq a => a -> [a] -> [a]
¥×¥í¥°¥é¥ß¥ó¥°±é½¬I Exercise on Programming I [1zh] ` `%%%`#`&12_`__~~~ alse
![¥×¥í¥°¥é¥ß¥ó¥°±é½¬I Exercise on Programming I [1zh] ` `%%%`#`&12_`__~~~ alse](/thumbs/97/134738565.jpg "¥×¥í¥°¥é¥ß¥ó¥°±é½¬I Exercise on Programming I [1zh] ` `%%%`#`&12_`__~~~ alse")
I Exercise on Programming I http://bit.ly/oitprog1 1, 2 of 14 ( RD S ) I 1, 2 of 14 1 / 44 Ruby Ruby ( RD S ) I 1, 2 of 14 2 / 44 7 5 9 2 9 3 3 2 6 5 1 3 2 5 6 4 7 8 4 5 2 7 9 6 4 7 1 3 ( RD S ) I 1, 2
haskell.gby
Haskell 1 2 3 Haskell ( ) 4 Haskell Lisper 5 Haskell = Haskell 6 Haskell Haskell... 7 qsort [8,2,5,1] [1,2,5,8] "Hello, " ++ "world!" "Hello, world!" 1 + 2 div 8 2 (+) 1 2 8 div 2 3 4 map even [1,2,3,4]
Copyright c 2006 Zhenjiang Hu, All Right Reserved.
1 2006 Copyright c 2006 Zhenjiang Hu, All Right Reserved. 2 ( ) 3 (T 1, T 2 ) T 1 T 2 (17.3, 3) :: (Float, Int) (3, 6) :: (Int, Int) (True, (+)) :: (Bool, Int Int Int) 4 (, ) (, ) :: a b (a, b) (,) x y
test.gby
Beautiful Programming Language and Beautiful Testing 1 Haskeller Haskeller 2 Haskeller (Doctest QuickCheck ) github 3 Haskeller 4 Haskell Platform 2011.4.0.0 Glasgow Haskell Compiler + 23 19 8 5 10 5 Q)
Copyright c 2008 Zhenjiang Hu, All Right Reserved.
2008 10 27 Copyright c 2008 Zhenjiang Hu, All Right Reserved. (Bool) True False data Bool = False True Remark: not :: Bool Bool not False = True not True = False (Pattern matching) (Rewriting rules) not
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)
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],
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
ML Edinburgh LCF ML Curry-Howard ML ( ) ( ) ( ) ( ) 1
More Logic More Types ML/OCaml GADT Jacques Garrigue ( ) Jacques Le Normand (Google) Didier Rémy (INRIA) @garriguejej ocamlgadt ML Edinburgh LCF ML Curry-Howard ML ( ) ( ) ( ) ( ) 1 ( ) ML type nebou and
2
2011.11.11 1 2 MapReduce 3 4 5 6 Functional Functional Programming 7 8 9 10 11 12 13 [10, 20, 30, 40, 50] 0 n n 10 * 0 + 20 * 1 + 30 * 2 + 40 * 3 + 50 *4 = 400 14 10 * 0 + 20 * 1 + 30 * 2 + 40 * 3 + 50
1. A0 A B A0 A : A1,...,A5 B : B1,...,B
1. A0 A B A0 A : A1,...,A5 B : B1,...,B12 2. 3. 4. 5. A0 A, B Z Z m, n Z m n m, n A m, n B m=n (1) A, B (2) A B = A B = Z/ π : Z Z/ (3) A B Z/ (4) Z/ A, B (5) f : Z Z f(n) = n f = g π g : Z/ Z A, B (6)
bdd.gby
Haskell Behavior Driven Development 2012.5.27 @kazu_yamamoto 1 Haskell 4 Mew Firemacs Mighty ghc-mod 2 Ruby/Java HackageDB 3 Haskeller 4 Haskeller 5 Q) Haskeller A) 6 7 Haskeller Haskell 8 9 10 Haskell
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
1. A0 A B A0 A : A1,...,A5 B : B1,...,B
1. A0 A B A0 A : A1,...,A5 B : B1,...,B12 2. 3. 4. 5. A0 A B f : A B 4 (i) f (ii) f (iii) C 2 g, h: C A f g = f h g = h (iv) C 2 g, h: B C g f = h f g = h 4 (1) (i) (iii) (2) (iii) (i) (3) (ii) (iv) (4)
# 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)
「計算と論理」 Software Foundations その4
Software Foundations 4 cal17@fos.kuis.kyoto-u.ac.jp http://www.fos.kuis.kyoto-u.ac.jp/~igarashi/class/cal/ November 7, 2017 ( ) ( 4) November 7, 2017 1 / 51 Poly.v ( ) ( 4) November 7, 2017 2 / 51 : (
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
情報科学概論 第1回資料
1. Excel (C) Hiroshi Pen Fujimori 1 2. (Excel) 2.1 Excel : 2.2Excel Excel (C) Hiroshi Pen Fujimori 2 256 (IV) :C (C 65536 B4 :2 (2 A3 Excel (C) Hiroshi Pen Fujimori 3 Tips: (1) B3 (2) (*1) (3) (4)Word
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)
つくって学ぶプログラミング言語 RubyによるScheme処理系の実装
Ruby Scheme 2013-04-16 ( )! SICP *1 ;-) SchemeR SICP MIT * 1 Structure and Interpretaion of Computer Programs 2nd ed.: 2 i SchemeR Ruby Ruby Ruby Ruby & 3.0 Ruby ii https://github.com/ichusrlocalbin/scheme_in_ruby
連載 構文解析器結合子 山下伸夫 (( 株 ) タイムインターメディア ) 文字列の分解 1 1 Haskell lines Prelude lines :: String -> [String] lines "" = [] lines s = let (l,s'
![連載 構文解析器結合子 山下伸夫 (( 株 ) タイムインターメディア ) 文字列の分解 1 1 Haskell lines Prelude lines :: String -> [String] lines = [] lines s = let (l,s'](/thumbs/88/117152646.jpg "連載 構文解析器結合子 山下伸夫 (( 株 ) タイムインターメディア ) 文字列の分解 1 1 Haskell lines Prelude lines :: String -> [String] lines = [] lines s = let (l,s'")
連載 構文解析器結合子 山下伸夫 (( 株 ) タイムインターメディア ) nobsun@sampou.org 文字列の分解 1 1 Haskell lines Prelude lines :: String -> [String] lines "" = [] lines s = let (l,s') = break ('\n'==) s in l : case s' of [] -> [] (_:s'')
1. A0 A B A0 A : A1,...,A5 B : B1,...,B12 2. 5 3. 4. 5. A0 (1) A, B A B f K K A ϕ 1, ϕ 2 f ϕ 1 = f ϕ 2 ϕ 1 = ϕ 2 (2) N A 1, A 2, A 3,... N A n X N n X N, A n N n=1 1 A1 d (d 2) A (, k A k = O), A O. f
Ruby Ruby ruby Ruby G: Ruby>ruby Ks sample1.rb G: Ruby> irb (interactive Ruby) G: Ruby>irb -Ks irb(main):001:0> print( ) 44=>
Ruby Ruby 200779 ruby Ruby G: Ruby>ruby Ks sample1.rb G: Ruby> irb (interactive Ruby) G: Ruby>irb -Ks irb(main):001:0> print( 2+3+4+5+6+7+8+9 ) 44 irb(main):002:0> irb irb(main):001:0> 1+2+3+4 => 10 irb(main):002:0>
# 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
4 (induction) (mathematical induction) P P(0) P(x) P(x+1) n P(n) 4.1 (inductive definition) A A (basis ) ( ) A (induction step ) A A (closure ) A clos
4 (induction) (mathematical induction) P P(0) P(x) P(x+1) n P(n) 4.1 (inductive definition) A A (basis ) ( ) A (induction step ) A A (closure ) A closure 81 3 A 3 A x A x + A A ( A. ) 3 closure A N 1,
untitled
280 200 5 7,800 6 8,600 28 1 1 18 7 8 2 ( 31 ) 7 42 2 / / / / / / / / / / 1 3 (1) 4 5 3 1 1 1 A B C D 6 (1) -----) (2) -- ()) (3) ----(). ()() () ( )( )( )( ) ( ) ( )( )( )( ) () (). () ()() 7 () ( ) 1
Microsoft Word - SNSで繋がる人間関係.doc
SNS SNS ID SNS ixi Twitter Facebook SNS SNS SNS SNS SNS SNS Mixi Mixi Mixi SNS SNS SNS Mixi 2009 9 30 1,792 SNS 52.2% 47.8% 20 24 33.8% 25 29 28.4% 30 34 17.6% Wikipedia SNS Mixi Mixi SNS Mixi SNS Twitter
NOTE P, A,. A P ( A, P ),,.,. P A. (set) (set), (). (element), (element).,.,. ( A, B, X, Y, P ), { } (),..3 (union) A, B,A B, A B (union),. A B = {x x
2. (set)............... 2.2,.... 2.3 (union)............ 2.4 (intersection)......... 2.5 (power set)......... 3.6 (cartesian product set)... 3 2, 3 2. (length)........ 3 2.2 (epsilon)............ 3 2.3
1
005 11 http://www.hyuki.com/girl/ http://www.hyuki.com/story/tetora.html http://www.hyuki.com/ Hiroshi Yuki c 005, All rights reserved. 1 1 3 (a + b)(a b) = a b (x + y)(x y) = x y a b x y a b x y 4 5 6
LDA (Latent Dirichlet Allocation) Wikipediade LDA 2 / 37
Latent Dirichlet Allocation W707 s-taiji@is.titech.ac.jp 1 / 37 LDA (Latent Dirichlet Allocation) Wikipediade LDA 2 / 37 1 LDA: Latent Dirichlet Allocation 2 Wikipedia LDA 3 3 / 37 DF 4 / 37 DF 4 / 37
ohp03.dvi
19 3 ( ) 2019.4.20 CS 1 (comand line arguments) Unix./a.out aa bbb ccc ( ) C main void int main(int argc, char *argv[]) {... 2 (2) argc argv argc ( ) argv (C char ) ( 1) argc 4 argv NULL. / a. o u t \0
Pascal Pascal Free Pascal CPad for Pascal Microsoft Windows OS Pascal
Pascal Pascal Pascal Free Pascal CPad for Pascal Microsoft Windows OS 2010 10 1 Pascal 2 1.1.......................... 2 1.2.................. 2 1.3........................ 3 2 4 2.1................................
( [1]) (1) ( ) 1: ( ) 2 2.1,,, X Y f X Y (a mapping, a map) X ( ) x Y f(x) X Y, f X Y f : X Y, X f Y f : X Y X Y f f 1 : X 1 Y 1 f 2 : X 2 Y 2 2 (X 1
![( [1]) (1) ( ) 1: ( ) 2 2.1,,, X Y f X Y (a mapping, a map) X ( ) x Y f(x) X Y, f X Y f : X Y, X f Y f : X Y X Y f f 1 : X 1 Y 1 f 2 : X 2 Y 2 2 (X 1](/thumbs/91/105288755.jpg "( [1]) (1) ( ) 1: ( ) 2 2.1,,, X Y f X Y (a mapping, a map) X ( ) x Y f(x) X Y, f X Y f : X Y, X f Y f : X Y X Y f f 1 : X 1 Y 1 f 2 : X 2 Y 2 2 (X 1")
2013 5 11, 2014 11 29 WWW ( ) ( ) (2014/7/6) 1 (a mapping, a map) (function) ( ) ( ) 1.1 ( ) X = {,, }, Y = {, } f( ) =, f( ) =, f( ) = f : X Y 1.1 ( ) (1) ( ) ( 1 ) (2) 1 function 1 ( [1]) (1) ( ) 1:
jssst-ocaml.mgp
Objective Caml Jacques Garrigue Kyoto University garrigue@kurims.kyoto-u.ac.jp Objective Caml? 2 Objective Caml GC() Standard MLHaskell 3 OCaml () OCaml 5 let let x = 1 + 2 ;; val x : int = 3 ;; val-:
第9回 型とクラス
1 関数型プログラミング 第 9 回型とクラス 萩野達也 hagino@sfc.keio.ac.jp 2 静的型検査と型推論 型 値の集合 Bool = { True, False } Char = { 'a', 'b',... } Int = {... -2, -1, 0, 1, 2, 3,... } 静的型検査 Haskell はコンパイル時に式の型を検査する 静的 = コンパイル時 (v.s.
r03.dvi
19 ( ) 019.4.0 CS 1 (comand line arguments) Unix./a.out aa bbb ccc ( ) C main void... argc argv argc ( ) argv (C char ) ( 1) argc 4 argv NULL. / a. o u t \0 a a \0 b b b \0 c c c \0 1: // argdemo1.c ---
Excel ではじめる数値解析 サンプルページ この本の定価 判型などは, 以下の URL からご覧いただけます. このサンプルページの内容は, 初版 1 刷発行時のものです.
Excel ではじめる数値解析 サンプルページ この本の定価 判型などは, 以下の URL からご覧いただけます. http://www.morikita.co.jp/books/mid/009631 このサンプルページの内容は, 初版 1 刷発行時のものです. Excel URL http://www.morikita.co.jp/books/mid/009631 i Microsoft Windows
2.2 Sage I 11 factor Sage Sage exit quit 1 sage : exit 2 Exiting Sage ( CPU time 0m0.06s, Wall time 2m8.71 s). 2.2 Sage Python Sage 1. Sage.sage 2. sa
I 2017 11 1 SageMath SageMath( Sage ) Sage Python Sage Python Sage Maxima Maxima Sage Sage Sage Linux, Mac, Windows *1 2 Sage Sage 4 1. ( sage CUI) 2. Sage ( sage.sage ) 3. Sage ( notebook() ) 4. Sage
コンピュータ概論
4.1 For Check Point 1. For 2. 4.1.1 For (For) For = To Step (Next) 4.1.1 Next 4.1.1 4.1.2 1 i 10 For Next Cells(i,1) Cells(1, 1) Cells(2, 1) Cells(10, 1) 4.1.2 50 1. 2 1 10 3. 0 360 10 sin() 4.1.2 For
進化
YouTuber - 白 石 達 也 - -----Original Message------ YouTuber ------End Of Message------- 3 3 1 100 10 120Kg 1 7 5 2 5 1 2 3 4 5 2 3 YouTuber 37 37 63 3 9 5 ( ========= 1) ========= 5 Point1 Point2 Point3
第12回 モナドパーサ
1 関数型プログラミング 第 13 回モナドパーサ 萩野達也 hagino@sfc.keio.ac.jp Slide URL https://vu5.sfc.keio.ac.jp/slide/ 2 モナドパーサ モナドを使って構文解析を行ってみましょう. data Parser a = Parser (String -> Maybe (a, String)) 字句解析も構文解析の一部に含めてしまいます.
A/B (2010/10/08) Ver kurino/2010/soft/soft.html A/B
A/B (2010/10/08) Ver. 1.0 kurino@math.cst.nihon-u.ac.jp http://edu-gw2.math.cst.nihon-u.ac.jp/ kurino/2010/soft/soft.html 2010 10 8 A/B 1 2010 10 8 2 1 1 1.1 OHP.................................... 1 1.2.......................................
ohp02.dvi
172 2017.7.16 1 ? X A B A X B ( )? IBMPL/I FACOM PL1 ( ) X 2 ( ) 3 2-0 ( ) ( ) ( ) (12) ( ) (112) 31) 281 26 1 4 (syntax) (semantics) ( ) 5 BNF BNF(Backus Normal Form) Joun Backus (grammer) English grammer
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
第10回 モジュール
1 FUNCTIONAL PROGRAMMING 第 10 回モジュール 萩野達也 hagino@sfc.keio.ac.jp 2 モジュール モジュールは以下のエンティティを含みます. 変数 型コンストラクタ データコンストラクタ フィールドラベル 型クラス クラスメソッド Java のパッケージに似ている 名前空間はモジュールごとに分かれている 名前 ( 識別子 ) はモジュールで一意的でなくてはいけない
a n a n ( ) (1) a m a n = a m+n (2) (a m ) n = a mn (3) (ab) n = a n b n (4) a m a n = a m n ( m > n ) m n 4 ( ) 552
3 3.0 a n a n ( ) () a m a n = a m+n () (a m ) n = a mn (3) (ab) n = a n b n (4) a m a n = a m n ( m > n ) m n 4 ( ) 55 3. (n ) a n n a n a n 3 4 = 8 8 3 ( 3) 4 = 8 3 8 ( ) ( ) 3 = 8 8 ( ) 3 n n 4 n n
Functional Programming
PROGRAMMING IN HASKELL プログラミング Haskell Chapter 10 - Declaring Types and Classes 型とクラスの定義 愛知県立大学情報科学部計算機言語論 ( 山本晋一郎 大久保弘崇 2011 年 ) 講義資料オリジナルは http://www.cs.nott.ac.uk/~gmh/book.html を参照のこと 0 型宣言 (Type Declarations)
all.dvi
fortran 1996 4 18 2007 6 11 2012 11 12 1 3 1.1..................................... 3 1.2.............................. 3 2 fortran I 5 2.1 write................................ 5 2.2.................................
パズルをSugar制約ソルバーで解く
Sugar 1 2 3 1 CSPSAT 2008 8 21 Sugar 1 2 3 Sugar Sugar (CSP) (SAT ) (encode) SAT SAT order encoding direct encoding support encoding http://bachistckobe-uacjp/sugar/ Web Sugar 1 2 3 Sugar SAT (COP) MAX-CSP
10/ / /30 3. ( ) 11/ 6 4. UNIX + C socket 11/13 5. ( ) C 11/20 6. http, CGI Perl 11/27 7. ( ) Perl 12/ 4 8. Windows Winsock 12/11 9. JAV
tutimura@mist.i.u-tokyo.ac.jp kaneko@ipl.t.u-tokyo.ac.jp http://www.misojiro.t.u-tokyo.ac.jp/ tutimura/sem3/ 2002 11 20 p.1/34 10/16 1. 10/23 2. 10/30 3. ( ) 11/ 6 4. UNIX + C socket 11/13 5. ( ) C 11/20
http://banso.cocolog-nifty.com/ 100 100 250 5 1 1 http://www.banso.com/ 2009 5 2 10 http://www.banso.com/ 2009 5 2 http://www.banso.com/ 2009 5 2 http://www.banso.com/ < /> < /> / http://www.banso.com/
) 2008 8 21 22 21 10:00 12:00 e iπ 1. i ). e π. T @ MacTutor History of Mathematics archive www-history.mcs.standrews.ac.uk/history/ FAQ kawaguch))math.sci.osaka-u.ac.jp 2008 8 21 Part 1 e πi = 1 e = 2.71828...
n=360 28.6% 34.4% 36.9% n=360 2.5% 17.8% 19.2% n=64 0.8% 0.3% n=69 1.7% 3.6% 0.6% 1.4% 1.9% < > n=218 1.4% 5.6% 3.1% 60.6% 0.6% 6.9% 10.8% 6.4% 10.3% 33.1% 1.4% 3.6% 1.1% 0.0% 3.1% n=360 0% 50%
/ AICHI UNIVERSITY OF EDUCATION A { z = x + iy 0.100 ¥×¥í¥°¥é¥ß¥ó¥°±é½¬I Exercise on Programming I [1zh] ` `%%%`#`&12_`__~~~ alse
![¥×¥í¥°¥é¥ß¥ó¥°±é½¬I Exercise on Programming I [1zh] ` `%%%`#`&12_`__~~~ alse](/thumbs/104/163649157.jpg "¥×¥í¥°¥é¥ß¥ó¥°±é½¬I Exercise on Programming I [1zh] ` `%%%`#`&12_`__~~~ alse")
I Exercise on Programming I http://bit.ly/oitprog1 13 of 14 ( RD S ) I 13 of 14 1 / 39 https://bit.ly/oitprog1 ( RD S ) I 13 of 14 2 / 39 game.rb ( RD S ) I 13 of 14 3 / 39 game.rb 12 ( ) 1 require "io/console"
…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
Microsoft PowerPoint - 11RubyIntro-No02.ppt [互換モード]
![Microsoft PowerPoint - 11RubyIntro-No02.ppt [互換モード]](/thumbs/84/91185928.jpg "Microsoft PowerPoint - 11RubyIntro-No02.ppt [互換モード]")
Ruby 入門 東京電機大学櫻井彰人 Ruby とは? Ruby: 松本ゆきひろ氏による (1993) 純粋オブジェクト指向 スクリプト言語 Web プログラムで どんどんポピュラーに Ruby on Rails (http://www.rubyonrails.org/) なぜか きわめて Lisp like 松本行弘 (Matz) Introduction 実行環境 Windows/Unix/Linux/
BOX BOX 19 4 i
Lime 35 BOX BOX 19 4 i 1 1 1.1.............................. 1 1.2.......................... 1 1.3......................... 2 1.4........................ 2 1.5 Lime......................... 2 2 3 2.1.........................
27 4 2 Lime 51 i 27 4 ii I.............................. 1 I.1..................................... 1 I.2.................................. 1 I.3 Lime................................ 2 I.4.................................
1 # include < stdio.h> 2 # include < string.h> 3 4 int main (){ 5 char str [222]; 6 scanf ("%s", str ); 7 int n= strlen ( str ); 8 for ( int i=n -2; i
![1 # include < stdio.h> 2 # include < string.h> 3 4 int main (){ 5 char str [222]; 6 scanf (%s, str ); 7 int n= strlen ( str ); 8 for ( int i=n -2; i](/thumbs/89/99201513.jpg "1 # include < stdio.h> 2 # include < string.h> 3 4 int main (){ 5 char str [222]; 6 scanf (%s, str ); 7 int n= strlen ( str ); 8 for ( int i=n -2; i")
ABC066 / ARC077 writer: nuip 2017 7 1 For International Readers: English editorial starts from page 8. A : ringring a + b b + c a + c a, b, c a + b + c 1 # include < stdio.h> 2 3 int main (){ 4 int a,
2009 Web B012-1
2009 Web 2010 2 1 5108B012-1 1 4 1.1....................................... 4 1.2................................... 4 2 Web 5 2.1 Web............................... 5 2.2 Web.................................
r02.dvi
172 2017.7.16 1 1.1? X A B A X B ( )? IBMPL/I FACOM PL1 ( ) X ( ) 1.2 1 2-0 ( ) ( ) ( ) (12) ( ) (112) (131) 281 26 1 (syntax) (semantics) ( ) 2 2.1 BNF BNF(Backus Normal Form) Joun Backus (grammer) English
Appendix A BASIC BASIC Beginner s All-purpose Symbolic Instruction Code FORTRAN COBOL C JAVA PASCAL (NEC N88-BASIC Windows BASIC (1) (2) ( ) BASIC BAS
Appendix A BASIC BASIC Beginner s All-purpose Symbolic Instruction Code FORTRAN COBOL C JAVA PASCAL (NEC N88-BASIC Windows BASIC (1 (2 ( BASIC BASIC download TUTORIAL.PDF http://hp.vector.co.jp/authors/va008683/
たのしいプログラミング Pythonではじめよう！
Title of English-language original: Python for Kids A Playful Introduction to Programming ISBN 978-1-59327-407-8, published by No Starch Press, Inc. Copyright 2013 by Jason R. Briggs. Japanese-language
4 4 4 a b c d a b A c d A a da ad bce O E O n A n O ad bc a d n A n O 5 {a n } S n a k n a n + k S n a a n+ S n n S n n log x x {xy } x, y x + y 7 fx
4 4 5 4 I II III A B C, 5 7 I II A B,, 8, 9 I II A B O A,, Bb, b, Cc, c, c b c b b c c c OA BC P BC OP BC P AP BC n f n x xn e x! e n! n f n x f n x f n x f k x k 4 e > f n x dx k k! fx sin x cos x tan
II Time-stamp: <05/09/30 17:14:06 waki> ii
II waki@cc.hirosaki-u.ac.jp 18 1 30 II Time-stamp: ii 1 1 1.1.................................................. 1 1.2................................................... 3 1.3..................................................
導入基礎演習.ppt
Multi-paradigm Programming Functional Programming Scheme Haskell ML Scala X10 KL1 Prolog Declarative Lang. C Procedural Lang. Java C++ Python Object-oriented Programming / (root) bin home lib 08 09
r1.dvi
Ruby 2009.9.7 1 ( ) --- ( ( ) ( ) 1 --- ( ) 1 ( ) (?) IT 7K( )?? ( ) ( )? IT ( ) --- ( ) 1 ( ) --- ( ) (?) 2-3% Top-Level ICT Professional 5% ICT Professional 10% 100% 50% 20% Devl. Experiment Adv. ICT
pontab_0418_2.indd
for all visitor, customer, and independent merchant Vol.02 \0 TAKE FREE 2011 spring MAP B-4 http://ustre.am/mzl8 http://www.nipponbashi-t.jp/ MAP B-2,B-5 MAP B-3,B-5 http://ustre.am/tbze http://ustre.am/wxmu
Excel97関数編
Excel97 SUM Microsoft Excel 97... 1... 1... 1... 2... 3... 3... 4... 5... 6... 6... 7 SUM... 8... 11 Microsoft Excel 97 AVERAGE MIN MAX SUM IF 2 RANK TODAY ROUND COUNT INT VLOOKUP 1/15 Excel A B C A B
¥×¥í¥°¥é¥ß¥ó¥°±é½¬I Exercise on Programming I [1zh] ` `%%%`#`&12_`__~~~ alse
![¥×¥í¥°¥é¥ß¥ó¥°±é½¬I Exercise on Programming I [1zh] ` `%%%`#`&12_`__~~~ alse](/thumbs/104/163649169.jpg "¥×¥í¥°¥é¥ß¥ó¥°±é½¬I Exercise on Programming I [1zh] ` `%%%`#`&12_`__~~~ alse")
I Exercise on Programming I http://bit.ly/oitprog1 12 of 14 ( RD S ) I 12 of 14 1 / 35 https://bit.ly/oitprog1 ( RD S ) I 12 of 14 2 / 35 game.rb ( RD S ) I 12 of 14 3 / 35 game.rb 11 ( ) 1 require "io/console"
I: 2 : 3 +
I: 1 I: 2008 I: 2 : 3 + I: 3, 3700. (ISBN4-00-010352-0) H.P.Barendregt, The lambda calculus: its syntax and semantics, Studies in logic and the foundations of mathematics, v.103, North-Holland, 1984. (ISBN
Python Speed Learning
Python Speed Learning 1 / 89 1 2 3 4 (import) 5 6 7 (for) (if) 8 9 10 ( ) 11 12 for 13 2 / 89 Contents 1 2 3 4 (import) 5 6 7 (for) (if) 8 9 10 ( ) 11 12 for 13 3 / 89 (def) (for) (if) etc. 1 4 / 89 Jupyter
BASIC / / BA- SIC Web 1/10 1/10 / / JavaScript
BASIC / / BA- SIC Web 1/10 1/10 // JavaScript MIT Processing line(10,10,100,100); 1 BASIC / Phidgets 1 GAINER 2 USB / Phidgets USB 1: 1 http://www.phidgets.com/ 2 http://gainer.cc/ / / BGM Phidgets University
記号と準備
tbasic.org * 1 [2017 6 ] 1 2 1.1................................................ 2 1.2................................................ 2 1.3.............................................. 3 2 5 2.1............................................
Emacs Ruby..
command line editor 27014533 2018 3 1 5 1.1................................... 5 1.2................................... 5 2 6 2.1 Emacs...................................... 6 2.2 Ruby.......................................
2011.12.3 1 2 Q) A) 3 Q) A) 4 5 6 Haskell 7 8 Parser data Parser a = Parser (String -> [(a,string)]) Parser pwrap :: a -> Parser a pwrap v = Parser $ \inp -> [(v,inp)] Parser pbind :: Parser a -> (a ->
橡Taro9-生徒の活動.PDF
3 1 4 1 20 30 2 2 3-1- 1 2-2- -3- 18 1200 1 4-4- -5- 15 5 25 5-6- 1 4 2 1 10 20 2 3-7- 1 2 3 150 431 338-8- 2 3 100 4 5 6 7 1-9- 1291-10 - -11 - 10 1 35 2 3 1866 68 4 1871 1873 5 6-12 - 1 2 3 4 1 4-13
10/ / /30 3. ( ) 11/ 6 4. UNIX + C socket 11/13 5. ( ) C 11/20 6. http, CGI Perl 11/27 7. ( ) Perl 12/ 4 8. Windows Winsock 12/11 9. JAV
tutimura@mist.i.u-tokyo.ac.jp kaneko@ipl.t.u-tokyo.ac.jp http://www.misojiro.t.u-tokyo.ac.jp/ tutimura/sem3/ 2002 12 11 p.1/33 10/16 1. 10/23 2. 10/30 3. ( ) 11/ 6 4. UNIX + C socket 11/13 5. ( ) C 11/20
(1/2) 2/45 HPC top runner application programmer PC-9801F N88-BASIC Quick BASIC + DOS ( ) BCB Windows Percolation, Event-driven MD ActionScript Flash
1/45 8 Outline 1. 2. 3. 4. Jun. 6, 2013@ A (1/2) 2/45 HPC top runner application programmer PC-9801F N88-BASIC Quick BASIC + DOS ( ) BCB Windows Percolation, Event-driven MD ActionScript Flash MPI MD (2/2)
第8回 関数
1 関数型プログラミング 第 8 回関数 萩野達也 hagino@sfc.keio.ac.jp 2 関数定義 square n = n * n 与えられた数の 2 乗を計算する square 関数を定義している. 変数 square に 2 乗を計算する関数を束縛 (bind) したい. a = 10 変数 a に定数 10 を束縛する. square =... 3 高階関数 関数も値の一つである.
橡統計担当者のためのエクセル表紙.PDF
Num Lock(Pad Lock) ( Num Lock) [ ][ ] [ ][ ] Alt Alt 4 + ( ) 3+3 - ( ) 3-1 -1 * ( ) 3*3 / ( ) 3/3 % ( ) 20% ^ ( ) 3^2 (3*3 ) 2 TRUE FALSE = ( ) A1=B1 > ( ) A1>B1 < ( ) A1= ( ) A1>=B1
(CC Attribution) Lisp 2.1 (Gauche )
http://www.flickr.com/photos/dust/3603580129/ (CC Attribution) Lisp 2.1 (Gauche ) 2 2000EY-Office 3 4 Lisp 5 New York The lisps Sammy Tunis flickr lisp http://www.flickr.com/photos/dust/3603580129/ (CC
チーズケーキ技術 17.12
2 1 Node.js 1 9 1 10 1.1...................................... 10 Node.js.............................. 10 FFMPEG............................. 10 1.2............................... 11 JavaScript................................
1990 IMO 1990/1/15 1:00-4:00 1 N N N 1, N 1 N 2, N 2 N 3 N 3 2 x x + 52 = 3 x x , A, B, C 3,, A B, C 2,,,, 7, A, B, C
0 9 (1990 1999 ) 10 (2000 ) 1900 1994 1995 1999 2 SAT ACT 1 1990 IMO 1990/1/15 1:00-4:00 1 N 1990 9 N N 1, N 1 N 2, N 2 N 3 N 3 2 x 2 + 25x + 52 = 3 x 2 + 25x + 80 3 2, 3 0 4 A, B, C 3,, A B, C 2,,,, 7,
駒沢大学ガイドブック.indd
3 4 4 5 6 11 13 14 14 15 16 19 21 22 24 25 31 32 32 33 34 35 39 45 47 47 48 49 51 53 53 54 54 54 55 57 59 60 60 61 62 62 62 63 63 64 65 67 69 70 72 73 73 74 74 75 75 76 76 76 78 79 79 80 81 82 83 84 86
VDM-SL VDM VDM-SL Toolbox VDM++ Toolbox 1 VDM-SL VDM++ Web bool
VDM-SL VDM++ 23 6 28 VDM-SL Toolbox VDM++ Toolbox 1 VDM-SL VDM++ Web 2 1 3 1.1............................................... 3 1.1.1 bool......................................... 3 1.1.2 real rat int
Basic Math. 1 0 [ N Z Q Q c R C] 1, 2, 3,... natural numbers, N Def.(Definition) N (1) 1 N, (2) n N = n +1 N, (3) N (1), (2), n N n N (element). n/ N.
![Basic Math. 1 0 [ N Z Q Q c R C] 1, 2, 3,... natural numbers, N Def.(Definition) N (1) 1 N, (2) n N = n +1 N, (3) N (1), (2), n N n N (element). n/ N.](/thumbs/93/113887245.jpg "Basic Math. 1 0 [ N Z Q Q c R C] 1, 2, 3,... natural numbers, N Def.(Definition) N (1) 1 N, (2) n N = n +1 N, (3) N (1), (2), n N n N (element). n/ N.")
Basic Mathematics 16 4 16 3-4 (10:40-12:10) 0 1 1 2 2 2 3 (mapping) 5 4 ε-δ (ε-δ Logic) 6 5 (Potency) 9 6 (Equivalence Relation and Order) 13 7 Zorn (Axiom of Choice, Zorn s Lemma) 14 8 (Set and Topology)
monad.gby
2012.11.18 1 1 2 2 DSL 3 4 Q) A) 5 Q) A) 6 7 8 Haskell 9 10 Parser data Parser a = Parser (String -> [(a,string)]) Parser pwrap :: a -> Parser a pwrap v = Parser $ \inp -> [(v,inp)] Parser pbind :: Parser
x, y x 3 y xy 3 x 2 y + xy 2 x 3 + y 3 = x 3 y xy 3 x 2 y + xy 2 x 3 + y 3 = 15 xy (x y) (x + y) xy (x y) (x y) ( x 2 + xy + y 2) = 15 (x y)
x, y x 3 y xy 3 x 2 y + xy 2 x 3 + y 3 = 15 1 1977 x 3 y xy 3 x 2 y + xy 2 x 3 + y 3 = 15 xy (x y) (x + y) xy (x y) (x y) ( x 2 + xy + y 2) = 15 (x y) ( x 2 y + xy 2 x 2 2xy y 2) = 15 (x y) (x + y) (xy
フォトメン
1. SWOT 3. 2. 4. 2/27 3/27 4/27 S O W T 5/27 94520000 5 12509850 6 Facebook iphone 15005500 4 12503080 4 12805980 8 6/27 1. SWOT 3. 2. 4. 7/27 8/27 9/27 ( 345 7000 62.5 216 625 http://www.stat.go.jp/data/nihon/22.htm
K227 Java 2
1 K227 Java 2 3 4 5 6 Java 7 class Sample1 { public static void main (String args[]) { System.out.println( Java! ); } } 8 > javac Sample1.java 9 10 > java Sample1 Java 11 12 13 http://java.sun.com/j2se/1.5.0/ja/download.html
Functional Programming
PROGRAMMING IN HASKELL プログラミング Haskell Chapter 7 - Higher-Order Functions 高階関数 愛知県立大学情報科学部計算機言語論 ( 山本晋一郎 大久保弘崇 2013 年 ) 講義資料オリジナルは http://www.cs.nott.ac.uk/~gmh/book.html を参照のこと 0 Introduction カリー化により
297x210_CardNews_WTR17_PDF1
mini.jp facebook.com/mini.japan MINI CARD NEWS WINTER 2017 TOPIC01. MINI MINI MINI MINI cp.mini.jp/family MINI 3 DOOR. 45 / / 37 / / MINI 3 Door One (MT) 2,300,000 / One (AT) 2,440,000 / Cooper (MT) 2,720,000
