Starting in week 4 for students who would like to go beyond what will be covered in the normal tutorials. Students who have not done the work in advance may be sent away. Only way to learn is to do the work before the tutorial, not at the tutorial. You must attempt the work before the tutorial and bring with youĪ copy of the work you have done. Tutorial, which includes completing the tutorial exercises and the reading. Students are expected to prepare for each Link: Tutorial group times, places and membership. The tutorials that are not labelled as beginner-friendly will tend to proceed more quickly. In each tutorial timeslot so timetabling conflicts should not prevent anybodyįrom switching into, or out of, a beginner-friendly tutorial.Īll tutorial groups will cover the same tutorial exercises but the beginner-friendly tutorials will proceed more carefully, as required by the students in the group, to make sure that all students are keeping up. There will be a beginner-friendly tutorial Have no programming experience, or who are less confident, may wish to Some tutorial groups are designated as "beginner friendly". Tutor, and if possible attend another tutorial group in the same week.
If you are ill or otherwise unable to attend one week then email the Take place each week until week 10, led by a tutor. : (If you are having trouble on a mac, see these instructions.) : Comprehensions ( p127 in Thompson, referred to in Q12) Link: CamlBack (select language Haskell and login as guest) CamlBack is still underĭevelopment and for some kinds of exercises the feedback will be more helpful than for others. It may help you to make better progress on the exercises before your tutorialīut it is not a substitute for tutorial attendance. The CamlBack system, hosted at UCLA, can provide automated feedback on most of your tutorial exercises. If you are having difficulties, drop in to the lab when a demonstrator is on duty. You can discuss your work on these exercises with other students, and ask questions on This work does not contribute towards your mark for the course but it isĪbsolutely essential for your understanding of the material. Published here at least a week before the corresponding tutorial. You are very strongly advised to attend all lectures! Tuesday slides (continuing from Monday) andĭuring Semester 1, 14:10–15:00 Mondays in George Square Lecture Theatre and 11:10–12:00 Tuesdays in David Hume Tower Lecture Theatre A.Įxcept for the following swaps with Inf1-CL: Thursday slides (continuing from Tuesday) and Monday slides (continuing from Friday) andįriday slides (continuing from Tuesday) and The pages in the two course textbooks that correspond to each lecture
#Haskell functional programming code
Here are the annotated slides and code examples for each lecture. During semester 1, students should also be The first-year programme for all undergraduate degrees in the School of Informatics 1: Functional Programming is part of Higher-order functions and data types, whilstĮmphasizing the practical use of such constructs. The main goal is to acquaint the student withįundamental programming concepts such as recursion, abstraction, The course teaches the basics of functional programming using the Suitable for first-year undergraduate students This is a course in the School of Informatics Informatics 1: Functional Programming 2017–2018
0 kommentar(er)
