References

  1. Koen Claessen & John Hughes (2000): QuickCheck: a lightweight tool for random testing of Haskell programs. In: Proceedings of the fifth ACM SIGPLAN international conference on Functional programming, pp. 268–279, doi:10.1145/351240.351266.
  2. Association for Computing Machinery (2013): Computer Science Curricula 2013: Curriculum Guidelines for Undergraduate Degree Programs in Computer Science, doi:10.1145/2534860. Available at http://www.acm.org/education/CS2013-final-report.pdf.
  3. Kees Doets & Jan van Eijck (2004): The Haskell Road to Logic, Maths, and Programming. Texts in Computing. King’s College Publications.
  4. David Goldberg (1991): What every computer scientist should know about floating-point arithmetic. ACM computing surveys (CSUR) 23(1), pp. 5–48, doi:10.1145/103162.103163.
  5. P. B. Henderson (2002): Functional and declarative languages for learning discrete mathematics. Technical Report 0210. University of Kiel.
  6. Liberal Arts Computer Science Consortium (2007): A 2007 Model Curriculum for a Liberal Arts Degree in Computer Science. J. Educ. Resour. Comput. 7(2), doi:10.1145/1240200.1240202.
  7. Leonardo de Moura & Sebastian Ullrich (2021): The Lean 4 theorem prover and programming language. In: International Conference on Automated Deduction. Springer, pp. 625–635, doi:10.1007/978-3-030-79876-5_37.
  8. OEIS Foundation Inc. (2022): The On-Line Encyclopedia of Integer Sequences. Available at http://oeis.org/.
  9. John O'Donnell, Cardelia Hall & Rex Page (2006): Discrete Mathematics Using a Computer. Springer-Verlag London.
  10. C. Scharff & A. Wildenberg (2002): Teaching discrete structures with SML. Technical Report. University of Kiel.
  11. Dmitriy Traytel, Stefan Berghofer & Tobias Nipkow (2011): Extending Hindley-Milner type inference with coercive structural subtyping. In: Asian Symposium on Programming Languages and Systems. Springer, pp. 89–104, doi:10.1007/978-3-642-25318-8_10.
  12. The Univalent Foundations Program (2013): Homotopy Type Theory: Univalent Foundations of Mathematics. https://homotopytypetheory.org/book, Institute for Advanced Study.
  13. Thomas VanDrunen (2011): The Case for Teaching Functional Programming in Discrete Math. In: Proceedings of the ACM International Conference Companion on Object Oriented Programming Systems Languages and Applications Companion, OOPSLA '11. ACM, New York, NY, USA, pp. 81–86, doi:10.1145/2048147.2048180.
  14. Thomas VanDrunen (2013): Discrete mathematics and functional programming. Franklin, Beedle & Associates Incorporated.
  15. Thomas VanDrunen (2017): Functional Programming as a Discrete Mathematics Topic. ACM Inroads 8(2), pp. 51–58, doi:10.1145/3078325.
  16. Roger L. Wainwright (1992): Introducing Functional Programming in Discrete Mathematics. In: Proceedings of the Twenty-third SIGCSE Technical Symposium on Computer Science Education, SIGCSE '92. ACM, New York, NY, USA, pp. 147–152, doi:10.1145/135250.134540.
  17. Cong-Cong Xing (2008): Enhancing the Learning and Teaching of Functions Through Programming in ML. J. Comput. Sci. Coll. 23(4), pp. 97–104, doi:10.5555/1352079.1352096.
  18. Brent A. Yorgey, Richard A. Eisenberg & Harley D. Eades III (2018): Explaining Type Errors. In: Off The Beaten Track. Available at https://popl18.sigplan.org/details/OBT-2018/8/Explaining-Type-Errors.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org