Strumenti Utente

Strumenti Sito


magistraleinformatica:plp:start

Differenze

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

Link a questa pagina di confronto

Entrambe le parti precedenti la revisioneRevisione precedente
magistraleinformatica:plp:start [11/03/2014 alle 15:34 (11 anni fa)] – [Lectures] Marco Belliamagistraleinformatica:plp:start [11/03/2014 alle 15:36 (11 anni fa)] (versione attuale) – [Lectures] Marco Bellia
Linea 37: Linea 37:
 | 18/3/2013 | Simple and Compound Commands; commands for structured programming; implementation; Control abstraction |{{:magistraleinformatica:plp:lezione11-12|}}: (in italian) Exercises in slide 11, 12, 13, 21 |ch. 6, 11.1-.3 [GM]; ch. 5 [BM]| | 18/3/2013 | Simple and Compound Commands; commands for structured programming; implementation; Control abstraction |{{:magistraleinformatica:plp:lezione11-12|}}: (in italian) Exercises in slide 11, 12, 13, 21 |ch. 6, 11.1-.3 [GM]; ch. 5 [BM]|
 | 18/3/2013 | Parameter Passing: The 3 steps; By value, By name |Lecture13-14: Exercises in slide 11, 12, 13, 21 |ch. 7 [GM]; ch. 6 [BM]| | 18/3/2013 | Parameter Passing: The 3 steps; By value, By name |Lecture13-14: Exercises in slide 11, 12, 13, 21 |ch. 7 [GM]; ch. 6 [BM]|
-| 20/3/2013 | Parameter Passing: by need, by function/procedure, by reference, by constant, by result, by value-result |[[http://www.di.unipi.it/~bellia/FormaliWeb/FormaliWeb/materiale2004/materiale/AA2013/Paradigmi/Lecture13-14.pdf]] : Exercise in the last slide |ch. 7 [GM]; ch. 6 [BM]|+| 20/3/2013 | Parameter Passing: by need, by function/procedure, by reference, by constant, by result, by value-result |[Lecture13-14.pdf] : Exercise in the last slide |ch. 7 [GM]; ch. 6 [BM]|
 | 25/3/2013 | Fully Abstract Abstractions, Decomposition based Programming, Deep e Shallow Bindings, Inductive Programming, Divide and Conquer Programming, Memoization and Tail Recursive Programming Techniques | {{:magistraleinformatica:plp:lecture|}}: Exercises in the last slide |ch. 7 [GM]; ch. 6 [BM]| | 25/3/2013 | Fully Abstract Abstractions, Decomposition based Programming, Deep e Shallow Bindings, Inductive Programming, Divide and Conquer Programming, Memoization and Tail Recursive Programming Techniques | {{:magistraleinformatica:plp:lecture|}}: Exercises in the last slide |ch. 7 [GM]; ch. 6 [BM]|
 | 27/3/2013 | Data, Data types and Types: Type System, Type Safety, System F1, Equivalence, Coercion, Cast, Polymorphism | {{:magistraleinformatica:plp:lecture18-19e|}}: Exercises in the last slide |ch. 8 [GM]; | | 27/3/2013 | Data, Data types and Types: Type System, Type Safety, System F1, Equivalence, Coercion, Cast, Polymorphism | {{:magistraleinformatica:plp:lecture18-19e|}}: Exercises in the last slide |ch. 8 [GM]; |
magistraleinformatica/plp/start.1394552044.txt.gz · Ultima modifica: 11/03/2014 alle 15:34 (11 anni fa) da Marco Bellia

Donate Powered by PHP Valid HTML5 Valid CSS Driven by DokuWiki