The SKI combinator calculus is a combinatory logic system and a computational system. It can be thought of as a computer programming language, though it is not convenient for writing software. Instead, it is important in the mathematical theory of algorithms because it is an extremely simple Turing complete language. It can be likened to a reduced version of the untyped lambda calculus. It was int
åãã¦ã®æ¹ã¯ãä»æ§ããµã³ãã«ã½ã¼ã¹ããèªã¿ãã ããã æ´æ°å±¥æ´ [2007/04/14] å®æ [2007/07/13] å ¬é [2011/06/19] Iã³ã³ããã¼ã¿ããã³ãIã³ã³ããã¼ã¿ãçæãã^^ã追å æ¦è¦ COSAK(Constructed from Only S And K)ã¯ãã®åã®éãã"S"ã¨"K"ã ãããæ§æãããé¢æ°å(?)è¨èªã§ãã æ§æã¨ãã¦ãsã¨kã¨ããããã使ã£ãé¢æ°é©ç¨ããç¨æãã¦ãã¾ãããé¢æ°æ½è±¡ãªãã¦ã©ãã§ãããã§ãã ãã¡ããå¤æ°ãªãã¦ããã¾ãããããã§å¤æ°ã®ã¹ã³ã¼ããã©ãã¨ããããã¨ã§æ©ãå¿ è¦ã¯ãªããªãã¾ãããã ããæ¸ãã¨ãä½ãåºæ¥ãªãããã§ãããå®ã¯ãé«éé¢æ°(ã®ãããªãã®)ã使ãããªã©ããã®è¡¨ç¾åã¯æå¤ã¨é«ãã§ãã å®ç¨çãã©ããã¯ããµã³ãã«ã½ã¼ã¹ãè¦ã¦å®éã«è©¦ãã¦ã¿ã¦èãã¦ãã ãããããã«åããã¾ã(ç¬) å ¥å: åºå: ä»æ§ æ§æï¼ fo
ã¯ã¦ãªã°ã«ã¼ãã®çµäºæ¥ã2020å¹´1æ31æ¥(é)ã«æ±ºå®ãã¾ãã 以ä¸ã®ã¨ã³ããªã®éããä»å¹´æ«ãç®å¦ã«ã¯ã¦ãªã°ã«ã¼ããçµäºäºå®ã§ããæ¨ããç¥ãããã¦ããã¾ããã 2019å¹´æ«ãç®å¦ã«ãã¯ã¦ãªã°ã«ã¼ãã®æä¾ãçµäºããäºå®ã§ã - ã¯ã¦ãªã°ã«ã¼ãæ¥è¨ ãã®ãã³ãæ£å¼ã«çµäºæ¥ã決å®ãããã¾ããã®ã§ã以ä¸ã®éãã確èªãã ããã çµäºæ¥: 2020å¹´1æ31æ¥(é) ã¨ã¯ã¹ãã¼ãå¸æç³è«æé:2020å¹´1æ31æ¥(é) çµäºæ¥ä»¥éã¯ãã¯ã¦ãªã°ã«ã¼ãã®é²è¦§ããã³æ稿ã¯è¡ãã¾ãããæ¥è¨ã®ã¨ã¯ã¹ãã¼ããå¿ è¦ãªæ¹ã¯ä»¥ä¸ã®è¨äºã«ãããã£ã¦æç¶ãããã¦ãã ããã ã¯ã¦ãªã°ã«ã¼ãã«æ稿ãããæ¥è¨ãã¼ã¿ã®ã¨ã¯ã¹ãã¼ãã«ã¤ã㦠- ã¯ã¦ãªã°ã«ã¼ãæ¥è¨ ãå©ç¨ã®ã¿ãªãã¾ã«ã¯ãè¿·æãããããããã¾ãããã©ãããããããé¡ããããã¾ãã 2020-06-25 è¿½è¨ ã¯ã¦ãªã°ã«ã¼ãæ¥è¨ã®ã¨ã¯ã¹ãã¼ããã¼ã¿ã¯2020å¹´2æ28
ãªããæè¿(*) Y Combinator(以ä¸ãä¸åç¹æ¼ç®åã)ã®è©±é¡ãåæã§ããã£ã¦ãã¾ããã ãããã話ã¯ãããã®ã®çµå±ã®ã¨ããã F(YF) = YF ã¨ããå¼ãæãç«ããããã®ââ"ä¸åç¹"ã¨ããåã®éããYFãFã®ä¸åç¹ã«ãããã®ã ã¨æãã¾ãã (ããã®èª¬æãåããããããã¨ã) ä¸åç¹æ¼ç®åèªèº«ã¯ãã以ä¸ã§ã以ä¸ã§ããªãã使ãéã次第ãã¨ã è¨å·ãæ¼ç®ãæå°éã«ããã®ãλè¨ç®ã ã£ã¦è©±ãããã£ã¦ã¾ããã åç´ã«ãããªããã£ã¨åç´ã«ã§ãã¾ãã K ⡠λxy.x S ⡠λxyz.(xz)yz ãã®äºã¤ã使ãã°é¢æ°æ½è±¡(é¢æ°ã®ä½æ)ããããã¨ãªãã é¢æ°é©ç¨(é¢æ°ã®å¼ã³åºã)ã ãã§å ¨ã¦ã表ãã¾ãã ä¾ãã°ããã£ã¼ãæ°ã® 0â¡Î»gu.u 㯠((s ((s (k s)) (k k))) (k k)) ã¨è¡¨ãã¾ããã ãã£ã¼ãæ°ã®å¾è é¢æ° sucâ¡Î»xgu.g((x
ã¯ã¦ãªã°ã«ã¼ãã®çµäºæ¥ã2020å¹´1æ31æ¥(é)ã«æ±ºå®ãã¾ãã 以ä¸ã®ã¨ã³ããªã®éããä»å¹´æ«ãç®å¦ã«ã¯ã¦ãªã°ã«ã¼ããçµäºäºå®ã§ããæ¨ããç¥ãããã¦ããã¾ããã 2019å¹´æ«ãç®å¦ã«ãã¯ã¦ãªã°ã«ã¼ãã®æä¾ãçµäºããäºå®ã§ã - ã¯ã¦ãªã°ã«ã¼ãæ¥è¨ ãã®ãã³ãæ£å¼ã«çµäºæ¥ã決å®ãããã¾ããã®ã§ã以ä¸ã®éãã確èªãã ããã çµäºæ¥: 2020å¹´1æ31æ¥(é) ã¨ã¯ã¹ãã¼ãå¸æç³è«æé:2020å¹´1æ31æ¥(é) çµäºæ¥ä»¥éã¯ãã¯ã¦ãªã°ã«ã¼ãã®é²è¦§ããã³æ稿ã¯è¡ãã¾ãããæ¥è¨ã®ã¨ã¯ã¹ãã¼ããå¿ è¦ãªæ¹ã¯ä»¥ä¸ã®è¨äºã«ãããã£ã¦æç¶ãããã¦ãã ããã ã¯ã¦ãªã°ã«ã¼ãã«æ稿ãããæ¥è¨ãã¼ã¿ã®ã¨ã¯ã¹ãã¼ãã«ã¤ã㦠- ã¯ã¦ãªã°ã«ã¼ãæ¥è¨ ãå©ç¨ã®ã¿ãªãã¾ã«ã¯ãè¿·æãããããããã¾ãããã©ãããããããé¡ããããã¾ãã 2020-06-25 è¿½è¨ ã¯ã¦ãªã°ã«ã¼ãæ¥è¨ã®ã¨ã¯ã¹ãã¼ããã¼ã¿ã¯2020å¹´2æ28
ãã®æ¥è¨ã®ã¿ã¤ãã«ã«ãªã£ã¦ããã©ã ãå¼ãλx. x K S Kãã¯ï¼ ã*1ã®ä¸ç¹åºåºãã¨å¼ã°ããã³ã³ããã¼ã¿ã§ï¼ å ¨ã¦ã®éã©ã ãå¼ã¯ãã®ã³ã³ããã¼ã¿ X = λx. x K S K ããæ§ç¯ãããã¨ãã§ããï¼ ãã®ãã¨ã¯ï¼S 㨠K ããããã X (X X) 㨠X X X ã§è¡¨ç¾ã§ãããã¨ãã確èªã§ããï¼ ãã®ãããªä¸ç¹åºåºã¯å¤æ°ç¥ããã¦ããï¼ ãã¼ã *2ã«ããä¸ç¹åºåº X = λf. f (f S (K K K I)) K *3 ãç¨ããã¨ï¼ S 㨠K ããããã X (X X) 㨠X X ã§è¡¨ããã¨ãã§ããï¼ ã¾ãï¼ãã¼ã¬ã³ãã¬ãã*4ã¯ï¼X = λf. f (f S (K K)) K ã¨ããä¸ç¹åºåºãææ¡ãã¦ããï¼ ãã® X ã«ããï¼S 㨠K ã¯ãããã X (X X X) 㨠X X X ã§è¡¨ç¾ã§ããï¼ ç¾å¨ã®ã¨ããï¼ãã©ãã«ã¼*5ã«ãã X ã³ã³ããã¼ã¿ X = λf
ã©ã³ãã³ã°
ã©ã³ãã³ã°
ã©ã³ãã³ã°
ãªãªã¼ã¹ãé害æ å ±ãªã©ã®ãµã¼ãã¹ã®ãç¥ãã
ææ°ã®äººæ°ã¨ã³ããªã¼ã®é ä¿¡
å¦çãå®è¡ä¸ã§ã
j次ã®ããã¯ãã¼ã¯
kåã®ããã¯ãã¼ã¯
lãã¨ã§èªã
eã³ã¡ã³ãä¸è¦§ãéã
oãã¼ã¸ãéã
{{#tags}}- {{label}}
{{/tags}}