[B! OCaml] TaKUMAã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯

TaKUMA id:TaKUMA

OCamlã«é–¢ã™ã‚‹TaKUMAã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯ (20)

${{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}}

F*: A Proof-Oriented Programming Language
Introduction F* (pronounced F star) is a general-purpose proof-oriented programming language, supporting both purely functional and effectful programming. It combines the expressive power of dependent types with proof automation based on SMT solving and tactic-based interactive theorem proving. F* programs compile, by default, to OCaml. Various fragments of F* can also be extracted to F#, to C or
TaKUMA 2022/07/22
F*

OCaml
ãƒªãƒ³ã‚¯
HaskellåŽ¨ã‚’6å¹´ã‚„ã£ã¦ã‚‹ä¿ºãŒOCamlã‚’ä»•äº‹ã§2ãƒ¶æœˆä½¿ã£ã¦ã¿ãŸ - keigoiã®æ—¥è¨˜
Haskell Advent Calendar jp 2010ã®ãŸã‚ã®ã‚¨ãƒ³ãƒˆãƒªã§ã™ï¼ˆ17æ—¥ç›®ï¼‰ï¼Ž 6æ—¥ç›®ã® id:camlspotterã•ã‚“ã® çµŒé¨“15å¹´ã®OCaml ãƒ¦ãƒ¼ã‚¶ãƒ¼ãŒ Haskell ã‚’ä»•äº‹ã§åŠå¹´ä½¿ã£ã¦ã¿ãŸ ã«å¯¾ã™ã‚‹ã‚«ã‚¦ãƒ³ã‚¿ãƒ¼ï¼ˆã«ãªã£ã¦ã‚‹ã‹ã©ã†ã‹åˆ†ã‹ã‚‰ãªã„ã§ã™ãŒï¼‰ã¿ãŸã„ãªæ„Ÿã˜ã§ã™ï¼Ž è¿‘ãã¦é ã„éš£äººï¼šHaskellã¨OCaml OCamlã¯Haskellã¨é•ã£ã¦å‰¯ä½œç”¨ãŒã‚ã‚Šï¼Œæ›´ã«HMåž‹æŽ¨è«–ã‚’ã‚‚ã¤ãŸã‚ãƒ—ãƒã‚°ãƒ©ãƒžã¯æœ¬è³ªçš„ãªéƒ¨åˆ†ã®è¨˜è¿°ã«æ³¨åŠ›ã—ã¤ã¤ï¼Œã‚³ãƒ¼ãƒ‰ã®ãƒãƒ¥ãƒ¼ãƒ‹ãƒ³ã‚°ã‚‚ã§ãã‚‹ï¼Ž ã¤ã¾ã‚ŠåƒãHaskellãƒ—ãƒã‚°ãƒ©ãƒžãŒã‚·ãƒªã‚¢ã‚¹ãªã‚½ãƒ•ãƒˆã‚¦ã‚§ã‚¢ã‚’æ›¸ãæ™‚ã«ä½¿ãˆã‚‹ã»ã¨ã‚“ã©å”¯ä¸€ã®é¸æŠžè‚¢ã ï¼Žã—ã‹ã—ï¼ŒåŒã˜é™çš„åž‹ä»˜ã‘ã®é–¢æ•°åž‹è¨€èªžã§ã‚ã‚ŠãªãŒã‚‰ï¼ŒOCamlã¨Haskellã®è¦‹ãŸç›®ã¯ã‹ãªã‚Šç•°ãªã‚‹ï¼Ž ã“ã®è¨˜äº‹ã§ã¯ï¼Œ Haskellãƒ—ãƒã‚°ãƒ©ãƒžãŒOCamlã‚’ä½¿ã„å§‹ã‚ã‚‹ã¨ï¼Œã©ã†ã„ã†ãƒˆãƒ©ãƒƒãƒ—ã«ãƒãƒžã‚‹ã‹ã‚’æ›¸ãï¼Ž ãªã‹ã§ã‚‚ï¼Œ
TaKUMA 2022/07/02
OCaml

