SKI combinator calculus - Wikipedia
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
FLOPSã‹ã‚‰å¸°å®… - sumiiã®ãƒ–ãƒã‚°
ã—ã¾ã—ãŸã€‚å ±å‘Šã¯æš‡ãªã¨ãã«å°‘ã—ãšã¤è¿½è¨˜ã—ã¾ã™ï¼ˆã‚¢ãƒ³ãƒ†ãƒŠã—ã¥ã‚‰ã„？）。ã“ã†ã„ã†å¦ä¼šã«ã—ã¦ã¯ã€Œç†è«–ã€ã‚ˆã‚Šã€Œå¿œç”¨ã€ã£ã½ã„話ãŒå¤šã‹ã£ãŸã‹ã‚‚。「Haskellã§â€¦ã¨ã„ã†ãƒ©ã‚¤ãƒ–ラリを作りã¾ã—ãŸã€ã¿ãŸã„ãªã€‚ http://nicosia.is.s.u-tokyo.ac.jp/FLOPS2006/program.html 以下ã¯ç™ºè¡¨ã‚’抜粋ã—ã¦å ±å‘Šã€‚è«–æ–‡ã¯ã€ã‚¿ã‚¤ãƒˆãƒ«ã‚„著者ã®åå‰ã§æ¤œç´¢ã™ã‚Œã°ã€å¤§æŠµã¯Webã«ã‚ã‚‹ã¨æ€ã„ã¾ã™ã€‚ Guy Steeleã®invited talk JavaãŒC++を改良ã—ãŸï¼ˆã“ã¨ã«ãªã£ã¦ã„る）ã¿ãŸã„ã«Fortranを改良ã—よã†ï¼ã¨ã„ã†è©±ã€‚FLOPSã®invited talkã ã‹ã‚‰ã¨ã„ã†éƒ¨åˆ†ã‚‚ã‚ã‚‹ã ã‚ã†ã‘ã©ã€ã‚„ã£ã±ã‚ŠGuy Steeleã¯Schemeã¨ã„ã†ã‹é–¢æ•°åž‹è¨€èªžãƒ©ãƒ–ラブらã—ãã€ã„ã‹ã«ã“ã£ãã‚Šã¨é–¢æ•°åž‹è¨€èªžã®æ©Ÿèƒ½ã‚’å°Žå…¥ã™ã‚‹ã‹ã€ã¨ã„ã†è©±ã‚‚。折角ãªã®ã§WadlerãŸã¡ã¨ä¸€ç·’ã«ï¼’時間ãらã„ç«‹
関数型言語マニアã®ãŸã‚ã®è«–文紹介６：定ç†è¨¼æ˜Žå™¨ã§æ›¸ã‹ã‚ŒãŸCコンパイラ - sumiiã®ãƒ–ãƒã‚°
Formal certification of a compiler back-end, or: programming a compiler with a proof assistant. Xavier Leroy. POPL 2006. http://pauillac.inria.fr/~xleroy/publi/compiler-certif.pdf ソースコードã¨ã‹ã€‚ http://pauillac.inria.fr/~xleroy/compcert-backend/ 著者ã®Xavier Leroyã¯OCamlã®ä½œè€…ã§ã™ã€‚ （ãƒã‚¤ãƒ†ã‚£ãƒ–コードをåã）コンパイラを作ã£ãŸã“ã¨ãŒã‚る人ãªã‚‰ã€ã”ã稀ã«ã—ã‹èµ·ããªã„ã€ã‚ã‘ã®ã‚ã‹ã‚‰ãªã„ãƒã‚°ã«æ‚©ã¾ã•ã‚ŒãŸã“ã¨ãŒãã£ã¨ã‚ã‚‹ã¨æ€ã„ã¾ã™ã€‚ãã†ã„ã†ãƒã‚°ãŒã‚ã‚‹ã¨ã€ã‚³ãƒ³ãƒ‘イラを作る人ã©ã“ã‚ã‹ã€ãれを使ã†ãƒ—ãƒã‚°ãƒ©ãƒžã‚‚æ‚©ã¾ã•ã‚Œã¾ã™ã€‚ã“ã‚Œã¯MLã®ã‚ˆã†ãªåž‹ã¤ã言語ã§ã‚³
å·o・-・）＜2nd life - Haskell ã®æ—¥æœ¬èªžãƒªãƒ•ã‚¡ãƒ¬ãƒ³ã‚¹ãƒžãƒ‹ãƒ¥ã‚¢ãƒ«å¼•ãツール href
http://i.loveruby.net/w/href.html 入門Haskellã‚„YAPC::Asia ã® Audrey ã®ã‚»ãƒƒã‚·ãƒ§ãƒ³ã€Learning Haskell㧠LL 界隈ã§ã‚‚熱ããªã‚Šå§‹ã‚㟠Haskell。ã‹ãã„ã†è‡ªåˆ†ã‚‚å°‘ã—ã¥ã¤å‹‰å¼·ä¸ã§ã™ã€‚ ã§ã€æœ€åˆå‹‰å¼·ã™ã‚‹ã®ã«å¿…至ãªãƒ‰ã‚ュメントã®ä¸€ã¤ãŒãƒªãƒ•ã‚¡ãƒ¬ãƒ³ã‚¹ãƒžãƒ‹ãƒ¥ã‚¢ãƒ«ã§ã™ã€‚href ã¯ã‚³ãƒžãƒ³ãƒ‰ãƒ©ã‚¤ãƒ³ã‹ã‚‰æ—¥æœ¬èªžã®ãƒªãƒ•ã‚¡ãƒ¬ãƒ³ã‚¹ã‚’引ãã“ã¨ãŒã§ãる便利ツール。用例も載ã£ã¦ã‚‹ã®ã‚‚ã‚ã‚ŠãŒãŸã„ã§ã™ã。使用方法ã¯ç°¡å˜( ReFe ã¨åŒã˜ )㧠href コマンドã®å¼•æ•°ã«èª¿ã¹ãŸã„関数を書ã„ã¦å®Ÿè¡Œã™ã‚‹ã ã‘ï¼ $ href reverse Data.List.reverse reverse :: [a] -> [a] PRELUDE reverse xs リスト xs ã‚’é€†é †ã«ã—ãŸãƒªã‚¹ãƒˆã‚’è¿”ã™ã€‚ reverse [1,2,3] = [3,2,1] re
ãªãœé–¢æ•°ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã¯é‡è¦ã‹
John Hughes, Institutionen för Datavetenskap, Chalmers Tekniska Högskola, 41296 Göteborg, SWEDEN. [email protected] ã“ã®æ—¥æœ¬èªžè¨³ã¯åŽŸè‘—者ã®æ‰¿è«¾ã‚’å¾—ã¦å±±ä¸‹ãŒã“ã“ã«å…¬é–‹ã™ã‚‹ã‚‚ã®ã§ã™ã€‚ ã“ã®è¨³æ–‡ã«ã¤ã„ã¦ã®ã€å¾¡æŒ‡æ‘˜ãªã©ã¯å±±ä¸‹ä¼¸å¤«(nobsun .at. sampou.org)ã¾ã§ãŠããŒã„ ã„ãŸã—ã¾ã™ã€‚ 翻訳最終更新日 : 2011-09-17 原文 "Why Functional Programming Matters" 日本語訳PostScript ã“ã®è«–æ–‡ã¯1984年以æ¥ä½•å¹´ã‚‚ã®ã‚ã„ã Chalmers大å¦ã®ãƒ¡ãƒ¢ã¨ã—ã¦å›žè¦§ã•ã‚ŒãŸã€‚ 1989å¹´ã¨1990å¹´ã«å¹¾åˆ†ã‹æ”¹è¨‚ã‚’ã—ãŸã®ãŒ[Hug89]㨠[Hug90]ã§ã‚る。ã“ã®ç‰ˆã¯ã‚‚ã¨ã®Chalmer大å¦ã®ãƒ¡ãƒ¢ ã®nroff原稿をもã¨ã«
1
リリースã€éšœå®³æƒ…å ±ãªã©ã®ã‚µãƒ¼ãƒ“スã®ãŠçŸ¥ã‚‰ã›
最新ã®äººæ°—エントリーã®é…ä¿¡
j次ã®ãƒ–ックマーク
kå‰ã®ãƒ–ックマーク
lã‚ã¨ã§èªã‚€
eコメント一覧を開ã
oページを開ã
{{#tags}}- {{label}}
{{/tags}}