[B! ocaml] jjzakã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯

jjzak id:jjzak

ocamlã«é–¢ã™ã‚‹jjzakã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯ (50)

${{author_name}}$

{{{comment_expanded}}}

{{label}}

{{#is_bookmark}}ãƒªã‚¹ãƒˆ{{/is_bookmark}}{{^is_bookmark}}ãƒªãƒ³ã‚¯{{/is_bookmark}}

${{author_name}}$
{{author_name}}{{created}}
{{ #comment }}{{ comment }}{{ /comment }}
- {{ label }}

${{author_name}}$

{{{comment_expanded}}}

{{label}}

{{#is_bookmark}}ãƒªã‚¹ãƒˆ{{/is_bookmark}}{{^is_bookmark}}ãƒªãƒ³ã‚¯{{/is_bookmark}}

Jacques Garrigue ã®è¬›ç¾©æƒ…å ±
ã‚ªãƒ•ã‚£ã‚¹ã‚¢ãƒ¯ãƒ¼ (2025å¹´ç§‹å¦æœŸ) å ´æ‰€ï¼šå¤šå…ƒæ•°ç†ç§‘å¦ç ”ç©¶æ£Ÿ 405å·å®¤ã€€æ—¥æ™‚ï¼šæœˆæ›œæ—¥ 11æ™‚ã€œ12æ™‚ ã‚»ãƒŸãƒŠãƒ¼ å°‘äººæ•°ã‚¯ãƒ©ã‚¹ å’æ¥ç ”ç©¶ 2025å¹´åº¦ è¨ˆç®—æ©Ÿæ•°å¦åŸºç¤Ž æ•°å¦é€šè«–II Perspectives in Mathematical Sciences III/I (Spring 2025) 2024å¹´åº¦ 2024å¹´åº¦ç§‹ãƒ»æ•°ç†è§£æžãƒ»è¨ˆç®—æ©Ÿæ•°å¦I 2024å¹´åº¦å‰æœŸãƒ»æ±åŒ—å¤§å¦é›†ä¸è¬›ç¾© 2024å¹´åº¦æ˜¥ãƒ»æ•°ç†è§£æžãƒ»è¨ˆç®—æ©Ÿæ•°å¦IV 2023å¹´åº¦ 2023å¹´åº¦ç§‹ãƒ»æ•°å¦å±•æœ›II Perspectives in Mathematical Sciences IV/II (Fall 2023) 2023å¹´åº¦æ˜¥ãƒ»æ•°ç†è§£æžãƒ»è¨ˆç®—æ©Ÿæ•°å¦III 2022å¹´åº¦ 2022å¹´åº¦ç§‹ãƒ»Affeldtæ°é›†ä¸è¬› ç¾© 2021å¹´åº¦ 2021å¹´åº¦ç§‹ãƒ»æ•°ç†è§£æžãƒ»è¨ˆç®—æ©Ÿæ•°å¦IV 2021å¹´åº¦å‰æœŸãƒ»ä¹å·žå¤§å¦é›†ä¸è¬›ç¾© 2020å¹´åº¦ 20
jjzak 2011/02/20
ocaml

math

study

programming
ãƒªãƒ³ã‚¯
betflix6789 à¸¨à¸¹à¸™à¸¢à¹Œà¸£à¸§à¸¡à¸à¸²à¸£à¹€à¸”à¸´à¸™à¸žà¸±à¸™à¸à¸à¸™à¹„à¸¥à¸™à¹Œ à¹€à¸à¸¡à¸ªà¹Œà¸ªà¸¥à¹‡à¸à¸•à¸„à¸£à¸šà¸§à¸‡à¸ˆà¸£
à¹€à¸§à¹‡à¸šà¹„à¸‹à¸•à¹Œà¸ªà¸¥à¹‡à¸à¸• betflix6789 à¸„à¸²à¸ªà¸´à¹‚à¸™à¸à¸à¸™à¹„à¸¥à¸™à¹Œ à¹€à¸£à¸²à¸„à¸·à¸à¸œà¸¹à¹‰à¹ƒà¸«à¹‰à¸šà¸£à¸´à¸à¸²à¸£à¸„à¸²à¸ªà¸´à¹‚à¸™à¸à¸à¸™à¹„à¸¥à¸™à¹Œà¸£à¸²à¸¢à¹ƒà¸«à¸à¹ˆà¸—à¸µà¹ˆà¸ªà¸¸à¸” UFABET à¸£à¸§à¸šà¸£à¸§à¸¡à¹€à¸§à¹‡à¸šà¹„à¸‹à¸•à¹Œà¸—à¸±à¹‰à¸‡à¹„à¸—à¸¢à¹à¸¥à¸°à¸•à¹ˆà¸²à¸‡à¸›à¸£à¸°à¹€à¸—à¸¨à¹„à¸§à¹‰à¹ƒà¸™à¸—à¸µà¹ˆà¹€à¸”à¸µà¸¢à¸§ BETFLIK.BET à¹à¸•à¹ˆà¸¥à¸°à¹€à¸§à¹‡à¸šà¹„à¸‹à¸•à¹Œà¹„à¸”à¹‰à¸£à¸±à¸šà¸à¸²à¸£à¸•à¸£à¸§à¸ˆà¸ªà¸à¸šà¹‚à¸”à¸¢à¸£à¸°à¸šà¸šà¸à¸²à¸£à¸ˆà¸±à¸”à¸à¸±à¸™à¸”à¸±à¸šà¸¡à¸²à¸•à¸£à¸à¸²à¸™ à¸£à¸°à¸šà¸šà¸—à¸µà¹ˆà¹€à¸‚à¹‰à¸²à¹ƒà¸ˆà¸‡à¹ˆà¸²à¸¢ à¹ƒà¸Šà¹‰à¹„à¸”à¹‰à¸à¸±à¸šà¸œà¸¹à¹‰à¸Šà¸²à¸¢à¸—à¸¸à¸à¸„à¸™ à¹à¸¥à¸°à¸—à¸¸à¸à¸§à¸±à¸¢ à¸£à¸à¸‡à¸£à¸±à¸šà¸—à¸¸à¸à¹€à¸à¸¡à¸„à¸à¸¡à¸žà¸´à¸§à¹€à¸•à¸à¸£à¹Œ à¸”à¹‰à¸§à¸¢à¸£à¸°à¸šà¸šà¸¡à¸·à¸à¸–à¸·à¸à¸—à¸±à¹‰à¸‡à¸«à¸¡à¸” à¸¡à¸µà¹€à¸à¸¡à¸—à¸µà¹ˆà¸¡à¸µà¹€à¸à¸à¸¥à¸±à¸à¸©à¸“à¹Œà¸¡à¸²à¸à¸¡à¸²à¸¢ à¹€à¸Šà¹ˆà¸™ SAgame, SAgaming, Sexy Baccarat, Pretty Gaming, AG Gaming, PGSLOT
jjzak 2011/02/20
compiler

flash

ocaml

actionscript

scheme

programming
ãƒªãƒ³ã‚¯
çµŒé¨“15å¹´ã®OCaml ãƒ¦ãƒ¼ã‚¶ãƒ¼ãŒ Haskell ã‚’ä»•äº‹ã§åŠå¹´ä½¿ã£ã¦ã¿ãŸ - camlspotterâ€™s blog
ä»Šã®ä¼šç¤¾ã«ç§»ã£ã¦åŠå¹´çµŒã¡ã¾ã—ãŸã€‚ã‚ã§ãŸãè©¦ç”¨æœŸé–“çµ‚äº†ã§ã™ã€‚ã¨ã„ã£ã¦ã‚‚åˆ¥ã«è©¦ç”¨æœŸé–“ä¸ã«å¯†ã‹ã«é¦–ã‚’åˆ‡ã‚‰ã‚Œã‚‹ã‚ˆã†ãªäº‹ã‚’ã—ãŸã¨ã‹ã€é€†ã«è©¦ç”¨æœŸé–“ãŒçµ‚ã‚ã£ãŸã‹ã‚‰ã¨è¨€ã£ã¦ã“ã‚Œã§å®šå¹´ã¾ã§ã®ã†ã®ã†ã¨åƒã‘ã‚‹ã€ã¨ã„ã†è¨³ã§ã¯ã‚ã‚Šã¾ã›ã‚“ã€‚æœªæ¥ã¯å…¨ãåˆ¤ã‚Šã¾ã›ã‚“ã€‚ã¾ã‚ã¨ã«ã‹ãã€ä¸€ã¤åŒºåˆ‡ã‚ŠãŒã‚„ã£ã¦ãã¾ã—ãŸã€‚ é‡‘èžã‚’çŸ¥ã‚‰ãªã„Quantsã®ä»•äº‹ ç§ã®è·æ¥ã®è‚©æ›¸ãã«ã¯ Quantitatitatitatitative ã¨ã„ã†å˜èªžãŒãã£ã¤ã„ã¦è¶…ã‚«ãƒƒã‚³ã‚ˆã•ãã†ã€‚æ™®é€šã¯ Quant ã¨ã„ã†ã¨ã€é‡‘èžå·¥å¦ã‚„çµ±è¨ˆæ•°ç†ã«è©³ã—ã„å¤œã‚‚ãƒ–ã‚¤ãƒ–ã‚¤ã„ã‚ã—ã¦ã„ã‚‹è¶…ã‚¤ã‚±ãƒ¡ãƒ³20ä»£ã‚’æƒ³åƒã—ã¾ã™ãŒã€ç§ã¯é‡‘èžã¨ã‹å…¨ç„¶çŸ¥ã‚‰ãªã„ã‚¢ãƒ©ãƒ•ã‚©ãƒ¼ãŠçˆ¶ã•ã‚“ã§ã™ã€‚ãã‚Œã§ã‚‚ Quant ã§ã™ã€‚ãŠé¡˜ã„ã§ã™ã‹ã‚‰ã€ç§ã«ä½•ã‚’è²·ã£ãŸã‚‰ã„ã„ã‹ã¨ã‹ã€èžã‹ãªã„ã§ãã ã•ã„ã€‚é‡‘èžå•†å“ã¨ã‹è²·ã£ãŸäº‹ãªã„ã—ã€‚ã¨ã„ã†ã‹ã€é€†ã«æ•™ãˆã¦æ¬²ã—ã„ã§ã™ã€‚ ç§ã®ãƒãƒ¼ãƒ ã¯ã€æœ¬å½“ã® Quant ã•ã‚“é”ãŒé–‹ç™ºã—ãŸã€é‡‘èžæ´¾ç”Ÿå•†
jjzak 2011/02/20
column

haskell

ocaml

programming
ãƒªãƒ³ã‚¯
diaspar journal
No posts. No posts. Home Subscribe to: Comments (Atom)
jjzak 2011/02/20
functional

lisp

ocaml

haskell
ãƒªãƒ³ã‚¯
ã‚µãƒ¼ãƒ“ã‚¹çµ‚äº†ã®ãŠçŸ¥ã‚‰ã›
ã‚µãƒ¼ãƒ“ã‚¹çµ‚äº†ã®ãŠçŸ¥ã‚‰ã› ã„ã¤ã‚‚Yahoo! JAPANã®ã‚µãƒ¼ãƒ“ã‚¹ã‚’ã”åˆ©ç”¨ã„ãŸã ãèª ã«ã‚ã‚ŠãŒã¨ã†ã”ã–ã„ã¾ã™ã€‚ ãŠå®¢æ§˜ãŒã‚¢ã‚¯ã‚»ã‚¹ã•ã‚ŒãŸã‚µãƒ¼ãƒ“ã‚¹ã¯æœ¬æ—¥ã¾ã§ã«ã‚µãƒ¼ãƒ“ã‚¹ã‚’çµ‚äº†ã„ãŸã—ã¾ã—ãŸã€‚ ä»Šå¾Œã¨ã‚‚Yahoo! JAPANã®ã‚µãƒ¼ãƒ“ã‚¹ã‚’ã”æ„›é¡§ãã ã•ã„ã¾ã™ã‚ˆã†ã€ã‚ˆã‚ã—ããŠé¡˜ã„ã„ãŸã—ã¾ã™ã€‚
jjzak 2010/08/24
programming

functional

ocaml

tutorial
ãƒªãƒ³ã‚¯
osiireâ€™s blog
å”çªã«lock-freeã‚’Alloyã§æ›¸ã„ã¦ã¿ãŸããªã£ãŸã®ã§æ›¸ã„ãŸã€‚ what is lock-free å†¬ã®Lock freeç¥ã‚Š safe from Kumazaki Hiroki www.slideshare.net kumagiã•ã‚“ã®è³‡æ–™ã«ã‚ˆã‚‹ã¨ã€lock-free stackã¯ãƒªãƒ³ã‚¯ãƒªã‚¹ãƒˆã¿ãŸã„ãªã‚‚ã®ã§ã€å…ˆé ã¸ã®ãƒã‚¤ãƒ³ã‚¿ã‚’CAS(Compare and Swap)ã§åˆ‡ã‚Šæ›¿ãˆã‚‹ã‚‰ã—ã„ã€‚ ç´ ç›´ã«AlloyåŒ–ã™ã‚‹ã¨ã“ã†ãªã‚‹ã€‚ sig Data {} // linked elements of stack. sig StackElem { data:Data , next:lone StackElem // edge dosen't have next element. } { no next & this // prevent self pointing. } sig HeadPoin
jjzak 2010/08/24
ocaml

blog

programming
ãƒªãƒ³ã‚¯
2006å¹´åº¦å¾ŒæœŸãƒ»æ•°ç†è§£æžãƒ»è¨ˆç®—æ©Ÿæ•°å¦ III
ãƒ¬ãƒãƒ¼ãƒˆèª²é¡Œ ãƒ¬ãƒãƒ¼ãƒˆèª²é¡Œ æå‡ºæœŸé™ 2006å¹´2æœˆ6æ—¥(ç«) (M2ã¯1æœˆ30æ—¥(ç«)) è¬›ç¾©äºˆå®š ã‚·ãƒ©ãƒã‚¹ ç¬¬1å›ž 10æœˆ4æ—¥ å‡ºå¸16äºº Objective Camlãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã®åŸºç¤Ž: å®šç¾©ã¨åž‹ è¬›ç¾©ãƒ¡ãƒ¢ è³‡æ–™ Emacsã§OCamlã‚’ä½¿ã† ç¬¬2å›ž 10æœˆ11æ—¥ å‡ºå¸12äºº å¤šç›¸åž‹ã¨æ±Žé–¢æ•° é–¢æ•°ã‚°ãƒ©ãƒ•ã®æç”» é–¢æ•°æç”»ãƒ©ã‚¤ãƒ–ãƒ©ãƒªãƒ¼ plot.ml plot.mli ç¬¬3å›ž 10æœˆ18æ—¥ å‡ºå¸12äºº å†å¸°é–¢æ•° ç¬¬4å›ž 10æœˆ25æ—¥ å‡ºå¸12äºº å†å¸°ãƒ‡ãƒ¼ã‚¿åž‹ ç¬¬5å›ž 11æœˆ1æ—¥ å‡ºå¸12äºº æœ‰é™ã‚ªãƒ¼ãƒˆãƒžãƒˆãƒ³ã¨èªžå¥è§£æž è¬›ç¾©ãƒ¡ãƒ¢ ç¬¬6å›ž 11æœˆ15æ—¥ å‡ºå¸9äºº ã‚¹ãƒˆãƒªãƒ¼ãƒ ãƒ»ãƒ‘ãƒ¼ã‚¶ã¨æ§‹æ–‡è§£æž è¿½åŠ è³‡æ–™ ç¬¬7å›ž 11æœˆ22æ—¥ å‡ºå¸10äºº ã‚¹ãƒˆãƒªãƒ¼ãƒ ãƒ»ãƒ‘ãƒ¼ã‚¶ã¨æ§‹æ–‡è§£æž ç¬¬8å›ž 11æœˆ29æ—¥ å‡ºå¸7äºº ã‚°ãƒ©ãƒ•ã‚£ãƒƒã‚¯ã‚¹ã¨GUI è¬›ç¾©ãƒ¡ãƒ¢ ç¬¬9å›ž 12æœˆ6æ—¥ å‡ºå¸8äºº æŠ½è±¡åŒ– è¬›ç¾©ãƒ¡ãƒ¢ ç¬¬10å›ž 1
jjzak 2010/08/24
ocaml

programming

tutorial
ãƒªãƒ³ã‚¯
ãƒ¡ãƒˆãƒãƒãƒƒãƒˆãƒ¯ãƒ¼ã‚¯æœ€çŸè·¯å•é¡Œ (Mathematica) by Inquisitor
ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã®å…¥é–€ã«é©ã—ãŸè¨€èªžã¯ä½•ã‹ã¨ã„ã†å•ã„ã«å”¯ä¸€ã®å…·ä½“çš„ãªç”ãˆã¨ã„ã†ã‚‚ã®ã¯ã‚ã‚Šã¾ã›ã‚“ã€‚å¤šãã®å¤§å¦ã§ã¯Cè¨€èªžã‚’ä½¿ã£ã¦ã„ã‚‹ã§ã—ã‚‡ã†ã€‚MITã®ã‚ˆã†ã«é–¢æ•°åž‹è¨€èªžã‚’ä½¿ã†ä¾‹ã‚‚ã‚ã‚Šã¾ã™ï¼ˆãã®æ•™ç§‘æ›¸SICPï¼‰ã€‚åŸºæœ¬çš„ã«ã¯ãªã‚“ã§ã‚‚ã„ã„ã¨ç§ã¯æ€ã„ã¾ã™ã€‚ã‚ªãƒ–ã‚¸ã‚§ã‚¯ãƒˆæŒ‡å‘ã§ã—ã‹æ›¸ã‘ãªã„ã‚ˆã†ãªè¨€èªžã¯ã€æ€è€ƒã‚’åˆ¶é™ã—ã¦ã—ã¾ã†å±é™ºãŒã‚ã‚‹ã®ã§ã¡ã‚‡ã£ã¨èºŠèº‡ã—ã¾ã™ãŒã€å–ã‚Šè¿”ã—ãŒã¤ã‹ãªã„ã¨ã„ã†ã»ã©ã§ã¯ãªã„ã§ã—ã‚‡ã†ã€‚ é–¢æ•°åž‹ã§å…¥é–€ã—ãŸã„ï¼ˆã•ã›ãŸã„ï¼‰ã‘ã‚Œã©ã€SICPã¯æœ¬æ ¼çš„ã™ãŽã‚‹ã¨ã„ã†å‘ãã«ã¯ã€æµ…äº•å¥ä¸€ã€Žãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã®åŸºç¤Žã€ï¼ˆã‚µã‚¤ã‚¨ãƒ³ã‚¹ç¤¾, 2007ï¼‰ãŒã„ã„ã‹ã‚‚ã—ã‚Œã¾ã›ã‚“ã€‚ä½¿ç”¨è¨€èªžã¯é–¢æ•°åž‹è¨€èªžOCamlã§ã™ãŒã€ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°è¨€èªžã§ã¯ãªããƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã‚’å¦ã¹ã‚‹ã‚ˆã†ã«æ›¸ã‹ã‚Œã¦ã„ã¾ã™ã€‚ ã§ã‚‚ã€ã¡ã‚‡ã£ã¨å¼•ã£ã‹ã‹ã‚‹ã¨ã“ã‚ãŒã‚ã£ãŸã®ã§ã€ãã®ã“ã¨ã«ã¤ã„ã¦æ›¸ã„ã¦ãŠãã¾ã™ã€‚ ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°è¨€èªžã«ã¤ã„ã¦å¦ã¶ã®ã§ã‚ã‚Œã°ã€Javaãªã©ã®ã‚ªãƒ–ã‚¸ã‚§ã‚¯ãƒˆ
jjzak 2010/08/24
ocaml

algorithm

programming
ãƒªãƒ³ã‚¯
è¿·è·¯ã®è©¦é¨“å•é¡Œã‚’è§£ã„ã¦ã¿ãŸ - ã«ã‚ã¨ã‚Šå°å±‹ã§ã®ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°
å‚è€ƒï¼šäººæç²å¾—ä½œæˆ¦ãƒ»ï¼” è©¦é¨“å•é¡Œã»ã‹: äººç”Ÿã‚’æ›¸ãæ›ãˆã‚‹è€…ã™ã‚‰ã„ãŸã€‚ Lv4ã«è©•ä¾¡ã•ã‚Œã‚‹ãŸã‚ã«ã¯ã€æœ€çŸæ€§ã®å®Œå…¨ãªãƒã‚§ãƒƒã‚¯ãŒå¿…è¦ã ã£ãŸã®ã§Coqã§è¨¼æ˜Žã—ã¦ã¿ãŸã€‚ ã¾ãšã€accessiblesã¨ã„ã†é–¢æ•°ã‚’å®šç¾©ã—ã€ä»¥ä¸‹ã®æ€§è³ªã‚’è¨¼æ˜Žã—ãŸã€‚ ã“ã“ã§plengthã¯ãƒ‘ã‚¹ã®é•·ã•ã‚’è¨ˆã‚‹é–¢æ•°ã§ã€Path x pã¯pãŒxã‚’èµ·ç‚¹ã¨ã—ãŸãƒ‘ã‚¹ã§ã‚ã‚‹ã¨ã„ã†è¿°èªžã€‚endofã¯ãƒ‘ã‚¹ã®çµ‚ç‚¹ã‚’æ±‚ã‚ã‚‹é–¢æ•°ã€‚ Fixpoint accessibles (start : node) (len : nat) : list path := match len with | O => (PUnit start) :: nil | S n' => div_equiv path_equiv_dec @@ (flat_map expand @@ accessibles start n') end. ã“ã®é–¢æ•°ã¯startã‹ã‚‰å§‹ã¾ã£ã¦lenã®é•·ã•
jjzak 2010/08/24
algorithm

ocaml
ãƒªãƒ³ã‚¯
kamonama@Blogger
defclass ã® slot ã«ã¯ã€:type ã‚ªãƒ—ã‚·ãƒ§ãƒ³ã‚’æŒ‡å®šã™ã‚‹ã“ã¨ãŒã§ãã‚‹ã€‚ æœŸå¾…ã¨ã—ã¦ã¯ã€:type ã‚ªãƒ—ã‚·ãƒ§ãƒ³ã‚’æŒ‡å®šã—ãŸå ´åˆã€æŒ‡å®šã—ãŸåž‹ã‚’æº€ãŸã•ãªã„å€¤ã‚’ä»£å…¥ã—ã‚ˆã†ã¨ã™ã‚‹ã¨ã€ã‚¨ãƒ©ãƒ¼ã¨ãªã£ã¦æ¬²ã—ã„ã€‚ã¨ã“ã‚ãŒã€SBCL ã§ã¯ãã®ã‚ˆã†ã«ãªã‚‰ãªã„ã€‚ (defclass foo () ((x :accessor foo-x :initarg :x :type integer))) (let ((x (make-instance 'foo :x 1))) (setf (foo-x x) :foo) (foo-x x)) ; => :foo defclass ã¨ slot ã¸ã®ã‚¢ã‚¯ã‚»ã‚¹ã‚’ optimize safety ã§è©•ä¾¡ã™ã‚‹ã¨ã€æœŸå¾…ã™ã‚‹æŒ™å‹•ã¨ãªã‚‹ã€‚ (locally (declare (optimize safety)) (defclass foo () ((x :accessor fo
jjzak 2010/08/24
blog

simulation

ocaml

programming
ãƒªãƒ³ã‚¯
XML ã‚’ãªã‚“ã¨ãªã OCaml ã®ãƒ‡ãƒ¼ã‚¿ã«è½ã¨ã™ãŠæ‰‹è»½ãªæ–¹æ³•ã‚’ãŠæ‰‹è»½ã«è§£èª¬ã™ã‚‹ - camlspotterâ€™s blog
ã†ã‚“ã€ä½•ã‹ã¡ã‚‡ã†ã©ã“ã†ã„ã†ã‚„ã£ã¤ã‘ä»•äº‹ã‚’ã—ã¦ã„ãŸã‚‰ã‚»ãƒƒã‚¯ã‚¹ãŒãƒ”ãƒ¼ (http://twitter.com/chunjp/statuses/6523318056) ã¨ã‹ã„ã†ã®ãŒå¤šæ–¹é¢ã‹ã‚‰èžã“ãˆã¦ããŸã‚“ã‚ˆã€‚ãã‚Œã§ã€‚è‹¥ã„äººã¯ãªã‹ãªã‹ãã†ã„ã†ã®æ¥ãšã‹ã—ãã¦è©±ã›ãªã„ã§ã—ã‚‡ã€ã ã‹ã‚‰ã‚¢ãƒ©ãƒ•ã‚©ãƒ¼ã®ãŠã£ã¡ã‚ƒã‚“ãŒã¡ã‚‡ã£ã¨ã—ãŸã‚‹ã‚ã€‚ ç›®çš„ ä½•ã‹ XML ã§æ›¸ã‹ã‚ŒãŸãƒ‡ãƒ¼ã‚¿ãŒã‚ã£ã¦ã€ä½•ã¨ãªãã©ã†ã„ã†ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã«ãªã£ã¦ã‚‹ã‹ã¯ç†è§£ã§ãã‚‹ã€‚ã‚ãƒ¼ã€ã“ã“ã¯ãƒªã‚¹ãƒˆã ãªã€ã¨ã‹ã€ã“ã“ã¯ OCaml ã§ã„ã†ãƒ¬ã‚³ãƒ¼ãƒ‰ã£ã½ã„ã¨ã‹ã€‚ãã†ã„ã†ãƒ‡ãƒ¼ã‚¿ã‚’èªã¿è¾¼ã‚“ã§ OCaml ã®åž‹ã«è½ã¨ã—è¾¼ã‚€ã¨ã„ã†ä½œæ¥ã€ã“ã‚Œã‚’ã§ãã‚‹ã ã‘ãŠæ‰‹è»½ã«ã—ãŸã„ã€‚ã‚¹ã‚ãƒ¼ãƒžã¨ã‹ã‚¬ãƒ³ç„¡è¦–ã€‚ãã†ã„ã†ã®ã§ã‚„ã‚ŠãŸã„äººã¯ãŒã‚“ã°ã£ã¦ãã ã•ã„ã€‚ã§ãã‚‹ã ã‘ãŠæ‰‹è»½ã«ãŒåŸºæœ¬ã€‚ ææ–™ xml-light : XML ã‚’ã•ãã£ã¨èªã¿è¾¼ã‚“ã ã‚Šãƒ—ãƒªãƒ³ãƒˆã—ã¦ãã‚Œã‚‹ãƒ©ã‚¤ãƒ–ãƒ©ãƒªã€‚è»½ã„ã®ã§ãã‚“ã ã‘ã€‚ sexp
jjzak 2010/08/24
ocaml

programming

xml

tips
ãƒªãƒ³ã‚¯
OCaml åŸºç¤Žæœ€é€Ÿãƒžã‚¹ã‚¿ãƒ¼ â€” Scratch Leaf â€” MAYAH.JP
OCaml ã¯ Haskell ã¨ã¯é•ã£ã¦ç´”ç²‹ã§ãªã„é–¢æ•°åž‹è¨€èªžã§ã™ã€‚ML (Meta Language) ã¨ã„ã†è¨€èªžãƒ•ã‚¡ãƒŸãƒªãƒ¼ã®æ–¹è¨€ã®ä¸€ã¤ã§ã€ãƒ•ãƒ©ãƒ³ã‚¹ã® INRIA ã¨ã„ã†ç ”ç©¶æ‰€ã§é–‹ç™ºã•ã‚Œã¦ã„ã¾ã™ã€‚é€Ÿåº¦ã‚’ç¨¼ããŸã‚ã«å‘½ä»¤åž‹ã®ã‚ˆã†ã«æ›¸ã“ã†ã¨æ€ãˆã°æ›¸ã‘ã‚‹ã—ã€é…å»¶è©•ä¾¡ã‚‚ãƒ‡ãƒ•ã‚©ãƒ«ãƒˆã§ã¯ã—ã¾ã›ã‚“ã€‚ãã®åˆ†ã€practical ãªã‚¢ãƒ—ãƒªã‚±ãƒ¼ã‚·ãƒ§ãƒ³ãŒæ›¸ãã‚„ã™ããªã£ã¦ã„ã¾ã™ã€‚ ä»–ã®è¨€èªžã‚’ã‚ã‚‹ç¨‹åº¦çŸ¥ã£ã¦ã„ã‚‹äººã¯ã“ã‚Œã‚’èªã‚ã° OCaml ã®ã¨ã‚Šã‚ãˆãšã®åŸºç¤Žã‚’ãƒžã‚¹ã‚¿ãƒ¼ã—ã¦ OCaml ã‚’æ›¸ãã“ã¨ãŒã§ãã‚‹ã‚ˆã†ã«ãªã‚Šã¾ã™ã€‚å¤šåˆ†ã€‚é–¢æ•°åž‹è¨€èªžã®çŸ¥è˜ã¯ä»®å®šã—ã¦ã„ã¾ã›ã‚“ã€‚C/C++ ãã‚‰ã„ã®çŸ¥è˜ãŒã‚ã‚Œã°èªã‚ã‚‹ã¨æ€ã„ã¾ã™ã€‚å…ƒã® Perl åŸºç¤Žæ–‡æ³•æœ€é€Ÿãƒžã‚¹ã‚¿ãƒ¼ã§ã¯ãƒªãƒ•ã‚¡ãƒ¬ãƒ³ã‚¹ã½ã„ä½œã‚Šã§ã™ãŒã€ãƒãƒ¥ãƒ¼ãƒˆãƒªã‚¢ãƒ«ã½ããªã£ã¦ã—ã¾ã„ã¾ã—ãŸã€‚ ãªãŠã€èªã‚“ã§ã„ã‚‹ã¨åˆ†ã‹ã‚Šã¾ã™ãŒã€è‰²ã€…ã¨ã‚ã‚“ã©ãã•ã„ã“ã¨ãŒå¤šã„ã‚ˆã†ã«æ„Ÿã˜ã¾ã™ã€‚ã—ã‹ã—ã€ã“ã‚Œã‚’ã¡ã‚ƒã‚“ã¨æ›¸ã
jjzak 2010/08/24
reference

ocaml

programming

tutorial
ãƒªãƒ³ã‚¯
æµœæ‘æ‹“å¤«ã®ä¸–ç•Œ - FC2 BLOG ãƒ‘ã‚¹ãƒ¯ãƒ¼ãƒ‰èªè¨¼
ãƒ–ãƒã‚° ãƒ‘ã‚¹ãƒ¯ãƒ¼ãƒ‰èªè¨¼ é–²è¦§ã™ã‚‹ã«ã¯ç®¡ç†äººãŒè¨å®šã—ãŸ ãƒ‘ã‚¹ãƒ¯ãƒ¼ãƒ‰ã®å…¥åŠ›ãŒå¿…è¦ã§ã™ã€‚ ç®¡ç†äººã‹ã‚‰ã®ãƒ¡ãƒƒã‚»ãƒ¼ã‚¸ Website under construction é–²è¦§ãƒ‘ã‚¹ãƒ¯ãƒ¼ãƒ‰ Copyright Â© since 1999 FC2 inc. All Rights Reserved.
jjzak 2010/08/24
ã‚‚ã—ä»Šæ—¥ãŒè‡ªåˆ†ã®äººç”Ÿæœ€å¾Œã®æ—¥ã ã¨ã—ãŸã‚‰ã€ä»Šæ—¥ã‚„ã‚‹äºˆå®šã®ã“ã¨ã‚’ç§ã¯æœ¬å½“ã«ã‚„ã‚ŠãŸã„ã ã‚ã†ã‹ï¼Ÿã€€ï¼ˆã‚¹ãƒ†ã‚£ãƒ¼ãƒ–ãƒ»ã‚¸ãƒ§ãƒ–ã‚º ï¼ Appleå‰µæ¥è€…ï¼‰

blog

column

lisp

programming

clojure

ocaml
ãƒªãƒ³ã‚¯
The MinCaml Compiler
*** Moved to http://github.com/esumii/min-caml *** MinCaml: An educational compiler from a tiny ML subset to the SPARC or PowerPC assem bly language; Only 2000 lines of Objective Caml, but almost as efficient as---or even more efficient than---OCaml and GCC!
jjzak 2009/11/14
programming

tutorial

functional

reference

compiler

ml

ocaml

language

document

code
ãƒªãƒ³ã‚¯
SuffixArray - ã¿ãšã´ãƒ¼æ—¥è¨˜
30åˆ†ãƒ—ãƒã‚°ãƒ©ãƒ ã€ãã®580ã€‚id:Gemmaã•ã‚“ã«å€Ÿã‚ŠãŸWEB+DB PRESS Vol.50ã«ã€suffix arrayã®è§£èª¬ãŒè¼‰ã£ã¦ã„ãŸã®ã§ã‚„ã£ã¦ã¿ãŸã€‚ è§£èª¬ã‚’èªã‚“ã ã¨ãã¯ã€Œã¡ã‚‡ã†ç°¡å˜ã˜ã‚ƒã‚“ã€‚ã•ãã£ã¨å®Ÿè£…ã—ã¦ã‚„ã‚“ã‚ˆã€ã¨æ€ã£ã¦ã„ãŸã‘ã©ã€ã„ã–å§‹ã‚ãŸã‘ã©ã€ã‘ã£ã“ã†å¤§å¤‰ã ã£ãŸã€‚ç°¡å˜ã¨ã‹è¨€ã£ã¦ã€ã”ã‚ã‚“ãªã•ã„ã€‚ ãã‚‚ãã‚‚araryã¨ã¤ã„ã¦ã‚‹æ™‚ç‚¹ã§å¤§å¤‰ãªã“ã¨ã«æ°—ãŒã¤ãã¹ãã ã£ãŸã€‚ãƒœã‚¯ã€OCamlã§arrayã‚’ä½¿ã£ãŸã“ã¨ãªã‚“ã¦ã»ã¨ã‚“ã©ãªã„ã˜ã‚ƒãªã„ã‹ã€‚ ä½¿ã„æ–¹ ã‚·ã‚°ãƒãƒãƒ£ã¯ã“ã‚“ãªæ„Ÿã˜ã€‚ type t val make : string -> t val find : t -> string -> int list ã¾ãšã€suffix arrayã‚’ä½œã‚‹ã€‚ # let s = SuffixArray.make "abracadabra";; val s : SuffixArray.t = <abstr>
jjzak 2009/08/02
suffixarray

programming

algorithm

search

text

ocaml
ãƒªãƒ³ã‚¯
ã¯ã¦ãªã‚°ãƒ«ãƒ¼ãƒ—ã®çµ‚äº†æ—¥ã‚’2020å¹´1æœˆ31æ—¥(é‡‘)ã«æ±ºå®šã—ã¾ã—ãŸ - ã¯ã¦ãªã®å‘ŠçŸ¥
ã¯ã¦ãªã‚°ãƒ«ãƒ¼ãƒ—ã®çµ‚äº†æ—¥ã‚’2020å¹´1æœˆ31æ—¥(é‡‘)ã«æ±ºå®šã—ã¾ã—ãŸ ä»¥ä¸‹ã®ã‚¨ãƒ³ãƒˆãƒªã®é€šã‚Šã€ä»Šå¹´æœ«ã‚’ç›®å‡¦ã«ã¯ã¦ãªã‚°ãƒ«ãƒ¼ãƒ—ã‚’çµ‚äº†äºˆå®šã§ã‚ã‚‹æ—¨ã‚’ãŠçŸ¥ã‚‰ã›ã—ã¦ãŠã‚Šã¾ã—ãŸã€‚ 2019å¹´æœ«ã‚’ç›®å‡¦ã«ã€ã¯ã¦ãªã‚°ãƒ«ãƒ¼ãƒ—ã®æä¾›ã‚’çµ‚äº†ã™ã‚‹äºˆå®šã§ã™ - ã¯ã¦ãªã‚°ãƒ«ãƒ¼ãƒ—æ—¥è¨˜ ã“ã®ãŸã³ã€æ£å¼ã«çµ‚äº†æ—¥ã‚’æ±ºå®šã„ãŸã—ã¾ã—ãŸã®ã§ã€ä»¥ä¸‹ã®é€šã‚Šã”ç¢ºèªãã ã•ã„ã€‚ çµ‚äº†æ—¥: 2020å¹´1æœˆ31æ—¥(é‡‘) ã‚¨ã‚¯ã‚¹ãƒãƒ¼ãƒˆå¸Œæœ›ç”³è«‹æœŸé™:2020å¹´1æœˆ31æ—¥(é‡‘) çµ‚äº†æ—¥ä»¥é™ã¯ã€ã¯ã¦ãªã‚°ãƒ«ãƒ¼ãƒ—ã®é–²è¦§ãŠã‚ˆã³æŠ•ç¨¿ã¯è¡Œãˆã¾ã›ã‚“ã€‚æ—¥è¨˜ã®ã‚¨ã‚¯ã‚¹ãƒãƒ¼ãƒˆãŒå¿…è¦ãªæ–¹ã¯ä»¥ä¸‹ã®è¨˜äº‹ã«ã—ãŸãŒã£ã¦æ‰‹ç¶šãã‚’ã—ã¦ãã ã•ã„ã€‚ ã¯ã¦ãªã‚°ãƒ«ãƒ¼ãƒ—ã«æŠ•ç¨¿ã•ã‚ŒãŸæ—¥è¨˜ãƒ‡ãƒ¼ã‚¿ã®ã‚¨ã‚¯ã‚¹ãƒãƒ¼ãƒˆã«ã¤ã„ã¦ - ã¯ã¦ãªã‚°ãƒ«ãƒ¼ãƒ—æ—¥è¨˜ ã”åˆ©ç”¨ã®ã¿ãªã•ã¾ã«ã¯ã”è¿·æƒ‘ã‚’ãŠã‹ã‘ã„ãŸã—ã¾ã™ãŒã€ã©ã†ãžã‚ˆã‚ã—ããŠé¡˜ã„ã„ãŸã—ã¾ã™ã€‚ 2020-06-25 è¿½è¨˜ ã¯ã¦ãªã‚°ãƒ«ãƒ¼ãƒ—æ—¥è¨˜ã®ã‚¨ã‚¯ã‚¹ãƒãƒ¼ãƒˆãƒ‡ãƒ¼ã‚¿ã¯2020å¹´2æœˆ28
jjzak 2009/07/04
ocaml

ml

programming

functional

language
ãƒªãƒ³ã‚¯
ocaml-nagoya - ocaml-nagoya
æ¬¡å›žã®äºˆå®š â€ æ—¥æ™‚ï¼š2008/10/22(æ°´) 18:30ã€œ å ´æ‰€ï¼šåå¤å±‹å¤§å¦ IBé¤¨ å—æ£Ÿ 5éšŽ 562å®¤ (ã‚ã„ã¦ã„ã‚Œã°) å†…å®¹ javascript, NekoVM, swf, PHPã«ã‚³ãƒ³ãƒ‘ã‚¤ãƒ«ã§ãã‚‹ocamlè£½è¨€èªžhaXe? ã‚³ãƒ³ãƒ‘ã‚¤ãƒ©ã®ã‚³ãƒ¼ãƒ‰ãƒªãƒ¼ãƒ‡ã‚£ãƒ³ã‚° (å°ç¬ åŽŸã•ã‚“ãŒã„ã‚‰ã£ã—ã‚ƒã‚Œã°) type improvement ã«ã¤ã„ã¦ â†‘ [NEWS] â€ ã‚ªãƒ¼ãƒ—ãƒ³ã‚½ãƒ¼ã‚¹ã‚«ãƒ³ãƒ•ã‚¡ãƒ¬ãƒ³ã‚¹2008 åå¤å±‹ã§ç™ºè¡¨ã—ã¦ãã¾ã—ãŸã€‚ è©³ã—ãã¯ã“ã¡ã‚‰ OCaml-3.10.2 æ¥ã¾ã—ãŸ!(2008-02-29) http://caml.inria.fr/ocaml/release.en.html 3.10.1 ã‹ã‚‰ã®å¤‰æ›´ç‚¹ ä¸»ã«ä¸å…·åˆä¿®æ£. windowsç’°å¢ƒä¸‹ã§str.mliãŒè¦‹ä»˜ã‹ã‚‰ãªã‹ã£ãŸã‚‰ã€å†ã‚¤ãƒ³ã‚¹ãƒˆãƒ¼ãƒ«ã—ã¾ã—ã‚‡ã†ã€‚ OCaml-3.10.1 æ¥ã¾ã—ãŸ!(2008-01-11) 3.10
jjzak 2009/06/22
ocaml

programming

development

functional

ml
ãƒªãƒ³ã‚¯
ãƒã‚¿è¨˜éŒ²åº«/ä¸å‹•ç‚¹ã‚³ãƒ³ãƒ“ãƒãƒ¼ã‚¿ - ocaml-nagoya
jjzak 2009/06/22
ocaml

y-combinator

programming

combinator
ãƒªãƒ³ã‚¯
Thrift - ocaml-nagoya
ã‚¯ãƒ©ã‚¤ã‚¢ãƒ³ãƒˆã‚’æ›¸ã â€ Hello_client.mlã‚’æ–°è¦ä½œæˆã—ã¦å†…å®¹ã¯ã“ã†ã™ã‚‹ã€‚ open Thrift;; open Hello_types;; let s = new TSocket.t "localhost" 9090;; let p = new TBinaryProtocol.t s;; let c = new Hello.client p p;; s#opn; print_string (c#hello "Gemma"); print_char '\n'; s#close; â†‘ ã‚¯ãƒ©ã‚¤ã‚¢ãƒ³ãƒˆã‚’ã‚³ãƒ³ãƒ‘ã‚¤ãƒ«ã™ã‚‹ â€ Makefileã‚’ä½¿ã†ã¹ã—ã€‚ SOURCES = ./gen-ocaml/hello_types.ml ./gen-ocaml/hello_consts.ml ./gen-ocaml/Hello.ml Hello_client.ml RESULT = test_cli
jjzak 2009/06/21
RPC ãƒ•ãƒ¬ãƒ¼ãƒ ãƒ¯ãƒ¼ã‚¯

thrift

library

framework

ocaml

web
ãƒªãƒ³ã‚¯
è‰¯ã„ãƒ—ãƒã‚°ãƒ©ãƒžã‚’ç›®æŒ‡ã™ãªã‚‰ã€ŒConcurrent Progrmming in MLã€ã¯ä»Šã™ãèªã‚€ã¹ã - osiireâ€™s blog
ï¼ˆã„ãˆã€ã©ã†ã›å‰ã‹ã‚‰åºƒã‚ãŸã„ã¨ã¯æ€ã£ã¦ãŸã®ã§ã€ã¡ã‚‡ã£ã¨ä¾¿ä¹—ã€‚ï¼‰ ã“ã‚Œã‹ã‚‰ãƒžãƒ«ãƒã‚³ã‚¢å½“ã‚Šå‰æ™‚ä»£ã«ãªã‚‹ã—ä¸¦è¡Œå‡¦ç†ã‚’æ‰±ãˆã‚‹ã‚ˆã†ã«ãªã‚ŠãŸã„ã€‚ã§ã‚‚ä¸¦è¡Œå‡¦ç†ã£ã¦é›£ã—éŽãŽã‚‹ã€‚ãã‚“ãªè«¸æ°ã«æœ—å ±ã§ã™ã€‚ç°¡å˜ã‹ã¤å®‰å…¨ã«ãƒžãƒ«ãƒã‚¹ãƒ¬ãƒƒãƒ‰ã‚’æ‰±ãˆã‚‹æ–¹æ³•ãŒã‚ã‚Šã¾ã™ã€‚ ãã‚Œã¯ã€ãƒ¡ãƒƒã‚»ãƒ¼ã‚¸ãƒ‘ãƒƒã‚·ãƒ³ã‚°ã«ã‚ˆã‚‹ã‚¹ãƒ¬ãƒƒãƒ‰é–“æƒ…å ±å…±æœ‰ã§ã™ã€‚Erlangã®ã‚ˆã†ãªã‚¢ã‚¯ã‚¿ãƒ¼ãƒ¢ãƒ‡ãƒ«ã¨è¨€ã£ãŸæ–¹ãŒãƒ”ãƒ³ã¨ãã‚‹äººã‚‚ã„ã‚‹ã‹ã‚‚ã—ã‚Œã¾ã›ã‚“ã€‚ãƒ¡ãƒƒã‚»ãƒ¼ã‚¸ãƒ‘ãƒƒã‚·ãƒ³ã‚°ã®ä¸–ç•Œã«ã¯ãƒãƒƒã‚¯ã‚‚ã‚·ã‚°ãƒŠãƒ«ã‚‚ç™»å ´ã—ã¾ã›ã‚“ã€‚ã‚ã‚‹ã®ã¯ã€ã‚¹ãƒ¬ãƒƒãƒ‰é–“ã§å…±æœ‰ã™ã‚‹é€šä¿¡è·¯ã ã‘ã§ã™ã€‚ãªãœé€šä¿¡è·¯ã ã‘ã§ã€æŽ’ä»–åˆ¶å¾¡ãŒå‡ºæ¥ã‚‹ã®ã§ã—ã‚‡ã†ã‹ï¼Ÿæ–°ã—ã„ã‚¹ãƒ¬ãƒƒãƒ‰ã‚’ä½œã£ã¦ã€ãã®ã‚¹ãƒ¬ãƒƒãƒ‰ãŒæŒã¤æ–‡å—åˆ—ã‚’èªã¿æ›¸ãã™ã‚‹ãƒ¡ãƒƒã‚»ãƒ¼ã‚¸ãƒ‘ãƒƒã‚·ãƒ³ã‚°ã‚¹ã‚¿ã‚¤ãƒ«ã®ãƒ—ãƒã‚°ãƒ©ãƒ ã‚’è¦‹ã‚Œã°ä¸€ç›®çžç„¶ã§ã™ã€‚ (* ç´°ã‹ã„äº‹ã¯è‹¥å¹²å˜ç´”åŒ–ã—ãŸã‚µãƒ³ãƒ—ãƒ«ãƒ—ãƒã‚°ãƒ©ãƒ ã§ã™ã€‚*) let start_server init_msg = let ch = (* é€šä¿¡
jjzak 2009/06/21
programming

concurrent

ä¸¦åˆ—å‡¦ç†

ocaml

ml
ãƒªãƒ³ã‚¯
1 2 3 æ¬¡ã®ãƒšãƒ¼ã‚¸