An n-ary zipWith in Haskell
暂无分享,去创建一个
[1] Philip Wadler,et al. Deforestation: Transforming Programs to Eliminate Trees , 1990, Theor. Comput. Sci..
[2] Ronald Cramer,et al. Efficient Multiparty Computations with Dishonest Minority , 1998 .
[3] Jonathan Rees,et al. Revised3 report on the algorithmic language scheme , 1986, SIGP.
[4] Lennart Augustsson,et al. Cayenne—a language with dependent types , 1998, ICFP '98.
[5] Olivier Danvy. Functional Unparsing , 1998, J. Funct. Program..
[6] Olivier Danvy,et al. An Operational Investigation of the CPS Hierarchy , 1999, ESOP.
[7] Peter Bro Miltersen,et al. The Complexity of Identifying Large Equivalence Classes , 1998, Fundam. Informaticae.
[8] Ivan Damgård,et al. On the (Im)possibility of Basing Oblivious Transfer and Bit Commitment on Weakened Security Assumptions , 1998, EUROCRYPT.
[9] Ivan Damgård,et al. Verifiable Encryption and Applications to Group Signatures and Signature Sharing , 1998, IACR Cryptol. ePrint Arch..