Haskell
ãƒªãƒ³ã‚¯
OCaml Programming: Correct + Efficient + Beautiful â€” OCaml Programming: Correct + Efficient + Beautiful
Preface About This Book Installing OCaml Introduction 1. Better Programming Through OCaml 1.1. The Past of OCaml 1.2. The Present of OCaml 1.3. Look to Your Future 1.4. A Brief History of CS 3110 1.5. Summary 2. The Basics of OCaml 2.1. The OCaml Toplevel 2.2. Compiling OCaml Programs 2.3. Expressions 2.4. Functions 2.5. Documentation 2.6. Printing 2.7. Debugging 2.8. Summary 2.9. Exercises OCaml
TaKUMA 2022/06/29
OCaml
ãƒªãƒ³ã‚¯
Real World OCaml
Functional programming for the masses2nd Edition (Oct 2022) Yaron Minsky Yaron Minsky joined Jane Street in 2003, where he started out developing quantitative trading strategies, going on to found the firm's quantitative research group. He introduced OCaml to the company and managed the transition to using OCaml for all of its core infrastructure, turning Jane Street into the world's largest indus
TaKUMA 2022/06/22
OCaml
ãƒªãƒ³ã‚¯
2019å¹´åº¦ã€Œãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°è¨€èªžã€é…å¸ƒè³‡æ–™ (6)
[ å‰ã®è³‡æ–™ | è¬›ç¾©ãƒ›ãƒ¼ãƒ ãƒšãƒ¼ã‚¸ãƒ»ãƒˆãƒƒãƒ— | æ¬¡ã®è³‡æ–™ ] OCaml OCaml (æ—§åç§°: Objective Caml)ã¯ INRIA ã¨ã„ã†ãƒ•ãƒ©ãƒ³ã‚¹ã®å›½ç«‹ã®è¨ˆç®—æ©Ÿç§‘å¦ã®ç ”ç©¶æ‰€ã§ãƒ‡ã‚¶ã‚¤ãƒ³ãƒ»é–‹ç™ºã•ã‚ŒãŸè¨€èªžã§ã‚ã‚‹ï¼Žæ´å²çš„ã«ã¯ï¼Œè¨¼æ˜Žæ”¯æ´ç³»ã¨å‘¼ã°ã‚Œã‚‹ï¼Œè¨ˆç®—æ©Ÿã«ã‚ˆã£ã¦æ•°å¦çš„è¨¼æ˜Žã‚’è¡Œã†ãŸã‚ã®ã‚½ãƒ•ãƒˆã‚¦ã‚§ã‚¢ã‚’æ“ä½œã™ã‚‹ãŸã‚ã®è¨€èªžã®ç ”ç©¶ã‹ã‚‰ç™ºå±•ã—ã¦ããŸã‚‚ã®ã§ï¼Œå½“åˆã¯ ML (Meta Language) ã¨å‘¼ã°ã‚Œã¦ã„ãŸãŒï¼Œç ”ç©¶ãŒé€²å±•ã—ï¼Œã¾ãŸæ–¹è¨€ãŒæ´¾ç”Ÿã—ã¦ã„ãéŽç¨‹ã§ OCaml ãŒã§ãã‚ãŒã£ãŸï¼ŽStandard ML ãªã©ã®æ–¹è¨€ã‚’ã¾ã¨ã‚ã¦ ML ã¨å‘¼ã¶ã“ã¨ãŒå¤šã„ï¼Ž(èˆˆå‘³ãŒã‚ã£ãŸã‚‰ Caml ã®æ´å², Standard MLã®æ´å² ãªã©ã‚’è¦‹ã‚ˆï¼Ž) ML ã¯é–¢æ•°åž‹ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°(functional programming)ã¨å‘¼ã°ã‚Œã‚‹ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã‚¹ã‚¿ã‚¤ãƒ«ã‚’ã‚µãƒãƒ¼ãƒˆã—ã¦ã„ã‚‹ï¼ŽMLã¯æ ¸ã¨ãªã‚‹éƒ¨åˆ†ãŒå°ã•ãã‚·ãƒ³ãƒ—
TaKUMA 2021/04/29
OCaml
ãƒªãƒ³ã‚¯
Welcome to MirageOS
A programming framework for building type-safe, modular systems MirageOS is a library operating system that constructs unikernels for secure, high-performance network applications across a variety of cloud computing and mobile platforms. Code can be developed on a normal OS such as Linux or macOS, and then compiled into a fully-standalone, specialised unikernel that runs under a Xen or KVM hypervi
TaKUMA 2021/02/16
OCaml

