Syntactic sugar (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Syntactic sugar" in English language version.

refsWebsite

Global rank English rank

4doi.org

2^nd place

4microsoft.com

153^rd place

151^st place

3web.archive.org

1^st place

3semanticscholar.org

11^th place

8^th place

2books.google.com

3^rd place

2catb.org

3,959^th place

3,208^th place

2mit.edu

415^th place

327^th place

1cmu.edu

1,564^th place

1,028^th place

1rice.edu

3,843^rd place

2,772^nd place

1stackexchange.com

1,983^rd place

1,330^th place

1python.org

2,232^nd place

1,903^rd place

1r-project.org

7,871^st place

5,225^th place

1stackoverflow.com

4,643^rd place

2,973^rd place

1uni-tuebingen.de

8,201^st place

low place

1archive.org

6^th place

1llvm.org

low place

7,917^th place

1medium.com

551^st place

406^th place

archive.org

Dean, Thomas (2004). Talking with Computers: Explorations in the Science and Technology of Computing. Cambridge University Press. p. 115. ISBN 9780521542043.

books.google.com

Raymond, Eric S. (11 October 1996). The New Hacker's Dictionary – 3rd Edition. MIT Press. p. 432. ISBN 978-0-262-68092-9. Retrieved 5 August 2012.
Boiten, Eerke A.; Möller, Bernhard (2002-06-26). Mathematics of Program Construction. Springer. ISBN 9783540438571. Retrieved 3 August 2015.

catb.org

"The Jargon File - syntactic salt". 2003-06-12. Archived from the original on 2003-06-12. Retrieved 2018-03-19.
"syntactic sugar". catb.org. Retrieved 3 August 2015.

cmu.edu

cs.cmu.edu

Landin, Peter J. (1964). "The mechanical evaluation of expressions" (PDF). The Computer Journal. 6 (4). Computer Journal: 308–320. doi:10.1093/comjnl/6.4.308. Retrieved 21 July 2014.

doi.org

Landin, Peter J. (1964). "The mechanical evaluation of expressions" (PDF). The Computer Journal. 6 (4). Computer Journal: 308–320. doi:10.1093/comjnl/6.4.308. Retrieved 21 July 2014.
Felleisen, Matthias (December 1991). "On the Expressive Power of Programming Languages". Science of Computer Programming. 17 (1–3). Springer-Verlag: 35–75. doi:10.1016/0167-6423(91)90036-W. Retrieved 19 July 2014.
Perlis 1982, Epigram #3. Perlis, A. J. (September 1982). "Epigrams on programming". ACM SIGPLAN Notices. 17 (9). New York, NY, USA: Association for Computing Machinery: 7–13. doi:10.1145/947955.1083808. S2CID 20512767. Archived from the original on January 17, 1999.
Harrison, William; Sheard, Tim (July 8–10, 2002). "Mathematics of Program Construction" (PDF). Mathematics of Program Construction: 6th International Conference, MPC 2002, Dagstuhl Castle, Germany, July 8–10, 2002. Proceedings. International Conference on Mathematics of Program Construction. Lecture Notes in Computer Science. Vol. 2386. Dagstuhl Castle, Germany: Springer Berlin Heidelberg. p. 93. doi:10.1007/3-540-45442-X_6. ISBN 978-3-540-43857-1. S2CID 10059915. Archived from the original (PDF) on March 31, 2017.

llvm.org

clang.llvm.org

"C Language LLVM Documentation". clang.llvm.org. Retrieved 30 June 2020.

medium.com

"The Secret Life of Types in Swift". medium.com/@slavapestov. 14 July 2016. Retrieved 30 June 2020.

microsoft.com

msdn.microsoft.com

"C Compound Assignment". msdn.microsoft.com. Microsoft. Retrieved 20 June 2016. However, the compound-assignment expression is not equivalent to the expanded version because the compound-assignment expression evaluates expression1 only once, while the expanded version evaluates expression1 twice: in the addition operation and in the assignment operation.
"using Statement (C# Reference)". Retrieved 16 September 2014.
"new Modifier (C# Reference)". microsoft.com. Microsoft. Retrieved 3 August 2015.
"switch (C# Reference)". microsoft.com. Microsoft. Retrieved 3 August 2015.

mit.edu

mitpress.mit.edu

Abelson & Sussman 1996, Chapter 1, footnote 11. Abelson, Harold; Sussman, Gerald Jay; Sussman, Julie (1996) [1984]. Structure and Interpretation of Computer Programs. Cambridge, MA: MIT Press. ISBN 0-262-51087-1.

web.mit.edu

Abelson & Sussman 1996, Chapter 1, footnote 11. Abelson, Harold; Sussman, Gerald Jay; Sussman, Julie (1996) [1984]. Structure and Interpretation of Computer Programs. Cambridge, MA: MIT Press. ISBN 0-262-51087-1.

python.org

docs.python.org

"Python Data model". docs.python.org. 21 December 2020.

r-project.org

cran.r-project.org

"magrittr: Vignette". Retrieved 24 December 2018.

rice.edu

cs.rice.edu

Felleisen, Matthias (December 1991). "On the Expressive Power of Programming Languages". Science of Computer Programming. 17 (1–3). Springer-Verlag: 35–75. doi:10.1016/0167-6423(91)90036-W. Retrieved 19 July 2014.

semanticscholar.org

api.semanticscholar.org

Perlis 1982, Epigram #3. Perlis, A. J. (September 1982). "Epigrams on programming". ACM SIGPLAN Notices. 17 (9). New York, NY, USA: Association for Computing Machinery: 7–13. doi:10.1145/947955.1083808. S2CID 20512767. Archived from the original on January 17, 1999.
Harrison, William; Sheard, Tim (July 8–10, 2002). "Mathematics of Program Construction" (PDF). Mathematics of Program Construction: 6th International Conference, MPC 2002, Dagstuhl Castle, Germany, July 8–10, 2002. Proceedings. International Conference on Mathematics of Program Construction. Lecture Notes in Computer Science. Vol. 2386. Dagstuhl Castle, Germany: Springer Berlin Heidelberg. p. 93. doi:10.1007/3-540-45442-X_6. ISBN 978-3-540-43857-1. S2CID 10059915. Archived from the original (PDF) on March 31, 2017.

pdfs.semanticscholar.org

Harrison, William; Sheard, Tim (July 8–10, 2002). "Mathematics of Program Construction" (PDF). Mathematics of Program Construction: 6th International Conference, MPC 2002, Dagstuhl Castle, Germany, July 8–10, 2002. Proceedings. International Conference on Mathematics of Program Construction. Lecture Notes in Computer Science. Vol. 2386. Dagstuhl Castle, Germany: Springer Berlin Heidelberg. p. 93. doi:10.1007/3-540-45442-X_6. ISBN 978-3-540-43857-1. S2CID 10059915. Archived from the original (PDF) on March 31, 2017.

stackexchange.com

programmers.stackexchange.com

Garavaglia, Emilio (26 July 2015). "Why are shortcuts like x += y considered good practice?". stackexchange.com. Retrieved 20 June 2016. optimization can [be done] if 'finding x' has no side effects

stackoverflow.com

"Stack Overflow: What does the triple question mark mean in scala?". Retrieved 23 January 2024.

uni-tuebingen.de

www-pu.informatik.uni-tuebingen.de

Perlis 1982, Epigram #3. Perlis, A. J. (September 1982). "Epigrams on programming". ACM SIGPLAN Notices. 17 (9). New York, NY, USA: Association for Computing Machinery: 7–13. doi:10.1145/947955.1083808. S2CID 20512767. Archived from the original on January 17, 1999.

web.archive.org

Perlis 1982, Epigram #3. Perlis, A. J. (September 1982). "Epigrams on programming". ACM SIGPLAN Notices. 17 (9). New York, NY, USA: Association for Computing Machinery: 7–13. doi:10.1145/947955.1083808. S2CID 20512767. Archived from the original on January 17, 1999.
"The Jargon File - syntactic salt". 2003-06-12. Archived from the original on 2003-06-12. Retrieved 2018-03-19.
Harrison, William; Sheard, Tim (July 8–10, 2002). "Mathematics of Program Construction" (PDF). Mathematics of Program Construction: 6th International Conference, MPC 2002, Dagstuhl Castle, Germany, July 8–10, 2002. Proceedings. International Conference on Mathematics of Program Construction. Lecture Notes in Computer Science. Vol. 2386. Dagstuhl Castle, Germany: Springer Berlin Heidelberg. p. 93. doi:10.1007/3-540-45442-X_6. ISBN 978-3-540-43857-1. S2CID 10059915. Archived from the original (PDF) on March 31, 2017.