DM509: Programming Languages (5 ECTS)
STADS: 15011001
Level
Bachelor course
Teaching period
The course is offered in the autumn semester.
Second quarter.
Teacher responsible
Email: petersk@imada.sdu.dk
Timetable
Group |
Type |
Day |
Time |
Classroom |
Weeks |
Comment |
Common |
I |
Monday |
10-12 |
U142 |
45 |
|
Common |
I |
Wednesday |
12-14 |
U27a |
49-51 |
|
Common |
I |
Thursday |
12-14 |
U155 |
45-48 |
|
Common |
I |
Friday |
12-14 |
U155 |
45 |
|
Common |
I |
Friday |
12-14 |
U26 |
47, 49 |
|
S1 |
TE |
Monday |
10-12 |
U142 |
48 |
|
S1 |
TE |
Tuesday |
16-18 |
U27a |
45-51 |
|
S1 |
TE |
Friday |
12-14 |
U26 |
46, 48 |
|
Show entire timetable
Show personal time table for this course.
Comment:
Ubegrænset deltagerantal. Kurset kører i 2. kvartal.
Prerequisites:
None
Academic preconditions:
The contents of Programming A (DM502) and B (DM503) must be known. The course Algorithms and Data Structures (DM507) is recommended.
Course introductionTo give the students the general principles of programming languages design, and the specific choices characterizing the language classes imperative, object-oriented, logic-based and functional . To give the participants experience with programming in language of other types than the usual imperative and object-oriented languages.
Expected learning outcomeAfter the course, the student is expected to be able to:
- solve non-trivial programming tasks in a functional programming language by writing clear and correct code and by applying the standard language libraries.
- solve non-trivial programming tasks in a logic-based language by writing clear and correct code and by applying the standard language libraries.
- estimate time and space consumption of functional programs.
- prove properties of simple functional programs.
- calculate the most general type of a functional expression.
- calculate the most general unifier of two terms.
- execute resolution for a logical goal.
- convert an expression in first order logic to clausal form.
Subject overview- General languages mechanisms:
Control structure, type systems, abstraction, module.
- Functional languages:
Functions, higher-order types, polymorphism, lists, lazy evaluation, referential transparency, monads, efficiency considerations, proof of correctness
- Logic based languages:
Predicates and rules, unification, SLD resolution, function symbols, lists, implementation of negation, constraint programming.
LiteratureMeddeles ved kursets start.
Website
This course uses
e-learn (blackboard).
Prerequisites for participating in the exam
None
Assessment and marking:
Project divided into parts and integrated in the course. Pass/fail, internal evaluation by the teacher.
Re-examination after 4th quarter.
Expected working hours
The teaching method is based on three phase model.
Forelæsninger (22 timer), eksaminatorier (20 timer) og projektarbejde.
Educational activities
Language
This course is taught in Danish or English, depending on the lecturer. However, if international students participate, the teaching language will always be English.
Course enrollment
See deadline of enrolment.
Tuition fees for single courses
See fees for single courses.