MirageOS
ãƒªãƒ³ã‚¯
ãã‚ãã‚ Jane Street Core ã«ã¤ã„ã¦èªžã‚ã†ã€ã‹ãª #0: Core ã¨ã¯ - camlspotterâ€™s blog
Core ã¨ã¯ Jane Street ãŒé–‹ç™ºã€ä½¿ç”¨ã€ã‚ªãƒ¼ãƒ—ãƒ³ã‚½ãƒ¼ã‚¹ã¨ã—ã¦å…¬é–‹ã—ã¦ã„ã‚‹ OCaml åŸºæœ¬ãƒ©ã‚¤ãƒ–ãƒ©ãƒªã€‚ã“ã® Core ã«ã¤ã„ã¦ã¡ã‚‡ã£ã¨æ›¸ã“ã†ã‹ãªã€‚ ã¡ãªã¿ã«ã€ã“ã“ã«æ›¸ã„ã¦ã‚ã‚‹ã®ã¯ä¸€ãƒ¦ãƒ¼ã‚¶ã¨ã—ã¦ã®æ„è¦‹ã€‚é–“é•ã£ã¦ã‚‚ä¼šç¤¾ã®è¦‹è§£ã§ã¯ã‚ã‚Šã¾ã›ã‚“ã€‚å¿µã®ãŸã‚ã€‚ ç™ºç«¯ ã¾ãšã€ã“ã®ã‚¨ãƒ³ãƒˆãƒªã®ç™ºç«¯ã¯ã€Caml-list ã«å‡ºç¾ã—ãŸã€ŒWhy don't you use batteries?ã€ã¨ã„ã†é•·ãƒ¼ã„ã‚¹ãƒ¬ãƒƒãƒ‰(ä»Šé•·ã•57)ã€‚Batteries included ã¨ã„ã†ã®ã¯ã€OCaml ã®ã€Œæ¨™æº–ãƒ©ã‚¤ãƒ–ãƒ©ãƒªã€ãŒä½™ã‚Šã«è²§å¼±ãªã®ã§ã€ãã‚Œã‚’æ‹¡å……ã—ã‚ˆã†ã¨ã„ã†ã‚‚ã®ã§ã™ã€‚å¤ãã¯ extlib ã¨ã„ã† 3rd party ãƒ©ã‚¤ãƒ–ãƒ©ãƒªãŒã‚ã£ã¦ã€ãã‚Œã‚’å–ã‚Šè¾¼ã‚“ã§ã•ã‚‰ã«æ‹¡å¼µã—ã¦ã„ã¾ã™ã€‚(Batteries included ã‚‚ 3rd partyã€‚å¿µã®ãŸã‚ã€‚) OCaml è²§å¼±æ¨™æº–ãƒ©ã‚¤ãƒ–ãƒ©ãƒª ã¾ãšã€ãã®ã€OCaml ã®
TaKUMA 2017/01/30
OCaml
ãƒªãƒ³ã‚¯
Which of Haskell and OCaml is more practical? For example, in which aspect will each play a key role?
Answer (1 of 2): Haskell. This is a question I'm particularly well-placed to answer because I've spent quite a bit of time with both Haskell and OCaml, seeing both in the real world (including working at Jane Street for a bit). I've also seen the languages in academic settings and know many peop...
TaKUMA 2016/01/04
OCaml vs Haskell in practicality

OCaml

Haskell
ãƒªãƒ³ã‚¯
ãªãœæ¬¡ã«å¦ã¶è¨€èªžã¯é–¢æ•°åž‹ã§ã‚ã‚‹ã¹ãã‹ - YAMAGUCHI::weblog
ã¯ã˜ã‚ã« ã“ã‚“ã«ã¡ã¯ã€Pythonç•Œã®æƒ…å¼±ã§ã™ã€‚ã¡ã‚‡ã£ã¨å‰ã«OCamlç³»ã®ã‚¨ãƒ³ãƒˆãƒªã‚’è‰²ã€…ã¨çœºã‚ã¦ã„ãŸã‚‰Yaron Minskyæ°ã®ã‚¨ãƒ³ãƒˆãƒªã‚’è¦‹ã¤ã‘ãŸã®ã§ç¿»è¨³ã—ã¦ã¿ã¾ã—ãŸã€‚ OCaml for the Masses - ACM Queue Yaron Minskyæ°ã¯Jane Streetã§ç¬¬ä¸€ç·šã§æ´»èºã•ã‚Œã‚‹ã‚¨ãƒ³ã‚¸ãƒ‹ã‚¢ã§ã€Jane Streetã®æŠ€è¡“ãƒšãƒ¼ã‚¸ã‚’ã¯ã˜ã‚å¤šãã®å ´æ‰€ã§OCamlã«é–¢ã—ã¦ã®çŸ¥è¦‹ã‚’èªžã£ã¦ãã ã•ã£ã¦ã„ã¾ã™ã€‚ Jane Street Tech Blogs æœ¬ã‚¨ãƒ³ãƒˆãƒªã¯John Hughesã®åã‚¨ãƒ³ãƒˆãƒªã€Œãªãœé–¢æ•°ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã¯é‡è¦ã‹ã€ã‚’å—ã‘ã¦ACM Queueã«å¯„ç¨¿ã•ã‚ŒãŸã‚‚ã®ã®æ—¥æœ¬èªžè¨³ã§ã™ã€‚ ãªãœé–¢æ•°ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã¯é‡è¦ã‹ Why the next language you learn should be functional YARON MINSKY, JANE STREE
TaKUMA 2014/10/11
OCaml

