Archives/papers-we-love_papers-we-love
1
0
Fork 0
mirror of https://github.com/papers-we-love/papers-we-love.git synced 2024-10-27 20:34:20 +00:00
Code Issues Projects Releases Wiki Activity
08d02b5bf6
papers-we-love_papers-we-love/combinatory_logic/README.md

15 lines
583 B
Markdown
Raw Normal View History

Add Combinatorial Analysis and Computers (1965) (#422) Changes: - add: *Combinatorial Analysis and Computers* (1965) to `combinatory_logic/README.md` list - add: year to the other paper in the README - fix: tweak format of papers README for readability Decisions: - I put this in the `combinatory_logic` folder, but I think it would also fit in the `comp_sci_fundamentals_and_history` folder (given Knuth's historical importance to the field and the more theoretical nature of the paper). This seemed more direct. --- Paper Title: Combinatorial Analysis and Computers Author(s): Marshall Hall Jr. and Donald E. Knuth Paper Year: 1965 Reasons for Including Paper: Papers We Love DC/NoVA will be discussing this paper (and others) at our November meetup. This paper is included in Donald Knuth's book *Selected Papers on Discrete Mathematics*. Knuth's writings have been extremely important to the field of computer science, and I think that most of his papers would fit in well here. This one introduces computational complexity and the benefits/limits of computing, then it dives into several combinatorial problems. I find it interesting because 1) it's a neat view of the possibilities and limitations of computation early on, and 2) the problems that he lays out are interesting exercises even today.
2016-10-30 12:38:53 +00:00
# Combinatory Logic
Adds section and paper on combinatory logic. Referenced by William Byrd on twitter.
2014-04-02 14:19:39 +00:00
Add Combinatorial Analysis and Computers (1965) (#422) Changes: - add: *Combinatorial Analysis and Computers* (1965) to `combinatory_logic/README.md` list - add: year to the other paper in the README - fix: tweak format of papers README for readability Decisions: - I put this in the `combinatory_logic` folder, but I think it would also fit in the `comp_sci_fundamentals_and_history` folder (given Knuth's historical importance to the field and the more theoretical nature of the paper). This seemed more direct. --- Paper Title: Combinatorial Analysis and Computers Author(s): Marshall Hall Jr. and Donald E. Knuth Paper Year: 1965 Reasons for Including Paper: Papers We Love DC/NoVA will be discussing this paper (and others) at our November meetup. This paper is included in Donald Knuth's book *Selected Papers on Discrete Mathematics*. Knuth's writings have been extremely important to the field of computer science, and I think that most of his papers would fit in well here. This one introduces computational complexity and the benefits/limits of computing, then it dives into several combinatorial problems. I find it interesting because 1) it's a neat view of the possibilities and limitations of computation early on, and 2) the problems that he lays out are interesting exercises even today.
2016-10-30 12:38:53 +00:00
* [Flattening Combinators: Surviving Without Parentheses]
Fix for URL to Flattening Combinators PDF (#548)
2019-06-06 17:41:41 +00:00
by Chris Okasaki (2003) ([DOI])
Add Combinatorial Analysis and Computers (1965) (#422) Changes: - add: *Combinatorial Analysis and Computers* (1965) to `combinatory_logic/README.md` list - add: year to the other paper in the README - fix: tweak format of papers README for readability Decisions: - I put this in the `combinatory_logic` folder, but I think it would also fit in the `comp_sci_fundamentals_and_history` folder (given Knuth's historical importance to the field and the more theoretical nature of the paper). This seemed more direct. --- Paper Title: Combinatorial Analysis and Computers Author(s): Marshall Hall Jr. and Donald E. Knuth Paper Year: 1965 Reasons for Including Paper: Papers We Love DC/NoVA will be discussing this paper (and others) at our November meetup. This paper is included in Donald Knuth's book *Selected Papers on Discrete Mathematics*. Knuth's writings have been extremely important to the field of computer science, and I think that most of his papers would fit in well here. This one introduces computational complexity and the benefits/limits of computing, then it dives into several combinatorial problems. I find it interesting because 1) it's a neat view of the possibilities and limitations of computation early on, and 2) the problems that he lays out are interesting exercises even today.
2016-10-30 12:38:53 +00:00
* [Combinatorial Analysis and Computers]
by Marshall Hall Jr. and Donald E. Knuth (1965)
[Flattening Combinators: Surviving Without Parentheses]:
Fix for URL to Flattening Combinators PDF (#548)
2019-06-06 17:41:41 +00:00
https://web.archive.org/web/20170828181221/http://www.westpoint.edu:80/eecs/SiteAssets/SitePages/Faculty%20Publication%20Documents/Okasaki/jfp03flat.pdf
[DOI]:
https://doi.org/10.1017/S0956796802004483
Add Combinatorial Analysis and Computers (1965) (#422) Changes: - add: *Combinatorial Analysis and Computers* (1965) to `combinatory_logic/README.md` list - add: year to the other paper in the README - fix: tweak format of papers README for readability Decisions: - I put this in the `combinatory_logic` folder, but I think it would also fit in the `comp_sci_fundamentals_and_history` folder (given Knuth's historical importance to the field and the more theoretical nature of the paper). This seemed more direct. --- Paper Title: Combinatorial Analysis and Computers Author(s): Marshall Hall Jr. and Donald E. Knuth Paper Year: 1965 Reasons for Including Paper: Papers We Love DC/NoVA will be discussing this paper (and others) at our November meetup. This paper is included in Donald Knuth's book *Selected Papers on Discrete Mathematics*. Knuth's writings have been extremely important to the field of computer science, and I think that most of his papers would fit in well here. This one introduces computational complexity and the benefits/limits of computing, then it dives into several combinatorial problems. I find it interesting because 1) it's a neat view of the possibilities and limitations of computation early on, and 2) the problems that he lays out are interesting exercises even today.
2016-10-30 12:38:53 +00:00
[Combinatorial Analysis and Computers]:
http://poncelet.math.nthu.edu.tw/disk5/js/computer/hall-knuth.pdf
Reference in New Issue Copy Permalink