| Entrambe le parti precedenti la revisioneRevisione precedenteProssima revisione | Revisione precedente |
| magistraleinformatica:mpp:start [02/10/2025 alle 12:34 (3 giorni fa)] – [Lectures (1st part)] Roberto Bruni | magistraleinformatica:mpp:start [02/10/2025 alle 12:36 (3 giorni fa)] (versione attuale) – [Lectures (1st part)] Roberto Bruni |
|---|
| | 6 | Fri | 26/09 | 16:00-18:00 | L1 | Exercises:\\ //induction//\\ \\ {{ :magistraleinformatica:mpp:2025-09-26_-_05b_-_more_induction.pdf |05 - More induction}} (Structural Induction)://many-sorted signatures, arithmetic and boolean expressions, structural induction over many-sorted signatures, termination of boolean expressions, memories, update operation, operational semantics of commands// | | | | 6 | Fri | 26/09 | 16:00-18:00 | L1 | Exercises:\\ //induction//\\ \\ {{ :magistraleinformatica:mpp:2025-09-26_-_05b_-_more_induction.pdf |05 - More induction}} (Structural Induction)://many-sorted signatures, arithmetic and boolean expressions, structural induction over many-sorted signatures, termination of boolean expressions, memories, update operation, operational semantics of commands// | | |
| | 7 | Tue | 30/09 | 16:00-18:00 | C1 | Exercises:\\ //induction//\\ \\ {{ :magistraleinformatica:mpp:2025-09-30_-_05c_-_rule_induction.pdf |05 - More induction (Rule Induction)}}:\\ //divergence, rule for divergence, limits of structural induction, induction on derivations, rule induction, determinacy of commands// | | | | 7 | Tue | 30/09 | 16:00-18:00 | C1 | Exercises:\\ //induction//\\ \\ {{ :magistraleinformatica:mpp:2025-09-30_-_05c_-_rule_induction.pdf |05 - More induction (Rule Induction)}}:\\ //divergence, rule for divergence, limits of structural induction, induction on derivations, rule induction, determinacy of commands// | | |
| | 8 | Thu | 02/10 | 09:00-11:00 | L1 | {{ :magistraleinformatica:mpp:2025-10-02_-_06_-_equivalence.pdf |06 - Equivalence}}:\\ //operational equivalence, concrete equivalences, parametric equivalences, equivalence and divergence//\\ \\ {{ :magistraleinformatica:mpp:2025-10-02_-_07_-_recursion.pdf |07 - Induction and recursion}}:\\ //well-founded recursion, lexicographic precedence relation, Ackermann function, denotational semantics of arithmetic expressions// | | | | 8 | Thu | 02/10 | 09:00-11:00 | L1 | {{ :magistraleinformatica:mpp:2025-10-02_-_06_-_equivalence.pdf |06 - Equivalence}}:\\ //operational equivalence, concrete equivalences, parametric equivalences, equivalence and divergence//\\ \\ {{ :magistraleinformatica:mpp:2025-10-02_-_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 | | | | | 08 - 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, monotonicity//\\ \\ Exercises:\\ //induction, termination, determinacy, divergence//\\ \\ 08 - Partial orders and fixpoints (ctd.):\\ //continuity, Kleene's fixpoint theorem, McCarthy's 91 function// | | | | 9 | Fri | 03/10 | 16:00-18:00 | L1 | 08 - 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, monotonicity//\\ \\ Exercises:\\ //induction, termination, determinacy, divergence// | | |
| | 10 | | | | | 08 - Partial orders and fixpoints (ctd.):\\ //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// | | | | 10 | | | | | 08 - Partial orders and fixpoints (ctd.):\\ //continuity, Kleene's fixpoint theorem, 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 | | | | | Exercises:\\ //posets//\\ \\ 10 - Consistency:\\ //denotational equivalence, congruence, compositionality principle, consistency of commands, correctness, completeness// | | | | 11 | | | | | Exercises:\\ //posets//\\ \\ 10 - Consistency:\\ //denotational equivalence, congruence, compositionality principle, consistency of commands, correctness, completeness// | | |
| | 12 | | | | | Exercises:\\ //well-founded recursion, posets, semantics//\\ \\ 11 - Haskell:\\ //an overview//\\ \\ Haskell ghci:\\ //basics, tuples, lists, list comprehension, guards, pattern matching, lambda, partial application, zip, exercises// | | | | 12 | | | | | Exercises:\\ //well-founded recursion, posets, semantics//\\ \\ 11 - Haskell:\\ //an overview//\\ \\ Haskell ghci:\\ //basics, tuples, lists, list comprehension, guards, pattern matching, lambda, partial application, zip, exercises// | | |