functional
ãƒªãƒ³ã‚¯
æœ‰é™ä¼šç¤¾ITãƒ—ãƒ©ãƒ³ãƒ‹ãƒ³ã‚°(IT Planning Inc.)
Copyright (C) 2006-2007 IT Planning Inc. All Rights Reserved.
TaKUMA 2011/08/02
functional

ä¼æ¥

OCaml
ãƒªãƒ³ã‚¯
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
TaKUMA 2011/02/20
Programming

Haskell

OCaml

blog
ãƒªãƒ³ã‚¯
åž‹æŽ¨è«–ã¯ã©ã®ã‚ˆã†ã«ã—ã¦å®Ÿè£…ã•ã‚Œã¦ã„ã‚‹ã‹ - ãƒ©ãƒ ãƒ€ãƒ—ãƒ©ã‚¹+ã®ç´¹ä»‹ -
ã“ã®è¨˜äº‹ã¯ Haskell Advent Calendar jp 2010 ã®ãŸã‚ã«æ›¸ã‹ã‚ŒãŸç‰©ã§ã™ã€‚(20æ—¥ç›®) åž‹æŽ¨è«–ã¯ç°¡å˜ ML ã‚„ Haskell ã®ã‚ˆã†ãªè¨€èªžã®åž‹æŽ¨è«–ã¯ã€åž‹æŽ¨è«–ã‚’çŸ¥ã‚‰ãªã„ã¿ãªã•ã‚“ãŒè€ƒãˆã¦ã„ã‚‹ã‚ˆã‚Šã¯é¥ã‹ã«ç°¡å˜ãªç‰©ã§ã™ã€‚å¤§é›‘æŠŠã«è¨€ã£ã¦ã—ã¾ãˆã°ã€æ§‹æ–‡æœ¨å…¨ä½“ã‚’æŽ¢ç´¢ã—ã¦ã€åŒä¸€ã§ã‚ã‚‹äº‹ãŒæ˜Žã‚‰ã‹ãªåž‹åŒå£«ã®å˜ä¸€åŒ–ã‚’ã—ã¦ã„ã‘ã°åž‹æŽ¨è«–ã§ãã¦ã—ã¾ã†ã®ã§ã™ã€‚ åž‹æŽ¨è«–ã®é›£ã—ã„æ‰€ãã®1 - å¤šç›¸åž‹ ã—ã‹ã—ã€åž‹æŽ¨è«–ã«ã‚‚é›£ã—ã„äº‹ãŒç„¡ã„ã‚ã‘ã§ã¯ã‚ã‚Šã¾ã›ã‚“ã€‚ã¾ãšæœ€åˆã®é›£é–¢ã¨ã—ã¦ã¯å¤šç›¸åž‹ãŒæŒ™ã’ã‚‰ã‚Œã¾ã™ã€‚ ML ã‚„ Haskell ã§ã¯ let ãªã©ã®å¤‰æ•°æŸç¸›ã«å¯¾ã—ã¦å¤šç›¸åž‹ãŒå°Žå…¥ã•ã‚Œã¦ã„ã¾ã™ã€‚å¼ã®ä¸ã§ã“ã‚Œã‚‰ã®å¤‰æ•°ãŒå‡ºç¾ã™ã‚‹ã¨ã€ãã®åž‹ã®åž‹å¤‰æ•°(ç¢ºå®šã—ã¦ã„ãªã„éƒ¨åˆ†)ã‚’å…¨ã¦ä»˜ã‘æ›¿ãˆã‚‹æ“ä½œãŒç™ºç”Ÿã—ã¾ã™ã€‚ ã—ã‹ã—ã€ç¢ºå®šã—ã¦ã„ãªã„éƒ¨åˆ†ã‚’ä»˜ã‘æ›¿ãˆã‚‹ã¨ã„ã†äº‹ã¯ã€æœ€çµ‚çš„ã«å…ƒã®åž‹ãŒç¢ºå®šã—ãŸå¾Œã«ãã®æ“ä½œã‚’ã—ãªã‘ã‚Œã°ã€åž‹ã‚’æ£ã—ã
TaKUMA 2010/12/27
åž‹æŽ¨è«–

functional

Haskell

OCaml

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

Programming

é–‹ç™º

ä»•äº‹

Haskell

