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 revisione Revisione precedente
Prossima revisione
Revisione precedente
magistraleinformatica:plp:start [11/03/2014 alle 15:31 (10 anni fa)]
Marco Bellia [Lectures]
magistraleinformatica:plp:start [11/03/2014 alle 15:36 (10 anni fa)] (versione attuale)
Marco Bellia [Lectures]
Linea 21: Linea 21:
 the Object Oriented, the Functional, and the Logic Programming paradigms, and on their use in the various programming methodologies. The Programming methodologies considered in the course includes Decomposition Based, Fully Abstract Abstraction, Inductive Programming, Divide and Conquer, Functional Programming, Memoization, Tail Recursion, Polymorphic Programming, Higher Order Programming, Combinator Based, Deductive Programming, Object Oriented Programming the Object Oriented, the Functional, and the Logic Programming paradigms, and on their use in the various programming methodologies. The Programming methodologies considered in the course includes Decomposition Based, Fully Abstract Abstraction, Inductive Programming, Divide and Conquer, Functional Programming, Memoization, Tail Recursion, Polymorphic Programming, Higher Order Programming, Combinator Based, Deductive Programming, Object Oriented Programming
 {{:magistraleinformatica:plp:lecture9-10fun.pdf|}} {{:magistraleinformatica:plp:lecture9-10fun.pdf|}}
-{{:magistraleinformatica:plp:principi_di_linguaggi.pdf|}}====== Lectures ======+{{:magistraleinformatica:plp:principi_di_linguaggi.pdf|}} 
 +====== Lectures ======
  
 ^ Date ^ Lecture ^ Notes ^ Reading ^ ^ Date ^ Lecture ^ Notes ^ Reading ^
Linea 36: 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| 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.1394551915.txt.gz · Ultima modifica: 11/03/2014 alle 15:31 (10 anni fa) da Marco Bellia