(2),2
e Nakano / Ph.D.
:2008.3 -:Associate Professor, Center for Frontier Science and Engineering, [[the University of Electro-Communications|http://www.uec.ac.jp/eng/]]
:2008.3 -:Assist
1,1
a, USA, January
2011.2012.
(1),1-5
:[[Objective Caml|http://caml.inria.fr/ocaml/]]:Objective Caml is a fast modern type-inferring functional programming language descended from the ML (Meta Language) family. I frequently use this language to write programs for practical tools and small compilers.
//
:[[Ruby]]:
//
:Java:
(1),1-9
My first name can be pronounced as {{e('quot')}}''K S K''{{e('quot')}}.
The combinator ''X = ''{{e(lambda)}}''x.x K S K'' {{fn('As usual, you must recognize it as {{e(lambda)}}x. ( ( ( x K ) S ) K ).')}}
is universal in the sense that
all combinators can be constructed by ''X''.
* ''S = X(XX)''
* ''K = (XX)X''
* ''I = X(XX)(XXX)(XXXX)''
Actually, ''I'' is defined as ''X(XX)(XXX)z'' where ''z'' can be any term.
(1),1
* To edit the ''[[To Do]]'' page.
6,6
##
[[λx.xKSK]][[λx.xKSK|lambda x.x KSK]]
(21),21
inf*ck|QuineBF]]
### [[Haskell|QuineHaskell]]
# Juggling
## [[
(1),1-18
l =
[""
," "
," ];m"
,"ain=ma"
,"pM_ putS"
,"tr(\"l\":m"
,"ap(f\n repl"
,"icate length)("
,"\"= \":\"[\\\"\\"
,"\"\":\n (map ((\","
,"\"++).show).tail)l)+"
,"+l )\nf r g s=r(17-di"
,"v(g s)2)' '++s++\"\\n\" "
];main=mapM_ putStr("l":map(f
replicate length)("= ":"[\"\"":
(map ((","++).show).tail)l)++l )
f r g s=r(17-div(g s)2)' '++s++"\n"
1,1
e contact me by
3,3
The e-mailMy email address is
4,4
address is
''{{e(107)}}{{e(115)}}{{e(107)}}''{{e(107)}}{{e(115)}}{{e(107)}}''
5,5
@''@''
6,6
cs.uec.ac.jp".''cs.uec.ac.jp''.
(1),1-21
:January 1, 2009:The paper '''[[Composing Stack-Attributed Tree Transducers|http://dx.doi.org/10.1007/s00224-008-9125-y]]''' is accepted by ''[[Theory of Computing Systems|http://www.springerlink.com/content/100369/]]'', Volume 44, Issue 1 (2009), pp.1-38.
//
:Nov 24, 2008: The paper '''Rewriting XQuery to Avoid Redundant Expressions based on Static Emulation of XML Store''' co-authored with Hiroyuki Kato, Soichiro Hidaka, Zhenjiang Hu, and Yasunori Ishihara is accepted by ''[[PLAN-X 2009|http://db.ucsd.edu/planx2009/]]''.
//
:Oct 15, 2008: The paper '''Towards Compositional Approach to Model Transformation for Software Development''' co-authored with Soichiro Hidaka, Zhenjiang Hu, and Hiroyuki Kato is accepted by the Software Engineering Track of [[SAC 2009|http://www.acm.org/conferences/sac/sac2009/]].
//
:July 9, 2008: The paper '''Consistent Web Site Updating based on Bidirectional Transformation''' co-authored with Zhanjiang Hu and Masato Takeichi is accepted by ''[[WSE 2008|http://wse2008.fbk.eu/]]''.
//
:March 1, 2008:I was installed as an Assistant Professor at [[the University of Electro-Communications|http://www.uec.ac.jp/eng/]].
//
:Dec 1, 2007:Two papers '''XML Type Checking for Macro Tree Transducers with Holes''' co-authored with Sebastian Maneth and '''XML Stream Processing Using a Lazy Concurrent Language''' co-authored with Shin-Cheng Mu and Ta-Chung Tsai were accepted by [[PLAN-X 2008|http://gemo.futurs.inria.fr/events/PLANX2008/]].
//
:Jun 8, 2007:The paper '''Bidirectionalization Transformation based on Automatic Derivation of View Complement Functions''' co-authored with Kazutaka Matsuda (the 1st author), Zhenjiang Hu, Makoto Hamana and Masato Takeichi was accepted by [[ICFP 2007|http://www.informatik.uni-bonn.de/~ralf/icfp07.html]].
//
// :Apr 26, 2007:I give a talk on '''Vu-X: Website Updating System based on Bidirectional Transformation''' at [[PTT|http://www.cc.uec.ac.jp/~kazutaka/ptt/arc/332/332.html]] (in Japanese).
//
// :Nov. 10, 2006:I give a talk on '''A Pushdown Machine for Recursive XML Processing''' at [[APLAS 2006|http://www.kb.ecei.tohoku.ac.jp/aplas2006/]].
// :Aug. 2, 2006:The paper '''A Pushdown Machine for Recursive XML Processing''' co-authored with Shin-Cheng Mu is accepted to [[APLAS 2006|http://www.kb.ecei.tohoku.ac.jp/aplas2006/]].
//
// :Jun. 7, 2006:Renewal of this site by using [[Hiki]] with [[TabWiki]].
//
(1),1-30
-
>>>
>>>>>
>+++>+>
+++>+>++>
+++>+>+>+>+
>+++>>+++>+>+
++>+>+++>+>++>+
++>++>>+++>+>>>+>
+>>+++>+++>+>>>>>++
>+++>++>>+>+>>>+++>+>
+++>+>++>+++>+++>+>>+++
>+++>+>+++>+>+++>>>>>>>>>
>>>>>>>>>>>>>+>+>++>+++>++>
>+++>+>>>>>>>>>>>>>>>>>>>>>>>
>>>>>>>>>>+>+>>+++>>>+>+>+>+>>>
++>+++>+>+>>+++>+>+>+>+>>+++>+>+>
++>+++>++>>+>+>>>+++>+>>+++>+>+>++>
+++>++>>+>+>+++>>+++>+>+++>+>>>+>+>>+
++>++>>>+++>+>+>>>>>+++>+>+++>+>++>+++>
++>>+>+>+>+>+>+>>>+++>+>>>>>>>+++>+>>>>>>
>+++>+>>+++>>>>>>>>>>>>>>>>>>>>>+++>+>>>+++
>+>+++>+>+++>+>>>+++>+>>>+++>+>>>>>>>++>+++>+
++>+>>+++>+++>+>+++>+>+++>+>++>+++>>>+>+>+>+>++
>+++>+>+>>+++>>>>>>>+>+>>>+>+>++>+++>+++>+>>+++>+
++>+>+++>+>++>+++>++>>+>+>++>+++>+>+>>+++>>>+++>+>>
>++>+++>+++>+>>+++>>>+++>+>+++>+>>+++>>+++>>+[[>>+[>]
+>+[<]<-]>>[>]<+<+++[<]<<+]>>>[>]+++>+>+>>>+>++++++++++
[>+++>+++>+<<<-]>>++<[-[<+>>.<-]<[>+<-]<[<<[<]+<<+[<+++++
+++++++++++>-]<++++++++++.>>[>]>>+<-]++>[<+>-]>>>.<<]>>++++