OCaml
ãƒªãƒ³ã‚¯
Objective Caml å…¥é–€
Objective Caml å…¥é–€äº”ååµ æ·³ äº¬éƒ½å¤§å¦ å·¥å¦éƒ¨æƒ…å ±å¦ç§‘è¨ˆç®—æ©Ÿç§‘å¦ã‚³ãƒ¼ã‚¹ å¤§å¦é™¢æƒ…å ±å¦ç ”ç©¶ç§‘çŸ¥èƒ½æƒ…å ±å¦å°‚æ”» e-mail: igarashi@kuis.kyoto-u.ac.jp Septemberï¿½24, 2007 Contents Chapterï¿½1ï¿½ï¿½ 1.1ï¿½ï¿½é–¢æ•°åž‹è¨€èªž ML ã¨ Objective Camlã«ã¤ã„ã¦ 1.1.1ï¿½ï¿½MLãƒ»Objective Caml ã®ç‰¹å¾´ 1.2ï¿½ï¿½å‚è€ƒæ›¸ï¼Œè³‡æ–™ï¼Œãƒžãƒ‹ãƒ¥ã‚¢ãƒ« 1.3ï¿½ï¿½ç’°å¢ƒè¨å®š Chapterï¿½2ï¿½ï¿½ 2.1ï¿½ï¿½ã‚¤ãƒ³ã‚¿ãƒ©ã‚¯ãƒ†ã‚£ãƒ–ã‚³ãƒ³ãƒ‘ã‚¤ãƒ©ã‚’ä½¿ã† 2.1.1ï¿½ï¿½ç°¡å˜ãªä½¿ã„æ–¹ 2.1.2ï¿½ï¿½ãã®ä»–: ãƒ•ã‚¡ã‚¤ãƒ«ã‹ã‚‰ã®ãƒ—ãƒã‚°ãƒ©ãƒ ã®èªã¿è¾¼ã¿ãƒ»ã‚³ãƒ¡ãƒ³ãƒˆ 2.2ï¿½ï¿½åŸºæœ¬ãƒ‡ãƒ¼ã‚¿åž‹ã¨ãã®æ¼”ç®— 2.2.1ï¿½ï¿½unitåž‹ 2.2.2ï¿½ï¿½intåž‹ 2.2.3ï¿½ï¿½floatåž‹ 2.2.4ï¿½ï¿½charåž‹ 2.2.5ï¿½ï¿½stringåž‹ 2
TaKUMA 2010/11/06
OCaml

Programming

functional

Tutorial

ã¾ã¨ã‚

reference
ãƒªãƒ³ã‚¯
OCaml.jp
ã“ã®ãƒšãƒ¼ã‚¸ã¯æœ€å¾Œã«æ›´æ–°ã•ã‚Œã¦ã‹ã‚‰1å¹´ä»¥ä¸ŠçµŒéŽã—ã¦ã„ã¾ã™ã€‚æƒ…å ±ãŒå¤ã„å¯èƒ½æ€§ãŒã‚ã‚Šã¾ã™ã®ã§ã€ã”æ³¨æ„ãã ã•ã„ã€‚ OCamlï¼ˆã‚ªã‚ãƒ£ãƒ ãƒ«ï¼ã‚ªãƒ¼ã‚ãƒ£ãƒ ãƒ«ï¼‰ã¯ã€INRIAï¼ˆãƒ•ãƒ©ãƒ³ã‚¹å›½ç«‹æƒ…å ±å¦è‡ªå‹•åˆ¶å¾¡ç ”ç©¶æ‰€ï¼‰ã§é–‹ç™ºã•ã‚Œã¦ã„ã‚‹é–¢æ•°åž‹è¨€èªžã®ä¸€ç¨®ã§ã€æœ€æ–°ã®è¨€èªžç†è«–ã®æˆæžœãŒå–ã‚Šå…¥ã‚Œã‚‰ã‚ŒãŸãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°è¨€èªžã§ã™ã€‚ åž‹å®‰å…¨ãªé™çš„åž‹ã‚·ã‚¹ãƒ†ãƒ ã‚’åŸºç›¤ã«ã€ãƒã‚°ã®å°‘ãªã„é«˜ä¿¡é ¼ãªãƒ—ãƒã‚°ãƒ©ãƒ ãŒé–‹ç™ºã§ãã¾ã™ã€‚ ã‚ªãƒ–ã‚¸ã‚§ã‚¯ãƒˆã€åž‹æŽ¨è«–ã€ä»£æ•°çš„ãƒ‡ãƒ¼ã‚¿åž‹ã€ãƒ¢ã‚¸ãƒ¥ãƒ¼ãƒ«ã‚·ã‚¹ãƒ†ãƒ ã€å¤šç›¸ãƒãƒªã‚¢ãƒ³ãƒˆã€ç¬¬ä¸€ç´šãƒ¢ã‚¸ãƒ¥ãƒ¼ãƒ«ã€GADTã¨ã„ã£ãŸæ§˜ã€…ãªæ©Ÿèƒ½ã‚’åˆ©ç”¨ã—ã¦ã€ã‚ˆã‚Šç°¡æ½”ã§æ•´ç†ã•ã‚ŒãŸã‚³ãƒ¼ãƒ‰ãŒè¨˜è¿°ã§ãã¾ã™ã€‚ x86, x86-64, ARM, PowerPCãªã©å¤šæ•°ã®ã‚¢ãƒ¼ã‚ãƒ†ã‚¯ãƒãƒ£ã®ãƒã‚¤ãƒ†ã‚£ãƒ–ã‚³ãƒ¼ãƒ‰ã‚’å‡ºåŠ›ã§ãã‚‹ã‚³ãƒ³ãƒ‘ã‚¤ãƒ©ã‚’æŒã£ã¦ã„ã¾ã™ã€‚Android ã‚„ iOS å‘ã‘ã®ã‚¯ãƒã‚¹ã‚³ãƒ³ãƒ‘ã‚¤ãƒ«ã‚‚å¯èƒ½ã§ã™ï¼ˆLinux ä¸Šã§ã®ã‚¯ãƒã‚¹ã‚³ãƒ³ãƒ‘ã‚¤ãƒ«ã¯ opam-cross-a
TaKUMA 2010/09/29
OCaml

