13:10:57 From Sean Jentz : Alt+R 13:11:09 From TrotskyIcepickHD : Unregistered Hypercam 2 13:11:15 From Edwin Ekberg : Requires permission it seems 13:12:02 From Alexander Magnusson : Check if you can find the setting that lets us record the screen 13:12:33 From Edwin Ekberg : I trust in your computer though :) 13:13:32 From Alexander Magnusson : https://support.zoom.us/hc/en-us/articles/201362473-Local-Recording#h_3a53d485-a50f-4f6a-8019-533a0526fe47 13:13:35 From Alexander Magnusson : link to the setting 13:13:48 From William Karlssons : Otherwise you should be able to catch it via OBS 13:13:58 From William Karlssons : Or if someone wants to bust out a capture card lol 13:14:19 From Alexander Magnusson : Yes, I can record now. Thanks! 13:14:21 From faraz : Alexander the legend 13:14:28 From Hannes : Alexander the great 13:14:31 From Alexander Magnusson : <3 13:14:54 From Rasmus Rose Gordon : yes 13:17:23 From Fa8054mo-s : Will the recording be shared among other students, or should we all record individually? 13:17:55 From Torben Nordtorp : he said he wanted to upload to the course homepage I think. 13:18:05 From Fa8054mo-s : Hope so 13:20:19 From Filip : A classmate says he cannot get into the meeting, do you have to manually let him in? 13:21:52 From Joakim Mörling : ^Same here 13:25:16 From Mimmi Hansson : same 13:25:38 From Love Barany : another one here too 13:26:06 From henrik : Will the Labs be done in pairs or Individual? 13:26:17 From Hugo Mattsson : in pairs 13:26:39 From Kasper Dejke : http://cs.lth.se/utbildning/samarbete-eller-fusk/ 13:27:13 From henrik : Where is the registrations for the labs? 13:28:02 From Joel Bäcker : can you buy the books at kfs? 13:28:33 From TrotskyIcepickHD : http://learnyouahaskell.com/chapters 13:29:45 From Klara Broman : I also have a friend who is not able to enter the meeting :/ 13:31:36 From Clara Cyon : Yeah it seems like the host has to invite people, I talked to several people who cannot access the lecture 13:33:36 From Fa8054mo-s : edaf40 pr 95? 13:33:40 From Fa8054mo-s : or* 13:33:56 From Alexander Magnusson : http://cs.lth.se/edaf95/ 13:34:15 From Fa8054mo-s : The current page is edaf40 13:34:22 From TrotskyIcepickHD : edan 13:36:59 From faraz : <3 13:39:26 From Hannes : Where will the lecture slides be uploaded? 13:39:36 From Fa8054mo-s : Will the recording be shared? 13:39:46 From Edwin Ekberg : Do you have to work in pairs for the labs and assignments? 13:39:55 From Alexander Magnusson : Is it okay if I upload the recording to youtube? 13:39:55 From Simonsigge : Do you have to register for labs? 13:40:10 From Rasmus Rose Gordon : And if so, where do you sign up? 13:40:14 From to0267el-s : Will everybody have access to the recorded lectures by Erik Meijer or only the ones who buy Hutton's book? If so where do we find them? 13:40:27 From henrik : Will the labs be done in pairs? 13:42:02 From Fa8054mo-s : Would you miss critical stuff if you follow slides only and not buy the book? 13:42:10 From TrotskyIcepickHD : Meijer's lectures are available here https://channel9.msdn.com/Series/C9-Lectures-Erik-Meijer-Functional-Programming-Fundamentals/Lecture-Series-Erik-Meijer-Functional-Programming-Fundamentals-Chapter-1 13:43:45 From Hannes : Will stuff like assignments, slides, recordings, etc. be uploaded both to the course website (cs.lth.se/edan40) and canvas, or just one or the other? 13:44:47 From Edwin Ekberg : Are assignments individual? 13:45:08 From Miro : To pass the course which things in particular need to completet? 13:45:14 From Hannes : Are the labs only for EDAF95 and not for EDAN40? 13:45:16 From Miro : do you need to complete* 13:45:35 From MICHAELA Bergman : You might have said this already (sorry, I missed the first part), but which book do you recommend to buy? 13:46:03 From SimonT : Is there a process for matching with a lab/assignment partner? 13:46:08 From Lukas Gustavsson : All recommended books are on the course site under Examination - reading advice 13:46:19 From Lukas Gustavsson : or atleast on edan40 course site 13:46:31 From Miro : Yes, here: http://cs.lth.se/edan40/literature-and-links/ 13:46:38 From Fa8054mo-s : Can you achieve grade 5 with following the lectures strictly, and not buy the book? 13:47:35 From Edwin Ekberg : Yes, only information from slides will be examined 13:49:42 From William Karlssons : According to the Lär och Timplan, EDAF95 is the intro course (5 points) and EDAN40 is the advanced course (7.5 points). However, elsewhere it seems like the opposite is the case. Which is correct? kurser.lth.se/lot/?val=program&prog=D 13:50:08 From Mimmi Hansson : What is the difference between labs and programming assignments? 13:51:03 From Lukas Gustavsson : EDAN40 is the advanced course 13:51:06 From Fa8054mo-s : Would you upload notes and the context to each slide per lecture? 13:51:26 From Direa Osman : What exercises are you solving during class sessions ? 13:52:07 From Alexander : Will you record the lectures here on zoom?:) 13:52:32 From Lukas Gustavsson : The lectures are being recorded yes 13:53:55 From Evelina Danielsson : Will there be 15 min break at 1400? 13:54:44 From Christian : Where do you find the exercises? 13:56:03 From Fa8054mo-s : Would you unmute people to ask them questions? 13:56:29 From Hannes : Will the exercises be the same for both EDAF95 and EDAN40? Or will you only be solving the ones for one of the courses? 13:58:09 From to0267el-s : As far as I am aware if we are recording and uploading to youtube there will likely be a GDPR issue with letting students speak without getting signed permission. 13:58:37 From Tim Djärf : if one is unsure which of the courses to pick, what are the main differences between the two? And will it be possible to change at a later point? 13:59:57 From Fa8054mo-s : Can't you just switch/hop to EDAN40, if you're registered to EDAF95? 14:01:36 From Torben Nordtorp : Break time :D 14:01:44 From Joel Sigurdsson : is it decided how the exam will be done? 14:01:51 From sanctified : I applied and got accepted to EDAF95 but have already decided to switch to EDAN40, should I send you an email? 14:16:02 From Rasmus Rose Gordon : It has worked pretty well, no audio problems. I noticed some video stutters at a few points, but that was proably on my side. 14:16:02 From Oscar Cederberg : it has gone pretty well 14:16:26 From sanctified : Doing well so far :) 14:16:31 From Felix : agreed 14:16:51 From Miro : I think it has gone well! It would be nice in the future iif people could jump into the lecture at any time, so you don't have to "accept" people. 14:17:50 From Torben Nordtorp : Read the questions before answering, so we know the context! Also, there seems to be an "raise hand" feature, so maybe you could let those students unmute with the help of that, to make it easier to ask questions :) 14:18:08 From Rikard Berg : A few questions I came up with over the break. How do we know with who we will do the assignments and do we have to register for getting paired anywhere? Will there be a list on the website or will it come via email? Also, what's the deadline for the different assignments, do we submit them all at the same time? 14:43:18 From Brandon Chou : does (x:xs) mean each element from x to xs? 14:43:33 From William Karlssons : x is head and xs is tail 14:43:34 From Simonsigge : x is the head, xs is the rest 14:43:34 From Elias Rudberg : x is head of list, xs is rest 14:44:03 From Miro : why is it necessary to specify "x" as the head by x:xs? Isn't it given that the first value in the list is its head? 14:44:27 From Adrian Murphy : could sum1 [x] = x be used as a base case too? 14:44:47 From Gabriel Borglund : For every recursive call the head is “shaved off” by sendin xs as the argument to the recursive ackumulate call 14:45:11 From Miro : oooh, so xs is always "the rest" 14:45:31 From Gabriel Borglund : in the case (x:xs) yes! :) 14:45:42 From Miro : nice, thanks! 14:45:49 From Elias Rudberg : Can you skip the i as input if you just put the i in the base case to what you want? 14:45:51 From alex : what is i? 14:46:07 From Elias Rudberg : Seems like i is what you want your base case to give? 14:46:09 From Simonsigge : init value 14:47:13 From alex : Bump on what Torben wrote earlier, there is a "Raise Hand" feature in the "Participant"-window 14:47:23 From Fa8054mo-s : Why does ackumulate take two arguments? Shouldn't it take 3? 14:49:14 From Miro : Can you show an example how you would call "product2" function on an example list? Like for example product2 of "1,3,5,7"? 14:49:44 From Oscar Cederberg : so in this case, you're stating that sum2 will return 0 if an empty list is used as an input? 14:49:47 From Filip : product2 [1.3.5.7] 14:50:31 From Miro : thanks Filip! Ok so you just call it normally and fill in the "third" argument 14:50:46 From Filip : Yes 14:50:54 From Miro : perfect, thanks! 14:54:59 From Karl Hallsby : Note that 'mod' is actually `mod`. 14:55:00 From Joel Bäcker : So in this example we do not have a upper limit so this program would generate all primes? 14:55:08 From Hannes : corona alarm 14:55:13 From karek To Jacek Malec(privately) : Feedback: we saw today that students can answer other students questions live during the lecture. Maybe you should say that if students want to ask you something, thay should write privately to you. And if they want to ask the whole course they can write to everyone, and if they don't get an answer from everyone they can write to you. I hope that made sense 14:55:15 From Karl Hallsby : @Joel, yes correct. 14:55:19 From sanctified : I have the same alarm tone haha 14:55:32 From Miro : hahah 14:56:09 From sanctified : @Joel although it's lazily evaluated so it wouldn't try to generate more primes than we need 14:57:08 From Miro : But how would we tell the program we have an "upper limit" of how many primes we want? Sine we're giving an infinite argument, how will it know? 14:57:16 From Oscar Cederberg : very nice image! 14:58:01 From sanctified : @Miro because the list isn't calculated until it's used, so if we wanna print the 3rd prime it'll only calculate the first 3 primes 14:58:26 From Miro : ah ok! 14:58:35 From Joel Bäcker : Aha, thanks! 14:58:50 From Fa8054mo-s : Is it normal if I'm a bit confused at this kind of functions? 14:59:32 From Karl Hallsby : @Miro, although, the way we have written the sieve function doesn't have an upper bound defined. It generates all of them. We would have to rewrite the function to handle that case. 14:59:33 From alex : You are not alone :) 15:00:09 From Miro : I'm also confused! haha Fa805mo-s I think it's normal 15:00:16 From TrotskyIcepickHD : haskell learning curve -> | 15:00:22 From Torben : Hah! 15:00:26 From alex : haha 15:00:30 From Karl Hallsby : @fa8054mo-s, it takes some time to wrap your head around the idea of higher-order functions. Don't worry, you'll figure it out. 15:00:30 From Gabriel Borglund : :’D 15:00:31 From Miro : Karl ok thanks for clarifying it! Then I understand better 15:00:34 From sanctified : accurate 15:01:07 From Rasmus Rose Gordon : It's really elegant 15:01:18 From Linnea Johnsson To Jacek Malec(privately) : When and where will the slides be uploaded? The course homepage seems to not be very up to date (see edaf95 examination or lecture material for example of lacking info) 15:01:55 From Karl Hallsby : If we want to attend tomorrow, what should we watch? 15:01:57 From Daniel : thank you! 15:01:58 From sanctified : thank you for the lecture! 15:02:01 From Oscar Cederberg : thank you 15:02:05 From SimonT : Thank you! 15:02:06 From Simonsigge : Thanks, format worked very well 15:02:07 From Mohamad Yamen Albdeiwi : Thank you1 15:02:08 From Mohamad Yamen Albdeiwi : ! 15:02:09 From oneil : thank you 15:02:13 From Joel Bäcker : Thank you 15:02:14 From Torben : thank you for today 15:02:18 From Lukas Gustavsson : :) 15:02:29 From Quanwei Li : thank you 15:02:40 From Fa8054mo-s : I feel like there isn't a consistent syntax for Haskell... 15:02:42 From Rikard Berg : Not sure if these were answered earlier, but if so I missed the answers. How do we know with who we will do the assignments and do we have to register for getting paired anywhere? Will there be a list on the website or will it come via email? Also, what's the deadline for the different assignments, do we submit them all at the same time? 15:02:52 From Christian : +1 15:02:57 From abbeswag : +1 15:02:58 From Torben : Those things you mentioned we should checkout till tomorrow, is there a list or more information on the homepage? 15:03:05 From Linnea Johnsson : When and where will the slides be uploaded? The course homepage seems to not be very up to date (see edaf95 examination or lecture material for example of lacking info) 15:03:09 From Edvin : is there a setting for letting people join without you accepting them, there was someone who got in at first but their computer crashed and then they couldnt get back in 15:03:17 From Oscar Cederberg : when we declare sum2 = ackumilate (+) 0, are we stating that if an empty list is used as input that it shall return 0? 15:03:59 From Hannes : How do you do pattern matching in the interpreter? In a file I can write e.g. fact 0 = 1 fact n = n * fact (n-1) but the interpreter seems just to overwrite the definition, "forgetting" the initial fact 0 = 1 definition 15:04:08 From alex : Torben pointed out that there is a "Raise Hand" feature in Zoom that you maybe could use if you find it suitable! 15:04:12 From Gabriel Borglund : That is true Oscar 15:04:30 From Torben : There seems to be some interaction features in the participants window, please check it out! 15:04:42 From Lukas Gustavsson : Is there any easy exercise to get you started in haskell? 15:04:44 From William Karlssons : Bumping Torben's ealier Q: Those things you mentioned we should checkout till tomorrow, is there a list or more information on the homepage? 15:04:49 From Oscar Cederberg : thanks gabriel 15:04:57 From Hannes : Ah ok thanks 15:05:12 From Elias Rudberg : I still did not really get how it would behave if we called ackumulate with only 2 arguments 15:05:28 From Oscar Cederberg : the image for how zipwith works (through a flow diagram) was very helpful. thank you. 15:05:34 From Miro : What is the deadline for the assignments? Can you hand them in all at once? 15:05:42 From Gabriel Borglund : Elias, the sum1 is actually a new function. It takes one argument 15:05:47 From Gabriel Borglund : The list that is 15:05:55 From Karl Hallsby : What do we watch for tomorrow @Jacek? 15:06:18 From Elias Rudberg : @gabriel Alright, that cleares it up ^^ 15:07:11 From alex : Where do we find this link? 15:07:34 From Kasper Dejke : https://channel9.msdn.com/Series/C9-Lectures-Erik-Meijer-Functional-Programming-Fundamentals/Lecture-Series-Erik-Meijer-Functional-Programming-Fundamentals-Chapter-1 15:07:39 From Gabriel Borglund : Thank you! :D