单子 (函数式编程) (Chinese Wikipedia)

Analysis of information sources in references of the Wikipedia article "单子 (函数式编程)" in Chinese language version.

refsWebsite

Global rank Chinese rank

18web.archive.org

1^st place

7haskell.org

low place

4doi.org

2^nd place

23^rd place

2unige.it

low place

2microsoft.com

153^rd place

238^th place

1wikipedia.org

low place

1realworldhaskell.org

low place

1stackoverflow.com

4,643^rd place

3,964^th place

1tufts.edu

155^th place

474^th place

1jsoftware.com

low place

1worldcat.org

5^th place

12^th place

1ams.org

451^st place

935^th place

1vub.ac.be

low place

8,042^nd place

1sigfpe.com

low place

ams.org

Kleisli, Heinrich. Every standard construction is induced by a pair of adjoint functors (PDF). Proceedings of the American Mathematical Society. 1965, 16 (3): 544–546 [19 November 2018]. doi:10.1090/S0002-9939-1965-0177024-4. （原始内容存档 (PDF)于2018-07-26）.

doi.org

Moggi, Eugenio. Notions of computation and monads (PDF). Information and Computation. 1991, 93 (1): 55–92 [2021-02-04]. doi:10.1016/0890-5401(91)90052-4. （原始内容存档 (PDF)于2011-03-22）.
Spivey, Mike. A functional theory of exceptions (PDF). Science of Computer Programming. 1990, 14 (1): 25–42 [2021-02-04]. doi:10.1016/0167-6423(90)90056-J. （原始内容存档 (PDF)于2020-08-21）.
Iverson, Kenneth. A dictionary of APL. APL Quote Quad. September 1987, 18 (1): 5–40 [19 November 2018]. ISSN 1088-6826. doi:10.1145/36983.36984. （原始内容存档于2020-04-25）.
Kleisli, Heinrich. Every standard construction is induced by a pair of adjoint functors (PDF). Proceedings of the American Mathematical Society. 1965, 16 (3): 544–546 [19 November 2018]. doi:10.1090/S0002-9939-1965-0177024-4. （原始内容存档 (PDF)于2018-07-26）.

haskell.org

wiki.haskell.org

Do notation considered harmful. HaskellWiki. [12 October 2018]. （原始内容存档于2020-11-08）.
What a Monad is not. 7 October 2018 [2021-02-04]. （原始内容存档于2021-02-09）.
Monad (sans metaphors). HaskellWiki. 1 November 2009 [24 October 2018]. （原始内容存档于2020-08-21）.
Applicative functor. HaskellWiki. Haskell.org. 7 May 2018 [20 November 2018]. （原始内容存档于2018-10-30）.
Gibbard, Cale. Monads as containers. HaskellWiki. Haskell.org. 30 December 2011 [20 November 2018]. （原始内容存档于2017-12-14）.

haskell.org

Hudak, Paul; Peterson, John; Fasel, Joseph. About Monads. A Gentle Introduction to Haskell 98. 1999. chapter 9 [2021-02-04]. （原始内容存档于2021-01-26）.
Monad laws. HaskellWiki. haskell.org. [14 October 2018]. （原始内容存档于2015-01-03）.

jsoftware.com

Iverson, Kenneth. A dictionary of APL. APL Quote Quad. September 1987, 18 (1): 5–40 [19 November 2018]. ISSN 1088-6826. doi:10.1145/36983.36984. （原始内容存档于2020-04-25）.

microsoft.com

blogs.msdn.microsoft.com

Some Details on F# Computation Expressions. [9 October 2018]. （原始内容存档于2019-01-30）.

microsoft.com

Peyton Jones, Simon L.; Wadler, Philip. Imperative functional programming (PDF). 20th Annual ACM Symposium on Principles of Programming Languages. Charleston, South Carolina. January 1993 [2021-02-04]. （原始内容存档 (PDF)于2020-11-01）.

realworldhaskell.org

book.realworldhaskell.org

O'Sullivan, Bryan; Goerzen, John; Stewart, Don. Monads. Real World Haskell. Sebastopol, California: O'Reilly Media. 2009. chapter 14 [2021-02-04]. ISBN 978-0596514983. （原始内容存档于2021-01-14）.

sigfpe.com

blog.sigfpe.com

Piponi, Dan. You Could Have Invented Monads! (And Maybe You Already Have.). A Neighborhood of Infinity. 7 August 2006 [2021-02-08]. （原始内容存档于2009-03-30）.

stackoverflow.com

C. A. McCann's answer (Jul 23 '10 at 23:39) How and why does the Haskell Cont monad work?. [2021-02-04]. （原始内容存档于2020-11-26）.

tufts.edu

cs.tufts.edu

Spivey, Mike. A functional theory of exceptions (PDF). Science of Computer Programming. 1990, 14 (1): 25–42 [2021-02-04]. doi:10.1016/0167-6423(90)90056-J. （原始内容存档 (PDF)于2020-08-21）.

