Differenze

Queste sono le differenze tra la revisione selezionata e la versione attuale della pagina.

--- magistraleinformatica:psc:start [08/03/2025 alle 17:00 (5 giorni fa)] – [Lectures (1st part)] Roberto Bruni
+++ magistraleinformatica:psc:start [08/03/2025 alle 17:01 (5 giorni fa)] (versione attuale) – [Lectures (1st part)] Roberto Bruni
@@ Linea 105: / Linea 105: @@
 |  6 | Thu | 06/03 | 14:00-16:00 | C1 | 05 - Induction (ctd.):\\ //divergence, rule for divergence, limits of structural induction, induction on derivations, rule induction, determinacy of commands// | {{ :magistraleinformatica:psc:2025-03-06_-_05c_-_rule_induction.pdf |Lecture 05c}} |
 |  7 | Fri | 07/03 | 09:00-11:00 | L1 | 06 - Equivalence:\\ //operational equivalence, concrete equivalences, parametric equivalences, equivalence and divergence//\\ \\ 07 - Induction and recursion:\\ //well-founded recursion, lexicographic precedence relation, Ackermann function, denotational semantics of arithmetic expressions, consistency of operational and denotational semantics for arithmetic expressions, fixpoint equations// | {{ :magistraleinformatica:psc:2025-03-07_-_06_-_equivalence.pdf |Lecture 06}}\\ {{ :magistraleinformatica:psc:2025-03-07_-_07_-_recursion.pdf |Lecture 07}} |
-|  8 |  |  |  |  | 08 - Partial orders and fixpoints (ctd.):\\ //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// | Lecture 07\\ Lecture 08a\\ Lecture 08b  |
+|  8 | Tue | 11/03 | 09:00-11:00 | E | 08 - Partial orders and fixpoints (ctd.):\\ //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// | Lecture 08a\\ Lecture 08b  |
-|  9 |  |  |  |  | Exercises:\\ //induction, termination, determinacy, divergence//\\ \\ 08 - Partial orders and fixpoints (ctd.):\\ //continuity, Kleene's fixpoint theorem, McCarthy's 91 function// | Exercises 02\\ Lecture 08b\\  |
+|  9 | Thu | 13/03 | 14:00-16:00 | C1 | Exercises:\\ //induction, termination, determinacy, divergence//\\ \\ 08 - Partial orders and fixpoints (ctd.):\\ //continuity, Kleene's fixpoint theorem, McCarthy's 91 function// | Exercises 02\\ Lecture 08b\\  |
-| 10 |  |  |  |  | Exercises:\\ //well-founded recursion, posets, semantics//\\ \\ 08 - Partial orders and fixpoints (ctd.):\\ //recursive definitions of partial functions as logical systems, immediate consequences operator, set of theorems as fixpoint// | Exercises 03\\ Lecture 08c |
+| 10 | Fri | 14/03 | 09:00-11:00 | L1 | Exercises:\\ //well-founded recursion, posets, semantics//\\ \\ 08 - Partial orders and fixpoints (ctd.):\\ //recursive definitions of partial functions as logical systems, immediate consequences operator, set of theorems as fixpoint// | Exercises 03\\ Lecture 08c |
 | 11 |  |  |  |  | 09 - Denotational semantics:\\ //lambda-notation, free variables, capture-avoiding substitutions, alpha-conversion, beta rule, conditionals, denotational semantics of commands, fixpoint computation//\\ \\ 10 - Consistency:\\ //denotational equivalence, congruence, compositionality principle, consistency of commands, correctness, completeness// | Lecture 09\\ Lecture 10 |
 | 12 |  |  |  |  | 11 - Haskell:\\ //an overview//\\ \\ Haskell ghci:\\ //basics, tuples, lists, list comprehension, guards, pattern matching, lambda, partial application, zip, exercises// | [[https://www.haskell.org/|Haskell]]\\ Lecture 11\\ ghci session 01 |