摘要:
core.ac.uk
elsevier.com
sci-hub.se 参考文章(9)
Philip Wadler, Will Partain, John Hughes, María M. Guzmán, Joseph H. Fasel, Kevin Hammond, Simon L. Peyton Jones, Paul Hudak, John Peterson, Rishiyur S. Nikhil, Richard B. Kieburtz, Jon Fairbairn, Brian Boutel, Thomas Johnsson, Report on the Programming Language Haskell, A Non-strict, Purely Functional Language. Sigplan Notices. ,vol. 27, pp. 1- ,(1992)
Dennis M. Volpano, Geoffrey S. Smith, On the complexity of ML typability with overloading Functional Programming Languages and Computer Architecture. pp. 15- 28 ,(1991) , 10.1007/3540543961_2
Helmut Seidl, Deciding equivalence of finite tree automata symposium on theoretical aspects of computer science. pp. 480- 492 ,(1989) , 10.1007/BFB0029009
A. J. Kfoury, J. Tiuryn, P. Urzyczyn, An analysis of ML typability Journal of the ACM. ,vol. 41, pp. 368- 398 ,(1994) , 10.1145/174652.174659
Tobias Nipkow, Christian Prehofer, Type checking type classes Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '93. pp. 409- 418 ,(1993) , 10.1145/158511.158698
Harry G. Mairson, Deciding ML typability is complete for deterministic exponential time Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '90. pp. 382- 401 ,(1990) , 10.1145/96709.96748
P. Wadler, S. Blott, How to make ad-hoc polymorphism less ad hoc symposium on principles of programming languages. pp. 60- 76 ,(1989) , 10.1145/75277.75283
Paul Hudak, Simon Peyton Jones, Philip Wadler, Brian Boutel, Jon Fairbairn, Joseph Fasel, María M. Guzmán, Kevin Hammond, John Hughes, Thomas Johnsson, Dick Kieburtz, Rishiyur Nikhil, Will Partain, John Peterson, Report on the programming language Haskell: a non-strict, purely functional language version 1.2 Sigplan Notices. ,vol. 27, pp. 1- 164 ,(1992) , 10.1145/130697.130699
R. D. Tennent, Principles of Programming Languages Prentice Hall PTR. ,(1981)