unige.it

disi.unige.it

Moggi, Eugenio. Notions of computation and monads (PDF). Information and Computation. 1991, 93 (1): 55–92 [2021-02-04]. doi:10.1016/0890-5401(91)90052-4. （原始内容存档 (PDF)于2011-03-22）.
Moggi, Eugenio. Computational lambda-calculus and monads (PDF). Fourth Annual Symposium on Logic in computer science. Pacific Grove, California. June 1989 [2021-02-05]. （原始内容存档 (PDF)于2018-09-24）.

vub.ac.be

soft.vub.ac.be

De Meuter, Wolfgang. Monads as a theoretical foundation for AOP (PDF). International Workshop on Aspect Oriented Programming at ECOOP. Jyväskylä, Finland. 1997 [2021-02-04]. （原始内容存档 (PDF)于2012-04-15）.

web.archive.org

O'Sullivan, Bryan; Goerzen, John; Stewart, Don. Monads. Real World Haskell. Sebastopol, California: O'Reilly Media. 2009. chapter 14 [2021-02-04]. ISBN 978-0596514983. （原始内容存档于2021-01-14）.
Moggi, Eugenio. Notions of computation and monads (PDF). Information and Computation. 1991, 93 (1): 55–92 [2021-02-04]. doi:10.1016/0890-5401(91)90052-4. （原始内容存档 (PDF)于2011-03-22）.
Hudak, Paul; Peterson, John; Fasel, Joseph. About Monads. A Gentle Introduction to Haskell 98. 1999. chapter 9 [2021-02-04]. （原始内容存档于2021-01-26）.
C. A. McCann's answer (Jul 23 '10 at 23:39) How and why does the Haskell Cont monad work?. [2021-02-04]. （原始内容存档于2020-11-26）.
Spivey, Mike. A functional theory of exceptions (PDF). Science of Computer Programming. 1990, 14 (1): 25–42 [2021-02-04]. doi:10.1016/0167-6423(90)90056-J. （原始内容存档 (PDF)于2020-08-21）.
Monad laws. HaskellWiki. haskell.org. [14 October 2018]. （原始内容存档于2015-01-03）.
Some Details on F# Computation Expressions. [9 October 2018]. （原始内容存档于2019-01-30）.
Do notation considered harmful. HaskellWiki. [12 October 2018]. （原始内容存档于2020-11-08）.
Iverson, Kenneth. A dictionary of APL. APL Quote Quad. September 1987, 18 (1): 5–40 [19 November 2018]. ISSN 1088-6826. doi:10.1145/36983.36984. （原始内容存档于2020-04-25）.
Kleisli, Heinrich. Every standard construction is induced by a pair of adjoint functors (PDF). Proceedings of the American Mathematical Society. 1965, 16 (3): 544–546 [19 November 2018]. doi:10.1090/S0002-9939-1965-0177024-4. （原始内容存档 (PDF)于2018-07-26）.
Moggi, Eugenio. Computational lambda-calculus and monads (PDF). Fourth Annual Symposium on Logic in computer science. Pacific Grove, California. June 1989 [2021-02-05]. （原始内容存档 (PDF)于2018-09-24）.
Peyton Jones, Simon L.; Wadler, Philip. Imperative functional programming (PDF). 20th Annual ACM Symposium on Principles of Programming Languages. Charleston, South Carolina. January 1993 [2021-02-04]. （原始内容存档 (PDF)于2020-11-01）.
What a Monad is not. 7 October 2018 [2021-02-04]. （原始内容存档于2021-02-09）.
De Meuter, Wolfgang. Monads as a theoretical foundation for AOP (PDF). International Workshop on Aspect Oriented Programming at ECOOP. Jyväskylä, Finland. 1997 [2021-02-04]. （原始内容存档 (PDF)于2012-04-15）.
Monad (sans metaphors). HaskellWiki. 1 November 2009 [24 October 2018]. （原始内容存档于2020-08-21）.
Applicative functor. HaskellWiki. Haskell.org. 7 May 2018 [20 November 2018]. （原始内容存档于2018-10-30）.
Gibbard, Cale. Monads as containers. HaskellWiki. Haskell.org. 30 December 2011 [20 November 2018]. （原始内容存档于2017-12-14）.
Piponi, Dan. You Could Have Invented Monads! (And Maybe You Already Have.). A Neighborhood of Infinity. 7 August 2006 [2021-02-08]. （原始内容存档于2009-03-30）.

wikipedia.org

en.wikipedia.org

由于编程中常见在多个自由变量上的函数的事实，本文中描述的单子在技术上是范畴论学者所称谓的强单子（英语：strong monad）^[2]

worldcat.org

Iverson, Kenneth. A dictionary of APL. APL Quote Quad. September 1987, 18 (1): 5–40 [19 November 2018]. ISSN 1088-6826. doi:10.1145/36983.36984. （原始内容存档于2020-04-25）.