Reddit - Dive into anything
The Haskell programming language community. Daily news and info about all things Haskell related: practical stuff, theory, types, libraries, jobs, patches, releases, events and conferences and more... ICFP 2010 papers are in ACM DL, but not freely available. The program is here: http://www.icfpconference.org/icfp2010/program.html And a (growing) list of freely available pre-prints: Monday Keynote:
9 by 9 Sudoku Solver
The box below offers an alternative way of filling the board faster. Seed the board with the sample numbers or enter your own numbers. This Sudoku solver will help you solve any valid SuDoku in seconds. Just seed the SuDoku board with numbers and then click on the appropriate button to check, partially solve or completely solve the puzzle. For a complete description of the features scroll down the
行列ã¨é …æ›¸æ› - d.y.d.
21:54 10/06/30 行列ã¨é …æ›¸æ› "Termination of String Rewriting with Matrix Interpretations" ã¨ã„ã†è«–文をèªã¿ã¾ã—ãŸã€‚ ã“ã‚Œã¯ä½•ã‹ã¨ã„ã†ã¨ã¤ã¾ã‚Šã€ ICFPコンテストã®å…ƒãƒã‚¿ã¨ã—㦠紹介 ã•ã‚Œã¦ã„ãŸè«–æ–‡ã§ã™ã€‚ ã‚Œ ㄠ年〠冗談９割ã§ã€ä¸»å‚¬è€…ã®å°‚門分野ã«ã¡ãªã‚“ã å•é¡ŒãŒå‡ºã‚‹ã«é•ã„ãªã„ï¼ã¨å«ã‚“ã§ã„ã‚‹ã®ã§ã™ãŒã€ 本当ã«æ¥ã‚‹ã¨ã¯æ€ã‚ãªã‹ã£ãŸâ€¦ã€‚ ã•ã¦ã€‚é …æ›¸ãæ›ãˆ (term rewriting) ã¨å‘¼ã°ã‚Œã‚‹ç ”究分野ãŒã‚ã‚Šã¾ã—ã¦ã€ 例ãˆã°ã“ã‚“ãªå•é¡Œã‚’調ã¹ã¦ã„ã¾ã™ã€‚ æ–‡å—列ã«å¯¾ã—ã¦ã€ã€Œä»¥ä¸‹ã®æ“作ã®ã©ã‚Œã‹ã‚’好ãã«é¸ã¶ ＆ 実行ã™ã‚‹ã€ã‚’ç¹°ã‚Šè¿”ã—ã¾ã™ã€‚ abc ã¨ã„ã†éƒ¨åˆ†æ–‡å—列を de ã«æ›¸ãæ›ãˆã‚‹ （abc ⇒ de ã¨æ›¸ãã¾ã™ï¼‰ ef ⇒ g fgh ⇒ ij ã©ã‚“ãªæ–‡å—列ã‹ã‚‰ã‚¹ã‚¿ãƒ¼ãƒˆã—ã¦ã‚‚ã€æœ€å¾Œã«ã¯ã€ã©ã®è¦å‰‡ã‚‚使ãˆãªã„状態 （ã¤
有é™é ˜åŸŸã§ã®æŽ¨ç§»é–‰åŒ…ã®å…¬ç†åŒ– - ヒビルテ(2009-09-16)
λ. 有é™é ˜åŸŸã§ã®æŽ¨ç§»é–‰åŒ…ã®å…¬ç†åŒ– 昨日も書ã„ãŸã‚ˆã†ã«ã€æŽ¨ç§»é–‰åŒ…ã¯ä¸€èˆ¬ã«ã¯ä¸€éšŽè¿°èªžè«–ç†ã§ã¯è¡¨ç¾ã§ããªã„ã®ã§ã€é ˜åŸŸã‚’有é™ã«é™å®šã—ãŸå ´åˆã§ã‚‚é ˜åŸŸã®ã‚µã‚¤ã‚ºã®ä¸Šé™ n ã«ä¾å˜ã—ãŸå½¢ã€ãŸã¨ãˆã°ä»¥ä¸‹ã®ã‚ˆã†ãªå½¢ã§ã—ã‹è¡¨ç¾ã§ããªã„ã¨æ€ã„込んã§ã„ãŸã€‚ ∀x,y. Tk(x,y) ⇔ R(x,y) ∨ σ1 ∨ … ∨ σn-2 where σn := ∃z1,…,zn. R(x,z1) ∧ R(z1,z2) ∧ … ∧ R(zn-1,zn) ∧ R(zn,y) Automating First-Order Relational Logic ãªã‚“ã‹ã§ã‚‚ã€ã€ŒThe transitive closure is obtained by applying an operator that computes closure using iterative doubling, as explained in [15].ã€
Title Here
ã„ã¾ã©ãã®ï¼ï¼Ÿ プãƒã‚°ãƒ©ãƒŸãƒ³ã‚°è¨€èªžç†è«– ã„ãªã° ã‹ãšã²ã‚ 稲葉 一浩 http://www.kmonos.net/ http://twitter.com/kinaba 言語組：講義資料 2/39 ãŠè©±ã—ã™ã‚‹å†…容 •時ã¯2009å¹´ •「プãƒã‚°ãƒ©ãƒŸãƒ³ã‚°è¨€èªžã€ã® 「ç†è«–ã€ã® ã€Œç ”ç©¶è€…ã€ã®ã‚ã„ã 㧠•今ãªã«ãŒã‚¢ãƒ„ã„？ 3/39 ç†è«–ç³»ã®ãƒˆãƒƒãƒ—レベルã®å¦ä¼š •POPL 2009 –Symposium on Principles of Programming Languages »“プãƒã‚°ãƒ©ãƒŸãƒ³ã‚°è¨€èªžã®æœ¬è³ªâ€ •ESOP 2009 –European Symposium on Programming 4/39 今年ã®æ™‚間割:POPL 2009 • 並行性 (Concurrency) • 型１(Types) • ãã®ä»–１ (Medley) • é™çš„解æžï¼‘ (Static analysis) • 関数型ﾌ
交差点信å·ãŒåŒæ™‚ã«ã€Œé’ã€ã€ãƒ—ãƒã‚°ãƒ©ãƒ ã®ãƒŸã‚¹ | スラド
ストーリー by soara 2009å¹´07月20æ—¥ 19時45分 自動車販売店å‰ã®ä¿¡å·ã¯è¦ã‚‰ãªã‹ã£ãŸ? 部門より èªå£²æ–°èžã®ãƒ‹ãƒ¥ãƒ¼ã‚¹ã«ã‚ˆã‚‹ã¨ã€ç¦å³¶çœŒä¼šæ´¥è‹¥æ¾å¸‚ã®å›½é“交差点ã§ã€äºŒã¤ã®ä¿¡å·ãŒ 30 å¹´è¿‘ãã«ã‚ãŸã£ã¦ç´„ 7 秒間ã€åŒæ™‚ã«é’ã«ãªã£ã¦ã„ãŸã“ã¨ãŒã‚ã‹ã£ãŸã€‚ã“ã®äº¤å·®ç‚¹ã§ä¹—用車åŒå£«ã®äº‹æ•…ãŒã‚ã‚Šã€åŒæ–¹ã¨ã‚‚「信å·ãŒé’ã ã£ãŸã€ã¨ä¸»å¼µã—ãŸãŸã‚è¦å¯ŸãŒèª¿ã¹ã€ä¸å…·åˆãŒæ˜Žã‚‰ã‹ã«ãªã£ãŸã‚‰ã—ã„。 三åå¹´ã‚‚å‰ã ã¨ã€ãƒªãƒ¬ãƒ¼åˆ¶å¾¡ã‹ã‚·ãƒ¼ã‚±ãƒ³ã‚µãƒ¼ãªã®ã ã‚ã†ã‹ï¼Ÿ ã„ãšã‚Œã«ã—ã¦ã‚‚ã“ã®ã‚ˆã†ã«è‡´å‘½çš„ãªä¸å…·åˆãŒ 30 年間も放置ã•ã‚Œã¦ã„ãŸã®ã¯é©šãã 。åŒã˜ãƒã‚¸ãƒƒã‚¯ã‚’採用ã—ã¦ã„ã‚‹ä¿¡å·æ©Ÿå…¨ã¦ã‚’ãƒã‚§ãƒƒã‚¯ã™ã‚‹å¿…è¦ãŒã‚ã‚‹ã¨æ€ã†ã€‚
Coq in a Hurry
These notes provide a quick introduction to the Coq system and show how it can be used to define logical concepts and functions and reason about them. It is designed as a tutorial, so that readers can quickly start their own experiments, learning only a few of the capabilities of the system. A much more comprehensive study is provided in [1], which also provides an extensive collection of exercise
ヒビルテ(2008-10-14)
λ. SmallCheck and Lazy SmallCheck: automatic exhaustive testing for small values SmallCheck and Lazy SmallCheck: automatic exhaustive testing for small values. Colin Runciman, Matthew Naylor and Fredrik Lindblad. in Haskell '08: Proceedings of the first ACM SIGPLAN symposium on Haskell ã‚’èªã‚“ã 。 QuickCheck ãŒãƒ©ãƒ³ãƒ€ãƒ テストãªã®ã«å¯¾ã—ã¦ã€SmallCheck ã¯æŒ‡å®šã—ãŸä¸Šé™ã¾ã§ã®ç¯„囲ã®ç¶²ç¾…çš„ãªæ¤œæŸ»ã‚’è¡Œã†*1。 QuickCheckã§ã¯å€¤ãŒé©åˆ‡ã«åˆ†æ•£ã™ã‚‹ã‚ˆã†ã«å€¤ã®ç”Ÿæˆæ©Ÿã‚’書ãã®ã¯ç°¡å˜ã§ã¯ãªã„ãŒã€Sm
brainfuck interpreter in Coq - ã¾ã‚ã‚ã‚‚
Haskell ã€Erlang ã®æ¬¡ã®ãƒ–ーム㯠Coq ã«é•ã„ã‚ã‚Šã¾ã›ã‚“。ã¨ã‚Šã‚ãˆãšåŸºæœ¬ã¨ã„ã†ã“ã¨ã§ã€Coq ã§ã²ãã‚Šã®ãªã„ brainfuck インタプリタを書ã„ã¦ã¿ã¾ã—ãŸã€‚動作例。Coq ã®ã‚³ãƒ¼ãƒ‰ãŒè‰²ã¥ã‘ã§ããªã„ã¨ã¯ä½•äº‹ã‹ã€‚ Eval compute in (finite_execute " +++++++++[>++++++++>+++++++++++>+++++<<< -]>.>++.+++++++..+++.>-.------------.<++ ++++++.--------.+++.------.--------.>+. " "" 500). = "Hello, world!"%string : string 残念ãªãŒã‚‰ (?) Coq ã§ã¯åœæ¢æ€§ãŒä¿éšœã•ã‚ŒãŸé–¢æ•°ã—ã‹å®šç¾©ã§ãã¾ã›ã‚“。ã“ã“ã§ã¯æœ€å¤§è©•ä¾¡ã‚¹ãƒ†ãƒƒãƒ—を指定ã—ãªã„ã¨ã„ã‘ãªã„ã¨ã„ã†ä»•æ§˜ã«ã—ã¦ã”ã¾ã‹ã—ã¦ã„ã¾ã™ (引数㮠50
リリースã€éšœå®³æƒ…å ±ãªã©ã®ã‚µãƒ¼ãƒ“スã®ãŠçŸ¥ã‚‰ã›
最新ã®äººæ°—エントリーã®é…ä¿¡
j次ã®ãƒ–ックマーク
kå‰ã®ãƒ–ックマーク
lã‚ã¨ã§èªã‚€
eコメント一覧を開ã
oページを開ã
anarchy proof -
https://jp.techcrunch.com/2010/05/17/20100513adobe-deputs-esignatures-takes-digital-signatures-to-the-cloud/
http://www.tom.sfc.keio.ac.jp/~sakai/d/?date=20091106
æ•°å¦åŸºç¤Žè«–講演会「ゲーデルã®ä¸å®Œå…¨æ€§å®šç†ã€ - ヒビルテ(2009-10-31)
JSSST : Vol. 23 (2006) , No. 3 pp.3_14-3_34
Verifying Compiler Transformations for Concurrent Programs | Lambda the Ultimate
http://deepthought.ttu.ee/it/gandalf/OtterBook.pdf
AMS: A Special Issue on Formal Proof | Lambda the Ultimate
Type-Checking Zero Knowledge | Lambda the Ultimate
http://www.tom.sfc.keio.ac.jp/~sakai/d/?date=20081029
http://www.tom.sfc.keio.ac.jp/~sakai/d/?date=20080831
{{#tags}}- {{label}}
{{/tags}}