Studying at the University of Verona
Here you can find information on the organisational aspects of the Programme, lecture timetables, learning activities and useful contact details for your time at the University, from enrolment to graduation.
Study Plan
This information is intended exclusively for students already enrolled in this course.If you are a new student interested in enrolling, you can find information about the course of study on the course page:
Laurea magistrale in Ingegneria e scienze informatiche - Enrollment from 2025/2026The Study Plan includes all modules, teaching and learning activities that each student will need to undertake during their time at the University.
Please select your Study Plan based on your enrollment year.
1° Year
Modules | Credits | TAF | SSD |
---|
2° Year activated in the A.Y. 2012/2013
Modules | Credits | TAF | SSD |
---|
Tre insegnamenti a scelta tra i seguenti
Modules | Credits | TAF | SSD |
---|
Modules | Credits | TAF | SSD |
---|
Tre insegnamenti a scelta tra i seguenti
Modules | Credits | TAF | SSD |
---|
Legend | Type of training activity (TTA)
TAF (Type of Educational Activity) All courses and activities are classified into different types of educational activities, indicated by a letter.
Foundations of Computing (2011/2012)
The teaching is organized as follows:
Learning outcomes
Module: LOGICA
-------
Module: LINGUAGGI
-------
The aim of the course is to present the theoretical basis of programming languages. A number of paradigmatic untyped and typed languages will be introduced. The entire course will focus on the concepts of operational semantics and type system. Formal techniques for verifying the behaviour of programs will be introduced.
Program
Module: LOGICA
-------
Module: LINGUAGGI
-------
Induction:
(i) Mathematical induction over the natural numbers;
(ii) Structural induction;
(iii) Rule induction.
Operational semantics:
Big step and small step semantics for simple languages including
(i) Exp, Bool, languages for arithmetic and Boolean expressions
(ii) the imperative language of while commands While
(iii)the functional languages Fun and Lambda and simple variations on them; call-by-name and call-by-value semantics.
Typing:
(i) Typing assignments for the languages Fun and Lambda
(ii) Progress and preservation.
(iii) For Lambda you should be familiar with the computational consequences of using types; in particular the need for explicit fixpoint operators.
Examination Methods
Module: LOGICA
-------
Module: LINGUAGGI
-------
The exam consists of a written and oral test.