Software Foundations
The Software Foundations series is a broad introduction to the mathematical underpinnings of reliable software. The principal novelty of the series is that every detail is one hundred percent formalized and machine-checked: the entire text of each volume, including the exercises, is literally a "proof script" for the Coq proof assistant. The exposition is intended for a broad range of readers, fro
Domain Modeling Made Functional (KanDDDinsky 2019)
(video at https://fsharpforfunandprofit.com/ddd/) Statically typed functional programming languages encourage a very different way of thinking about types. The type system is your friend, not an annoyance, and can be used in many ways that might not be familiar to OO programmers. Types can be used to represent the domain in a fine-grained, self documenting way. And in many cases, types can even be
Functional Programming Patterns (BuildStuff '14)
(video of these slides available here http://fsharpforfunandprofit.com/fppatterns/) In object-oriented development, we are all familiar with design patterns such as the Strategy pattern and Decorator pattern, and design principles such as SOLID. The functional programming community has design patterns and principles as well. This talk will provide an overview of some of these, and present some dem
状態ã€åž‹ã€æŠ½è±¡åŒ–ã«ã¤ã„ã¦ã„ã‚ã„ã‚
ãµã¿ (DJ Monad) @fumieval オブジェクト指å‘å‘ãã®è¨€èªžã¯ã€æ§˜ã€…ãªçŠ¶æ…‹ã¨ãã‚Œã«å¯¾ã™ã‚‹æ‰‹ç¶šãを独立ã—ãŸã€Œã‚ªãƒ–ジェクトã€ã«åˆ‡ã‚Šé›¢ã™ã“ã¨ãŒã§ãã‚‹ãŒã€æ‰‹ç¶šããã®ã‚‚ã®ã¯ãƒ•ã‚¡ãƒ¼ã‚¹ãƒˆã‚¯ãƒ©ã‚¹ã§ã¯ãªã„。Haskellã®å ´åˆã¯çœŸé€†ã§ã€å¥½ããªã‚ˆã†ã«æ‰‹ç¶šãを定義ã§ãã‚‹ãŒã€çŠ¶æ…‹ã‚’制御å¯èƒ½ã«ã—ãŸã¾ã¾åˆ†é›¢ã™ã‚‹ä»•çµ„ã¿ãŒãªã‹ã£ãŸã€‚ ãµã¿ (DJ Monad) @fumieval …ã¨ã„ã†ã®ã‚’昨日山本ã•ã‚“ã«è©±ã—ãŸã€‚ã“ã‚ŒãŒå¾“æ¥ã®OOPã®ä¸–ç•Œã¨Haskellã®ã‚¹ã‚¿ã‚¤ãƒ«ã®é–“ã«ã‚る地æºã§ã€ã“ã“ã«æ©‹ã‚’ã‹ã‘ãªã„é™ã‚Šã€çŠ¶æ…‹ã«ã¤ã„ã¦ä¸è‡ªç”±ãŒç™ºç”Ÿã—続ã‘ã‚‹ã ã‚ã†
OCaml ã® let 㨠let rec ã¯ãªãœåˆ¥æ‰±ã„ã«ãªã£ã¦ã„ã‚‹ã®ã‹ã€æ±ºå®šç‰ˆã€ã‚‚ã—ã㯠OCaml 暦å何年ã ã£ãŸã‹å¿˜ã‚ŒãŸã‘ã©ä»•äº‹ã§ Haskell を一年使ã£ã¦ã¿ãŸ - camlspotter’s blog
ã¯ã˜ã‚ã«æ–ã£ã¦ãŠããŒã€å…¨éƒ¨Pros/Consã®ã‚るデザインãƒãƒ§ã‚¤ã‚¹ãªã®ã§ã€ã“ã†ã˜ã‚ƒãªãゃã„ã‘ãªã„ã£ã¦ã“ã¨ã§ã¯ãªã„。ãŸã 〠OCaml ã¯ã“ã®é¸æŠžã‚’ã—ãŸã€ãã„ã†äº‹ã 。 å‰å›žã®ã€ŒçµŒé¨“15å¹´ã® OCaml ユーザー㌠Haskell を仕事ã§åŠå¹´ä½¿ã£ã¦ã¿ãŸã€ http://d.hatena.ne.jp/camlspotter/20101212/1292165692 ã®ã‚ˆã†ãªæ˜“ã—ã„æ–‡ç« ã§ã¯ãªã„ã®ã§ã‚ã‹ã‚‰ãªã„人ã¯ã¨ã“ã¨ã‚“判らãªã„ã ã‚ã†ã€‚ã¾ã‚勘å¼ã—ã¦æ¬²ã—ã„。 ã‚ã¨ã€é¢å€’ã ã‚ã†ãŒã€èªã‚€äººã¯å…¨éƒ¨å¸¸ä½“を敬体ã«ã—ã¦æœ€å¾Œã«ã€Œã¨æ€ã„ã¾ã™ã€ã‚’ã¤ã‘ã¦èªã‚“ã§ãれ。ãã ã•ã„ã€ã¨æ€ã„ã¾ã™ã€‚ Shadowing ã¯ä¾¿åˆ©ã§ã‚ã‚‹ã¨æ€ã£ã¦ã„ã‚‹ OCaml ã® let ã¯éžå†å¸°ãªã®ã§ä»¥å‰å®šç¾©ã•ã‚ŒãŸåå‰ã«åˆ¥ã®å€¤ã®æŸç¸›ã‚’オーãƒãƒ¼ãƒ©ã‚¤ãƒ‰ã§ãる。OCaml ã®äººã¯ã“ã‚ŒãŒä¾¿åˆ©ã ã¨æ€ã£ã¦ãŠã‚Šçš†æ™®é€šã«ä½¿ã£ã¦ã„る。詳ã—ã㯠http://d.hat
関手データモデルï¼åœè«–データベース： ãã®å¾Œã®ç™ºå±•ã¨ç¾çŠ¶ (2016) - 檜山æ£å¹¸ã®ã‚マイラ飼育記 (ã¯ã¦ãªBlog)
2013å¹´ã®åˆé ã«ã€ãƒ‡ã‚¤ãƒ´ã‚£ãƒƒãƒ‰ãƒ»ã‚¹ãƒ”ヴァックã®é–¢æ‰‹ãƒ‡ãƒ¼ã‚¿ãƒ¢ãƒ‡ãƒ«ï¼ˆfunctorial data model）ã«ã¤ã„ã¦ç´¹ä»‹ã—ã¾ã—ãŸã€‚ デイヴィッド・スピヴァックã¯ãƒ‡ãƒ¼ã‚¿ãƒ™ãƒ¼ã‚¹ç•Œã®é©å‘½å…ã‹ -- 関手的データモデル è¡æ’ƒçš„ãªãƒ‡ãƒ¼ã‚¿ãƒ™ãƒ¼ã‚¹ç†è«–・関手的データモデル 入門 ã‚ã‚Œã‹ã‚‰3å¹´3ヶ月ãŒçµŒéŽã—ã¦ã€ä»Šã€é–¢æ‰‹ãƒ‡ãƒ¼ã‚¿ãƒ¢ãƒ‡ãƒ«ã‚„åœè«–データベース（categorical database）ã®çŠ¶æ³ã¯ã©ã†ãªã£ã¦ã„ã‚‹ã§ã—ょã†ã‹ã€‚ 一言ã§ã„ãˆã°ã€ 派手ã«å–§ä¼ã¯ã•ã‚Œã¦ãªã„ãŒã€ç€å®Ÿã«ç™ºå±•ã—ã¦ã„ã‚‹ ã¨ãªã‚‹ã§ã—ょã†ã€‚ãã®é€²å±•ã®æ§˜åを次ã®3ã¤ã®å´é¢ã‹ã‚‰æ¦‚観ã—ã¦ã¿ã¾ã™ã€‚ ビジãƒã‚¹ ソフトウェア ç†è«– 内容： ビジãƒã‚¹ï¼š Categorical Informatics, Inc ソフトウェア： FQL IDE ç†è«–： ç‰å¼è«–ç†ã¨ä»£æ•°ãƒ‡ãƒ¼ã‚¿ãƒ™ãƒ¼ã‚¹ ※ リンクã¨æ³¨é‡ˆãŒãŸãã•ã‚“ã‚ã‚‹ã®ã¯ã€ã“ã®è¨˜äº‹ãŒã€ã“ã®è©±é¡Œã«é–¢ã™ã‚‹èª¬æ˜Žä»˜ãブックマ
Optimizing Hash-Array Mapped Tries for Fast and Lean Immutable JVM Collections | the morning paper
the morning paper a random walk through Computer Science research, by Adrian Colyer Made delightfully fast by strattic Optimizing Hash-Array Mapped Tries for Fast and Lean Immutable JVM Collections – Steinforder & Vinju, 2015 You’d think that the collection classes in modern JVM-based languages would be highly efficient at this point in time – and indeed they are. But the wonderful thing is that t
Computer Laboratory – Course pages 2014–15: Advanced Functional Programming – Course materials
Mailing list There is a mailing list for the course: [email protected]. Announcements, questions and discussion. Feel free to post! Have a question but feeling shy? Mail a lecturer instead and we'll anonymise and post your question: jerem[email protected] or leo.whit[email protected]. Preparation If you haven't used a typed functional language before then it would be wise to familiarize y
What's new in purely functional data structures since Okasaki?
Since Chris Okasaki's 1998 book "Purely functional data structures", I haven't seen too many new exciting purely functional data structures appear; I can name just a few: IntMap (also invented by Okasaki in 1998, but not present in that book) Finger trees (and their generalization over monoids) There are also some interesting ways of implementing already known datastructures, such as using "nested
More monads in OCaml
While popular in Haskell, monads can be encoded effectively in OCaml too. This post describes one such encoding, as well as the process of developing a modern OCaml program. I assume that you know what monads are and why you should care about them. If this is not the case, then there are some excellent books 1 out there. Introduction Haskell is famous for the integration of monads in its core lang
F# for fun and profit
Do you want to understand what all the fuss about functional programming is about? This site will introduce you to F# and show you ways that F# can help in day-to-day development of mainstream commercial business software. On the way, I hope to open your mind to the joys of functional programming – it really is fun! If you have never heard of F#, it is a general purpose functional/hybrid programmi
1
ランã‚ング
ランã‚ング
ランã‚ング
リリースã€éšœå®³æƒ…å ±ãªã©ã®ã‚µãƒ¼ãƒ“スã®ãŠçŸ¥ã‚‰ã›
最新ã®äººæ°—エントリーã®é…ä¿¡
j次ã®ãƒ–ックマーク
kå‰ã®ãƒ–ックマーク
lã‚ã¨ã§èªã‚€
eコメント一覧を開ã
oページを開ã
オブジェクト指å‘ã¨ã¯ä½•ã ã£ãŸã®ã‹ï¼Ÿ – ゆã³ã¦ã
{{#tags}}- {{label}}
{{/tags}}