Document

Tutorial

Programming
ãƒªãƒ³ã‚¯
OCaml ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°å…¥é–€
OCaml ã®ã™ã™ã‚ OCaml ã¨ã¯ãƒ•ãƒ©ãƒ³ã‚¹ã® æƒ…å ±æŠ€è¡“ç³»ã®ç ”ç©¶æ©Ÿé–¢ã® INRIA ã§é–‹ç™ºã•ã‚Œã¦ã„ã‚‹é–¢æ•°åž‹è¨€èªž ML (ã®æ–¹è¨€) ã§ã™ã€‚ML ã«ã¯å¤šç›¸åž‹ã€åž‹æŽ¨è«–ã€ã‚¬ãƒ¼ãƒ™ãƒ¼ã‚¸ã‚³ãƒ¬ã‚¯ã‚·ãƒ§ãƒ³ (GC)ã€ ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã®ãƒ‘ã‚¿ãƒ¼ãƒ³ãƒžãƒƒãƒãƒ³ã‚°ç‰ã€ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°è¨€èªžç†è«–ã®ç ”ç©¶ã® æˆæžœ (ã™ã”ãæœ€æ–°ã®ã‚‚ã®ã¨è¨€ã†ã‚ã‘ã§ã¯ç„¡ã„ãã†ã§ã™ãŒ) ãŒè©°ã‚è¾¼ã¾ã‚Œ ã¦ã„ã¾ã™ã€‚ã“ã‚Œã‚‰ã®ç›®çš„ãƒ»åŠ¹ç”¨ã¯ã€ ã‚³ãƒ¼ãƒ‰ã®å†åˆ©ç”¨ã®ç¯„å›²ãŒå¤§ãã„ (å¤šç›¸åž‹) ã‚³ãƒ¼ãƒ‰ã®è¨˜è¿°é‡ãŒçŸã‹ããªã‚‹ (åž‹æŽ¨è«–ãƒ»ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã®ãƒ‘ã‚¿ãƒ¼ãƒ³ãƒžãƒƒãƒãƒ³ã‚°) ãƒã‚°ã®å…¥ã‚Šè¾¼ã‚€ä½™åœ°ãŒå°‘ãªããªã‚‹ (GCã€é–¢æ•°çš„(å‰¯ä½œç”¨ã®å°‘ãªã„)ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°) ç‰ã§ã™ã€‚ç§ã¯ OCaml ã‚’ç ”ç©¶ã§ã®ãƒ‡ãƒ¼ã‚¿å‡¦ç†ã‚’ã¯ã˜ã‚ã€ä½œæˆã™ã‚‹ãƒ—ãƒã‚°ãƒ©ãƒ ã»ã¨ã‚“ã© å…¨ã¦ã«ãŠã„ã¦æ—¥å¸¸çš„ã«ä½¿ã£ã¦ã„ã‚‹ã®ã§ã™ãŒã€ ã¨ã«ã‹ãé–‹ç™ºåŠ¹çŽ‡ãŒè‰¯ã„ã§ã™ã€‚ ã‚³ãƒ³ãƒ‘ã‚¤ãƒ«æ™‚ã®åž‹ãƒã‚§ãƒƒã‚¯ã®åŽ³ã—ã•ã«ã¯æ…£ã‚Œãªã„ã¨ã¡ã‚‡ã£ã¨é¢å€’ã«æ„Ÿã˜ã‚‹ ã‹ã‚‚ã—ã‚Œã¾
TaKUMA 2010/09/29
OCaml

