| Entrambe le parti precedenti la revisioneRevisione precedenteProssima revisione | Revisione precedente |
| magistraleinformatica:mpp:start [28/11/2025 alle 09:35 (3 giorni fa)] – [Lectures (2nd part)] Roberto Bruni | magistraleinformatica:mpp:start [01/12/2025 alle 13:42 (3 ore fa)] (versione attuale) – [Lectures (2nd part)] Roberto Bruni |
|---|
| |
| ^ N ^ Date ^^ Time ^ Room ^ Lecture notes ^ Links ^ | ^ N ^ Date ^^ Time ^ Room ^ Lecture notes ^ Links ^ |
| | 21 | Fri | 07/11 | 16:00-18:00 | L1 | {{ :magistraleinformatica:mpp:2025-11-06_-_15_-_consistency_hofl.pdf |15 - Consistency of HOFL (ctd.)}}:\\ //unlifted semantics, lifted vs unlifted semantics//\\ \\ Exercises:\\ //HOFL//\\ \\ 16a - Erlang:\\ //an overview, erl, numbers, atoms, tuples, lists, terms, variables, term comparison, pattern matching, list comprehension, modules, functions, guards, higher order, recursion, pids, spawn, self, send, receive, examples// | [[http://www.erlang.org/|Erlang]] | | | 21 | Fri | 07/11 | 16:00-18:00 | L1 | {{ :magistraleinformatica:mpp:2025-11-06_-_15_-_consistency_hofl.pdf |15 - Consistency of HOFL (ctd.)}}:\\ //unlifted semantics, lifted vs unlifted semantics//\\ \\ Exercises:\\ //HOFL//\\ \\ {{ :magistraleinformatica:mpp:2025-11-07_-_16a_-_erlang.pdf |16a - Erlang}}:\\ //an overview, erl, numbers, atoms, tuples, lists, terms, variables, term comparison, pattern matching, list comprehension, modules, functions, guards, higher order, recursion, pids, spawn, self, send, receive, examples// | [[http://www.erlang.org/|Erlang]] | |
| | 22 | Tue | 11/11 | 14:00-16:00 | C1 | {{ :magistraleinformatica:mpp:2025-11-11_-_16b_-_google_go.pdf |16b - GoogleGo}}:\\ //an overview, playground, Go principles, variable declaration, type conversion, multiple assignments, type inference, imports, packages and public names, named return values, naked return, multiple results, conditionals and loops, pointers, struct, receiver arguments and methods, interfaces, goroutines, bidirectional channels, channel types, send, receive, asynchronous communication with buffering, close, select, communicating communication means, range, handling multiple senders, concurrent prime sieve// | [[http://golang.org/|Google Go]] | | | 22 | Tue | 11/11 | 14:00-16:00 | C1 | {{ :magistraleinformatica:mpp:2025-11-11_-_16b_-_google_go.pdf |16b - GoogleGo}}:\\ //an overview, playground, Go principles, variable declaration, type conversion, multiple assignments, type inference, imports, packages and public names, named return values, naked return, multiple results, conditionals and loops, pointers, struct, receiver arguments and methods, interfaces, goroutines, bidirectional channels, channel types, send, receive, asynchronous communication with buffering, close, select, communicating communication means, range, handling multiple senders, concurrent prime sieve// | [[http://golang.org/|Google Go]] | |
| | 23 | Thu | 13/11 | 09:00-11:00 | L1 | {{ :magistraleinformatica:mpp:2025-11-13_-_17_-_ccs.pdf |17 - CCS}}:\\ //Introduction to concurrency, Syntax, operational semantics, value passing, modelling imperative programs with CCS// | | | | 23 | Thu | 13/11 | 09:00-11:00 | L1 | {{ :magistraleinformatica:mpp:2025-11-13_-_17_-_ccs.pdf |17 - CCS}}:\\ //Introduction to concurrency, Syntax, operational semantics, value passing, modelling imperative programs with CCS// | | |
| | 29 | Thu | 27/11 | 09:00-11:00 | L1 | {{ :magistraleinformatica:mpp:2025-11-27_-_22a_-_ltl_ctl.pdf |22a - Temporal logics}}:\\ //linear temporal logic (LTL), linear structures models, shifting, LTL satisfaction, equivalence of formulas, automata-like models, computational tree logic (CTL* and CTL), infinite trees, infinite paths, branching structure, CTL* satisfaction, equivalence of formulas, CTL formulas, expressiveness comparison//\\ \\ {{ :magistraleinformatica:mpp:2025-11-27_-_22b_-_mu_calculus.pdf |22b - Mu-calculus}}:\\ //mu-calculus syntax and semantics// | | | | 29 | Thu | 27/11 | 09:00-11:00 | L1 | {{ :magistraleinformatica:mpp:2025-11-27_-_22a_-_ltl_ctl.pdf |22a - Temporal logics}}:\\ //linear temporal logic (LTL), linear structures models, shifting, LTL satisfaction, equivalence of formulas, automata-like models, computational tree logic (CTL* and CTL), infinite trees, infinite paths, branching structure, CTL* satisfaction, equivalence of formulas, CTL formulas, expressiveness comparison//\\ \\ {{ :magistraleinformatica:mpp:2025-11-27_-_22b_-_mu_calculus.pdf |22b - Mu-calculus}}:\\ //mu-calculus syntax and semantics// | | |
| | - | Fri | 28/11 | 16:00-18:00 | L1 | **Canceled:**\\ //Conflicting institutional activities of the instructor// | | | | - | Fri | 28/11 | 16:00-18:00 | L1 | **Canceled:**\\ //Conflicting institutional activities of the instructor// | | |
| | 30 | Tue | 02/12 | 16:00-18:00 | C1 | {{ :magistraleinformatica:mpp:2025-11-27_-_22b_-_mu_calculus.pdf |22b - Mu-calculus}}:\\ //positive normal form, least and greatest fixpoints, invariant properties, possibly properties, mu-calculus with labels//\\ \\ 23 - Pi-calculus:\\ //name mobility, free names, bound names, syntax and operational semantics, scope extrusion, early and late bisimilarities, weak semantics// | | | | 30 | Tue | 02/12 | 16:00-18:00 | C1 | **Prof. Bruni**\\ {{ :magistraleinformatica:mpp:2025-11-27_-_22b_-_mu_calculus.pdf |22b - Mu-calculus}}:\\ //positive normal form, least and greatest fixpoints, invariant properties, possibly properties, mu-calculus with labels//\\ \\ **Prof. Bonchi**\\ KAT:\\ //Calculus of relations// | | |
| | 31 | Thu | 04/12 | 09:00-11:00 | L1 | **Prof. Bonchi**\\ KAT | | | | 31 | Thu | 04/12 | 09:00-11:00 | L1 | **Prof. Bonchi**\\ KAT:\\ //Kleene Algebras with Tests// | | |
| | 32 | Fri | 05/12 | 16:00-18:00 | L1 | **Prof. Bonchi**\\ KAT | | | | 32 | Fri | 05/12 | 16:00-18:00 | L1 | **Prof. Bonchi**\\ KAT:\\ //Kleene Algebras with Tests// | | |
| | 33 | Tue | 09/12 | 16:00-18:00 | C1 | **Prof. Bonchi**\\ KAT | | | | 33 | Tue | 09/12 | 16:00-18:00 | C1 | **Prof. Bonchi**\\ KAT:\\ //Reasoning about IMP programs// | | |
| | 34 | Thu | 11/12 | 09:00-11:00 | L1 | **Prof. Bonchi**\\ KAT | | | | 34 | Thu | 11/12 | 09:00-11:00 | L1 | **Prof. Bonchi**\\ KAT:\\ //Reasoning about IMP programs// | | |
| | 35 | Fri | 12/12 | 16:00-18:00 | L1 | Introduction to probabilistic models:\\ //Markov chains, stationary distributions, probabilistic bisimilarity, PEPA// | | | | 35 | Fri | 12/12 | 16:00-18:00 | L1 | **Prof. Bonchi**\\ KAT:\\ //Reasoning about IMP programs// | | |
| | End | | | | | | | | | End | | | | | | | |
| |
