Nanyang Technological University
Staff Personal Web Page DISCLAIMER The websites under https://personal.ntu.edu.sg and https://www3.ntu.edu.sg/home are hosting NTU staff's personal web pages. If you are coming from an expired or bookmarked page (www.ntu.edu.sg/home/your_url), you may want to update your link with the new domain (personal.ntu.edu.sg/your_url). NTU does not in any way accept any liability nor responsibility for thi
Senamtics with Applications - soutaroブãƒã‚°
k.inabaã•ã‚“ãŒã€Œé¢ç™½ãã†ã€ã¨æ›¸ã„ã¦ãŸæœ¬ã§ã™ã€‚ Semantics with Applications: An Appetizer (Undergraduate Topics in Computer Science) 作者: Hanne Riis Nielson,Flemming Nielson出版社/メーカー: Springer London発売日: 2007/04/27メディア: ペーパーãƒãƒƒã‚¯ã“ã®å•†å“ã‚’å«ã‚€ãƒ–ãƒã‚° (1件) を見る é¢ç™½ãã†ã ã£ãŸã—ã€Amazonã§è¦‹ã¦ã¿ãŸã‚‰ã€ãªã‚“ã‹ãˆã‚‰ã„安ã‹ã£ãŸã®ã§è²·ã£ã¦ã¿ã¾ã—ãŸ*1。ã„ã‚„ã€ã“ã†ã„ã†æœ¬ã£ã¦ã€ã‚¤ãƒ¡ãƒ¼ã‚¸ã¨ã—ã¦5,000円〜10,000円ãらã„ã—ãã†ãªæ°—ãŒã—ã¾ã™ã€‚届ã„ã¦ã‹ã‚‰æ°—ã¥ã„ãŸã®ã§ã™ãŒã€ã€ŒUndergraduate Topics in Computer Scienceã€ã¨ã‹æ›¸ã„ã¦ã‚ã‚Šã¾ã—ãŸã€‚æ„Ÿã˜ã¨ã—ã¦ã¯å¦éƒ¨ç”Ÿã®æŽˆæ¥ã‹ã‚»ãƒŸãƒŠãƒ¼ã‹ã§ä½¿ã†
Programming and Computation
Types Metaprogramming Lambda-calculus Monads in Haskell and other languages Continuations and delimited control Streams Generic zipper and the zipper-based filesystem Many faces of fixed-point combinators Having an Effect There was still something left to discover in how to add and multiply Doubts about the concept of information and an elementary derivation of the Shannon entropy formula The curi
Unchecked Exceptions can be Strictly More Powerful than Call/CC | Lambda the Ultimate
Unchecked Exceptions can be Strictly More Powerful than Call/CC Here's a little light reading for your day-after-Labor-Day (or whatever yesterday was where you live): Unchecked Exceptions can be Strictly More Powerful than Call/CC, Mark Lillibridge and Olivier Danvy, 1999, Higher-Order and Symbolic Computation. We demonstrate that in the context of statically-typed purely-functional lambda calculi
Computational Complexity of Games and Puzzles
Many of the games and puzzles people play are interesting because of their difficulty: it requires cleverness to solve them. Often this difficulty can be shown mathematically, in the form of computational intractibility results: every NP-complete problem is in some sense a puzzle, and conversely many puzzles are NP-complete. Two-player games often have higher complexities such as being PSPACE-comp
å†å¸°ãƒ—ãƒã‚°ãƒ©ãƒ ã®æ„味論ã«ã¤ã„ã¦
∗ 1 semantics of programming languages recursion ∗ 59 (2007), 180–191 1 2 2.1 fact(x) ≡ if x = 0 then 1 else x × fact(x−1) well-defined Z * Z Z * Z F : (Z * Z) → (Z * Z) F(f)(x) =      1 (x = 0) x × f(x − 1) (x 6= 0, f(x − 1) ) ( ) F F fact fact [[fact]] : Z * Z [[fact]](x) = ( x! (x ≥ 0) ( ) 2 F f [[fact]] F([[fact]])(x) =      1 (x = 0) x × y (x 6= 0, [[fact]](x−1) = y) ( ) = ( x! (x ≥
selfref2006.dvi
∗ I 2 1 2 2 2 3 3 4 5 5 7 6 8 II 11 1 11 2 12 3 13 4 14 5 15 6 — 16 ∗ 2002 8 5 8 2006 5 2007 8 Soto-Andrade Varela 1984 1 Part I 1 Russell, B.A.W., 1872-1970 ( ) X ∈ X X M 1 M M M ∈ M M M M M ∈ M M 2 Cantor, G., 1845-1918 1 X 2X X u t X m : 2X → X X R R = {m(A) | A ⊆ X, m(A) 6∈ A} m(R) R m(R) ∈ R R m(A) 6∈ A A ⊆ X m(R) = m(A) m R = A m(R) 6∈ R m(R) 6∈ R R m(R) ∈ R 1 M 2 1 1 ( ) 3 1 2 X X X XX X u
セマンティクス(笑) - soutaroブãƒã‚°
セマンティクスã£ã¦ï¼Ÿ - Higepon’s blog Route 477(2008-05-30) セマンティクス - soutaroã«ã£ã http://alohakun.blog7.fc2.com/?no=945 http://www.tom.sfc.keio.ac.jp/~sakai/d/?date=20080603#p01 d.y.d. 多分ã€æ™‚ç³»åˆ—é †ã€‚ id:higeponã•ã‚“ã®ã‚¨ãƒ³ãƒˆãƒªã¯LDRã§çœºã‚ãŸã ã‘ã§ã€ã¡ã‚‡ã£ã¨ã—ã¦yharaã•ã‚“ãŒã‚³ãƒ¡ãƒ³ãƒˆã—ã¦ã‚‹ã®ã‚’見ã¦ã€ã˜ã‚ƒã‚ã›ã£ã‹ãã ã‹ã‚‰ã¨æ€ã£ã¦ã¡ã‚‡ã£ã¨ã‚»ãƒžãƒ³ãƒ†ã‚£ã‚¯ã‚¹ã«ã¤ã„ã¦æ›¸ã„ã¦ã¿ã‚ˆã†ã¨æ€ã£ãŸã€‚ã©ã†ã„ã†è©±ã«ã™ã‚‹ã‹ä¸€çž¬è€ƒãˆã¦ã€Haskell Hackathonã®ã¨ãã«Lingrã§id:SiroKuroã•ã‚“ã¨è©±ã—ã¦ãŸã®ã‚’æ€ã„出ã—ã¦è‰¯ã„機会ã ã‹ã‚‰ã€ãã®ã¨ãç†è§£ã—ãŸæ°—ã«ãªã£ãŸã“ã¨ã‚’書ã„ã¦ã¿ã‚ˆã†ã¨æ±ºã‚ãŸã€‚ãã®ã‚ã¨ã€ã‚ã‚ã¯ã•ã‚“ãŒã€ä¾‹ã«ã‚ˆã£ã¦ETã«
ホワット・ア・ワンダフル・ワールド セマンティクス
soutaroã«ã£ã 2008-05-30 ■セマンティクス ã²ã’ã½ã‚“ OSã¨ã‹ä½œã£ã¡ã‚ƒã†ã‹Mona- 2008/05/30 セマンティクスã£ã¦ï¼Ÿ セマンティクスをè°è«–ã™ã‚‹ãŸã‚ã«ã¯ï¼Œè¨ˆç®—モデルを決ã‚ãªã„ã¨ã„ã‘ã¾ã›ã‚“． 計算モデルãŒæ±ºã¾ã‚Œã°ï¼ŒçŠ¶æ…‹ã®è¡¨ç¾æ–¹æ³•ãŒæ±ºã¾ã‚Šï¼Œã€Œè¨ˆç®—ã€ã¨ã„ã†æ¦‚念ãŒæ±ºã¾ã‚Šã¾ã™ï¼Ž 計算ã¨ã„ã†ã®ã¯ï¼ŒçŠ¶æ…‹å¤‰åŒ–ã®åˆ—ã®ã“ã¨ã§ã™ï¼Ž 計算ãŒæ±ºã¾ã‚Œã°ï¼Œè¨ˆç®—ã¨ãƒ—ãƒã‚°ãƒ©ãƒ ã®å¯¾å¿œé–¢ä¿‚を決定ã™ã‚‹ã“ã¨ãŒã§ãã¾ã™ï¼Ž ãã®ï¼Œå¯¾å¿œé–¢ä¿‚ã®ã“ã¨ãŒ 「æ„味論 (semantics)ã€ã ã¨æ€ã„ã¾ã™ï¼Ž ä»»æ„ã®ãƒ—ãƒã‚°ãƒ©ãƒ 空間 P 内ã®ãƒ—ãƒã‚°ãƒ©ãƒ p ∈ P ã¨ï¼Œä»»æ„ã®è¨ˆç®—空間 C 内ã®è¨ˆç®—（状態ã®å¤‰åŒ–列） c ∈ C ã®çµ„ ＜p, c＞ ãŒæ„味論ã¨ã„ã†æ°—ãŒã—ã¾ã™ （ã„や，メãƒãƒ£ã‚¯ãƒãƒ£ãƒ†ã‚トーã§ï¼Œå€‹äººçš„ãªã‚¤ãƒ¡ãƒ¼ã‚¸ã§ã™ã‘ã©ï¼‰ ã“ã“らã¸ã‚“を真é¢ç›®ã«è€ƒãˆã¦ã„ã‚‹ã®ã¯ï¼ŒãŸã¶ã‚“ç‰ä¾¡å¤‰æ›è¨ˆç®—モデル(Equivalent Trans
d.y.d.ãŠã‚‚ã—ã‚ã„ã¿ã‚ã‚“
13:33 08/06/29 RSS of kmonos/wlog moved! http://www.kmonos.net/wlog/index.rdf ã„ã‚„ã€ç§»å‹•ã—ãŸã®ã¯15ヶ月å‰ãªã®ã§ã€ã™ã§ã«ã”å˜ã˜ã®æ–¹ã¯è¯éº—ã«ã‚¹ãƒ«ãƒ¼ã—ã¦ãã ã•ã„。 「ã“ã“ã®RSSãŒæ–‡å—化ã‘ã—ã¦ã‚‹ã‚ˆãƒ¼ã€ã¨ã„ã†æ–¹ã ã‘ã€â†‘ã«ç™»éŒ²å¤‰æ›´ã—ã¦ã„ãŸã ã‘ã‚‹ã¨ã€ ç›´ã‚‹ã‹ã¨æ€ã„ã¾ã™ã€‚ãŠæ‰‹æ•°ãŠã‹ã‘ã—ã¦ã‚¹ãƒŸãƒžã‚»ãƒ³ã€‚定期的ã«ã€Œæ–‡å—化ã‘ã£ã¦ã‚‹ã€ã¨ã„ㆠ指摘を見ã‹ã‘ã‚‹ã®ã§å†åº¦ãƒ–ãƒãƒ¼ãƒ‰ã‚ャストã§ã™ã€‚ã“ã†ã€è¾›è¾£ãªè©•è°ä¼šã¨ã‹ã§æ€’られãã†ã§ã™ã‘ã©ã€ 諸般ã®äº‹æƒ…ã«ã‚ˆã‚Šå¤ã„æ–¹ã‹ã‚‰ãƒªãƒ€ã‚¤ãƒ¬ã‚¯ãƒˆã‹ã‘ã‚‹ã®é›£ã—ã„らã—ã„ã®ã よã… ãã‚Œã¯ãã†ã¨ã€æ˜¨æ—¥ã®è¨˜äº‹ã«è¿½è¨˜ã—ã¾ã—ãŸã€‚ 10:26 08/06/28 Logic ∩ CS 検索ã—ã¦ãŸã‚‰ãŸã¾ãŸã¾ãƒ’ットã—㟠"On the Unusual Effectiveness of Logic in Computer Scienc
Categories
Welcome to the Computational Category Theory Project Computational Category Theory is an implementation of concepts and constructions from category theory in the functional programming language Standard ML. The original ideas are due to R.M. Burstall, and it was developed by D. Rydeheard, with help from D.T. Sannella and others in the University of Edinburgh theoretical computer science community.
計算ã¨è«–ç†Computation and Logic - ä½è—¤é›…彦(京都大å¦å·¥å¦éƒ¨æƒ…å ±å¦ç§‘)
計算ã¨è«–ç† äº¬éƒ½å¤§å¦å·¥å¦éƒ¨æƒ…å ±å¦ç§‘ é–‹è¨è¬›ç¾© 担当教官: ä½è—¤é›…彦 目次 å·¥å¦éƒ¨ã‚µãƒ¼ãƒã«ãŠã‘ã‚‹ Syllabus ã®æƒ…å ± å—講å¦ç”Ÿã¸ã®é€£çµ¡äº‹é …: ãã®1 (10月07æ—¥) 講義資料: 今後ã“ã®å ´æ‰€ã«ç½®ãã¾ã™ï¼Ž 第1ç« , 第2ç« ( PDF file) 第3ç« , 第4ç« , 第5ç« ( PDF file) ä½è—¤ãƒ»äº”ååµç ”ホームページ ä½è—¤ 雅彦 質å•ãªã©ã®å®›å…ˆ: [email protected]uis.kyoto-u.ac.jp
è«–æ–‡èªã¿: Arrows, Robots, and Functional Reactive Programming http://www.haskell.org/yampa/AFPLectureNotes.pdf - 言語ゲーãƒ
Haskell ã®ã‚¢ãƒ‹ãƒ¡ãƒ¼ã‚·ãƒ§ãƒ³ãƒ©ã‚¤ãƒ–ラリ Yampa ã«ã¤ã„ã¦ã®ãƒãƒ¥ãƒ¼ãƒˆãƒªã‚¢ãƒ«ã€‚ã¾ãŸã‚‚ã‚„ FRP (Functional Reactive Programming) ã®è©±é¡Œã§ã™ã€‚SOE ã® FAL ã¯ä¼‘憩ã—ã¦ã€ãã®æœªæ¥ã®å§¿ã§ã‚ã‚‹ Yampa ã«å¯„ã‚Šé“ã—ã¾ã™ã€‚Monad を一般化ã—㟠Arrow ãªã‚‹ã‚‚ã®ã‚’使ã£ã¦ã€time / space leak ãªã‚‹ç‰©ã‚’排除ã—ã€ãƒ¢ãƒã‚¤ãƒ«ãƒãƒœãƒƒãƒˆã®ãƒ—ãƒã‚°ãƒ©ãƒ ã‚’ãã£ã¡ã‚Šè¨˜è¿°ã—ã¾ã™ã€‚ プãƒã‚°ãƒ©ãƒ ã®ä¾‹ã¨ã—ã¦ã€ã‚·ãƒ ボット(ãƒãƒœãƒƒãƒˆã‚·ãƒŸãƒ¥ãƒ¬ãƒ¼ã‚¿)を扱ã„ã¾ã™ã€‚シムボットã¯äºŒã¤ã®ç‹¬ç«‹ã—ã¦å‹•ã車輪をæŒã¡ã€ã¶ã¤ã‹ã‚Šã‚»ãƒ³ã‚µãƒ¼ã‚„ã€å‰å¾Œå·¦å³ã«å…‰å¦ã‚»ãƒ³ã‚µãƒ¼ã‚’æŒã¡ã¾ã™ã€‚ã¾ãŸã€ä»–ã®ã‚·ãƒ ボットã®ä½ç½®ã‚’知る事も出æ¥ã¾ã™ã€‚ シグナル (p 3) 一番é‡è¦ãªæ¦‚念ã¯ã‚·ã‚°ãƒŠãƒ«ã§ã™ã€‚ Signal a = Time -> a ã¤ã¾ã‚Šã€ã‚·ã‚°ãƒŠãƒ«ã¨ã¯æ™‚é–“ã®é–¢æ•°ã§ã™ã€‚例ãˆã°ã‚·ãƒ ボットã¯è»Šè¼ªãŒäºŒã¤ã‚ã‚‹ã®ã§
15-819K Logic Programming
Logic programming is a paradigm where computation arises from proof search in a logic according to a fixed, predictable strategy. It thereby unifies logical specification and implementation in a way that is quite different from functional or imperative programming. This course provides a thorough, modern introduction to logic programming. It consists of a traditional lecture component and a projec
ランã‚ング
ランã‚ング
ランã‚ング
リリースã€éšœå®³æƒ…å ±ãªã©ã®ã‚µãƒ¼ãƒ“スã®ãŠçŸ¥ã‚‰ã›
最新ã®äººæ°—エントリーã®é…ä¿¡
j次ã®ãƒ–ックマーク
kå‰ã®ãƒ–ックマーク
lã‚ã¨ã§èªã‚€
eコメント一覧を開ã
oページを開ã
Moggi :: CT -> Hask - The Syntactic Century
Teaching
http://www.tom.sfc.keio.ac.jp/~sakai/d/?date=20080603
Kursused - Arvutiteaduse instituut
15-851 Computation and Deduction
http://imps.mcmaster.ca/doc/seven-virtues.pdf
{{#tags}}- {{label}}
{{/tags}}