Programming

Tutorial
ãƒªãƒ³ã‚¯
OCamlå‚™å¿˜éŒ²
åŸºæœ¬çš„ã«linuxãƒ™ãƒ¼ã‚¹ã€‚ãƒãƒ¼ã‚¸ãƒ§ãƒ³ã¯å¤§ä½“3.07ã¨ã‹3.08ãã‚‰ã„ã€‚ã‚ˆãåˆ†ã‹ã‚‰ãªã„éƒ¨åˆ†ã‚‚ã¨ã‚Šã‚ãˆãšæ›¸ã„ã¦ã„ã‚‹ã®ã§ã€å¤šåˆ†é–“é•ã„å¤šæ•°ã€‚å¾ã€…ã«è¿½åŠ ã¨ã‹ä¿®æ£ã¨ã‹ã™ã‚‹äºˆå®šã€‚ä»Šã®ã¨ã“ã‚ã‚ªãƒ–ã‚¸ã‚§ã‚¯ãƒˆã¨ãƒ¢ã‚¸ãƒ¥ãƒ¼ãƒ«ã®ã¨ã“ã‚ã®å†…å®¹ã¯ç©ºã€‚ ãƒ„ãƒ¼ãƒ«ã®ä½¿ã„æ–¹ èµ·å‹•ã¨çµ‚äº†ã®ä»•æ–¹ OCamlã®ã‚¤ãƒ³ã‚¿ãƒ—ãƒªã‚¿ã‚’èµ·å‹•ã•ã›ã‚‹ã«ã¯ã‚·ã‚§ãƒ«ã‹ã‚‰æ¬¡ã®ã‚ˆã†ã«å…¥åŠ›ã™ã‚‹ã€‚ [radio@taka radio]$ ocaml Objective Caml version 3.08.0 # çµ‚äº†ã¯ #ã€€#quit;; ã¨æ‰“ã¡è¾¼ã‚€ã€‚ãƒã‚¤ãƒˆã‚³ãƒ³ãƒ‘ã‚¤ãƒ«ã¯ã‚·ã‚§ãƒ«ã‹ã‚‰ [radio@taka radio]$ã€€ocamlc hoge.ml -o hoge ãƒã‚¤ãƒ†ã‚£ãƒ–ã‚³ãƒ³ãƒ‘ã‚¤ãƒ«ã¯ [radio@taka radio]$ã€€ocamlopt hoge.ml -o hoge ã¨ã™ã‚‹ã€‚ ã¾ãŸæ¬¡ã®ã‚ˆã†ã«ã™ã‚‹ã¨èµ·å‹•æ™‚ã«ãƒ•ã‚¡ã‚¤ãƒ«ã‚’èªã¿è¾¼ã‚€ã“ã¨ãŒã§ãã‚‹ [radio@ta
TaKUMA 2010/09/29
OCaml

Programming

reference

