OVERVIEW

Students will be provided with a deeper and more critical knowledge of programming languages, through the learning of theoretical foundations and the comparison of different paradigms. 

AIMS AND CONTENT

LEARNING OUTCOMES

Gaining a deeper and more critical knowledge of programming languages, through the learning of theoretical foundations and the comparison of different paradigms.

AIMS AND LEARNING OUTCOMES

At the end of the course, studentes will be able to:

Deeply understand the notions presented in the course.

Pratice with some expertise in the proposed programming paradigms.

TEACHING METHODS

Lectures, small project.

SYLLABUS/CONTENT

• Foundations: small-step semantics, type systems, soundness
• Functional paradigm: lambda calculus, call-by-value and call-by-name, simply-typed lambda-calculus, polymorphism, Hindley-Milner inference. Functional programming in Haskell, lazy evaluation, type classes.
• Effects: extensions of lambda-calculus with imperative features and exceptions
• Object-oriented paradigm: subtyping, Featherweight Java
• Logic paradigm: Prolog syntax, model-theoretic semantics, SLD resolution.
• Coinduction and coinductive logic programming

RECOMMENDED READING/BIBLIOGRAPHY

Course notes

Benjamin Pierce, Types and Programming Lannguages

TEACHERS AND EXAM BOARD

Exam Board

ELENA ZUCCA SCHILLANI (President)

DAVIDE ANCONA

FRANCESCO DAGNINO (President Substitute)

LESSONS

LESSONS START

In agreement with the calendar approved by the Degree Program Board of Computer Science.

EXAMS

EXAM DESCRIPTION

The exam will consist of an oral test and possibly the development of a small project.

ASSESSMENT METHODS

The oral exam checks the correct understanding of the concepts, and the ability of presenting them appropriately. The development of a small project checks that the student has experimented the proposed programming paradigms.

Exam schedule