2010-01-01ãã1å¹´éã®è¨äºä¸è¦§
ã¿ã¤ãã³ã°é度ã測å®ããããã°ã©ã ãã¤ãã£ã¦ã¿ãã http://jsdo.it/katona/typingä¸æ®µã®textareaã®èª²é¡æãä¸æ®µã®textareaã«å ¥åããã 1æåç®ã®æã¡å§ãããè¨æ¸¬ãéå§ããããæå©ï¼ï¼ï¼ãªä»æ§ã <html> <head> <title>Typing</title> <script> function key(f){ while(f.src.value.indexO</head></html>â¦
# let twice f x = f (f x)ãã㯠f ã¨ããé¢æ°ã¨å¤ x ãããã£ã¦ãf ãäºå x ã«é©ç¨ããé¢æ°ã§ãã ãã¦ãã§ã¯ã # twice twice twice twice add1 0 ã¯ä½ã帰ã£ã¦æ¥ãã¨æãã¾ããï¼ http://d.hatena.ne.jp/camlspotter/20100710/1278752186 ã»twiceã¯ãã£â¦
ãã£ãï¼ã¤ã®é¢æ°ããåºçºãã¦æ¨æ¥ãã£ããã£ã¼ãæ°ã®å æ¸ä¹é¤ - MEMO:ã¯ã¦ãªæ¯åºãåç¾ããã æåã«çæãã¦ããå種ã³ã³ããã¼ã¿ã¯ã³ã¡ã³ããã¤ãã¦ããããm=ã®ã¨ããããã¯åºæ¬çã«æ¨æ¥ã¨åããªã®ã§çç¥ã æåã®é¢æ°x(Fokkerçã®ä¸ç¹åºåºã³ã³ããã¼ã¿)â¦
åæ¨è«ãç¡å¹ã«ããæ¹æ³ãçºè¦ã åæ¨è«ããã¾ãã Y ã³ã³ããã¼ã¿ L ã®å®ç¾©ã¯ãæ¬å½ã¯ L x y = x (y y) ã§ãã(y y)ã®é¨åãèªå·±è¨åã«ãªã£ã¦ãGHC ã§ã¯ãã®é¨åã®åããã¾ãå¦çã§ãã¾ãããããã§ãunsafeCoerce ã§åæ¨è«ããã¾ããã¦ãã¾ãã http://d.hâ¦
sethsbcolorã¨ãããã®ãã®ãã°ãã®ãªãã¬ã¼ã¿ããã£ãã®ã§ç¢ºèªç¨ã«PostScriptçãæ¸ãã¦ã¿ãã ãã£ã±ãé»è²ãç´«ã®ã¨ããã«ã¯ãã£ããã¨ç·ãè¦ããæ°ãããã %!PS-Adobe-3.0 1 1 256 { /r exch def 0 1 360 { /th exch def th 360 div r 256 div 1 sethsbcâ¦
canvasã使ã£ã¦è²ç¸ç°ãæãã¦ã¿ã http://kar.s206.xrea.com/js/colors.html è²ã®å¤åã®ãããããèªåã§èããã®ãç®çã ã£ãã®ã§ã°ã©ãã¼ã·ã§ã³ã®æã¯ä½¿ããï¼ãã¯ã»ã«ãã¤å¦çãã¦ãã ãªã®ã§ããªãéãå¦çã«ãªã£ã¦ãã®ã§æ³¨æã RGBåè²ã0ã255ã®256éâ¦
ä¸ã¤ã®å¤ãååã«æç¸ããã«è¤æ°ç®æã§ä½¿ãã£ã¦ã©ããããã ãSã³ã³ããã¼ã¿çãªãã®ãç¨æããã¦ãï¼ cube = (((*).((*)<*>id))<*>id) -- \x -> x * x * x fib = (flip(if'.(< 2))1)<*>((+).fib.(-1 +)<*>fib.(-2 +)) http://d.hatena.ne.jp/nishiohirokazuâ¦
ãã®éGaucheã§ä½ã£ãã©ã ãå¼ããã®å¤æããã°ã©ã (ã¨ãã®å¾ã®èª¿æ»)ããããã£ããã¨ã表ã«ã¾ã¨ãã¦ã¿ãã name in out memo I x x S K _ , W K , C K _ , R _ K M x x x O I , W I , W T Y x x (Y x) M2 L , U U , M2 (B M2 B) i x x S K V S K , S (O (K â¦
Schemeã®ã©ã ãå¼ã«å¯¾å¿ããã³ã³ããã¼ã¿è¡¨è¨ãæ±ããããã°ã©ã ãä½ã£ãã 使ãæ¹ lambdaãlambdaccã«ãã¦ãé常ã®lambdaã¨åãããã«å¼æ°ã¨æ¬ä½ãä¸ããã gosh> (lambdacc (x y z) (x (y z))) B gosh> (lambdacc (x y) (x (y y))) (C B M) ã½ã¼ã¹ã³ã¼ã (â¦
ããªã¢ã«ãã£ãºã ãªã âæ®éã®é¢æ° ä¾ï¼Cè¨èªç ï¼ã¤ã®å¼æ°(self)ã®åã«å¿ãã¦ããªã¢ã«ãã£ãºã âæ®éã®ãªãã¸ã§ã¯ãæåã®ã¡ã½ãã ä¾ï¼Smalltalkç å ¨ã¦ã®å¼æ°ã®åã«å¿ãã¦ããªã¢ã«ãã£ãºã âã¸ã§ããªãã¯ãã¡ã³ã¯ã·ã§ã³ ä¾ï¼CLOSç ããã«æ»ãå¤ã®åã«ãâ¦
type Combinator Prelude Monad Applicative a -> a I x = x id ask a -> b -> a K x y = x const return pure (a -> b) -> (c -> a) -> c -> b B x y z = x (y z) (.) liftM (a -> b -> c) -> b -> a -> c C x y z = x z y flip (a -> a) -> a Y x = x (Y xâ¦
åè¨èªã§è©¦ããçµæã¯ä»¥ä¸ã®ã¨ãã Erlangã®å ´å ã§ãã > case [1,1,1] of [X,X,X] -> "same"; _ -> "different" end. "same" > case [1,1,2] of [X,X,X] -> "same"; _ -> "different" end. "different" Pureã®å ´å ã§ãã > case [1,1,1] of [x,x,x] = "saâ¦
Haskellã§åºæ¥ãªãã£ããã¨ãPureã§ãªãã³ã¸ãã®2 å帰ã使ããã«Yã³ã³ããã¼ã¿ãå®ç¾©ãã 404 Blog Not Found:Y combinator is forbidden in Haskell!? ã¨ããããã£ã¡ãããã£ã¡ããã¡ããããããåºæ¥ãªãã®ã§ãã ch_y = \ f -> (\ x -> f (x x)) (\ x -â¦
Haskell風ã®ææ³ã ãã©åçåãªPureã¨ããè¨èªãçºè¦ã The Pure Programming Language Pure has a modern syntax featuring curried function applications, lexical closures and equational definitions with pattern matching, and thus is somewhat simâ¦
æ¨æ¥ã®éº»éã®å¾ ã¡ã®åé¡ãPrologã®ã³ã¼ããã»ã¼ï¼å¯¾ï¼ã§ãªã¹ãå å 表è¨ã«æ¸ãæãããããããªæ°ãããã®ã§ãã£ã¦ã¿ãã ä¾ãã°ãPrologã§ã®é åã®å¦çé¨(ï¼è¡ç®)ã¯ãHaskellã§ã¯ï¼è¡ç®ã®ããã«è¨è¿°ã§ããã¯ãã (Prolog) tenpai(Xs, [[X,Y,Z]|Ys]) :- selecâ¦
麻éã®æçãå ¥åã¨ãã¦ä¸ããããã¨ãããå¾ ã¡ããåºåããããã°ã©ã ãæ¸ãã¦ãã ããã 1122335556799 : â99âãã¢ã¿ãã®ä¸¡é¢ãâ55ââ99âã®ã·ã£ãã§ããã®ã§ã(123)(123)(555)(99)[67]ã(123)(123)(55)(567)[99]ã(123)(123)(99)(567)[55]ãæ£è§£ã§ãã httpâ¦
http://d.hatena.ne.jp/katona/20100422/p1 ãã£ã¡ã«ä¿®æ£çãæ¸ãã¾ãã 麻éã®æçãå ¥åã¨ãã¦ä¸ããããã¨ãããå¾ ã¡ããåºåããããã°ã©ã ãæ¸ãã¦ãã ããã 1122335556799 : â99âãã¢ã¿ãã®ä¸¡é¢ãâ55ââ99âã®ã·ã£ãã§ããã®ã§ã(123)(123)(555)(99)[67â¦
æ¼ç¹¹å®çï¼è±: Deduction theoremï¼ã¨ã¯ãæ°çè«çå¦ã«ããã¦ãè«çå¼ E ãã è«çå¼ F ãæ¼ç¹¹å¯è½ãªãã°ãå«æ E â F ã証æå¯è½ã§ããï¼ããªãã¡ã空éåããæ¼ç¹¹å¯è½ï¼ãã¨ãããã®ã å ¬ççå½é¡è«çã§ã¯ãå ¬çå³å¼ã¨ãã¦æ¬¡ã®ãã®ã使ãã®ãä¸è¬çã§ããâ¦