Tips
ãƒªãƒ³ã‚¯
OCamlãƒãƒ¥ãƒ¼ãƒˆãƒªã‚¢ãƒ«
ã“ã®ã‚¦ã‚§ãƒ–ã‚µã‚¤ãƒˆã¯OCamlã‚’å¦ã¼ã†ã¨ã™ã‚‹äººãŸã¡ã®ç‚ºã®å®Ÿéš›çš„ã§è©³ç´°ãªãƒãƒ¥ãƒ¼ãƒˆãƒªã‚¢ãƒ«ã‚’é›†ã‚ãŸã‚‚ã®ã§ã‚ã‚‹ã€‚ ã‚ˆãçŸ¥ã‚‰ã‚Œã¦ã„ã‚‹é€šã‚Šã€OCamlã¯ã‚¢ãƒ—ãƒªã‚±ãƒ¼ã‚·ãƒ§ãƒ³é–‹ç™ºã®ãŸã‚ã®é«˜é€Ÿã€ç°¡æ½”ã‹ã¤å¼·åŠ›ãªè¨€èªžã§ã‚ã‚‹ã€‚ã“ã“ã§ã¯èªè€…ãŒã™ã§ã«OCamlã®å‡¦ç†ç³»ã‚’ã‚¤ãƒ³ã‚¹ãƒˆãƒ¼ãƒ«ã—ã¦ã„ã‚‹ã‚‚ã®ã¨ä»®å®šã™ã‚‹ã€‚ã‚¤ãƒ³ã‚¹ãƒˆãƒ¼ãƒ«ã®æ–¹æ³•ã«ã¤ã„ã¦ã¯è‹±æ–‡ã§ã‚ã‚‹ãŒOCamlã®ãƒ¡ã‚¤ãƒ³ãƒšãƒ¼ã‚¸ã‚„OCaml Alianceã«ã‚ˆã‚‹è§£èª¬ã«èª¬æ˜Žã•ã‚Œã¦ã„ã‚‹ã€‚ã¾ãŸDebianãã®ä»–ã®Linuxãƒ‡ã‚£ã‚¹ãƒˆãƒªãƒ“ãƒ¥ãƒ¼ã‚·ãƒ§ãƒ³ã€FreeBSDãƒ‘ãƒƒã‚±ãƒ¼ã‚¸ã«ã‚‚ãªã£ã¦ã„ã‚‹ã€‚ åŽŸæ–‡(è‹±èªž) é‚¦è¨³ç‰ˆã«é–¢ã™ã‚‹ãƒ„ãƒƒã‚³ãƒŸãªã©
TaKUMA 2010/09/29
OCaml

Programming

reference

Tutorial
ãƒªãƒ³ã‚¯
The Caml language: Home
Caml is a general-purpose programming language, designed with program safety and reliability in mind. It is very expressive, yet easy to learn and use. Caml supports functional, imperative, and object-oriented programming styles. It has been developed and distributed by INRIA, a French research institute in computer science and applied mathematics, since 1985. The OCaml system is the main implemen
TaKUMA 2010/09/29
OCaml

Programming

Language
ãƒªãƒ³ã‚¯
OCaml - Wikipedia
OCamlï¼ˆ[oÊŠËˆkÃ¦mÉ™l] oh-KAM-É™lã€ã‚ªãƒ¼ã‚ãƒ£ãƒ ãƒ«ã€ã‚ªãƒ¼ã‚ãƒ£ãƒ¡ãƒ«ï¼‰ã¯ã€ãƒ•ãƒ©ãƒ³ã‚¹ã® INRIA ãŒé–‹ç™ºã—ãŸãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°è¨€èªžMLã®æ–¹è¨€ã¨ãã®å®Ÿè£…ã§ã‚ã‚‹ã€‚MLã®å„è¦ç´ ã«åŠ ãˆã€ã‚ªãƒ–ã‚¸ã‚§ã‚¯ãƒˆæŒ‡å‘çš„è¦ç´ ã®è¿½åŠ ãŒç‰¹é•·ã§ã‚ã‚‹ã€‚ã‹ã¤ã¦ã¯ Objective Caml ã¨ã„ã†åå‰ã§ã€ãã®ç•¥ã¨ã—ã¦ OCaml ã¨åºƒãå‘¼ã°ã‚Œã¦ã„ãŸãŒã€æ£å¼ã« OCaml ã«æ”¹åã•ã‚ŒãŸ[2]ã€‚ ã‚‚ã¨ã¯Camlã¨ã„ã†åå‰ã®ã€MLã®æ–¹è¨€ã®å‡¦ç†ç³»å®Ÿè£…ã€ãŠã‚ˆã³è¨€èªžã§ã‚ã£ãŸã€‚ã“ã®åå‰ã¯categorical abstract machine languageã®é å—èªžã«ç”±æ¥ã™ã‚‹ï¼ˆen:Categorical abstract machineã‚‚å‚ç…§ï¼‰ã€‚ã‚„ãŒã¦ã€categorical abstract machineã‚ˆã‚Šã‚‚åŠ¹çŽ‡ã®è‰¯ã„æŠ½è±¡æ©Ÿæ¢°ãƒ™ãƒ¼ã‚¹ã«æ›¸ãç›´ã•ã‚Œã€ã‚¯ãƒ©ã‚¹ã‚„ç¶™æ‰¿ãªã©ã‚¯ãƒ©ã‚¹ãƒ™ãƒ¼ã‚¹ã‚ªãƒ–ã‚¸ã‚§ã‚¯ãƒˆæŒ‡å‘ã®è¨€èªžæ©Ÿèƒ½ãŒè¿½åŠ ã•ã‚Œ Obj
TaKUMA 2010/09/29
OCaml

Programming

Wikipedia

Language
ãƒªãƒ³ã‚¯
1