Prolog Prolog (GNU Prolog) PROLOG (PROgramming in LOGic) 1972 A. Colmerauer LISP Bruce A. Tate 7 7 Ruby, Io, Prolog, Scala, Erlang, Clojure, and Haske
|
|
|
- しおり なつ
- 5 years ago
- Views:
Transcription
1 Prolog Prolog (GNU Prolog) PROLOG (PROgramming in LOGic) 1972 A. Colmerauer LISP Bruce A. Tate 7 7 Ruby, Io, Prolog, Scala, Erlang, Clojure, and Haskell GNU Prolog Prolog Prolog mg :- mgo, h2. h2o :- mgo, h2. co2 :- c, o2. h2co3 :- co2, h2o. mgo. h2. o2. c. h2co3.pl.pl Prolog 1
2 h2co3.pl Prolog h2co3.pl Prolog?- listing. 2
3 ?- listing. co2 :- c, o2. c. h2. o2. h2co3 :- co2, h2o. mgo. mg :- mgo, h2. h2o :- mgo, h2.?- listing. Prolog Prolog?- mgo.?- h2.?- au. 3
4 uncaught exception: error(existence_error(procedure,au/0),top_level/0) Prolog mg :- mgo, h2. h2o :- mgo, h2. co2 :- c, o2. h2co3 :- co2, h2o. mgo. h2. o2. c. mgo. (MgO) MgO Prolog mgo (MgO) mgo (atom) mgo Prolog h2. (H2) 4
5 o2. (O2) c. (C) Prolog?- Prolog?- mgo. (MgO) (MgO) mgo.?- mgo.?- h2. h2.?- au. au. au Prolog?- co2. 5
6 co2. au co2. CO2 co2 :- c, o2. co2 c o2 (C) (O2) (CO2) Prolog (CO2) (C) (O2) o2. c. Prolog?- h2co3. 6
7 h2co3. h2co3 :- co2, h2o. h2co3 co2 h2o co2 c o2 h2o Prolog h2o. h2o :- mgo, h2. (MgO) (H2) (Mg) (H2O) mg :- mgo, h2. h2o :- mgo, h2. (MgO) (H2) (Mg) (MgO) (H2) (H2O) (H2O) (MgO) (H2) 7
8 mgo. h2. Prolog mg :- mgo, h2. h2o :- mgo, h2. co2 :- c, o2. h2co3 :- co2, h2o. mgo. h2. o2. c.?- h2co3. head h2co3 h2co3 :- co2, h2o. body co2, h2o. co2 h2o h2co3 :- co2, h2o. h2co3 head co2, h2o. bodygoal co2, h2o. head co2 co2 :- c, o2. co2 body c, o2. c, o2, h2o. c o2 h2o head c 8
9 c. o2, h2o. o2 h2o head o2 o2. head h2o h2o :- mgo, h2. goal mgo, h2. mgo. head h2 h2. Prolog child(toyotomi_hideyori, yodonokata). child(toyotomi_hideyori, toyotomi_hideyosi). child(turumatsu, yodonokata). child(turumatsu, toyotomi_hideyosi). child(yodonokata, oichi). child(yodonokata, azai_nagamasa). child(ohatsu, oichi). child(ohatsu, azai_nagamasa). child(ogou, oichi). child(ogou, azai_nagamasa). child(toyotomi_hideyosi, kinosita_yaemon). child(toyotomi_hideyosi, naka). child(toyotomi_hidenaga, takeami). child(toyotomi_hidenaga, naka). child(asahi, takeami). 9
10 child(asahi, naka). child(tomo, kinosita_yaemon). child(tomo, naka). child(toyotomi_hidetsugu, miyosi_yosihusa). child(toyotomi_hidetsugu, tomo). child(senhime, tokugawa_hidetada). child(senhime, ogou). child(tokugawa_iemitsu, tokugawa_hidetada). child(tokugawa_iemitsu, ogou). male(toyotomi_hideyori). male(turumatsu). male(toyotomi_hideyosi). male(toyotomi_hidenaga). male(toyotomi_hidetsugu). male(tokugawa_iemitsu). male(azai_nagamasa). male(kinosita_yaemon). male(takeami). male(tokugawa_hidetada). female(yodonokata). female(oichi). female(ohatsu). female(ogou). female(naka). female(tomo). female(senhime). father(x, Y) :- child(y, X), male(x). mother(x, Y) :- child(y, X), female(x). father(x) :- child(y, X), male(x). mother(x) :- child(y, X), female(x). ancestor(x, Y) :- child(y, X). ancestor(x, Y) :- child(z, X), ancestor(z, Y). descendant(x, Y) :- child(x, Y). descendant(x, Y) :- child(x, Z), descendant(z, Y). family.pl family.pl GNU Prolog child(toyotomi_hideyori, yodonokata). child(toyotomi_hideyori, toyotomi_hideyosi). child(turumatsu, yodonokata). child(turumatsu, toyotomi_hideyosi). child(yodonokata, oichi). child(yodonokata, azai_nagamasa). 10
11 child(ohatsu, oichi). child(ohatsu, azai_nagamasa). child(ogou, oichi). child(ogou, azai_nagamasa). child(toyotomi_hideyosi, kinosita_yaemon). child(toyotomi_hideyosi, naka). child(toyotomi_hidenaga, takeami). child(toyotomi_hidenaga, naka). child(asahi, takeami). child(asahi, naka). child(tomo, kinosita_yaemon). child(tomo, naka). child(toyotomi_hidetsugu, miyosi_yosihusa). child(toyotomi_hidetsugu, tomo). child(senhime, tokugawa_hidetada). child(senhime, ogou). child(tokugawa_iemitsu, tokugawa_hidetada). child(tokugawa_iemitsu, ogou). child(toyotomi_hideyori, yodonokata). toyotomi_hideyori yodonokata child(toyotomi_hideyori, yodonokata). child (toyotomi_hideyori, yodonokata). child ( child(toyotomi_hideyori, yodonokata). child (toyotomi_hideyori, yodonokata) head male(toyotomi_hideyori). male(turumatsu). male(toyotomi_hideyosi). male(toyotomi_hidenaga). male(toyotomi_hidetsugu). male(tokugawa_iemitsu). male(azai_nagamasa). male(kinosita_yaemon). male(takeami). male(tokugawa_hidetada). 11
12 male(toyotomi_hideyori). toyotomi_hideyori female(yodonokata). female(oichi). female(ohatsu). female(ogou). female(naka). female(tomo). female(senhime). female(yodonokata). yodonokata father(x, Y) :- child(y, X), male(x). ( Prolog child(y, X) male(x) father(x, Y) father(x, Y) child(y, X) male(x) X Y Y X X Prolog X Y Prolog father yodonokata father(x, Y) :- child(y, X), male(x). father(x, Y) (head) child(y, X) male(x) (body) mother(x, Y) :- child(y, X), female(x). X Y Y X X Prolog father(x) :- child(y, X), male(x). X Y X X Prolog X X Y X _ father(x) :- child(_, X), male(x). mother(x) :- child(y, X), female(x). 12
13 X Y X X Prolog _ mother(x) :- child(_, X), female(x). ancestor(x, Y) :- child(y, X). ancestor(x, Y) :- child(z, X), ancestor(z, Y). X Y Y X Z X Z Y Prolog Prolog (head) ancestor(x, Y) ancestor(z, Y) ancestor Prolog Y X descendant(x, Y) :- child(x, Y). descendant(x, Y) :- child(x, Z), descendant(z, Y). X Y X Y X Z Z Y Prolog ( Prolog?- child(tokugawa_iemitsu, ogou). tokugawa_iemitsu ogou child(tokugawa_iemitsu, ogou) child() (head) child(toyotomi_hideyori, yodonokata). child(tokugawa-iemitsu, ogou) child(toyotomi_hideyori, yodonokata) child(tokugawa_iemitsu, ogou).?- child(tokugawa_iemitsu, ogou).?- 13
14 ?- child(x, ogou). child(x, ogou) X Prolog ogou child(senhime, ogou). child(x, ogou) child(senhime, ogou) X senhime?- child(x, ogou). X = senhime?? X = senhime? ; ; child(senhime, ogou). child(tokugawa_iemitsu, ogou). child(x, ogou) child(tokugawa_iemitsu, ogou) X tokugawa_iemitsu?- child(x, ogou). X = senhime? ; X = tokugawa_iemitsu (31 ms)?- ;?- child(x, azai_nagamasa).?- child(x, azai_nagamasa). X = yodonokata? 14
15 X = yodonokata? a a?- child(x, azai_nagamasa). X = yodonokata? a X = ohatsu X = ogou no?- a?- child(senhime, X), female(x). X = ogou child(senhime, X) female(x) X senhime X X X senhime X = ogou 15
16 mother(x, Y) :- child(y, X), female(x).?- mother(x, senhime). X = ogou?- child(senhime, X), female(x). Prolog child(senhime, X) (head) child(senhime, tokugawa_hidetada). child(senhime, X) child(senhime, tokugawa_hidetada) X tokugawa_hidetada female(x) X tokugawa_hidetada female(tokugawa_hidetada) female(tokugawa_hidetada) female(tokugawa_hidetada) (head) child(senhime, tokugawa_hidetada). child(senhime, X) (head) 16
17 child(senhime, ogou). child(senhime, X) child(senhime, ogou) X ogou female(x) X ogou female(ogou) female(ogou) (head) female(ogou). Prolog?- child(senhime, X), female(x). X = ogou?-?- mother(x, senhime). mother(x, senhime) (head) mother(x, Y) :- child(y, X), female(x). mother(x, senhime) :- child(senhime, X), female(x). Y senhime mother(x, senhime) child(senhime, X), female(x) child(senhime, X), female(x). mother(x, Y) :- child(y, X), female(x). Prolog X Y X Y sister sister(x, Y) :- female(x), child(x, Z), child(y, Z). family.pl Prolog?- assertz((sister(x, Y) :- female(x), child(x, Z), child(y, Z))).?- sister(senhime, X). 17
18 ?- sister(senhime, X). X = senhime??- sister(senhime, X). X = senhime? a?- sister(senhime, X). X = senhime? a X = tokugawa_iemitsu X = senhime X = tokugawa_iemitsu?- 18
19 2 1 senhime senhime Prolog?- sister(senhime, X). sister(x, Y) :- female(x), child(x, Z), child(y, Z). female(sennhime), child(sennhime, Z), child(x, Z). female(sennhime). child(sennhime, Z), child(x, Z). child(senhime, tokugawa_hidetada). Z tokugawa_hidetada child(x, tokugawa_hidetada). child(senhime, tokugawa_hidetada). X senhime?- sister(senhime, X). X = senhime? X Y sister(x, Y) :- female(x), child(x, Z), child(y, Z), X \= Y. 1 Z tokugawa_hidetada Z ogou parents(x, Y, Z) :- female(y), child(x, Y), male(z), child(x, Z). X Y Z sister(x, Y) :- female(x), parents(x, Z, W), parents(y, Z, W), X \= Y. 19
20 ?- retract((sister(x, Y) :- female(x), child(x, Z), child(y, Z))).?- assertz((parents(x, Y, Z) :- female(y), child(x, Y), male(z), child(x, Z))).?- assertz((sister(x, Y) :- female(x), parents(x, Z, W), parents(y, Z, W), X \= Y)).?- sister(senhime,x). X = tokugawa_iemitsu? ; (16 ms) no?-?- sister(asahi, X). no?- female(asahi).?- assertz(female(asahi)). uncaught exception: error(permission_error(modify,static_procedure,female/1),assertz/1)?- assertz() family.pl female(asahi). parents(x, Y, Z) :- female(y), child(x, Y), male(z), child(x, Z). sister(x, Y) :- female(x), parents(x, Z, W), parents(y, Z, W), X \= Y. female(asahi). parents(x, Y, Z) :- female(y), child(x, Y), male(z), child(x, Z). sister(x, Y) :- female(x), parents(x, Z, W), parents(y, Z, W), X \= Y. family.pl female(asahi). 20
21 female(asahi). female().?- sister(asahi,x). X = toyotomi_hidenaga? ; (16 ms) no?- toyotomi_hideyosi sister(x, Y) :- female(x), parents(x, Z, W1), parents(y, Z, W2), X \= Y, W1 \= W2. sister(x, Y) :- female(x), parents(x, Z1, W), parents(y, Z2, W), X \= Y, Z1 \= Z2. sister(x, Y) sister(x, Y) :- female(x), parents(x, Z, W), parents(y, Z, W), X \= Y. sister(x, Y) :- female(x), parents(x, Z, W1), parents(y, Z, W2), X \= Y, W1 \= W2. sister(x, Y) :- female(x), parents(x, Z1, W), parents(y, Z2, W), X \= Y, Z1 \= Z2.?- sister(asahi, X). X = toyotomi_hidenaga? a X = toyotomi_hideyosi X = tomo no?- 21
22 parent daughter (son) grandfather groundmother grandchild brother sibling aunt uncle niece nephew cousin X Y \+(X=Y) \+ not GNU Prolog Prolog 0 X X Prolog X s(x) natural_number(0). natural_number(s(x)) :- natural_number(x). Prolog
23 ?- natural_number(0).?- natural_number(s(s(0))).?- natural_number(s(s(s(s(s(0)))))).?- natural_number(x). 23
24 natural_number natural_number(0). X = 0? natural_number(s(x)) :- natural_number(x). natural_number(x) natural_number(s(x)) X Prolog natural_number(s(y)) :- natural_number(y). natural_number(x) natural_number(s(y)) X s(y) X = s(y) natural_number(y) natural_number(0). Y = 0 X = s(y) X = s(0) natural_number(y) natural_number(0) natural_number(s(x)) :- natural_number(x). 24
25 natural_number(y) natural_number(s(x)) natural_number(s(x)) natural_number(s(z)) :- natural_number(z). Y = s(z) natural_number(z) natural_number(0). Z = 0 natural_number(z) natural_number(0) Y = s(z) Y = s(0) X = s(y) X=s(s(0)) X=s(s(0)) Prolog natural_number(0). natural_number(s(x)) :- natural_number(x). plus(0, X, X) :- natural_number(x). plus(s(x), Y, s(z)) :- plus(x, Y, Z).?- assertz((plus(0, X, X) :- natural_number(x))).?- assertz((plus(s(x), Y, s(z)) :- plus(x, Y, Z))). X 0 X X X Y Z X s(x)) Y Z s(z)) Prolog 25
26 ?- plus(0, s(0), X). X = s(0) 0 1 X = s(0) 1?- plus(x, s(0), s(s(s(0)))). X = s(s(0)) X 1 3 X X 2 Prolog 26
27 ?- plus(x, Y, s(s(s(0)))). 3 Prolog times(0, X, 0) :- natural_number(x). times(s(x), Y, Z) :- times(x, Y, XY), plus(xy, Y, Z). X 0 X X X Y X Y XY XY Y Z?- times(s(s(0)), s(s(s(0))), X). X = s(s(s(s(s(s(s(0))))))) times(s(s(0)), X, s(s(s(s(0))))). X = s(s(0)) 27
28 Prolog natural_number(0). natural_number(s(x)) :- natural_number(x). plus(0, X, X) :- natural_number(x). plus(s(x), Y, s(z)) :- plus(x, Y, Z). times(0, X, 0) :- natural_number(x). times(s(x), Y, Z) :- times(x, Y, XY), plus(xy, Y, Z). exp(s(x), 0, 0). exp(0, s(x), s(0)). exp(s(n), X, Y) :- exp(n, X, Z), times(z, X, Y). factorial(0, s(0)). factorial(s(n), F) :- factorial(n, F1), times(s(n), F1, F). greater_or_equal(0, X) :- natural_number(x). greater_or_equal(s(x), s(y)) :- greater_or_equal(x, Y). greater(0, X) :- natural_number(x), \+(0 = X). greater(s(x), s(y)) :- greater(x, Y). minimum(n1, N2, N1) :- greater_or_equal(n1, N2). minimum(n1, N2, N2) :- greater_or_equal(n2, N1). mod(x, Y, X) :- greater(x, Y). mod(x, Y, Z) :- plus(x1, Y, X), mod(x1, Y, Z). 28
29 gcd(x, 0, X) :- greater(0, X). gcd(x, Y, Gcd) :- mod(x, Y, Z), gcd(y, Z, Gcd). exp, factorial, greater_or_equal, greater, minimum, mod, gcd Prolog even odd Prolog factorial(n,f) :- N>0, N1 is N-1, factorial(n1,f1), F is N*F1. factorial(0,1).?- factorial(5,f). F = 120 n! = n * (n-1)! if n > 0 and n! = 1 if n = 0 Prolog Prolog Scheme Prolog Scheme C++ C++ Prolog N1 is N-1, F is N*F1. is N1 N - 1 F N * F1?- N is N = 11?- 11 is N + 7. uncaught exception: error(instantiation_error,(is)/2) is 29
30 gcd(x, 0, X). gcd(x,y,z):- U is X mod Y, gcd(y, U, Z).?- gcd(24, 9, X). X = 3? (47 ms) gcd(x,y,z):- U is X mod Y, gcd(y, U, Z). gcd(x, 0, X).?- gcd(24, 9, X). uncaught exception: error(evaluation_error(zero_divisor),(is)/2) Prolog gcd() gcd(x,y,z):- Y > 0, U is X mod Y, gcd(y, U, Z). gcd(x, 0, X). Prolog Scheme Python C C++ Prolog [], [1], [1, 2, 3], [A, B, C], [a, [b, c], d]?- [1, 2, 3] = [1, 2, 3].?- [1, 2, 3] = [X, Y, Z]. X = 1 Y = 2 Z = 3 30
31 ?- [1, 2, 3] = [X, X, Z]. no?- [] = [].?- [a, b, c, d] = [Head Tail]. Head = a Tail = [b, c, d]?- [] = [Head Tail]. no?- [a] = [Head Tail]. Head = a Tail = []?- [a, b, c] = [a Tail]. Tail = [b, c]?- [a, b, c] = [a [Head Tail]]. Head = b Tail = [c]?- [a, b, c, d, e] = [_,_ [Head Tail]]. Head = c Tail = [d, e] 31
32 ?- [a, b, c, d, e] = [_,_ [Head _]]. Head = c _ area([tuple],0). area([(x1,y1),(x2,y2) XYs],Area) :- area([(x2,y2) XYs],Area1),Area is (X1*Y2-Y1*X2)/2 + Area1.?- area([(4,6),(4,2),(0,8),(4,6)],area). Area = -8.0? (4,6),(4,2),(0,8),(4,6) maxlist([x Xs],M) :- maxlist(xs,x,m). maxlist([x Xs],Y,M) :- maximum(x,y,y1),maxlist(xs,y1,m). maxlist([],m,m). maximum(x,y,y) :- X =< Y. maximum(x,y,x) :- X > Y.?- maxlist([5,3,9,4,7,1],m). M = 9? maxlist([x Xs],M) :- maxlist(xs,x,m). maxlist([x Xs],Y,M) :- maximum(x,y,y1),maxlist(xs,y1,m). maxlist([],m,m). maximum(x,y,y) :- X =< Y. maximum(x,y,x) :- X > Y. 2 ( 32
33 maxlist(x,m) 3 ( maxlist(x, Y, M) maxlist([x Xs],M) :- maxlist(xs,x,m). X [X Xs] M X X Xs M maximum(x,y,y) :- X =< Y. maximum(x,y,x) :- X > Y. ( X Y Y Y X X Y X X Y maxlist([x Xs],Y,M) :- maximum(x,y,y1),maxlist(xs,y1,m). Y X [X Xs] M X Y Y1 Xs Y1 M Prolog maxlist([],m,m). M Bruce A. Tate Ohmsha valid([]). valid([head Tail]):- fd_all_different(head), valid(tail). sudoku(puzzle, Solution) :- Solution = Puzzle, Puzzle = [S11, S12, S13, S14, S15, S16, S17, S18, S19, S21, S22, S23, S24, S25, S26, S27, S28, S29, S31, S32, S33, S34, S35, S36, S37, S38, S39, S41, S42, S43, S44, S45, S46, S47, S48, S49, S51, S52, S53, S54, S55, S56, S57, S58, S59, S61, S62, S63, S64, S65, S66, S67, S68, S69, S71, S72, S73, S74, S75, S76, S77, S78, S79, S81, S82, S83, S84, S85, S86, S87, S88, S89, 33
34 S91, S92, S93, S94, S95, S96, S97, S98, S99], fd_domain(solution, 1, 9), Row1 = [S11, S12, S13, S14, S15, S16, S17, S18, S19], Row2 = [S21, S22, S23, S24, S25, S26, S27, S28, S29], Row3 = [S31, S32, S33, S34, S35, S36, S37, S38, S39], Row4 = [S41, S42, S43, S44, S45, S46, S47, S48, S49], Row5 = [S51, S52, S53, S54, S55, S56, S57, S58, S59], Row6 = [S61, S62, S63, S64, S65, S66, S67, S68, S69], Row7 = [S71, S72, S73, S74, S75, S76, S77, S78, S79], Row8 = [S81, S82, S83, S84, S85, S86, S87, S88, S89], Row9 = [S91, S92, S93, S94, S95, S96, S97, S98, S99], Col1 = [S11, S21, S31, S41, S51, S61, S71, S81, S91], Col2 = [S12, S22, S32, S42, S52, S62, S72, S82, S92], Col3 = [S13, S23, S33, S43, S53, S63, S73, S83, S93], Col4 = [S14, S24, S34, S44, S54, S64, S74, S84, S94], Col5 = [S15, S25, S35, S45, S55, S65, S75, S85, S95], Col6 = [S16, S26, S36, S46, S56, S66, S76, S86, S96], Col7 = [S17, S27, S37, S47, S57, S67, S77, S87, S97], Col8 = [S18, S28, S38, S48, S58, S68, S78, S88, S98], Col9 = [S19, S29, S39, S49, S59, S69, S79, S89, S99], Square1 = [S11, S12, S13, S21, S22, S23, S31, S32, S33], Square2 = [S14, S15, S16, S24, S25, S26, S34, S35, S36], Square3 = [S17, S18, S19, S27, S28, S29, S37, S38, S39], Square4 = [S41, S42, S43, S51, S52, S53, S61, S62, S63], Square5 = [S44, S45, S46, S54, S55, S56, S64, S65, S66], Square6 = [S47, S48, S49, S57, S58, S59, S67, S68, S69], Square7 = [S71, S72, S73, S81, S82, S83, S91, S92, S93], Square8 = [S74, S75, S76, S84, S85, S86, S94, S95, S96], Square9 = [S77, S78, S79, S87, S88, S89, S97, S98, S99], valid([row1, Row2, Row3, Row4, Row5, Row6, Row7, Row8, Row9, Col1, Col2, Col3, Col4, Col5, Col6, Col7, Col8, Col9, Square1, Square2, Square3, Square4, Square5, Square6, Square7, Square8, Square9]). s([_,_,_,7,1,2,4,6,_, _,_,_,_,3,_,1,_,8, _,_,_,_,_,_,_,7,3, 4,_,_,3,_,_,_,_,5, 6,5,_,_,_,_,_,1,7, 8,_,_,_,_,6,_,_,2, 2,9,_,_,_,_,_,_,_, 5,_,1,_,9,_,_,_,_, _,3,8,1,2,4,_,_,_]). p([_,1,8,5,_,_,_,_,_, 34
35 _,_,_,9,_,_,8,7,_, _,_,4,_,_,2,_,_,_, 6,_,_,8,_,_,7,_,_, _,_,_,_,7,_,_,_,_, _,_,2,_,_,5,_,_,4, _,_,_,4,_,_,1,_,_, _,4,9,_,_,1,_,_,_, _,_,_,_,_,7,6,4,_]). q([_,_,3,7,_,8,_,_,_, _,_,_,_,_,_,_,_,_, 6,_,_,3,1,_,_,_,_, 9,_,8,_,_,2,_,_,5, _,_,4,_,_,_,3,_,_, 2,_,_,1,_,_,4,_,9, _,_,_,_,2,9,_,_,_, _,_,_,_,_,_,_,_,_, _,_,_,8,_,4,7,_,_]).?- s(p),sudoku(p,s). P = [3,8,5,7,1,2,4,6,9, 9,7,6,4,3,5,1,2,8, 1,4,2,9,6,8,5,7,3, 4,2,7,3,8,1,6,9,5, 6,5,3,2,4,9,8,1,7, 8,1,9,5,7,6,3,4,2, 2,9,4,6,5,3,7,8,1, 5,6,1,8,9,7,2,3,4, 7,3,8,1,2,4,9,5,6] S = [3,8,5,7,1,2,4,6,9, 9,7,6,4,3,5,1,2,8, 1,4,2,9,6,8,5,7,3, 4,2,7,3,8,1,6,9,5, 6,5,3,2,4,9,8,1,7, 8,1,9,5,7,6,3,4,2, 2,9,4,6,5,3,7,8,1, 5,6,1,8,9,7,2,3,4, 7,3,8,1,2,4,9,5,6] (16 ms) 35
36 ?- p(p),sudoku(p,s). P = [_#3(2..3:7:9),1,8,5,_#63(3..4:6),_#84(3..4:6),_#105(2..4:9), _#126(2..3:6:9),_#147(2..3:6:9),_#168(2..3:5),_#189(2..3:5..6), _#210(3:5..6),9,_#244(1:3..4:6),_#265(3..4:6),8,7,_#312(1..3:5..6), _#333(3:5:7:9),_#354(3:5..7:9),4,_#388(1:3:6..7),_#409(1:3:6:8),2, _#443(3:5:9),_#464(1:3:5..6:9),_#485(1:3:5..6:9),6,_#519(3:5:9), _#540(1:3:5),8,_#574(1..4:9),_#595(3..4:9),7,_#629(1..3:5:9), _#650(1..3:5:9),_#671(1:3..5:8..9),_#692(3:5:8..9),_#713(1:3:5), _#734(1..3:6),7,_#768(3..4:6:9),_#789(2..3:5:9),_#810(1..3:5..6:8..9), _#831(1..3:5..6:8..9),_#852(1:3:7..9),_#873(3:7..9),2,_#907(1:3:6), _#928(1:3:6:9),5,_#962(3:9),_#983(1:3:6:8..9),4,_#1017(2..3:5:7..8), _#1038(2..3:5..8),_#1059(3:5..7),4,_#1093(2..3:5..6:8..9), _#1114(3:6:8..9),1,_#1148(2..3:5:8..9),_#1169(2..3:5:7..9), _#1190(2..3:5:7..8),4,9,_#1237(2..3:6),_#1258(2..3:5..6:8),1, _#1292(2..3:5),_#1313(2..3:5:8),_#1334(2..3:5:7..8),_#1355(1..3:5:8), _#1376(2..3:5:8),_#1397(1:3:5),_#1418(2..3),_#1439(2..3:5:8..9), 7,6,4,_#1499(2..3:5:8..9)] S = [_#3(2..3:7:9),1,8,5,_#63(3..4:6),_#84(3..4:6),_#105(2..4:9), _#126(2..3:6:9),_#147(2..3:6:9),_#168(2..3:5),_#189(2..3:5..6), _#210(3:5..6),9,_#244(1:3..4:6),_#265(3..4:6),8,7,_#312(1..3:5..6), _#333(3:5:7:9),_#354(3:5..7:9),4,_#388(1:3:6..7),_#409(1:3:6:8),2, _#443(3:5:9),_#464(1:3:5..6:9),_#485(1:3:5..6:9),6,_#519(3:5:9), _#540(1:3:5),8,_#574(1..4:9),_#595(3..4:9),7,_#629(1..3:5:9), _#650(1..3:5:9),_#671(1:3..5:8..9),_#692(3:5:8..9),_#713(1:3:5), _#734(1..3:6),7,_#768(3..4:6:9),_#789(2..3:5:9),_#810(1..3:5..6:8..9), _#831(1..3:5..6:8..9),_#852(1:3:7..9),_#873(3:7..9),2,_#907(1:3:6), _#928(1:3:6:9),5,_#962(3:9),_#983(1:3:6:8..9),4,_#1017(2..3:5:7..8), _#1038(2..3:5..8),_#1059(3:5..7),4,_#1093(2..3:5..6:8..9), _#1114(3:6:8..9),1,_#1148(2..3:5:8..9),_#1169(2..3:5:7..9), _#1190(2..3:5:7..8),4,9,_#1237(2..3:6),_#1258(2..3:5..6:8),1, _#1292(2..3:5),_#1313(2..3:5:8),_#1334(2..3:5:7..8),_#1355(1..3:5:8), _#1376(2..3:5:8),_#1397(1:3:5),_#1418(2..3),_#1439(2..3:5:8..9), 7,6,4,_#1499(2..3:5:8..9)] (16 ms)?- S = [_#3(2..3:7:9),1,8,5,_#63(3..4:6),_#84(3..4:6),_#105(2..4:9),_#126(2..3:6:9),
37 Bruce A. Tate Ohmsha GNU Prolog fd_domain() valid([]). valid([head Tail]):- fd_all_different(head), valid(tail). sudoku(puzzle, Solution) :- Solution = Puzzle, Puzzle = [S11, S12, S13, S14, S15, S16, S17, S18, S19, S21, S22, S23, S24, S25, S26, S27, S28, S29, S31, S32, S33, S34, S35, S36, S37, S38, S39, S41, S42, S43, S44, S45, S46, S47, S48, S49, S51, S52, S53, S54, S55, S56, S57, S58, S59, S61, S62, S63, S64, S65, S66, S67, S68, S69, S71, S72, S73, S74, S75, S76, S77, S78, S79, S81, S82, S83, S84, S85, S86, S87, S88, S89, S91, S92, S93, S94, S95, S96, S97, S98, S99], fd_domain(solution, 1, 9), Row1 = [S11, S12, S13, S14, S15, S16, S17, S18, S19], Row2 = [S21, S22, S23, S24, S25, S26, S27, S28, S29], Row3 = [S31, S32, S33, S34, S35, S36, S37, S38, S39], Row4 = [S41, S42, S43, S44, S45, S46, S47, S48, S49], Row5 = [S51, S52, S53, S54, S55, S56, S57, S58, S59], Row6 = [S61, S62, S63, S64, S65, S66, S67, S68, S69], Row7 = [S71, S72, S73, S74, S75, S76, S77, S78, S79], Row8 = [S81, S82, S83, S84, S85, S86, S87, S88, S89], Row9 = [S91, S92, S93, S94, S95, S96, S97, S98, S99], Col1 = [S11, S21, S31, S41, S51, S61, S71, S81, S91], Col2 = [S12, S22, S32, S42, S52, S62, S72, S82, S92], Col3 = [S13, S23, S33, S43, S53, S63, S73, S83, S93], Col4 = [S14, S24, S34, S44, S54, S64, S74, S84, S94], Col5 = [S15, S25, S35, S45, S55, S65, S75, S85, S95], Col6 = [S16, S26, S36, S46, S56, S66, S76, S86, S96], Col7 = [S17, S27, S37, S47, S57, S67, S77, S87, S97], Col8 = [S18, S28, S38, S48, S58, S68, S78, S88, S98], Col9 = [S19, S29, S39, S49, S59, S69, S79, S89, S99], Square1 = [S11, S12, S13, S21, S22, S23, S31, S32, S33], Square2 = [S14, S15, S16, S24, S25, S26, S34, S35, S36], Square3 = [S17, S18, S19, S27, S28, S29, S37, S38, S39], Square4 = [S41, S42, S43, S51, S52, S53, S61, S62, S63], Square5 = [S44, S45, S46, S54, S55, S56, S64, S65, S66], 37
38 Square6 = [S47, S48, S49, S57, S58, S59, S67, S68, S69], Square7 = [S71, S72, S73, S81, S82, S83, S91, S92, S93], Square8 = [S74, S75, S76, S84, S85, S86, S94, S95, S96], Square9 = [S77, S78, S79, S87, S88, S89, S97, S98, S99], valid([row1, Row2, Row3, Row4, Row5, Row6, Row7, Row8, Row9, Col1, Col2, Col3, Col4, Col5, Col6, Col7, Col8, Col9, Square1, Square2, Square3, Square4, Square5, Square6, Square7, Square8, Square9]). s([_,_,_,7,1,2,4,6,_, _,_,_,_,3,_,1,_,8, _,_,_,_,_,_,_,7,3, 4,_,_,3,_,_,_,_,5, 6,5,_,_,_,_,_,1,7, 8,_,_,_,_,6,_,_,2, 2,9,_,_,_,_,_,_,_, 5,_,1,_,9,_,_,_,_, _,3,8,1,2,4,_,_,_]). p([_,1,8,5,_,_,_,_,_, _,_,_,9,_,_,8,7,_, _,_,4,_,_,2,_,_,_, 6,_,_,8,_,_,7,_,_, _,_,_,_,7,_,_,_,_, _,_,2,_,_,5,_,_,4, _,_,_,4,_,_,1,_,_, _,4,9,_,_,1,_,_,_, _,_,_,_,_,7,6,4,_]). q([_,_,3,7,_,8,_,_,_, _,_,_,_,_,_,_,_,_, 6,_,_,3,1,_,_,_,_, 9,_,8,_,_,2,_,_,5, _,_,4,_,_,_,3,_,_, 2,_,_,1,_,_,4,_,9, _,_,_,_,2,9,_,_,_, _,_,_,_,_,_,_,_,_, _,_,_,8,_,4,7,_,_]). valid([]). valid([head Tail]):- fd_all_different(head), valid(tail). valid([]). 38
39 valid([head Tail]):- fd_all_different(head), valid(tail). Head Tail [Head Tail] fd_all_different(head) Head fd_all_different() GNU Prolog, valid(tail). Tail sudoku(puzzle, Solution) :- Solution = Puzzle, Puzzle = [S11, S12, S13, S14, S15, S16, S17, S18, S19, S21, S22, S23, S24, S25, S26, S27, S28, S29, S31, S32, S33, S34, S35, S36, S37, S38, S39, S41, S42, S43, S44, S45, S46, S47, S48, S49, S51, S52, S53, S54, S55, S56, S57, S58, S59, S61, S62, S63, S64, S65, S66, S67, S68, S69, S71, S72, S73, S74, S75, S76, S77, S78, S79, S81, S82, S83, S84, S85, S86, S87, S88, S89, S91, S92, S93, S94, S95, S96, S97, S98, S99], fd_domain(solution, 1, 9), Row1 = [S11, S12, S13, S14, S15, S16, S17, S18, S19], Row2 = [S21, S22, S23, S24, S25, S26, S27, S28, S29], Row3 = [S31, S32, S33, S34, S35, S36, S37, S38, S39], Row4 = [S41, S42, S43, S44, S45, S46, S47, S48, S49], Row5 = [S51, S52, S53, S54, S55, S56, S57, S58, S59], Row6 = [S61, S62, S63, S64, S65, S66, S67, S68, S69], Row7 = [S71, S72, S73, S74, S75, S76, S77, S78, S79], Row8 = [S81, S82, S83, S84, S85, S86, S87, S88, S89], Row9 = [S91, S92, S93, S94, S95, S96, S97, S98, S99], Col1 = [S11, S21, S31, S41, S51, S61, S71, S81, S91], Col2 = [S12, S22, S32, S42, S52, S62, S72, S82, S92], Col3 = [S13, S23, S33, S43, S53, S63, S73, S83, S93], Col4 = [S14, S24, S34, S44, S54, S64, S74, S84, S94], Col5 = [S15, S25, S35, S45, S55, S65, S75, S85, S95], Col6 = [S16, S26, S36, S46, S56, S66, S76, S86, S96], Col7 = [S17, S27, S37, S47, S57, S67, S77, S87, S97], 39
40 Col8 = [S18, S28, S38, S48, S58, S68, S78, S88, S98], Col9 = [S19, S29, S39, S49, S59, S69, S79, S89, S99], Square1 = [S11, S12, S13, S21, S22, S23, S31, S32, S33], Square2 = [S14, S15, S16, S24, S25, S26, S34, S35, S36], Square3 = [S17, S18, S19, S27, S28, S29, S37, S38, S39], Square4 = [S41, S42, S43, S51, S52, S53, S61, S62, S63], Square5 = [S44, S45, S46, S54, S55, S56, S64, S65, S66], Square6 = [S47, S48, S49, S57, S58, S59, S67, S68, S69], Square7 = [S71, S72, S73, S81, S82, S83, S91, S92, S93], Square8 = [S74, S75, S76, S84, S85, S86, S94, S95, S96], Square9 = [S77, S78, S79, S87, S88, S89, S97, S98, S99], valid([row1, Row2, Row3, Row4, Row5, Row6, Row7, Row8, Row9, Col1, Col2, Col3, Col4, Col5, Col6, Col7, Col8, Col9, Square1, Square2, Square3, Square4, Square5, Square6, Square7, Square8, Square9]). Puzzle Solution Solution = Puzzle, Solution Puzzle Puzzle = [S11, S12, S13, S14, S15, S16, S17, S18, S19, S21, S22, S23, S24, S25, S26, S27, S28, S29, S31, S32, S33, S34, S35, S36, S37, S38, S39, S41, S42, S43, S44, S45, S46, S47, S48, S49, S51, S52, S53, S54, S55, S56, S57, S58, S59, S61, S62, S63, S64, S65, S66, S67, S68, S69, S71, S72, S73, S74, S75, S76, S77, S78, S79, S81, S82, S83, S84, S85, S86, S87, S88, S89, S91, S92, S93, S94, S95, S96, S97, S98, S99], Puzzle S11, S12, S13,..., S99 fd_domain(solution, 1, 9), Solution 1 9 fd_domain() GNU Prolog Row1 = [S11, S12, S13, S14, S15, S16, S17, S18, S19], Row2 = [S21, S22, S23, S24, S25, S26, S27, S28, S29], Row3 = [S31, S32, S33, S34, S35, S36, S37, S38, S39], Row4 = [S41, S42, S43, S44, S45, S46, S47, S48, S49], Row5 = [S51, S52, S53, S54, S55, S56, S57, S58, S59], Row6 = [S61, S62, S63, S64, S65, S66, S67, S68, S69], Row7 = [S71, S72, S73, S74, S75, S76, S77, S78, S79], Row8 = [S81, S82, S83, S84, S85, S86, S87, S88, S89], Row9 = [S91, S92, S93, S94, S95, S96, S97, S98, S99], 40
41 Col1 = [S11, S21, S31, S41, S51, S61, S71, S81, S91], Col2 = [S12, S22, S32, S42, S52, S62, S72, S82, S92], Col3 = [S13, S23, S33, S43, S53, S63, S73, S83, S93], Col4 = [S14, S24, S34, S44, S54, S64, S74, S84, S94], Col5 = [S15, S25, S35, S45, S55, S65, S75, S85, S95], Col6 = [S16, S26, S36, S46, S56, S66, S76, S86, S96], Col7 = [S17, S27, S37, S47, S57, S67, S77, S87, S97], Col8 = [S18, S28, S38, S48, S58, S68, S78, S88, S98], Col9 = [S19, S29, S39, S49, S59, S69, S79, S89, S99], Square1 = [S11, S12, S13, S21, S22, S23, S31, S32, S33], Square2 = [S14, S15, S16, S24, S25, S26, S34, S35, S36], Square3 = [S17, S18, S19, S27, S28, S29, S37, S38, S39], Square4 = [S41, S42, S43, S51, S52, S53, S61, S62, S63], Square5 = [S44, S45, S46, S54, S55, S56, S64, S65, S66], Square6 = [S47, S48, S49, S57, S58, S59, S67, S68, S69], Square7 = [S71, S72, S73, S81, S82, S83, S91, S92, S93], Square8 = [S74, S75, S76, S84, S85, S86, S94, S95, S96], Square9 = [S77, S78, S79, S87, S88, S89, S97, S98, S99], valid([row1, Row2, Row3, Row4, Row5, Row6, Row7, Row8, Row9, Col1, Col2, Col3, Col4, Col5, Col6, Col7, Col8, Col9, Square1, Square2, Square3, Square4, Square5, Square6, Square7, Square8, Square9]). s([_,_,_,7,1,2,4,6,_, _,_,_,_,3,_,1,_,8, _,_,_,_,_,_,_,7,3, 4,_,_,3,_,_,_,_,5, 6,5,_,_,_,_,_,1,7, 8,_,_,_,_,6,_,_,2, 2,9,_,_,_,_,_,_,_, 5,_,1,_,9,_,_,_,_, _,3,8,1,2,4,_,_,_]). p([_,1,8,5,_,_,_,_,_, _,_,_,9,_,_,8,7,_, _,_,4,_,_,2,_,_,_, 6,_,_,8,_,_,7,_,_, _,_,_,_,7,_,_,_,_, _,_,2,_,_,5,_,_,4, _,_,_,4,_,_,1,_,_, 41
42 _,4,9,_,_,1,_,_,_, _,_,_,_,_,7,6,4,_]). q([_,_,3,7,_,8,_,_,_, _,_,_,_,_,_,_,_,_, 6,_,_,3,1,_,_,_,_, 9,_,8,_,_,2,_,_,5, _,_,4,_,_,_,3,_,_, 2,_,_,1,_,_,4,_,9, _,_,_,_,2,9,_,_,_, _,_,_,_,_,_,_,_,_, _,_,_,8,_,4,7,_,_]). _?- p(p),sudoku(p,s). fd_domain(a, B, C)?- fd_domain(a, [1, 3, 5]). A = _#2(1:3:5)?- fd_domain(a, 1, 5) A = _#0(1..5)?- fd_domain(a, 1, 6), fd_domain(a, 3, 9). A = _#0(3:6)?- fd_domain(a, 1, 6), fd_domain(a, [1, 3, 5, 7, 9]). A = _#0(1:3:5)?- fd_domain([a,b,c], 1, 9), fd_domain(a, 1, 3), fd_domain(b, 3, 6). A = _#0(1..3) B = _#17(3..6) 42
43 C = _#34(1..9) fd_domain GNU Prolog GNU PROLOG MANUAL member(x, L) X L?- member(3,[1,2,3,4,5]). true? ; no?- member(x, [1,2,3,4]). X = 1? ; X = 2? ; X = 3? ; 43
44 X = 4?- member(1, L). L = [1 _]? ; L = [_,1 _]? ; L = [_,_,1 _]? ; L = [_,_,_,1 _]? ; L = [_,_,_,_,1 _]? ; L = [_,_,_,_,_,1 _]? ; L = [_,_,_,_,_,_,1 _]? (63 ms) member fd_domain(solution, 1, 9) member(x, [1,2,3,4,5,6,7,8,9]) 1, 2, 3 perm([a,b,c]) :- member(a,[1,2,3]),member(b,[1,2,3]),member(c,[1,2,3]),fd_all_different([a,b,c]).?- [ d:/prolog/permutation.pl ]. compiling d:/prolog/permutation.pl for byte code... d:/prolog/permutation.pl compiled, 1 lines read bytes written, 11 ms?- perm([a,b,c]). A = 1 B = 2 C = 3? ; A = 1 B = 3 44
45 C = 2? ; A = 2 B = 1 C = 3? ; A = 2 B = 3 C = 1? ; A = 3 B = 1 C = 2? ; A = 3 B = 2 C = 1? ; (31 ms) no?- bagof([a,b,c], perm([a,b,c]), List). List = [[1,2,3],[1,3,2],[2,1,3],[2,3,1],[3,1,2],[3,2,1]] perm([a,b,c]) :- fd_domain([a,b,c],1,3),fd_all_different([a,b,c]).?- [ d:/prolog/permutation.pl ]. compiling d:/prolog/permutation.pl for byte code... d:/prolog/permutation.pl compiled, 1 lines read bytes written, 17 ms?- perm([a,b,c]). A = _#3(1..3) B = _#24(1..3) C = _#45(1..3) (16 ms) 45
46 Prolog queen(q) :- perm([1,2,3,4,5,6,7,8], Q), safe(q). perm([],[]). perm(xs, [Z Zs]) :- select(z, Xs, Ys), perm(ys, Zs). safe([qt Qr]) :- \+(attack(qt, Qr)), safe(qr). safe([]). attack(x, Xs) :- attack_sub(x, 1, Xs). attack_sub(x, N, [Y Ys]) :- (X =:= Y + N ; X =:= Y - N). attack_sub(x, N, [Y Ys]) :- N1 is N + 1, attack_sub(x, N1, Ys).?- queen(q). Q = [1,5,8,6,3,7,2,4]? queen_f(q) :- queen_sub([1,2,3,4,5,6,7,8], [], Q). queen_sub(l, SafeQs, Q) :- select(x, L, RestQs), \+(attack(x, SafeQs)), queen_sub(restqs, [X SafeQs], Q). queen_sub([], Q, Q). attack(x, Xs) :- attack_sub(x, 1, Xs). attack_sub(x, N, [Y Ys]) :- (X =:= Y + N ; X =:= Y - N). attack_sub(x, N, [Y Ys]) :- N1 is N + 1, attack_sub(x, N1, Ys). 46
47 select?- select(x, [1,2,3], Y). X = 1 Y = [2,3]? ; X = 2 Y = [1,3]? ; X = 3 Y = [1,2]? ; (15 ms) no insertionsort([x Xs],Ys) :- insertionsort(xs,zs), insert(x,zs,ys). insertionsort([],[]). insert(x,[],[x]). insert(x,[y Ys],[Y Zs]) :- X > Y, insert(x,ys,zs). insert(x,[y Ys],[X,Y Ys]) :- X =< Y. 47
48 ?- insertionsort([5,8,3,1,8,4,7],x). X = [1,3,4,5,7,8,8]? quicksort([x Xs],Ys) :- partition(xs,x,littles,bigs), quicksort(littles,ls), quicksort(bigs,bs), append(ls,[x Bs],Ys). quicksort([],[]). partition([x Xs],Y,[X Ls],Bs) :- X =< Y, partition(xs,y,ls,bs). partition([x Xs],Y,Ls,[X Bs]) :- X > Y, partition(xs,y,ls,bs). partition([],y,[],[]).?- quicksort([5,8,3,1,8,4,7],x). X = [1,3,4,5,7,8,8]? append(l1, L2, L3) L1 L2 L3?- append([1],[2,3],x). X = [1,2,3]?- append([1,2],[3,4,5],x). X = [1,2,3,4,5]?- append([],[1,2],x). X = [1,2]?- append([1],[],x). X = [1] 48
49 ?- append([1], X, [1,2,3]). X = [2,3]?- append(x,y,[1,2,3]). X = [] Y = [1,2,3]? ; X = [1] Y = [2,3]? ; X = [1,2] Y = [3]? ; X = [1,2,3] Y = [] Scheme Visual C++ Leon Sterling, Ehud Shapiro Prolog Prolog Leon Sterling and Ehud Shapiro : The Art of Prolog second Edition, The MIT Press 1994 Problem Solving With Prolog : John Stobo (Kindle ) Prolog W. F. Clocksin/ C.S. Mellish 1983 Leon Sterling, Ehud Shapiro Prolog 1988 Bruce A. Tate Ohmsha 49
4 ソフトウェア工学 Software Engineering 抽象データ型 ABSTRACT DATA TYPE データ抽象 (data abstraction) 目的 : データ構造を ( 実装に依存せずに ) 抽象的に定義 方法 : データにアクセス (read, write) する関数の仕様
4 ソフトウェア工学 Software Engineering 抽象データ型 STRT DT TYPE データ抽象 (data abstraction) 目的 : データ構造を ( 実装に依存せずに ) 抽象的に定義 方法 : データにアクセス (read, write) する関数の仕様のみを記述 スタック (stack) の例 D push(d,s) S) pop(s) top(s)= top(s)=
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
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
untitled
1 2 3 4 2007101 20129 5 20123 6 2.30 1.91 7 http://www.yuchokampo.go.jp/release/pdf/12_disclosure_06_hoken_sankou2.pdf http://www.jili.or.jp/research/factbook/xls/tou6.xls 8 http://www.jcia.or.jp/pdf/pdf_files/fb_1_2012.pdf
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
平成１７年度後期
00 OHP ( OHP ) Code L00 L00 L0 L0 L00 L0 L00 L00 L00 L0 L0 L00 L00 L00 L00 L0 L00 L00+L00 L00 L0 L00 L00+L00 L00 K K K K K K L0 L0 L0 L0 L L L L L L L L L L L L L L L L L L L L L L L L L L L L L L00
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)
RETIO_61号
sssssss 16 s 10 38 58 164195 16 1,887 1,079 216 134 10 356 76 437 4,195 377 165956 16 300 5 6 0 56 3 377 118022996 69 388904 17 221730 260018286 498999 80011110 58 5310 30 125020421 40 80 78 200 28160
(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
43-03‘o’ì’¹‘®”q37†`51†i„¤‰ƒ…m†[…g†j.pwd
n 808 3.0 % 86.8 % 8.3 % n 24 4.1 % 54.0 % 37.5 % 0% % 20 % 30 % 40 % 50 % 60 % 70 % 80 % 90 % 0% 37.4 % 7.2 % 27.2 % 8.4 % n 648 13.6 % 18.1% 45.4 % 4.1% n 18 0% % 20 % 30 % 40 % 50 % 60 % 70 % 80 % 90
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...
untitled
20 7 1 22 7 1 1 2 3 7 8 9 10 11 13 14 15 17 18 19 21 22 - 1 - - 2 - - 3 - - 4 - 50 200 50 200-5 - 50 200 50 200 50 200 - 6 - - 7 - () - 8 - (XY) - 9 - 112-10 - - 11 - - 12 - - 13 - - 14 - - 15 - - 16 -
untitled
19 1 19 19 3 8 1 19 1 61 2 479 1965 64 1237 148 1272 58 183 X 1 X 2 12 2 15 A B 5 18 B 29 X 1 12 10 31 A 1 58 Y B 14 1 25 3 31 1 5 5 15 Y B 1 232 Y B 1 4235 14 11 8 5350 2409 X 1 15 10 10 B Y Y 2 X 1 X
2 (concurrency) (sequentiality) cf.
GHC / KL1 ueda@ueda.info.waseda.ac.jp Copyright (C) 2000 Kazunori Ueda 2 (concurrency) (sequentiality) cf. 3 4 5 5 6 7 ? 8 : Yes : No. ? 9 : No. : Yes. 10 : C, C++, Lisp,... : cf.... 11 Concurrent Logic
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],
SCM (v0201) ( ) SCM 2 SCM 3 SCM SCM 2.1 SCM SCM SCM (1) MS-DOS (2) Microsoft(R) Windows 95 (C)Copyright Microsoft Corp
SCM (v0201) ( ) 14 4 20 1 SCM 2 SCM 3 SCM 4 5 2 SCM 2.1 SCM SCM 2 1 2 SCM (1) MS-DOS (2) Microsoft(R) Windows 95 (C)Copyright Microsoft Corp 1981-1996. 1 (3) C:\WINDOWS>cd.. C:\>cd scm C:\SCM> C:\SCM>
0 (18) /12/13 (19) n Z (n Z ) 5 30 (5 30 ) (mod 5) (20) ( ) (12, 8) = 4
0 http://homepage3.nifty.com/yakuikei (18) 1 99 3 2014/12/13 (19) 1 100 3 n Z (n Z ) 5 30 (5 30 ) 37 22 (mod 5) (20) 201 300 3 (37 22 5 ) (12, 8) = 4 (21) 16! 2 (12 8 4) (22) (3 n )! 3 (23) 100! 0 1 (1)
特集・総説・報告（４４行）／Ｐ０４５－０５５＿報告 日本肝移植研究会
45 Liver Transplantation in Japan in 2006 Part 2 Registry by the The Summary Four thousand three hundred thirty liver transplants have been performed as of December 31, 2006 in 59 institutions in Japan.
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]
P01...R.s.[
234400 FFFFFFFFFFFFFF FFFFFFFFFFFFFF 0 2 660 99 ^ 2 4 5 6 7 3 230300 0 2 3 4 5 6 200230 666 752 22 300 30 3 300345 300500 23 300345 24 830945 230345 25 830945 230345 26 830945 230345 27 300 28 230345
xyr x y r x y r u u
xyr x y r x y r u u y a b u a b a b c d e f g u a b c d e g u u e e f yx a b a b a b c a b c a b a b c a b a b c a b c a b c a u xy a b u a b c d a b c d u ar ar a xy u a b c a b c a b p a b a b c a
3
5 1 D001D002 2 3 4 5 D001D002D010D023D131 D136D1435-15-25-45-115-13 D0105-115-12 D001D094D128 D001D010D1285-11 D0105-13 D0925-155-17 D126D1435-265-31 5-34 D1435-275-285-305-31 D0675-345-26 D023 D143D001D094
損保ジャパンの現状2011
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 62 63 64 65 66 67 68 69
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,
Microsoft Word - 表紙資料２－４
(1) / 130 g 25 g 520% 170 g 30 g 560% 70 mg 600 mg 11.6% 0 10.5 mg 0% (1) (2) / 50100 g 25 g 200400% 50100 g 30 g 167333% 5001000 mg 600 mg 83167% 1020 mg 10.5 mg 95190% (2) / (1) 45.6 g 30 g 152% (2)
2014 年度 SCCP s 古河智弥 目的 論理型プログラミング言語 Prolog の学習 宣言型言語であり 探索などに利用することができるプログラミング言語 Prolog の基本を習得し 機械学習の研究への応用および データベースの問い合せ言語として Prolog を記述する方法を
2014 年度 SCCP s1200191 古河智弥 目的 論理型プログラミング言語 Prolog の学習 宣言型言語であり 探索などに利用することができるプログラミング言語 Prolog の基本を習得し 機械学習の研究への応用および データベースの問い合せ言語として Prolog を記述する方法を学ぶ 概要 The Art of Prolog [1] の全 24 章の内 始めの 2 章を読み 内容の要約を発表する形式で学習した
原著・報告・記録（４４行）／Ｐ１５６～１６９＿報告 肝移植症例登録
156 Vol. 50, No. 23 Liver Transplantation in Japan Registry by the Japanese Liver Transplantation Society The Japanese Liver Transplantation Society Summary As of December 31, 2014, a total of 7,937 liver
xia2.dvi
Journal of Differential Equations 96 (992), 70-84 Melnikov method and transversal homoclinic points in the restricted three-body problem Zhihong Xia Department of Mathematics, Harvard University Cambridge,
原著・報告・記録（４４行）／Ｐ２６１～２７４＿報告 肝移植症例登録
261 Liver Transplantation in Japan Registry by the Japanese Liver Transplantation Society The Japanese Liver Transplantation Society Summary As of December 31, 2013, a total of 7,474 liver transplants
原著・報告・記録（４４行）／Ｐ１３４～１４７＿報告 肝移植症例登録
134 Vol. 52, No. 23 Liver transplantation in Japan. Registry by the Japanese Liver Transplantation Society The Japanese Liver Transplantation Society Summary As of December 31, 2016, a total of 8,825 liver
ブック 1.indb
20 29 29 18 21 29 10 30 31 10 11 12 30 13 10 30 14 11 30 15 12 16 13 17 14 18 15 19 16 20 17 21 18 10 20 29 82 83 84 85 86 87 88 20 10 89 20 12 11 90 20 13 12 91 20 14 13 92 20 14 14 93 15 15 94 15 16
原著・報告・記録（４４行）／Ｐ１４５～１５９＿報告 肝移植症例登録
145 Liver Transplantation in Japan Registry by the Japanese Liver Transplantation Society The Japanese Liver Transplantation Society Summary As of December 31, 2015, a total of 8,387 liver transplants
Sample Input Output for the Sample Input Sample Input Output for the Sample Input Sample Input 4-1 Output fo
Problem A Input: Standard Input Japan Alumni Group Summer Camp 2014 Day 4, AtCoder 15 Sep 2014 A A a b c A 60 A 60t + c ( t ) A -1 1 a b c Input 3 a, b, c a b c a, b, c 0 < a, b, c < 60 Constraints Output
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
102
5 102 5 103 q w 104 e r t y 5 u 105 q w e r t y u i 106 o!0 io!1 io q w e r t y 5 u 107 i o 108 q w e q w e r 5 109 q w 110 e r t 5 y 111 q w e r t y u 112 i q w e r 5 113 q w e 114 r t 5 115 q w e 116
untitled
20073-1- 3 4 5 9 12 14 17-2- 3,700ha 30,000t -3- 1t 70 50 40 C/N -4- 20011228 C/N 13 2001 2cm 1t 60 70 60-5- 70 1t -6- 2003131 ph EC T-C T-N C/N P2O5 K2O CaO MgO HO 2 ms % % % % % % % 8.52 0.64 74.9 44.9
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
パズルを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
2 2.1 NPCMJ ( (Santorini, 2010) (NPCMJ, 2016) (1) (, 2016) (1) (2) (1) ( (IP-MAT (CONJ ) (PP (NP (D ) (N )) (P )) (NP-SBJ *
Emacs Emacs : Emacs 1 Emacs Emacs ( ) (NPCMJ ) 1 Emacs NPCMJ 2 1 2 2.1 NPCMJ (http://npcmj.ninjal.ac.jp/) (Santorini, 2010) (NPCMJ, 2016) (1) (, 2016) (1) (2) (1) ( (IP-MAT (CONJ ) (PP (NP (D ) (N )) (P
曲面のパラメタ表示と接線ベクトル
L11(2011-07-06 Wed) :Time-stamp: 2011-07-06 Wed 13:08 JST hig 1,,. 2. http://hig3.net () (L11) 2011-07-06 Wed 1 / 18 ( ) 1 V = (xy2 ) x + (2y) y = y 2 + 2. 2 V = 4y., D V ds = 2 2 ( ) 4 x 2 4y dy dx =
strtok-count.eps
IoT FPGA 2016/12/1 IoT FPGA 200MHz 32 ASCII PCI Express FPGA OpenCL (Volvox) Volvox CPU 10 1 IoT (Internet of Things) 2020 208 [1] IoT IoT HTTP JSON ( Python Ruby) IoT IoT IoT (Hadoop [2] ) AI (Artificial
( ) ( ) ( ) 2
(Basic Theory of Information Processing) 1 1 1.1 - - ( ) ( ) ( ) 2 Engineering Transformation or ( ) Military Transformation ( ) ( ) ( ) HDTV 3 ( ) or ( ) 4 5.609 (TSUBAME2.5, 11 (2014.6)) IP ( ) ( ) (
つくって学ぶプログラミング言語 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
II 1 3 2 5 3 7 4 8 5 11 6 13 7 16 8 18 2 1 1. x 2 + xy x y (1 lim (x,y (1,1 x 1 x 3 + y 3 (2 lim (x,y (, x 2 + y 2 x 2 (3 lim (x,y (, x 2 + y 2 xy (4 lim (x,y (, x 2 + y 2 x y (5 lim (x,y (, x + y x 3y
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,
ICP-AES (ppbppm ICP-AES, ICP-MS, AA, IC GC, LC, GC-MS, LC-MS,LC-MS-MS U=u ( k=)
006106 ICP-AES 10 10 (ppbppm ICP-AES, ICP-MS, AA, IC GC, LC, GC-MS, LC-MS,LC-MS-MS 1 3 4 U=u ( k=) A B -a a u = a 3 -a a u = a 6 u ( x) = u( x ) + u ( x ) + u ( x ) + + u ( x n ) 1 3, EURACHEM/CITAC guide
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
導入基礎演習.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
2 2 MATHEMATICS.PDF 200-2-0 3 2 (p n ), ( ) 7 3 4 6 5 20 6 GL 2 (Z) SL 2 (Z) 27 7 29 8 SL 2 (Z) 35 9 2 40 0 2 46 48 2 2 5 3 2 2 58 4 2 6 5 2 65 6 2 67 7 2 69 2 , a 0 + a + a 2 +... b b 2 b 3 () + b n a
Login Basic Linux for Prolog PC W.Dog Linux Enter ccycs09 ccycs09 Enter Enter Linux 2
Contents Basic Linux for Prolog(Linux ) Login 2 Logout 3 Kterm 4 Prolog Technical Terms Prolog Fact 7 Database 8 Question 9 Match 10 Syntax 11 Clause 12 Character 13 Constant 14 Variable 15 Argument 17
P001-052.indd
Quality of Life 1 TEIJIN CSR Report 2014 2 TEIJIN CSR Report 2014 CONTENTS 3 5 9 15 21 23 25 26 28 37 38 41 42 29 30 34 35 36 43 44 45 49 50 51 52 http://www.teijin.co.jp/csr/ WEB 3 TEIJIN CSR Report 2014
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-:
,,,,., C Java,,.,,.,., ,,.,, i
24 Development of the programming s learning tool for children be derived from maze 1130353 2013 3 1 ,,,,., C Java,,.,,.,., 1 6 1 2.,,.,, i Abstract Development of the programming s learning tool for children
2 PostScript PostScript (token) 437 == 437 == PostScript PostScript 437 == PostScript (operator) 437 == == ==
PostScript version 1.03 2003 1 24 Copyright c 2000 2003 Daikoku Manabu 1 PostScript 1.1 PostScript PostScript PostScript (page description language) PostScript Adobe Systems Incorporated PostScript PostScript
Functional Programming
PROGRAMMING IN HASKELL プログラミング Haskell Chapter 7 - Higher-Order Functions 高階関数 愛知県立大学情報科学部計算機言語論 ( 山本晋一郎 大久保弘崇 2013 年 ) 講義資料オリジナルは http://www.cs.nott.ac.uk/~gmh/book.html を参照のこと 0 Introduction カリー化により
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
Informatics 2015
C 計算機の歴史 新旧のソロバン バベッジの階差機関 19C前半 手回し計算機 19C後半 20C後半 スパコン 1960年代 ENIAC (1946) 大型汎用計算機 1950年代 1980年代 電卓 1964 パソコン 1970年代 現在のコンピュータ Input Output Device Central Processing Unit I/O CPU Memory OS (Operating
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)
# 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
¥¤¥ó¥¿¡¼¥Í¥Ã¥È·×¬¤È¥Ç¡¼¥¿²òÀÏ Âè2²ó
2 212 4 13 1 (4/6) : ruby 2 / 35 ( ) : gnuplot 3 / 35 ( ) 4 / 35 (summary statistics) : (mean) (median) (mode) : (range) (variance) (standard deviation) 5 / 35 (mean): x = 1 n (median): { xr+1 m, m = 2r
Informatics 2014
C 計算機の歴史 手回し計算機 新旧のソロバン バベッジの階差機関 スパコン ENIAC (1946) パソコン 大型汎用計算機 電卓 現在のコンピュータ Input Output Device Central Processing Unit I/O CPU Memory OS (Operating System) OS Windows 78, Vista, XP Windows Mac OS X
40 (196) [14][20][27] 1 true 1 IO erase LLP B,C B C LLPAM LLP LLPAM B&C B & C B;C 2 LLP LLP Prolog B=>C C<=B B C!B! B LLP Prolog ( forall(x,b) x.b ) (
![40 (196) [14][20][27] 1 true 1 IO erase LLP B,C B C LLPAM LLP LLPAM B&C B & C B;C 2 LLP LLP Prolog B=>C C<=B B C!B! B LLP Prolog ( forall(x,b) x.b ) (](/thumbs/91/104848101.jpg "40 (196) [14][20][27] 1 true 1 IO erase LLP B,C B C LLPAM LLP LLPAM B&C B & C B;C 2 LLP LLP Prolog B=>C C<=B B C!B! B LLP Prolog ( forall(x,b) x.b ) (")
(195) 39 LLP LLPAM LLP Prolog LLPAM LO [2], ACL [15], Lolli [13], Lygon [9], Forum LLP IO [17], LLP [3] [4] [14] [20] [21] [24] [26] [27] TLLP [25] WAM LLPAM Lolli 1 LLP 2 Prolog 1 1987 J.-Y. Girard (resource-
連載 構文解析器結合子 山下伸夫 (( 株 ) タイムインターメディア ) 文字列の分解 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'')
Microsoft PowerPoint - IntroAlgDs-05-4.ppt
アルゴリズムとデータ構造入門 2005 年 0 月 25 日 アルゴリズムとデータ構造入門. 手続きによる抽象の構築.2 Procedures and the Processes They generate ( 手続きとそれが生成するプロセス ) 奥乃 博. TUT Scheme が公開されました. Windows は動きます. Linux, Cygwin も動きます. 0 月 25 日 本日のメニュー.2.
.N...[..7...doc
1 2 3 STEP1 4 STEP2 STEP3 5 6 7 8 9 1 Solution of Solution of Solution of Solution of Solution of Solution of Solution of Solution of Solution of Solution of Solution of Solution of Solution of Solution
¥×¥í¥°¥é¥ß¥ó¥°±é½¬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
01-34.._.]...p.q_001-024
![01-34.._.]...p.q_001-024](/thumbs/41/22496922.jpg "01-34.._.]...p.q_001-024")
Alvin. Bunt., Fig. Fig. Table N ii Table. A A A A B B B B B B B C D D C D D D Fig. SD........ B D A B Fig. A B B i ii N Alvin.J. Music therapy (Revised Paperback Edition, Originally published in ).London
12-7 12-7 12-7 12-7 12-8 12-10 12-10 12-10 12-11 12-12 12-12 12-14 12-15 12-17 12-18 10 12-19 12-20 12-20 12-21 12-22 12-22 12-23 12-25 12-26 12-26 12-29 12-30 12-30 12-31 12-33 12-34 12-3 12-35 12-36
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
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)
cable_nyuko_070605.indd
Solution Now Solution Now 01 Solution Now 02 Solution Now 03 Solution Now 04 Solution Now Solution Now 01 Solution Now 02 Solution Now 03 Solution Now 04 Solution Now Solution
pptx
iphone 2010 8 18 C xkozima@myu.ac.jp C Hello, World! Hello World hello.c! printf( Hello, World!\n );! os> ls! hello.c! os> cc hello.c o hello! os> ls! hello!!hello.c! os>./hello! Hello, World!! os>! os>
Microsoft PowerPoint - IntroAlgDs-06-8.ppt
アルゴリズムとデータ構造入門 2006 年 11 月 21 日 アルゴリズムとデータ構造入門 2. データによる抽象の構築 2.2 階層データ構造と閉包性 奥乃博大学院情報学研究科知能情報学専攻知能メディア講座音声メディア分野 http://winnie.kuis.kyoto-u.ac.jp/~okuno/lecture/06/introalgds/ okuno@i.kyoto-u.ac.jp 12
MC-440 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67
パワーMOS FET π-MOS
7 VDSS VDSS SJ147 TO-0IS 60 1 0. SJ55 L - 30 5 0.1 P 15 SJ183 L - 60 5 0.35 SJ537 L - TO-9MOD 50 5 0.19 P 15 SJ00 180 10 0.83 SJ567 00.5.0 SJ01 00 1 0.63 SJ570 L - TO-0AB 60 30 0.038 P 15 SJ4 TO-0FL/SM
応力とひずみ.ppt
in yukawa@numse.nagoya-u.ac.jp 2 3 4 5 x 2 6 Continuum) 7 8 9 F F 10 F L L F L 1 L F L F L F 11 F L F F L F L L L 1 L 2 12 F L F! A A! S! = F S 13 F L L F F n = F " cos# F t = F " sin# S $ = S cos# S S