| Entrambe le parti precedenti la revisioneRevisione precedenteProssima revisione | Revisione precedente |
| magistraleinformatica:mpp:start [30/09/2026 alle 23:03 (5 settimane fa)] – [Lectures (1st part)] Roberto Bruni | magistraleinformatica:mpp:start [20/10/2026 alle 22:55 (14 giorni fa)] (versione attuale) – [Lectures (2nd part)] Roberto Bruni |
|---|
| | 7 | Tue | 29/09 | 11:00-13:00 | PS4 | Exercises:\\ //induction//\\ \\ {{ :magistraleinformatica:mpp:2026-09-29_-_mpp_-_05c_-_rule_induction.pdf |05c - More induction (Rule Induction)}}:\\ //divergence, rule for divergence, limits of structural induction, induction on derivations, rule induction, determinacy of commands// | | | | 7 | Tue | 29/09 | 11:00-13:00 | PS4 | Exercises:\\ //induction//\\ \\ {{ :magistraleinformatica:mpp:2026-09-29_-_mpp_-_05c_-_rule_induction.pdf |05c - More induction (Rule Induction)}}:\\ //divergence, rule for divergence, limits of structural induction, induction on derivations, rule induction, determinacy of commands// | | |
| | 8 | Wed | 30/09 | 11:00-13:00 | H | {{ :magistraleinformatica:mpp:2026-09-30_-_mpp_-_06_-_equivalence.pdf |06 - Equivalence}}:\\ //operational equivalence, concrete equivalences, parametric equivalences, equivalence and divergence//\\ \\ Exercises:\\ //termination, determinacy, divergence//\\ \\ {{ :magistraleinformatica:mpp:2026-09-30_-_mpp_-_07_-_recursion.pdf |07 - Induction and recursion}}:\\ //well-founded recursion, lexicographic precedence relation, Ackermann function, denotational semantics of arithmetic expressions, towards denotational semantics of commands// | | | | 8 | Wed | 30/09 | 11:00-13:00 | H | {{ :magistraleinformatica:mpp:2026-09-30_-_mpp_-_06_-_equivalence.pdf |06 - Equivalence}}:\\ //operational equivalence, concrete equivalences, parametric equivalences, equivalence and divergence//\\ \\ Exercises:\\ //termination, determinacy, divergence//\\ \\ {{ :magistraleinformatica:mpp:2026-09-30_-_mpp_-_07_-_recursion.pdf |07 - Induction and recursion}}:\\ //well-founded recursion, lexicographic precedence relation, Ackermann function, denotational semantics of arithmetic expressions, towards denotational semantics of commands// | | |
| | 9 | Fri | 02/10 | 14:00-16:00 | C1 | Exercises:\\ //termination, determinacy, divergence//\\ \\ 08a - Partial orders and fixpoints:\\ //consistency of operational and denotational semantics for arithmetic expressions, fixpoint equations, partial orders, Hasse diagrams, chains, least element, minimal element, bottom element, upper bounds, least upper bound, limits, complete partial orders, powerset completeness, prefix independence, CPO of partial functions// | | | | 9 | Fri | 02/10 | 14:00-16:00 | C1 | Exercises:\\ //termination, determinacy, divergence//\\ \\ {{ :magistraleinformatica:mpp:2026-10-02_-_08a_.pdf |08a - Partial orders and fixpoints}}:\\ //consistency of operational and denotational semantics for arithmetic expressions, fixpoint equations, partial orders, Hasse diagrams, chains, least element, minimal element, bottom element, upper bounds, least upper bound, limits, complete partial orders, powerset completeness, prefix independence, CPO of partial functions// | | |
| | 10 | Tue | 06/10 | 11:00-13:00 | PS4 | 08b - Partial orders and fixpoints (Kleene's theorem):\\ //monotonicity, continuity, Kleene's fixpoint theorem//\\ \\ Exercises:\\ //well-founded recursion, posets, semantics// | | | | 10 | Tue | 06/10 | 11:00-13:00 | PS4 | {{ :magistraleinformatica:mpp:2026_-_08b_-_kleene_versione_bonchi.pdf |08b - Partial orders and fixpoints (Kleene's theorem)}}:\\ //monotonicity, continuity, Kleene's fixpoint theorem//\\ \\ Exercises:\\ //well-founded recursion, posets, semantics// | | |
| | 11 | Wed | 07/10 | 11:00-13:00 | H | 08c - Partial orders and fixpoints (Immediate Consequence Operator):\\ //McCarthy's 91 function, recursive definitions of partial functions as logical systems, immediate consequences operator, set of theorems as fixpoint//\\ \\ 09 - Denotational semantics:\\ //lambda-notation, free variables, capture-avoiding substitutions, alpha-conversion, beta rule, conditionals, denotational semantics of commands, fixpoint computation// | | | | 11 | Wed | 07/10 | 11:00-13:00 | H | {{ :magistraleinformatica:mpp:2026_-_08c_-_ico_versionebonchi.pdf |08c - Partial orders and fixpoints (Immediate Consequence Operator)}}:\\ //McCarthy's 91 function, recursive definitions of partial functions as logical systems, immediate consequences operator, set of theorems as fixpoint// | | |
| | 12 | Fri | 09/10 | 14:00-16:00 | C1 | 10 - Consistency:\\ //denotational equivalence, congruence, compositionality principle, consistency of commands, correctness, completeness// | | | | - | Fri | 09/10 | 14:00-16:00 | C1 | **canceled** | | |
| | 13 | Tue | 13/10 | 11:00-13:00 | PS4 | Exercises:\\ //CPO, continuous functions, IMP// | | | | 12 | Tue | 13/10 | 11:00-13:00 | PS4 | {{ :magistraleinformatica:mpp:2026-10-13_-_mpp_-_09_-_denotational_imp.pdf |09 - Denotational semantics}}:\\ //lambda-notation, free variables, capture-avoiding substitutions, alpha-conversion, beta rule, conditionals, denotational semantics of commands, fixpoint computation//\\ \\ Exercises:\\ //IMP// | | |
| | 14 | Wed | 14/10 | 11:00-13:00 | H | 11a - Haskell:\\ //an overview, Haskell ghci, basics, tuples, lists, list comprehension, guards, pattern matching, lambda, partial application, zip// | [[https://www.haskell.org/|Haskell]] | | | 13 | Wed | 14/10 | 11:00-13:00 | H | {{ :magistraleinformatica:mpp:2026-10-14_-_mpp_-_10_-_consistency_imp.pdf |10 - Consistency}}:\\ //denotational equivalence, congruence, compositionality principle, consistency of commands, correctness, completeness//\\ \\ {{ :magistraleinformatica:mpp:2026-10-14_-_mpp_-_11a_-_haskell.pdf |11a - Haskell}}:\\ //an overview, Haskell ghci, basics, tuples, lists// | [[https://www.haskell.org/|Haskell]] | |
| | 15 | Fri | 16/10 | 14:00-16:00 | C1 | 11b - Haskell GHCi:\\ //conditionals, cases, pattern matching, exercises, recursive definitions, let-in, where, map, filter, fixpoint operator, folds, application, function composition// | [[https://www.haskell.org/|Haskell]] | | | - | Fri | 16/10 | 14:00-16:00 | C1 | **cancelled** | | |
| | 16 | Tue | 20/10 | 11:00-13:00 | PS4 | 12a - HOFL:\\ //syntax, pre-terms, types, types judgements, type system, type checking, type inference, principal type, type preservation//\\ \\ Exercises:\\ //Haskell, type inference in HOFL// | | | | 14 | Tue | 20/10 | 11:00-13:00 | PS4 | {{ :magistraleinformatica:mpp:2026-10-20_-_mpp_-_11b_-_haskell.pdf |11b - Haskell GHCi}}:\\ //list comprehension, guards, pattern matching, lambda, partial application, zip, conditionals, cases, pattern matching, exercises, recursive definitions, let-in, where, map, filter, fixpoint operator, folds, application, function composition// | [[https://www.haskell.org/|Haskell]] | |
| | 17 | Wed | 21/10 | 11:00-13:00 | H | 12b - HOFL:\\ //canonical forms, operational semantics, lazy vs eager evaluation//\\ \\ Exercises:\\ //HOFL, typing, operational semantics// | | | | 15 | Wed | 21/10 | 11:00-13:00 | H | 12a - HOFL:\\ //syntax, pre-terms, types, types judgements, type system, type checking, type inference, principal type, type preservation//\\ \\ Exercises:\\ //Haskell, type inference in HOFL// | | |
| | 18 | Fri | 23/10 | 14:00-16:00 | C1 | 13a - Domain theory:\\ //Integers with bottom, cartesian product, projections, switching lemma, functional domains, lifting, let notation//\\ \\ Exercises:\\ //domains, HOFL denotational semantics// | | | | 16 | Fri | 23/10 | 14:00-16:00 | C1 | 12b - HOFL:\\ //canonical forms, operational semantics, lazy vs eager evaluation//\\ \\ Exercises:\\ //HOFL, typing, operational semantics// | | |
| | 19 | Tue | 27/10 | 11:00-13:00 | PS4 | 13b - Lifted Domains:\\ //lifted domains, lifting operator, de-lifting//\\ \\ 14 - Denotational semantics of HOFL:\\ //definition and examples, type consistency, continuity theorems, apply, fix, curry, uncurry, substitution lemma, compositionality, only free variables matters, canonical terms are not bottom//\\ \\ Exercises:\\ //HOFL, typing, denotational semantics, domains// | | | | 17 | Tue | 27/10 | 11:00-13:00 | PS4 | 13a - Domain theory:\\ //Integers with bottom, cartesian product, projections, switching lemma, functional domains, lifting, let notation//\\ \\ Exercises:\\ //domains, HOFL denotational semantics// | | |
| | 20 | Wed | 28/10 | 11:00-13:00 | H | 14 - Denotational semantics of HOFL (ctd.):\\ //continuity theorems, fix, curry, uncurry, substitution lemma, compositionality, only free variables matters, canonical terms are not bottom//\\ \\ 15 - Consistency of HOFL:\\ //Counterexample to completeness, correctness of the operational semantics, operational convergence, denotational convergence, operational convergence implies denotational convergence (and vice versa), operational and denotational equivalence, correspondence for type int, unlifted semantics, lifted vs unlifted semantics// | | | | 18 | Wed | 28/10 | 11:00-13:00 | H | 13b - Lifted Domains:\\ //lifted domains, lifting operator, de-lifting//\\ \\ 14 - Denotational semantics of HOFL:\\ //definition and examples, type consistency, continuity theorems, apply, fix, curry, uncurry, substitution lemma, compositionality, only free variables matters, canonical terms are not bottom//\\ \\ Exercises:\\ //HOFL, typing, denotational semantics, domains// | | |
| | | - | Fri | 30/10 | 14:00-16:00 | C1 | **cancelled** | | |
| | | 19 | Tue | 03/11 | 11:00-13:00 | PS4 | 14 - Denotational semantics of HOFL (ctd.):\\ //continuity theorems, fix, curry, uncurry, substitution lemma, compositionality, only free variables matters, canonical terms are not bottom//\\ \\ 15 - Consistency of HOFL:\\ //Counterexample to completeness, correctness of the operational semantics, operational convergence, denotational convergence, operational convergence implies denotational convergence (and vice versa), operational and denotational equivalence, correspondence for type int, unlifted semantics, lifted vs unlifted semantics// | | |
| |
| ---- | ---- |
| |
| ^ N ^ Date ^^ Time ^ Room ^ Lecture notes ^ Links ^ | ^ N ^ Date ^^ Time ^ Room ^ Lecture notes ^ Links ^ |
| | 21 | Fri | 30/10 | 14:00-16:00 | C1 | 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]] | | | 20 | Wed | 04/11 | 11:00-13:00 | H | 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]] | |
| | 22 | | | | | 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]] | | | 21 | | | | | 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 | | | | | 17 - CCS:\\ //Introduction to concurrency, Syntax, operational semantics, value passing, modelling imperative programs with CCS// | | | | 22 | | | | | 17 - CCS:\\ //Introduction to concurrency, Syntax, operational semantics, value passing, modelling imperative programs with CCS// | | |
| | 24 | | | | | 18a - Towards bisimulation:\\ //abstract semantics, graph isomorphism, trace equivalence, bisimulation game// | | | | 23 | | | | | 18a - Towards bisimulation:\\ //abstract semantics, graph isomorphism, trace equivalence, bisimulation game// | | |
| | 25 | | | | | 18b - Bisimulation:\\ //strong bisimulation, strong bisimilarity, strong bisimilarity is an equivalence, strong bisimilarity is a bisimulation, strong bisimilarity is the coarsest strong bisimulation, finitely branching processes, strong bisimilarity as a fixpoint, Phi operator, Phi is monotone, Phi is continuous (on finitely branching processes), guarded processes// | | | | 24 | | | | | 18b - Bisimulation:\\ //strong bisimulation, strong bisimilarity, strong bisimilarity is an equivalence, strong bisimilarity is a bisimulation, strong bisimilarity is the coarsest strong bisimulation, finitely branching processes, strong bisimilarity as a fixpoint, Phi operator, Phi is monotone, Phi is continuous (on finitely branching processes), guarded processes// | | |
| | 26 | | | | | 18c - More on bisimulation:\\ //some properties of guarded processes, Knaster-Tarski's fixpoint theorem, strong bisimilarity is a congruence, some laws for strong bisimilarity//\\ \\ 19 - Hennessy-Milner logic:\\ //modalities, HML syntax, formula satisfaction, converse of a formula, HML equivalence// | | | | 25 | | | | | 18c - More on bisimulation:\\ //some properties of guarded processes, Knaster-Tarski's fixpoint theorem, strong bisimilarity is a congruence, some laws for strong bisimilarity//\\ \\ 19 - Hennessy-Milner logic:\\ //modalities, HML syntax, formula satisfaction, converse of a formula, HML equivalence// | | |
| | 27 | | | | | 20 - Weak Semantics:\\ //weak transitions, weak bisimulation, weak bisimilarity, weak bisimilarity is not a congruence, weak observational congruence, Milner's tau-laws//\\ \\ 21 - CCS at work:\\ //playing with CCS (using CAAL), modelling and verification of mutual exclusion algorithms with CCS and CAAL// | | | | 26 | | | | | 20 - Weak Semantics:\\ //weak transitions, weak bisimulation, weak bisimilarity, weak bisimilarity is not a congruence, weak observational congruence, Milner's tau-laws//\\ \\ 21 - CCS at work:\\ //playing with CCS (using CAAL), modelling and verification of mutual exclusion algorithms with CCS and CAAL// | | |
| | 28 | | | | | CCS at work:\\ //playing with CCS (using CAAL), modelling and verification of mutual exclusion algorithms with CCS and CAAL//\\ \\ CAAL session (copy the text and paste it in the Edit panel) | [[http://caal.cs.aau.dk/|CAAL]] | | | 27 | | | | | CCS at work:\\ //playing with CCS (using CAAL), modelling and verification of mutual exclusion algorithms with CCS and CAAL//\\ \\ CAAL session (copy the text and paste it in the Edit panel) | [[http://caal.cs.aau.dk/|CAAL]] | |
| | 29 | | | | | 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//\\ \\ 22b - Mu-calculus:\\ //mu-calculus syntax and semantics// | | | | 28 | | | | | 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//\\ \\ 22b - Mu-calculus:\\ //mu-calculus syntax and semantics// | | |
| | 30 | | | | | 22b - Mu-calculus:\\ //positive normal form, least and greatest fixpoints, invariant properties, possibly properties, mu-calculus with labels//\\ \\ KAT:\\ //Calculus of relations// | | | | 29 | | | | | 22b - Mu-calculus:\\ //positive normal form, least and greatest fixpoints, invariant properties, possibly properties, mu-calculus with labels//\\ \\ KAT:\\ //Calculus of relations// | | |
| | | 30 | | | | | KAT:\\ //Kleene Algebras with Tests// | | |
| | 31 | | | | | KAT:\\ //Kleene Algebras with Tests// | | | | 31 | | | | | KAT:\\ //Kleene Algebras with Tests// | | |
| | 32 | | | | | KAT:\\ //Kleene Algebras with Tests// | | | | 32 | | | | | KAT:\\ //Reasoning about IMP programs// | | |
| | 33 | | | | | KAT:\\ //Reasoning about IMP programs// | | | | 33 | | | | | KAT:\\ //Reasoning about IMP programs// | | |
| | 34 | | | | | KAT:\\ //Reasoning about IMP programs// | | | |
| | End | | | | | | | | | End | | | | | | | |
| |
