Haskell and State
Haskell is a pure functional programming language. My question is: What are the advantages and disadvantages of using Haskell to solve problems involving lots of state, for example GUI programming or game programming? Also a secondary question: what methods are there to handle state in a functional way? Thanks in advance.
Haskell の State モナド (1) - 状態を模倣する
昔、モナドがよくわからなかったので、さまよっていたら、 … ネットで見たMonadの説明で一番私がわかりやすいと思ったのは、Wikibooksの説明。Hello World!がブラックボックスな人は、是非一読を。 (404 Blog Not Found:Haskellで一番難しいのは より) 最初にこの Wikibooksの説明 を読んだのは去年の 11 月頃。そのときの文書のバージョンは 05:13, 27 October 2008 で、今は内容が随分増えている。前の文書は、現在の Haskell/Understanding monads/State に相当するようだ。 ところで、上記の解説を最初読んだとき全く意味がわからなかった。 (@_@;) 「3 Stateful Computations」 では、「ランダムな数字を生成する関数」を例に挙げてモナドの説明がされていたけれど、何が言
Memoise
Memoi[sz]e、Memoi[sz]ation、メモ化の話題 メモ化ってなぁに？関数のメモ化memoise は特殊な ($) かも？Memo モジュール実装を共有する魔法 メモ化ってなぁに？ フィボナッチ関数を考えてみよう、定義は fib 0 = 0 fib 1 = 1 fib n = fib (n-1) + fib (n-2) これを使って、fib 7 を計算すると fib 7 -- fib 6 -- fib 5 -- fib 4 -- fib 3 -- fib 2 -- fib 1 -- 1 | | | | | | | | | | | fib 0 -- 0 | | | | | | | | | fib 1 -- 1 | | | | | | | fib 2 -- fib 1 -- 1 | | | | | | | fib 0 -- 0 | | | | | fib 3
"state monad" cache - Google 検索
stackoverflow.com › questions › future-with-state-mon... 2014/07/20 · ... cache ( getThirdPartyData will return Failure ). Second option which came to my mind was to extend, or rather redefine State monad - s ...
2008-05-25
sampou.orgのhttp://www.sampou.org/cgi-bin/haskell.cgi?Memoiseをほとんど丸写しして，Stateモナドを使ってフィボナッチを書いてみました． import Control.Monad.State rfib :: Integer -> Integer rfib 0 = 0 rfib 1 = 1 rfib n = rfib (n-1) + rfib (n-2) type Cache = [(Integer,Integer)] -- キャッシュ cfib :: Integer -> State Cache Integer cfib 0 = return 0 cfib 1 = return 1 cfib n = do cache <- get case (lookup n cache) of Just k -> return k Nothin
memo site:okmij.org/ftp/Haskell/ - Google 検索
memo-array.lhs [2K] The literate Haskell code with explanations and the benchmark. The code was originally posted as Re: (Newbie) Dynamic Programming ...
MonadFix - HaskellWiki
The MonadFix typeclass provides the mfix method for value recursion. It can be used directly, or indirectly through the RecursiveDo extension. The GHC Users Guide has a section on RecursiveDo. It is useful for building cyclic data in monadic code. What it is not and what it is It is tempting to see “recursion” and guess it means performing actions recursively or repeatedly. No. It means recursion
Watch and Diamond Reviews Here!
People buy diamonds for different reasons. Make sure you do some research before you buy one. There are five tips for a successful diamond purchase. If you need these tips without the hassle of a salesperson, then read through and let your search begin. First, each stone should have a careful examination of how it reflects the light. A good diamond reflects light and has a glowing appearance. Gems
1
リリース、障害情報などのサービスのお知らせ
最新の人気エントリーの配信
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く
Optimizing longest Collatz chain in Haskell
Memoization in Haskell?
awkward monad transformer stack
Better pattern for caching results
Data.MemoCombinators
[Haskell-cafe] Memoization
Stretching the storage manager: weak pointers and stable names in Haskell - Microsoft Research
[Haskell-cafe] Memoization
https://groups.google.com/forum/#!topic/comp.lang.haskell/kkWnHtkLcSU
Haskell caching results of a function