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
高階ã“ã¨ã‚Š Website
@dico_lequeã•ã‚“ãŒæ›¸ã(予定ã®)モナドã®ã®è–„ã„本ã®ã‚¤ãƒ¡ãƒ¼ã‚¸ã‚ャラクターã§ã™ã€‚ ãŸã ã—ã€ãれ以外ã®ç”¨é€”ã«ã‚‚自由ã«åˆ©ç”¨ã§ãã¾ã™ã€‚ åå‰ã®èªã¿æ–¹ã¯ã€ŽãŸã‹ã—㪠ã“ã¨ã‚Šã€ã§ã™ã€‚
1
ランã‚ング
ランã‚ング
ãŠçŸ¥ã‚‰ã›
リリースã€éšœå®³æƒ…å ±ãªã©ã®ã‚µãƒ¼ãƒ“スã®ãŠçŸ¥ã‚‰ã›
最新ã®äººæ°—エントリーã®é…ä¿¡
処ç†ã‚’実行ä¸ã§ã™
j次ã®ãƒ–ックマーク
kå‰ã®ãƒ–ックマーク
lã‚ã¨ã§èªã‚€
eコメント一覧を開ã
oページを開ã
In Scheme, how do you use lambda to create a recursive function?
{{#tags}}- {{label}}
{{/tags}}