Thursday,
Hours 10:30 AM
- 12:30 PM,
Orario ricevimento per il mese di settembre
giovedì 10.30-12.30
La mia ricerca è sempre stata orientata agli aspetti logici dell'informatica.
Sono convinto che la ricerca teorica sia uno dei cardini dell'università e che non possa per nessun motivo essere vincolata alle cosiddette esigenze del territorio.
Le università devono guardare a tutto il mondo contribuendo alla crescita della conoscenza globale.
Mi occupo dei fondamenti logici dell'informatica teorica e quantistica, in particolare:
Nella didattica mi sono sempre prestato alle esigenze dei corsi di laurea, insegnando le discipline più disparate (spesso molto distanti dai miei interessi di ricerca) quali architetture degli elaboratori, basi di dati, programmazione in C e Java, programmazione di sistema, logica, semantica dei linguaggi di programmazione, implementazione dei linguaggi di programmazione, compilatori, matematica discreta.
Modules running in the period selected: 66.
Click on the module to see the timetable and course details.
There you will find information, resources and services useful during your time at the University (Student’s exam record, your study plan on ESSE3, Distance Learning courses, university email account, office forms, administrative procedures, etc.). You can log into MyUnivr with your GIA login details: only in this way will you be able to receive notification of all the notices from your teachers and your secretariat via email and also via the Univr app.
MyUnivrDi seguito sono elencati gli eventi e gli insegnamenti di Terza Missione collegati al docente:
Topic | Description | Research area |
---|---|---|
Computability | Quantum and probabilistic computability. Implicit Complexity Theory. |
Algebra, Geometry, and Mathematical Logic
Models of computation |
Computability | Quantum and probabilistic computability. Implicit Complexity Theory. |
Algorithms, Logic, and Theory of Computing
Models of computation |
Computability | Quantum and probabilistic computability. Implicit Complexity Theory. |
Software Engineering and Formal Verification
Models of computation |
Lambda Calculus | Quantum and Probabilistic lambda calculi. Lambda calculus for Continuation Passing Style. Computational interpretation of modal proofs. |
Algebra, Geometry, and Mathematical Logic
Logic |
Lambda Calculus | Quantum and Probabilistic lambda calculi. Lambda calculus for Continuation Passing Style. Computational interpretation of modal proofs. |
Algorithms, Logic, and Theory of Computing
Logic |
Lambda Calculus | Quantum and Probabilistic lambda calculi. Lambda calculus for Continuation Passing Style. Computational interpretation of modal proofs. |
Software Engineering and Formal Verification
Logic |
modal and temporal logics | Proof theoretical analysis of modal and temporal logics. Modal and temporal logics for security. Distribute logics. Branching a linear temporal logics. |
Algebra, Geometry, and Mathematical Logic
Logic |
modal and temporal logics | Proof theoretical analysis of modal and temporal logics. Modal and temporal logics for security. Distribute logics. Branching a linear temporal logics. |
Algorithms, Logic, and Theory of Computing
Logic |
modal and temporal logics | Proof theoretical analysis of modal and temporal logics. Modal and temporal logics for security. Distribute logics. Branching a linear temporal logics. |
Software Engineering and Formal Verification
Logic |
proof theory, Linear logic, Type theory | Sequent calculi for modal, linear and temporal logics. Natural deduction systems for modal, linear and temporal logics. Labelled deductive systems. Type systems for CPS. Proof nets for linear and classical logics. Deductive systems for quantum computability. |
Algebra, Geometry, and Mathematical Logic
Logic |
proof theory, Linear logic, Type theory | Sequent calculi for modal, linear and temporal logics. Natural deduction systems for modal, linear and temporal logics. Labelled deductive systems. Type systems for CPS. Proof nets for linear and classical logics. Deductive systems for quantum computability. |
Algorithms, Logic, and Theory of Computing
Logic |
proof theory, Linear logic, Type theory | Sequent calculi for modal, linear and temporal logics. Natural deduction systems for modal, linear and temporal logics. Labelled deductive systems. Type systems for CPS. Proof nets for linear and classical logics. Deductive systems for quantum computability. |
Software Engineering and Formal Verification
Logic |
Quantum computation theory | Quantum lambda calculi. Topological quantum computing. Quantum computational complexity. Theory of quantum computable functions. Quantum theory of interaction. |
Algebra, Geometry, and Mathematical Logic
Models of computation |
Quantum computation theory | Quantum lambda calculi. Topological quantum computing. Quantum computational complexity. Theory of quantum computable functions. Quantum theory of interaction. |
Algorithms, Logic, and Theory of Computing
Models of computation |
Quantum computation theory | Quantum lambda calculi. Topological quantum computing. Quantum computational complexity. Theory of quantum computable functions. Quantum theory of interaction. |
Software Engineering and Formal Verification
Models of computation |
Office | Collegial Body |
---|---|
member | Computer Science Department Council - Department Computer Science |
******** CSS e script comuni siti DOL - frase 9957 ********p>