The Comonad.Reader » Recursion Schemes: A Field Guide
I talk an awful lot about different recursion schemes in this blog. What I want to do for the next few posts is taxonomize a list of the general recursion schemes I have seen, cite the original references for them where available, and provide a concise implementation of each and try to motivate the connections between them. I'll likely go back through and add more information or post motivating e
Category Theory and the category of Haskell programs : Part 1
Category Theory and the category of Haskell programs : Part 1 Posted by alpheccar - Jun 18 2007 at 22:59 CEST "Category theory" is an expression that is generally frightening people. But, if you have attempted to read some research papers in Computer Science, Mathematics, Physics or even Philosophy, you've surely remarked that Category theory is used a lot and you probably asked yourself : what i
Category theory - HaskellWiki
Category theory can be helpful in understanding Haskell's type system. There exists a "Haskell category", of which the objects are Haskell types, and the morphisms from types a to b are Haskell functions of type a -> b. The Haskell wikibooks has an introduction to Category theory, written specifically with Haskell programmers in mind. Definition of a category A category consists of two collections
Haskell/Category theory - Wikibooks, open books for an open world
This article attempts to give an overview of category theory, in so far as it applies to Haskell. To this end, Haskell code will be given alongside the mathematical definitions. Absolute rigour is not followed; in its place, we seek to give the reader an intuitive feel for what the concepts of category theory are and how they relate to Haskell. A simple category, with three objects A, B and C, thr
1
リリース、障害情報などのサービスのお知らせ
最新の人気エントリーの配信
処理を実行中です
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く
Index of /~sheard/course/AdvancedFP
