YH02860
After completing the programme, the student shall have knowledge of - The functional programming paradigm - Recursion - Higher-order functions - Algebraic data types - Data structures in functional languages: lists, tuples, trees - Modern type systems with type inference - Different evaluation strategies: lazy versus eager evaluation - Freedom from side effects, and how this can be made to coexist with I/O - Imperative programming in functional languages After completing the programme, the student shall have the skills to - solve programming problems in a functional language, using recursion - use lists, tuples and other functional data structures to structure data appropriately when solving problems - use the most common higher-order functions to program efficiently - declare their own data types and use them in modelling and problem solving - explain in writing and orally software solutions based on functional programming techniques After completing the programme, the student shall have the competences to - Independently use functional programming to solve various problems - Independently explain in writing and orally software solutions based on functional programming techniques
When you complete the course, Newton issues your certificate. Your name, the course content and the issue date are encrypted and secured on blockchain, so it cannot be changed, and anyone can check that it is genuine.
Sample Credential with placeholder data. Each credential is issued with the recipient’s details and is verifiable with the provider.
