F# を知ã£ã¦ã»ã—ã„
ãªã‚“ã§ã“ã‚“ãªã®ã‚’書ã„ã¦ã‚‹ã®ã‹ F# を布教1ã™ã‚‹ãŸã³ã«èª¤è§£ã‚’解ã„ãŸã‚Šã©ã“らã¸ã‚“ãŒè‰¯ã„ã®ã‹åˆ—挙ã—ãŸã‚Šã™ã‚‹ã®ç–²ã‚ŒãŸã—, URL ã ã‘投ã’ã¤ã‘ã‚Œã°æ¸ˆã‚€ã‚ˆã†ã«ã—ãŸã„ã‹ã‚‰ã§ã™. F# ã¨ã¯, ãªãœ F# ãªã®ã‹ F# ã¯æ›¸ã„ã¦ã„ã¦éžå¸¸ã«æ¥½ã—ã, ã‹ã¤ä½•ã§ã‚‚ã§ãã¦ã—ã¾ã†ã®ã§, 趣味ã®ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã®ãŠä¾›ã«ã¯éžå¸¸ã«æœ€é©ãªè¨€èªžã§ã™. ã¾ãŸãƒã‚°ã®å°‘ãªã„プãƒã‚°ãƒ©ãƒ を書ããŸã‚ã®æ©Ÿèƒ½ãŒå……実ã—ã¦ã„ã‚‹ã¨åŒæ™‚ã«, コードé‡ãŒå°‘ãªã済ã¿ãƒ¡ãƒ³ãƒ†ãƒŠãƒ³ã‚¹ã—ã‚„ã™ã„è¨è¨ˆã«ãªã£ã¦ã„ã‚‹ã®ã§, 実行速度ã®é€Ÿã•ã¨ç›¸ã¾ã£ã¦, 金èžç³»ä¼æ¥ã‚„ç ”ç©¶æ©Ÿé–¢ã‚’ä¸å¿ƒã«, 機械å¦ç¿’ç ”ç©¶è€…ã‚„ãƒ¢ãƒã‚¤ãƒ«ã‚¢ãƒ—リ開発者ãªã©ã«ã‚‚高ã評価ã•ã‚Œã¦ã„ã¾ã™. 1. 色々ãªè¨€èªžã®ã„ã„ã¨ã“å–ã‚Š F# 㯠OCaml ã¨ã„ã†è¨€èªžã‚’ベースã«é–‹ç™ºã•ã‚ŒãŸ2プãƒã‚°ãƒ©ãƒŸãƒ³ã‚°è¨€èªžã§, C# ã®é€Ÿåº¦ãƒ»ã‚¯ãƒã‚¹ãƒ—ラットフォーム性・ライブラリã®å¤šã•ãƒ»é–‹ç™ºç’°å¢ƒ Rust ã®ãƒ„ールãƒã‚§ã‚¤ãƒ³ Go ã®ãƒ‡ãƒ—ãƒ
Y combinator - Rosetta Code
Y combinator You are encouraged to solve this task according to the task description, using any language you may know. In strict functional programming and the lambda calculus, functions (lambda expressions) don't have state and are only allowed to refer to arguments of enclosing functions. This rules out the usual definition of a recursive function wherein a function is associated with the state
Resource Polymorphism
We present a resource-management model for ML-style programming languages, designed to be compatible with the OCaml philosophy and runtime model. This is a proposal to extend the OCaml language with destructors, move semantics, and resource polymorphism, to improve its safety, efficiency, interoperability, and expressiveness. It builds on the ownership-and-borrowing models of systems programming l
金èžã¨ OCaml - camlspotter’s blog
関数型言語ã¨ã„ã†ã¨é‡‘èžã§æµè¡Œã£ã¦ã„ã‚‹ã€ç‰¹ã«ã€€OCaml ã¨è¨€ãˆã°é‡‘èžå¾¡ç”¨é”関数型言語ã¨ã—ã¦èªžã‚‰ã‚Œã‚‹ã“ã¨ã‚‚多ã„。金èžæ¥ç•Œã«é–¢æ•°åž‹è¨€èªžã‚’æŒã¡è¾¼ã¿æˆåŠŸã—ãŸæœ€åˆã®äºŒç¤¾ LexiFi ã¨Jane Street Capital ã¯å…±ã« OCaml を採用ã—ã€ãã—ã¦äºŒç¤¾ã¨ã‚‚今日æˆåŠŸã—ã¦ã„ã‚‹ã‹ã‚‰ã 。 今回ã¯ãã®ã†ã¡ LexiFi ã«ã¤ã„ã¦è©±ã—ãŸã„。ç§ãŒ Ph.D ã‚’å–ã£ãŸå¾Œã€ä¸€å¹´é–“ã€ç”£æ¥ãƒã‚¹ãƒ‰ã‚¯ã¨ã—ã¦ãŠä¸–話ã«ãªã£ãŸä¼šç¤¾ã§ã‚る。 金èžæ´¾ç”Ÿå•†å“(デリヴァティブ)ã¯æ§˜ã€…ãªæ—¥æ™‚ã‚„æ¡ä»¶ã€ä¾å˜ã™ã‚‹åˆ¥ã®å•†å“ä¾¡æ ¼ã«ã‚ˆã£ã¦ä¾¡å€¤ãŒå¤‰åŒ–ã™ã‚‹ã€‚デリヴァティブã¯å…ˆç‰©ã‚„オプションãªã©ã®ã‚ˆã†ãªä¸€èˆ¬å¸‚å ´ã§ã‚‚æµé€šã—ã¦ã„ã‚‹ç°¡å˜ãªæ´¾ç”Ÿå•†å“ã ã‘ã§ãªãã€ä¼šç¤¾é–“ã§ã ã‘ã§å–引ã•ã‚Œã‚‹éžå¸¸ã«è¤‡é›‘ãªç‰©ã‚‚ã‚る。ã“れらã®å•†å“ã«ã¯ãã‚Œãžã‚Œæ¥ç•Œå†…ã§é€šç”¨ã™ã‚‹åå‰ãŒä»˜ã‘られå–引ã€è©•ä¾¡ã€ç®¡ç†ãŒè¡Œã‚ã‚Œã¦ããŸã€‚ãã—ã¦ã“れらを扱ã†ãƒ—ãƒã‚°ãƒ©ãƒ ã‚‚ã¾ãŸã€ãã‚Œãžã‚Œã®å•†å“ã”ã¨ã«åˆ¥å€‹ã®æ©Ÿ
1
ランã‚ング
ランã‚ング
ランã‚ング
リリースã€éšœå®³æƒ…å ±ãªã©ã®ã‚µãƒ¼ãƒ“スã®ãŠçŸ¥ã‚‰ã›
最新ã®äººæ°—エントリーã®é…ä¿¡
j次ã®ãƒ–ックマーク
kå‰ã®ãƒ–ックマーク
lã‚ã¨ã§èªã‚€
eコメント一覧を開ã
oページを開ã
OCaml Programming: Correct + Efficient + Beautiful — OCaml Programming: Correct + Efficient + Beautiful
{{#tags}}- {{label}}
{{/tags}}