Pi - 10 Trillion Digits
Round 2... 10 Trillion Digits of Pi Same program, same computer, just a longer wait... By Alexander J. Yee & Shigeru Kondo (Last updated: September 22, 2016) December 28, 2013: The record has been improved to 12 trillion digits. For anyone who is interested, this was recently the topic of a Stack Overflow question that I answered. Although not as exciting as the first time around, we finally manag
フィボナッム- zyxwvã®æ—¥è¨˜
ã§ããŸãƒ¼ã€‚値をãƒãƒ£ãƒãƒ«ã«æŠ•ã’込むã¨ãã¯ã€ãŒã£ã¡ã‚Šåž‹ã‚’書ãã»ã†ãŒç„¡é›£ã¿ãŸã„ã§ã™ã€‚ module Main where import PiMonad hiding (piStart) import PiMonad.IO.Console import PiMonad.Channel import PiMonad.Network main = piStart False Nothing mainPr mainPr :: Maybe (I (), NewP) -> PiMonad () mainPr _ = do s <- new fork $ fib 10 s s'<- recv s cout <!. show s' exit <! (0::Int) fib :: Int -> L Priv Int -> PiMonad () fib n s | n < 1 = s <! (1::Int) | o
A Very Brief Introduction to the Pi-Calculus (in Japanese)
Ï€-calculus 超入門 Ï€-calculus ã¯ã€80 年代ã®çµ‚ã‚ã‚Šã”ã‚ã« Milner らã«ã‚ˆã£ã¦æ案ã•ã‚ŒãŸä¸¦è¡Œè¨ˆç®—ã®ãƒ¢ãƒ‡ãƒ«ã®ä¸€ã¤ã§ã™ã€‚ãã“ã§ã¯ã€ãƒ—ãƒã‚»ã‚¹ã¨å‘¼ã°ã‚Œã‚‹è¤‡æ•°ã®ç‹¬ç«‹ã—ãŸä¸»ä½“ãŒã€é€šä¿¡ãƒãƒ£ãƒãƒ«ã¨å‘¼ã°ã‚Œã‚‹ãƒ‡ãƒ¼ã‚¿ã®é€šã‚Šé“を介ã—ã¦å€¤ã‚’ã‚„ã‚Šã¨ã‚Šã—ãªãŒã‚‰ã€è¨ˆç®—ã‚’è¡Œã£ã¦ã„ãã¾ã™ã€‚Ï€-calculus ã«ã¯ã„ã‚ã„ã‚ãªå¤‰ç¨®ãŒã‚ã‚‹ã®ã§ã™ãŒã€ã“ã“ã§ã¯ã¨ã‚Šã‚ãˆãšæ¬¡ã®ã‚ˆã†ãªæ§‹æˆè¦ç´ ã‹ã‚‰ãªã‚‹ã‚‚ã®ã‚’考ãˆã¾ã—ょã†ã€‚ new x . P æ–°ã—ã„ãƒãƒ£ãƒãƒ« x を作ã£ã¦ã‹ã‚‰ã€ãƒ—ãƒã‚»ã‚¹ P を実行ã™ã‚‹ (channel creation) x![v1, ..., vn] ãƒãƒ£ãƒãƒ« x ã«å€¤ v1, ..., vn ã‚’é€ã‚‹ (asynchronous output) x?[v1, ..., vn] . P ãƒãƒ£ãƒãƒ« x ã‹ã‚‰å€¤ v1, ..., vn ã‚’å—ã‘å–ã£ã¦ã€P を実行ã™ã‚‹ (input guard) P |
Ï€-calculus - Wikipedia
In theoretical computer science, the π-calculus (or pi-calculus) is a process calculus. The π-calculus allows channel names to be communicated along the channels themselves, and in this way it is able to describe concurrent computations whose network configuration may change during the computation. The π-calculus has few terms and is a small, yet expressive language (see § Syntax). Functional prog
Lambda to pi
I gave a talk a while back which included an interpreter for the pi-calculus, and a compiler from the lambda-calculus to it. I didn't really do justice to the material in a few slides, so here's a proper blog post. This article is available as a Literate Haskell file, which you can load into GHCi directly. The π-calculus If the λ-calculus is a minimal functional language, then the π-calculus is a
1
リリースã€éšœå®³æƒ…å ±ãªã©ã®ã‚µãƒ¼ãƒ“スã®ãŠçŸ¥ã‚‰ã›
最新ã®äººæ°—エントリーã®é…ä¿¡
j次ã®ãƒ–ックマーク
kå‰ã®ãƒ–ックマーク
lã‚ã¨ã§èªã‚€
eコメント一覧を開ã
oページを開ã
More π-Calculus Games | ScienceBlogs
{{#tags}}- {{label}}
{{/tags}}