Skip to main content
Before choosing courseDD1362 Programming Paradigms 6.0 creditsAdministrate About course

This course gives an introduction to functional programming, web programming and syntactical analysis.

Choose semester and course offering

Choose semester and course offering to see information from the correct course syllabus and course offering.

* Retrieved from Course syllabus DD1362 (Spring 2021–)

Content and learning outcomes

Course contents

Functional programming: the function concept, higher order functions, currying, evaluation strategies, streams, pattern matching, overloading, polymorphism, interpretation, types and classes.

Formal languages and syntax analysis: automata, regular expressions, grammars, lexical analysis, recursive descent, classes of languages

Internet programming.

Language translation: interpretation, compilation and linking.

Intended learning outcomes

After passing the course, the student should be able to:

  • apply and explain general concepts in programming, in particular flow of control, recursion, interpretation, paradigms and computing models
  • apply and explain basic concepts in functional programming, in particular clean functions, reference transparency, higher order functions, lazy evaluation, immutability, types and classes
  • apply and explain basic concepts in formal languages and syntax analysis, in particular automata, regular expression, grammars, lexical analysis and recursive descent
  • write own client-server programs as well as use protocols and be able to explain how they are interpreted and written

in order to

  • obtain a broader perspective on programming
  • be able to assess which paradigm and which programming language that is appropriate to solve a certain assignment
  • be able to use adequate programming style in a chosen programming paradigm
  • be able to participate in discussions about programming paradigms, history of programming languages, language definition, properties of type systems, principles of language design, language translation, programming principles and programming concepts actively

Course Disposition

No information inserted

Literature and preparations

Specific prerequisites

Completed courses in programming equivalent to DD1337 and algorithms and data structures equivalent to DD1338.

Active participation in a course offering where the final examination is not yet reported in LADOK is considered equivalent to completion of the course.

Registering for a course is counted as active participation.

The term 'final examination' encompasses both the regular examination and the first re-examination.

Recommended prerequisites

Basic computer science knowledge equivalent to DD1320, DD1321, DD1325, DD1327, DD1338, DD2325 or ID1020.

Object oriented programming knowledge equivalent to DD1310, DD1312, DD1315, DD1318, DD1331 or DD1337.

Largest yield of DD1362 will a student who have taken DD1396 Parallel programming and DD1351 Logic for computer scientists receive.


No information inserted


No information inserted

Examination and completion

If the course is discontinued, students may request to be examined during the following two academic years.

Grading scale

A, B, C, D, E, FX, F


  • LAB1 - Laboratory work, 3,5 hp, betygsskala: A, B, C, D, E, FX, F
  • TEN1 - Examination, 2,5 hp, betygsskala: P, F

Based on recommendation from KTH’s coordinator for disabilities, the examiner will decide how to adapt an examination for students with documented disability.

The examiner may apply another examination format when re-examining individual students.

Opportunity to complete the requirements via supplementary examination

No information inserted

Opportunity to raise an approved grade via renewed examination

Grade raising is not allowed.


Profile picture Philipp Haller

Ethical approach

  • All members of a group are responsible for the group's work.
  • In any assessment, every student shall honestly disclose any help received and sources used.
  • In an oral assessment, every student shall be able to present and answer questions about the entire assignment and solution.

Further information

Course web

Further information about the course can be found on the Course web at the link below. Information on the Course web will later be moved to this site.

Course web DD1362

Offered by

EECS/Computer Science

Main field of study


Education cycle

First cycle

Add-on studies

DD2481 Principles of programming languages, DD2372 Automata and languages, DD2457 Program semantics and analysis.


Marcus Dicander

Supplementary information

The course cannot be comibned with DD1361.

In this course, the EECS code of honor applies, see: