| Entrambe le parti precedenti la revisione
Revisione precedente
Prossima revisione
|
Revisione precedente
|
magistraleinformatica:plp:start [11/03/2014 alle 15:23 (10 anni fa)]
Marco Bellia [Lectures] |
magistraleinformatica:plp:start [11/03/2014 alle 15:36 (10 anni fa)] (versione attuale)
Marco Bellia [Lectures] |
| its abstract machine and of the programming methodologies of the supported linguistic constructs. It focuses on the study of three paradigms, | its abstract machine and of the programming methodologies of the supported linguistic constructs. It focuses on the study of three paradigms, |
| 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:principi_di_linguaggi.pdf|}} |
| ====== Lectures ====== | ====== Lectures ====== |
| |
| | 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.pdf|}}: 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]; | |
| | 8/4/2013 | Dynamic Allocation and Deallocation: Costructors and Deallocation Techniques; Decomposition Based, Inductive, Tail Recursion, Memoization Based and Divide and Conquer In Functional Languages; Higher Order Programming: Data Extensions and Control Extensions; Combinatory Programming| {{:magistraleinformatica:plp:lecture20|}} -upgraded-: Exercises in the slides 5,6,9,11| ch. 11.3, 11.5 [GM]; | | | 8/4/2013 | Dynamic Allocation and Deallocation: Costructors and Deallocation Techniques; Decomposition Based, Inductive, Tail Recursion, Memoization Based and Divide and Conquer In Functional Languages; Higher Order Programming: Data Extensions and Control Extensions; Combinatory Programming| {{:magistraleinformatica:plp:lecture20|}} -upgraded-: Exercises in the slides 5,6,9,11| ch. 11.3, 11.5 [GM]; | |
| | 10/4/2013 | Functional Languages: Reduction, Reduction Stategies and Combinatory Programming. Deductive Programming in Problem Solving: The general Problem and an Example | Lecture21-21Part1.pdf, Exercises in the last slide of Lecture20.pdf; {{:magistraleinformatica:plp:Lecture21-22part1|}} |ch. 11.2, 11.6 [GM];\\ ch. 12.1 [GM];| | | 10/4/2013 | Functional Languages: Reduction, Reduction Stategies and Combinatory Programming. Deductive Programming in Problem Solving: The general Problem and an Example | Lecture21-21Part1.pdf, Exercises in the last slide of Lecture20.pdf; {{:magistraleinformatica:plp:Lecture21-22part1|}} |ch. 11.2, 11.6 [GM];\\ ch. 12.1 [GM];| |
| | 15/4/2013 | Deductive Programming: First Order Logic, Prenex Clausal Form, Horn Clause, Minimal Freely Generated Model. The inference rules of Unification and LUSH Resolution, Resolvents | Lecture21-22.pdf; {{:magistraleinformatica:plp:lecture21-22e|}} |ch. 12.2-12.3 [GM];| | | 15/4/2013 | Deductive Programming: First Order Logic, Prenex Clausal Form, Horn Clause, Minimal Freely Generated Model. The inference rules of Unification and LUSH Resolution, Resolvents | Lecture21-22.pdf; {{:magistraleinformatica:plp:lecture21-22e|}} |ch. 12.2-12.3 [GM];| |
| | 17/4/2013 | Deductive Programming in Prolog. Syntax and Semantics. SLD resolution and its Search Space (or Resolvent Tree) | first 10 slides of Lecture23-25; {{:magistraleinformatica:plp:Lecture23-25E.pdf|}} |ch. 12.4.1-2-3 [GM];| | | 17/4/2013 | Deductive Programming in Prolog. Syntax and Semantics. SLD resolution and its Search Space (or Resolvent Tree) | first 10 slides of Lecture23-25; {{:magistraleinformatica:plp:Lecture23-25E|}} |ch. 12.4.1-2-3 [GM];| |
| | 22/4/2013 | Deductive Programming. NonDeterminism, Invertibility, Relational Calculus. Additionals and Extensions in Prolog | Lecture23-25.pdf; {{:magistraleinformatica:plp:Lecture23-25E|}} |ch. 12.4.4-5; 12.5; 12.6 [GM];| | | 22/4/2013 | Deductive Programming. NonDeterminism, Invertibility, Relational Calculus. Additionals and Extensions in Prolog | Lecture23-25.pdf; {{:magistraleinformatica:plp:Lecture23-25E|}} |ch. 12.4.4-5; 12.5; 12.6 [GM];| |
| | 24/4/2013 | From Data Abstractiona to Abstract Data Types. Type Record:Definition, Allocation, Access, Environment, Dynamic Allocation. API and ADT: Syntax and Function Up and Down|Lecture26-27.pdf; | ch. 9.1-9.2-9.3 [GM] (for more insights ch.14 [TG])| | | 24/4/2013 | From Data Abstractiona to Abstract Data Types. Type Record:Definition, Allocation, Access, Environment, Dynamic Allocation. API and ADT: Syntax and Function Up and Down|Lecture26-27.pdf; | ch. 9.1-9.2-9.3 [GM] (for more insights ch.14 [TG])| |
| | 08/05/2013 | Object Oriented Paradigm: Package, Class, Fields, Constructors, Methods | part1 of {{:magistraleinformatica:plp:Lecture|}} with the exercise in the last slide of the part| ch. 10.1-10.2 [GM] | | | 08/05/2013 | Object Oriented Paradigm: Package, Class, Fields, Constructors, Methods | part1 of {{:magistraleinformatica:plp:Lecture|}} with the exercise in the last slide of the part| ch. 10.1-10.2 [GM] | |
| | 13/05/2013 | Object Oriented Paradigm: The Inheritance and The self-reference. Additional Mechanisms: Generic and Sub-type Polymorphism; Interfaces and Anonymous Classes | part2 of {{:magistraleinformatica:plp:Lecture29-30|}}: exercises in the last slides of the part | ch. 10.3-10.4 [GM] | | | 13/05/2013 | Object Oriented Paradigm: The Inheritance and The self-reference. Additional Mechanisms: Generic and Sub-type Polymorphism; Interfaces and Anonymous Classes | part2 of {{:magistraleinformatica:plp:Lecture29-30|}}: exercises in the last slides of the part | ch. 10.3-10.4 [GM] | |
| | 15/05/2013 | Object Oriented Paradigm: Methodologies for ADT and code reuse| {{:magistraleinformatica:plp:Lecture.pdf|}}: exercises in the slides | | | | 15/05/2013 | Object Oriented Paradigm: Methodologies for ADT and code reuse| {{:magistraleinformatica:plp:Lecture|}}: exercises in the slides | | |
| | 20/05/2013 | Object Oriented Paradigm: ADT for Mutable and Immutable Values | {{:magistraleinformatica:plp:Lecture29-30withExercisesII|}}: exercises in the slides | | | | 20/05/2013 | Object Oriented Paradigm: ADT for Mutable and Immutable Values | {{:magistraleinformatica:plp:Lecture29-30withExercisesII|}}: exercises in the slides | | |
| | 20/05/2013 | Code Extension and Reuse in Java; Programming in Prolog | {{:magistraleinformatica:plp:Lecture29-30withExercisesII|}}, {{:magistraleinformatica:plp:strandSet|}}: exercises in the slides | | | | 20/05/2013 | Code Extension and Reuse in Java; Programming in Prolog | {{:magistraleinformatica:plp:Lecture29-30withExercisesII|}}, {{:magistraleinformatica:plp:strandSet|}}: exercises in the slides | | |
| * After each lecture, the relating slides will be available online from this page [SL] | * After each lecture, the relating slides will be available online from this page [SL] |
| * Lecture Notes on the formal aspects of the Programming Language Definition are (currently available only in italian [BM]) in preparation. | * Lecture Notes on the formal aspects of the Programming Language Definition are (currently available only in italian [BM]) in preparation. |
| * Principi di Linguaggi: Semantica Denotazione e Concetti di Programmazione, Bellia, M., March 2012, {{:magistraleinformatica:plp:principi_di_linguaggi.pdf|}} [BM] | * Principi di Linguaggi: Semantica Denotazione e Concetti di Programmazione, Bellia, M., March 2012, {{:magistraleinformatica:plp:principi_di_linguaggi|}} [BM] |
| * Programming Languages: Principles and Paradigms, Gabbrielli, M., Martini, S, Springer, 2010, ISBN 978-1-84882-914-5. [GM] | * Programming Languages: Principles and Paradigms, Gabbrielli, M., Martini, S, Springer, 2010, ISBN 978-1-84882-914-5. [GM] |
| |
