转录计算机专业老论文为 Latex 格式，提供原稿，报酬 10 元每份。主要工作内容是按照 ACM/IEEE 的要求排版，文字方面可以直接从原 PDF 中复制，但需注意字型（如斜体，加粗等）会在复制过程中丢失。有意者请邮件联系我：zhangshuai.ustc@gmail.com
J Reynolds. 1974. Towards a theory of type structure. Programming Symposium, 408–425. DOI:https://doi.org/10.1007/3-540-06859-7
P. J. Landin. 1966. The Next 700 Programming Languages. Commun. ACM 9, 3 (1966), 157–166. DOI:https://doi.org/10.1145/365230.365257
C. A. R. Hoare. 1969. An axiomatic basis for computer programming. Commun. ACM 12, 10 (1969), 576–580. DOI:https://doi.org/10.1145/363235.363259
Calvin C. Elgot. 1976. Structured Programming With and Without GO TO Statements. IEEE Trans. Softw. Eng. SE-2, 1 (1976), 41–54. DOI:https://doi.org/10.1109/TSE.1976.233800
Philip A. Bernstein and Nathan Goodman. 1981. Concurrency Control in Distributed Database Systems. CSUR 13, 2 (June 1981), 185–221. DOI:https://doi.org/10.1145/356842.356846
Theo Haerder and Andreas Reuter. 1983. Principles of transaction-oriented database recovery. CSUR 15, 4 (1983), 287–317. DOI:https://doi.org/10.1145/289.291
Michael J. Fischer, Nancy A. Lynch, and Michael S. Paterson. 1983. Impossibility of distributed consensus with one faulty process. In Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems - PODS ’83, 1–7. DOI:https://doi.org/10.1145/588058.588060
J. H. Saltzer, D. P. Reed, and D. D. Clark. 1984. End-to-end arguments in system design. ACM Trans. Comput. Syst. 2, 4 (November 1984), 277–288. DOI:https://doi.org/10.1145/357401.357402
Jonathan S. Turner. 1986. New Directions in Communications (or Which way to the Information Age?). IEEE Communications Magazine 24, 8–15. DOI:https://doi.org/10.1109/MCOM.1986.1092946
Maurice P. Herlihy and Jeannette M. Wing. 1990. Linearizability: a correctness condition for concurrent objects. ACM Trans. Program. Lang. Syst. 12, 3 (July 1990), 463–492. DOI:https://doi.org/10.1145/78969.78972
Fred B. Schneider. 1990. Implementing Fault-tolerant Services Using the State Machine Approach: A Tutorial. ACM Comput. Surv. 22, 4 (December 1990), 299–319. DOI:https://doi.org/10.1145/98163.98167
James K. Mullin. 1991. A caution on universal classes of hash functions. Inf. Process. Lett. 37, 5 (1991), 247–256. DOI:https://doi.org/10.1016/0020-0190(91)90216-5
Philip Wadler. 1992. The essence of functional programming. In Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL ’92, 1–14. DOI:https://doi.org/10.1145/143165.143169
Elizabeth Borowsky and Eli Gafni. 1993. Generalized FLP impossibility result for t -resilient asynchronous computations. Proc. twenty-fifth Annu. ACM Symp. Theory Comput. - STOC ’93 5, (1993), 91–100. DOI:https://doi.org/10.1145/167088.167119
Cormac Flanagan, Amr Sabry, Bruce F. Duba, and Matthias Felleisen. 1993. The essence of compiling with continuations. Proc. ACM SIGPLAN 1993 Conf. Program. Lang. Des. Implement. - PLDI ’93 39, 4 (1993), 237–247. DOI:https://doi.org/10.1145/155090.155113
Jim Gray, Pat Helland, Patrick O’Neil, Dennis Shasha, Jim Gray, Pat Helland, Patrick O’Neil, and Dennis Shasha. 1996. The dangers of replication and a solution. ACM SIGMOD Rec. 25, 2 (June 1996), 173–182. DOI:https://doi.org/10.1145/235968.233330
J Reynolds. 1974. Towards a theory of type structure. Programming Symposium, 408–425. DOI:https://doi.org/10.1007/3-540-06859-7
P. J. Landin. 1966. The Next 700 Programming Languages. Commun. ACM 9, 3 (1966), 157–166. DOI:https://doi.org/10.1145/365230.365257
C. A. R. Hoare. 1969. An axiomatic basis for computer programming. Commun. ACM 12, 10 (1969), 576–580. DOI:https://doi.org/10.1145/363235.363259
Calvin C. Elgot. 1976. Structured Programming With and Without GO TO Statements. IEEE Trans. Softw. Eng. SE-2, 1 (1976), 41–54. DOI:https://doi.org/10.1109/TSE.1976.233800
Philip A. Bernstein and Nathan Goodman. 1981. Concurrency Control in Distributed Database Systems. CSUR 13, 2 (June 1981), 185–221. DOI:https://doi.org/10.1145/356842.356846
Theo Haerder and Andreas Reuter. 1983. Principles of transaction-oriented database recovery. CSUR 15, 4 (1983), 287–317. DOI:https://doi.org/10.1145/289.291
Michael J. Fischer, Nancy A. Lynch, and Michael S. Paterson. 1983. Impossibility of distributed consensus with one faulty process. In Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems - PODS ’83, 1–7. DOI:https://doi.org/10.1145/588058.588060
J. H. Saltzer, D. P. Reed, and D. D. Clark. 1984. End-to-end arguments in system design. ACM Trans. Comput. Syst. 2, 4 (November 1984), 277–288. DOI:https://doi.org/10.1145/357401.357402
Jonathan S. Turner. 1986. New Directions in Communications (or Which way to the Information Age?). IEEE Communications Magazine 24, 8–15. DOI:https://doi.org/10.1109/MCOM.1986.1092946
Maurice P. Herlihy and Jeannette M. Wing. 1990. Linearizability: a correctness condition for concurrent objects. ACM Trans. Program. Lang. Syst. 12, 3 (July 1990), 463–492. DOI:https://doi.org/10.1145/78969.78972
Fred B. Schneider. 1990. Implementing Fault-tolerant Services Using the State Machine Approach: A Tutorial. ACM Comput. Surv. 22, 4 (December 1990), 299–319. DOI:https://doi.org/10.1145/98163.98167
James K. Mullin. 1991. A caution on universal classes of hash functions. Inf. Process. Lett. 37, 5 (1991), 247–256. DOI:https://doi.org/10.1016/0020-0190(91)90216-5
Philip Wadler. 1992. The essence of functional programming. In Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL ’92, 1–14. DOI:https://doi.org/10.1145/143165.143169
Elizabeth Borowsky and Eli Gafni. 1993. Generalized FLP impossibility result for t -resilient asynchronous computations. Proc. twenty-fifth Annu. ACM Symp. Theory Comput. - STOC ’93 5, (1993), 91–100. DOI:https://doi.org/10.1145/167088.167119
Cormac Flanagan, Amr Sabry, Bruce F. Duba, and Matthias Felleisen. 1993. The essence of compiling with continuations. Proc. ACM SIGPLAN 1993 Conf. Program. Lang. Des. Implement. - PLDI ’93 39, 4 (1993), 237–247. DOI:https://doi.org/10.1145/155090.155113
Jim Gray, Pat Helland, Patrick O’Neil, Dennis Shasha, Jim Gray, Pat Helland, Patrick O’Neil, and Dennis Shasha. 1996. The dangers of replication and a solution. ACM SIGMOD Rec. 25, 2 (June 1996), 173–182. DOI:https://doi.org/10.1145/235968.233330
