暂无分享,去创建一个
[1] Jan A. Bergstra,et al. On Algorithmic Equivalence of Instruction Sequences for Computing Bit String Functions , 2014, Fundam. Informaticae.
[2] Jean-Yves Girard,et al. Geometry of Interaction 1: Interpretation of System F , 1989 .
[3] A. Turing. On Computable Numbers, with an Application to the Entscheidungsproblem. , 1937 .
[4] J. Hartmanis,et al. On the Computational Complexity of Algorithms , 1965 .
[5] C. A. R. Hoare,et al. An axiomatic basis for computer programming , 1969, CACM.
[6] Gérard P. Huet,et al. Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems , 1980, J. ACM.
[7] Dana S. Scott,et al. A Type-Theoretical Alternative to ISWIM, CUCH, OWHY , 1993, Theor. Comput. Sci..
[8] Jean-Yves Girard,et al. Locus Solum: From the rules of logic to the logic of rules , 2001, Mathematical Structures in Computer Science.
[9] Yiannis N. Moschovakis,et al. On founding the theory of algorithms , 2011 .
[10] Patrick Cousot,et al. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints , 1977, POPL.
[11] Yiannis N. Moschovakis,et al. What Is an Algorithm? , 2020, The Age of Algorithms.