├── LICENSE ├── Lab001.md ├── Lab002.md ├── Lab003.md ├── Lab004.md ├── Lab005.md ├── Library.md ├── README.md └── hu-logo.jpg /LICENSE: -------------------------------------------------------------------------------- 1 | Apache License 2 | Version 2.0, January 2004 3 | http://www.apache.org/licenses/ 4 | 5 | TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION 6 | 7 | 1. Definitions. 8 | 9 | "License" shall mean the terms and conditions for use, reproduction, 10 | and distribution as defined by Sections 1 through 9 of this document. 11 | 12 | "Licensor" shall mean the copyright owner or entity authorized by 13 | the copyright owner that is granting the License. 14 | 15 | "Legal Entity" shall mean the union of the acting entity and all 16 | other entities that control, are controlled by, or are under common 17 | control with that entity. For the purposes of this definition, 18 | "control" means (i) the power, direct or indirect, to cause the 19 | direction or management of such entity, whether by contract or 20 | otherwise, or (ii) ownership of fifty percent (50%) or more of the 21 | outstanding shares, or (iii) beneficial ownership of such entity. 22 | 23 | "You" (or "Your") shall mean an individual or Legal Entity 24 | exercising permissions granted by this License. 25 | 26 | "Source" form shall mean the preferred form for making modifications, 27 | including but not limited to software source code, documentation 28 | source, and configuration files. 29 | 30 | "Object" form shall mean any form resulting from mechanical 31 | transformation or translation of a Source form, including but 32 | not limited to compiled object code, generated documentation, 33 | and conversions to other media types. 34 | 35 | "Work" shall mean the work of authorship, whether in Source or 36 | Object form, made available under the License, as indicated by a 37 | copyright notice that is included in or attached to the work 38 | (an example is provided in the Appendix below). 39 | 40 | "Derivative Works" shall mean any work, whether in Source or Object 41 | form, that is based on (or derived from) the Work and for which the 42 | editorial revisions, annotations, elaborations, or other modifications 43 | represent, as a whole, an original work of authorship. For the purposes 44 | of this License, Derivative Works shall not include works that remain 45 | separable from, or merely link (or bind by name) to the interfaces of, 46 | the Work and Derivative Works thereof. 47 | 48 | "Contribution" shall mean any work of authorship, including 49 | the original version of the Work and any modifications or additions 50 | to that Work or Derivative Works thereof, that is intentionally 51 | submitted to Licensor for inclusion in the Work by the copyright owner 52 | or by an individual or Legal Entity authorized to submit on behalf of 53 | the copyright owner. For the purposes of this definition, "submitted" 54 | means any form of electronic, verbal, or written communication sent 55 | to the Licensor or its representatives, including but not limited to 56 | communication on electronic mailing lists, source code control systems, 57 | and issue tracking systems that are managed by, or on behalf of, the 58 | Licensor for the purpose of discussing and improving the Work, but 59 | excluding communication that is conspicuously marked or otherwise 60 | designated in writing by the copyright owner as "Not a Contribution." 61 | 62 | "Contributor" shall mean Licensor and any individual or Legal Entity 63 | on behalf of whom a Contribution has been received by Licensor and 64 | subsequently incorporated within the Work. 65 | 66 | 2. Grant of Copyright License. Subject to the terms and conditions of 67 | this License, each Contributor hereby grants to You a perpetual, 68 | worldwide, non-exclusive, no-charge, royalty-free, irrevocable 69 | copyright license to reproduce, prepare Derivative Works of, 70 | publicly display, publicly perform, sublicense, and distribute the 71 | Work and such Derivative Works in Source or Object form. 72 | 73 | 3. Grant of Patent License. Subject to the terms and conditions of 74 | this License, each Contributor hereby grants to You a perpetual, 75 | worldwide, non-exclusive, no-charge, royalty-free, irrevocable 76 | (except as stated in this section) patent license to make, have made, 77 | use, offer to sell, sell, import, and otherwise transfer the Work, 78 | where such license applies only to those patent claims licensable 79 | by such Contributor that are necessarily infringed by their 80 | Contribution(s) alone or by combination of their Contribution(s) 81 | with the Work to which such Contribution(s) was submitted. If You 82 | institute patent litigation against any entity (including a 83 | cross-claim or counterclaim in a lawsuit) alleging that the Work 84 | or a Contribution incorporated within the Work constitutes direct 85 | or contributory patent infringement, then any patent licenses 86 | granted to You under this License for that Work shall terminate 87 | as of the date such litigation is filed. 88 | 89 | 4. Redistribution. You may reproduce and distribute copies of the 90 | Work or Derivative Works thereof in any medium, with or without 91 | modifications, and in Source or Object form, provided that You 92 | meet the following conditions: 93 | 94 | (a) You must give any other recipients of the Work or 95 | Derivative Works a copy of this License; and 96 | 97 | (b) You must cause any modified files to carry prominent notices 98 | stating that You changed the files; and 99 | 100 | (c) You must retain, in the Source form of any Derivative Works 101 | that You distribute, all copyright, patent, trademark, and 102 | attribution notices from the Source form of the Work, 103 | excluding those notices that do not pertain to any part of 104 | the Derivative Works; and 105 | 106 | (d) If the Work includes a "NOTICE" text file as part of its 107 | distribution, then any Derivative Works that You distribute must 108 | include a readable copy of the attribution notices contained 109 | within such NOTICE file, excluding those notices that do not 110 | pertain to any part of the Derivative Works, in at least one 111 | of the following places: within a NOTICE text file distributed 112 | as part of the Derivative Works; within the Source form or 113 | documentation, if provided along with the Derivative Works; or, 114 | within a display generated by the Derivative Works, if and 115 | wherever such third-party notices normally appear. The contents 116 | of the NOTICE file are for informational purposes only and 117 | do not modify the License. You may add Your own attribution 118 | notices within Derivative Works that You distribute, alongside 119 | or as an addendum to the NOTICE text from the Work, provided 120 | that such additional attribution notices cannot be construed 121 | as modifying the License. 122 | 123 | You may add Your own copyright statement to Your modifications and 124 | may provide additional or different license terms and conditions 125 | for use, reproduction, or distribution of Your modifications, or 126 | for any such Derivative Works as a whole, provided Your use, 127 | reproduction, and distribution of the Work otherwise complies with 128 | the conditions stated in this License. 129 | 130 | 5. Submission of Contributions. Unless You explicitly state otherwise, 131 | any Contribution intentionally submitted for inclusion in the Work 132 | by You to the Licensor shall be under the terms and conditions of 133 | this License, without any additional terms or conditions. 134 | Notwithstanding the above, nothing herein shall supersede or modify 135 | the terms of any separate license agreement you may have executed 136 | with Licensor regarding such Contributions. 137 | 138 | 6. Trademarks. This License does not grant permission to use the trade 139 | names, trademarks, service marks, or product names of the Licensor, 140 | except as required for reasonable and customary use in describing the 141 | origin of the Work and reproducing the content of the NOTICE file. 142 | 143 | 7. Disclaimer of Warranty. Unless required by applicable law or 144 | agreed to in writing, Licensor provides the Work (and each 145 | Contributor provides its Contributions) on an "AS IS" BASIS, 146 | WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or 147 | implied, including, without limitation, any warranties or conditions 148 | of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A 149 | PARTICULAR PURPOSE. You are solely responsible for determining the 150 | appropriateness of using or redistributing the Work and assume any 151 | risks associated with Your exercise of permissions under this License. 152 | 153 | 8. Limitation of Liability. In no event and under no legal theory, 154 | whether in tort (including negligence), contract, or otherwise, 155 | unless required by applicable law (such as deliberate and grossly 156 | negligent acts) or agreed to in writing, shall any Contributor be 157 | liable to You for damages, including any direct, indirect, special, 158 | incidental, or consequential damages of any character arising as a 159 | result of this License or out of the use or inability to use the 160 | Work (including but not limited to damages for loss of goodwill, 161 | work stoppage, computer failure or malfunction, or any and all 162 | other commercial damages or losses), even if such Contributor 163 | has been advised of the possibility of such damages. 164 | 165 | 9. Accepting Warranty or Additional Liability. While redistributing 166 | the Work or Derivative Works thereof, You may choose to offer, 167 | and charge a fee for, acceptance of support, warranty, indemnity, 168 | or other liability obligations and/or rights consistent with this 169 | License. However, in accepting such obligations, You may act only 170 | on Your own behalf and on Your sole responsibility, not on behalf 171 | of any other Contributor, and only if You agree to indemnify, 172 | defend, and hold each Contributor harmless for any liability 173 | incurred by, or claims asserted against, such Contributor by reason 174 | of your accepting any such warranty or additional liability. 175 | 176 | END OF TERMS AND CONDITIONS 177 | 178 | APPENDIX: How to apply the Apache License to your work. 179 | 180 | To apply the Apache License to your work, attach the following 181 | boilerplate notice, with the fields enclosed by brackets "[]" 182 | replaced with your own identifying information. (Don't include 183 | the brackets!) The text should be enclosed in the appropriate 184 | comment syntax for the file format. We also recommend that a 185 | file or class name and description of purpose be included on the 186 | same "printed page" as the copyright notice for easier 187 | identification within third-party archives. 188 | 189 | Copyright [yyyy] [name of copyright owner] 190 | 191 | Licensed under the Apache License, Version 2.0 (the "License"); 192 | you may not use this file except in compliance with the License. 193 | You may obtain a copy of the License at 194 | 195 | http://www.apache.org/licenses/LICENSE-2.0 196 | 197 | Unless required by applicable law or agreed to in writing, software 198 | distributed under the License is distributed on an "AS IS" BASIS, 199 | WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. 200 | See the License for the specific language governing permissions and 201 | limitations under the License. 202 | -------------------------------------------------------------------------------- /Lab001.md: -------------------------------------------------------------------------------- 1 | # LAB001 - Hello World 2 | 3 | *deadline: 1 week* 4 | 5 | We will cover: 6 | 1. How to init a new Haskell project 7 | 2. using the `IO` type 8 | 3. divide project to modules 9 | 10 | This week is all about getting started. Familiarize yourself with [Stack](https://docs.haskellstack.org/en/stable/README/) and basic concepts of the language: function definition and application, module creation, `IO` type. 11 | 12 | Programs: 13 | 14 | #### 1. Write a program that prints out "Hello worlds" and terminates 15 | 16 | ``` 17 | $ stack exec exercise1-exe 18 | Hello World 19 | ``` 20 | 21 | #### 2. Write a program that welcomes the user, asks for his/her name, greets user and terminates 22 | 23 | ``` 24 | $ stack exec exercise1-exe 25 | Hello, what is your name? 26 | Pawel 27 | Nice to meet you Pawel 28 | ``` 29 | 30 | #### 3. Write a program that will run program 2. in an infinite loop 31 | 32 | ``` 33 | $ stack exec exercise1-exe 34 | Hello, what is your name? 35 | Pawel 36 | Nice to meet you Pawel 37 | Hello, what is your name? 38 | Mike 39 | Nice to meet you Mike 40 | Hello, what is your name? 41 | Kate 42 | Nice to meet you Kate 43 | Hello, what is your name? 44 | ``` 45 | 46 | *hints*: 47 | import Control.Monad (forever) 48 | -------------------------------------------------------------------------------- /Lab002.md: -------------------------------------------------------------------------------- 1 | # LAB002 - Fun with lists 2 | 3 | *deadline: 2 weeks* 4 | 5 | We will cover: 6 | 1. List API 7 | 2. Property based testing using Quick Check 8 | 3. Our first typeclass: `Ord` 9 | 10 | This week we will do exercies that appear occasionally at job interviews: Quicksort algorithm and FizzBuzz. Both solutions should manifest themself the beauty of the Haskell language - once you are done, just compare them with anything written in any other programming language. 11 | They are both perfect for mastering some functions available for `List`. They also help get intuition when reasoning about lazy evaluation. 12 | Abstract version of quicksort implementation will require to understand concept of a typeclass and usage of an `Ord` typeclass. 13 | We will also have to test our solutions, so this is a great opportunity to introduce QuickCheck. 14 | 15 | Programs: 16 | 17 | #### Quicksort for list of integers 18 | 19 | 1. Implement a [Quicksort](https://en.wikipedia.org/wiki/Quicksort) algorithm that will take a list of integers as an input and return a sorted list of integers as an output. We are not looking for the most performant version, just the simplest version of this well known divide and conquer algorithm. 20 | 2. Write property based tests using QuickCheck that will test your solution. Think about the properties that you can check. 21 | 22 | ``` 23 | $ stack exec exercise2-exe 3 32 2 1 2 5 5 321 1 123 12 3 43 345 24 | [1,1,2,2,3,3,5,5,12,32,43,123,321,345] 25 | ``` 26 | 27 | #### Quick Sort for everyone! 28 | 29 | 1. Extend your Quicksort algorithm to work with a list of any arbitrary type 30 | 2. What are possible constraints on that type? 31 | 32 | #### FizzBuzz 33 | 34 | 1. Implement a program [FizzBuzz](https://en.wikipedia.org/wiki/Fizz_buzz) that will take a number as an input and generate list of strings as the output containing the "fizzbuzz" sequence 35 | 2. Can you think of any properties that you could test with QuickCheck? 36 | -------------------------------------------------------------------------------- /Lab003.md: -------------------------------------------------------------------------------- 1 | # LAB003 - Apples and oranges 2 | 3 | *deadline: 2 week* 4 | 5 | Programs: 6 | 7 | ### Shopping cart 8 | 9 | 1. You are building a checkout system for a shop which only sells apples and oranges. 10 | 2. Apples cost 60p and oranges cost 25p. 11 | 3. Build a checkout system which takes a list of items scanned at the till and outputs the total cost 12 | For example: [ Apple, Apple, Orange, Apple ] => £2.05 13 | 14 | ### Simple offers 15 | 16 | The shop decides to introduce two new offers 17 | * buy one, get one free on Apples 18 | * 3 for the price of 2 on Oranges 19 | 20 | Update your checkout functions accordingly 21 | 22 | ### QuickCheck 23 | 24 | You can use QuickCheck to verify that the price after applying promotion is lower than before promotion (you can leverage custom generators if you used instances for Apple and Orange). 25 | -------------------------------------------------------------------------------- /Lab004.md: -------------------------------------------------------------------------------- 1 | # LAB004 - Reverse Polish notation calculator 2 | 3 | *deadline: 1 week* 4 | 5 | We will cover: 6 | 1. Parser combinators 7 | 8 | Write "Reverse Polish notation calculator". Program runs forever where it: 9 | 1. promts user for the input expression (written in [Reverse Polish notation](https://en.wikipedia.org/wiki/Reverse_Polish_notation) 10 | 2. reads user input 11 | 3. evaluates user input: 12 | a) if it is a valid expression, it will evaluate its value 13 | b) if it is an invalid input (not an expression) then it will warn user about it 14 | 15 | Example: 16 | 17 | ``` 18 | > 10 20 + 19 | 30 20 | > 100 80 - 21 | 20 22 | > 10 2 / 23 | 5 24 | > 10 sdfsd / 25 | Could not evaluate '10 sdfsd /' 26 | ``` 27 | 28 | *Reading material:* 29 | 30 | 1. ["Learn you a Haskell" on Reverse Polish notation](http://learnyouahaskell.com/functionally-solving-problems) 31 | 2. "Haskell - Programming from first Principles" by Ch.Allen & J.Moronuki chapter 24 "Parser Combinators" 32 | 3. "Programming Haskell" by Graham Hutton, chapter 8 "Functional Parsers" 33 | -------------------------------------------------------------------------------- /Lab005.md: -------------------------------------------------------------------------------- 1 | # LAB005 - Advanced Calculator 2 | 3 | *deadline: 1 week* 4 | 5 | We will cover: 6 | 1. State monad 7 | 8 | Add new feature to the calculator you implemented in Exercise 4. This time each time you evaluate an expression, its value is printed out along with the name of the variable that will hold its value. That variable can be used in further calculations. 9 | 10 | Example: 11 | 12 | ``` 13 | > 20 10 + 14 | res0: 30 15 | > 100 res0 - 16 | res1: 70 17 | > res1 res50 / 18 | Could not evaluate 'res1 res50 /' 19 | ``` 20 | 21 | 22 | ### FAQ 23 | 24 | #### 1. Will you provide lectures notes? 25 | Originally Haskell University's intent is to provide challenges, problems to solve. It's the students responsibility to explore the topic on his/her own. However 26 | 1. occasionally we will point to book chapters, blog posts as hints for the exercies 27 | 2. we encourage the community to post solutions to the problems (via blogposts, gists, repositories, youtube videos), we will be more then happy to include them as solutions along the exercies. 28 | 29 | #### 2. I'm senior Haskell developer, can I help? 30 | Yes! We need your help. We need experienced Haskell developers to create exercies for us, to challange students. If you have an idea for an exercise, please submit an issue or add it directly as a pull request to this README.md 31 | -------------------------------------------------------------------------------- /Library.md: -------------------------------------------------------------------------------- 1 | # Library 2 | 3 | ## Other 4 | 5 | * [On writing a medium-sized Haskell for the very first time](https://skillsmatter.com/skillscasts/10832-how-to-architect-medium-to-large-scale-haskell-applications?utm_content=buffer18298&utm_medium=social&utm_source=twitter.com&utm_campaign=buffer) - video, requires (free) login at skillsamtter 6 | 7 | ## IO 8 | 9 | * [The Compromiseless Reconciliation of I/O and Purity](https://blog.jle.im/entry/the-compromiseless-reconciliation-of-i-o-and-purity) 10 | * [IO is pure](http://chris-taylor.github.io/blog/2013/02/09/io-is-not-a-side-effect/) - blog, discussion about `IO` - its purity aspect 11 | 12 | ## Testing 13 | * [Five step introduction to Hspec](https://hspec.github.io/getting-started.html) - a must read for newcommers 14 | * [QuickCheck slides](http://www.dcc.fc.up.pt/~pbv/aulas/tapf/slides/quickcheck.html) - Property Testing using QuickCheck 15 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | ![logo](hu-logo.jpg) 2 | # Haskell-University 3 | [![Join the chat at https://gitter.im/HaskellChamber/Haskell-University](https://badges.gitter.im/HaskellChamber/Haskell-University.svg)](https://gitter.im/HaskellChamber/Haskell-University?utm_source=badge&utm_medium=badge&utm_campaign=pr-badge&utm_content=badge) 4 | 5 | Portfolio-based approach to learning Haskell 6 | 7 | ### About 8 | 9 | Haskell Universty is a community driven project, where one can learn Haskell by solving exercises. You will create programs that each week will gain on complexity. Aim is to learn both the language as well as its real world application by exploring as many libraries, frameworks and tools as possible. 10 | 11 | Haskell University is designed to be self-paced, each exercise has a deadline estimated in weeks - you can start at anytime and just keep your private schedule. However because it hardly ever works :), starting on 26th November we initialized the first edition that will keep public schedule. If you will take that challenge, please create PR adding yourself to the [list of students](#students)! 12 | 13 | This is a community driven project. You are more then welcome to share your ideas, PRs and comments! 14 | 15 | For more information, see our [FAQ](#faq). If you are an experienced Haskell developer, please [see 2.](#2-im-senior-haskell-developer-can-i-help) 16 | 17 | ## First Edition! 18 | 19 | First edition of Haskell University just started! 20 | 21 | ### How can I join? 22 | 23 | You can join by adding your name to the [list of students](#students) with a link to the repository where you will push your solutions to the exercises. This is purely done for transparency. You will see other people taking part in the challange, so we all can learn from each other. 24 | Once you've added yourself to that list, you can consider yourself enrolled :) From now on you must solve each exercise by the end of the deadline. We have [a gitter channel](https://gitter.im/HaskellChamber/Haskell-University?utm_source=badge&utm_medium=badge&utm_campaign=pr-badge&utm_content=badge) where you can talk with fellow students, exchange ideas, reason about solutions. 25 | 26 | ### Students 27 | 28 | | Student | Repository | 29 | | ---------------------- | -------------------------------------------------------------------------------- | 30 | | Pawel Szulc | [solutions](https://github.com/rabbitonweb/HaskellUniversity-semester1) | 31 | | Lukasz Byczynski | [solutions](https://github.com/LukaszByczynski/HaskellUniversity-semester1) | 32 | | Jakub Janczak   | [solutions](https://github.com/kubek2k/HaskellUniversityExercises)         | 33 | | Bartosz Bonisławski | [solutions](https://github.com/bbonislawski/HaskellUniversity-semester1) | 34 | | Igor Mielientiev | [solutions](https://github.com/mielientiev/Haskell-University-semester1) | 35 | | Przemek Kamiński | [solutions](https://github.com/CGenie/HaskellUniversity-semester1) | 36 | | Christian Sakai | [solutions](https://github.com/christiansakai/HaskellUniversity-solutions) | 37 | | Wisnu Adi Nurcahyo | [solutions](https://github.com/wisn/Haskell-University-Solutions) | 38 | | Doug Fort | [solutions](https://github.com/dougfort/Haskell-University-semester1) | 39 | | Florian Schmeller | [solutions](https://github.com/fschmllr/HU-Semester1) | 40 | | Artur Czajka | [solutions](https://github.com/tr00per/HaskellUniversity-solutions) | 41 | | Eryk Ciepiela | [solutions](https://github.com/erykciepiela/HaskellUniversity-semester1) | 42 | | Stanislaw Findeisen | [solutions](https://github.com/sfindeisen/Haskell-University-1) | 43 | | Christopher Davenport | [solutions](https://github.com/ChristopherDavenport/HaskellUniversity-semester1) | 44 | | Andrew R. M. | [solutions](https://github.com/nixy/haskell-university-solutions) | 45 | | Michał Michalski | [solutions](https://github.com/regispl/HaskellUniversity-semester1) | 46 | | Bartek Kalinka | [solutions](https://github.com/bartekkalinka/haskell-university-solutions) | 47 | | Benjamin Weißenfels | [solutions](https://github.com/pixeldrama/haskell-university-solutions) | 48 | | Clite Tailor | [solutions](https://github.com/clitetailor/haskell-university-solutions) | 49 | | Nagarjuna Pamu | [solutions](https://github.com/pamu/haskell-university) | 50 | | Alessandro Molari (alem0lars) | [solutions](https://github.com/alem0lars/haskell-university-solutions) | 51 | | Jonatan Borkowski | [solutions](https://github.com/jborkowski/haskell-university-solutions) | 52 | 53 | # Labs schedule 54 | 55 | | Lab | Deadline | 56 | | ---------------------------------------------------------------------------------- | -------------------:| 57 | | 1. [Hello World](Lab001.md) | 03 December 2017 | 58 | | 2. [Fun with lists](Lab002.md) | 17 December 2017 | 59 | | 3. [Apples and oranges](Lab003.md) | 31 December 2017 | 60 | | 4. [Reverse Polish notation calculator](Lab004.md) | 07 January 2018 | 61 | | 5. [Advanced Calculator](Lab005.md) | 14 January 2018 | 62 | -------------------------------------------------------------------------------- /hu-logo.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/HaskellChamber/Haskell-University/0338c75ddd82b79a4796ce117570a314206c80da/hu-logo.jpg --------------------------------------------------------------------------------