ViewTube

Lectures on the theory of principles of programming lanaguages

Lecture Meivin

6:31

PPL 1.0 - The BEST programming language

Lecture Meivin

11:07

PPL 1.1 - Programming languages paradigms - part 1

Lecture Meivin

5:28

PPL 1.2 - Programming languages paradigms - part 2

Lecture Meivin

13:39

PPL 1.3 - Criteria for evaluating programming languages - part 1

Lecture Meivin

7:34

PPL 1.4 - Criteria for evaluating programming languages - part 2

Lecture Meivin

5:19

PPL 1.5 - Criteria for evaluating programming languages - part 3

Lecture Meivin

6:25

PPL 1.6 - Criteria for evaluating programming languages - part 5

Lecture Meivin

11:59

PPL 2.1 - Purpose of type system

Lecture Meivin

9:32

PPL 2.2 - Types of type systems

Lecture Meivin

16:32

PPL 2.3 - Comparing static vs. dynamic type systems

Lecture Meivin

6:18

PPL 2.4 - Duck typing

Lecture Meivin

6:40

PPL 2.5 - Strong and weak typing

Lecture Meivin

20:02

PPL 3.1 - Type implementation

Lecture Meivin

12:10

PPL 3.2 - Pointers and References

Lecture Meivin

14:16

PPL 3.3 - What are pointers

Lecture Meivin

10:17

PPL 3.4 - Pointer problems

Lecture Meivin

7:53

PPL 3.5 - Pointer problem comparison

Lecture Meivin

1:41

PPL 4.1- The cost of using pointers

Lecture Meivin

3:08

PPL 4.2 - Example of choosing between the two pointer problems

Lecture Meivin

6:44

PPL 4.3 - Tombstones

Lecture Meivin

5:22

PPL 4.4 - Tombstones efficiency

Lecture Meivin

6:34

PPL 4.5 - Locks and Keys

Lecture Meivin

16:14

PPL 4.6 - CPP smart pointers - Part 1

Lecture Meivin

12:53

PPL 4.7 - Smart Pointers - Part 2

Lecture Meivin

13:36

PPL 4.8 - Move semantics in CPP - part 1

Lecture Meivin

6:10

PPL 4.9 - Move semantics in CPP - part 2

Lecture Meivin

2:23

PPL 5.1 - Scopes - Introduction

Lecture Meivin

10:26

PPL 5.2 - Types of scopes

Lecture Meivin

22:40

PPL 5.3 - Static scopes

Lecture Meivin

4:09

PPL 5.4 - Blocks

Lecture Meivin

7:41

PPL 5.5 - Dynamic scopes

Lecture Meivin

7:47

PPL 5.6 - Cost of dynamic scopes

Lecture Meivin

6:21

PPL 6.1 - Memory reclaiming (introduction to garbage collection)

Lecture Meivin

7:14

PPL 6.2 - Reference counting

Lecture Meivin

6:01

PPL 6.3 - Garbage collection using Mark and Sweep

Lecture Meivin

8:15

PPL 6.4 - Mark and Sweep - part 2

Lecture Meivin

5:00

PPL 6.5 - Cost of Mark and Sweep

Lecture Meivin

6:00

PPL 6.6 - Enhancements to Mark and Sweep

Lecture Meivin

11:18

PPL 6.7 - Cheney's algorithm for garbage collection

Lecture Meivin

6:33

PPL 6.8 - Comparison of GC algorithms

Lecture Meivin

4:11

PPL 7.1 - Functions

Lecture Meivin

11:26

PPL 7.2 - Parameter binding

Lecture Meivin

12:07

PPL 7.3 - Parameter passing models

Lecture Meivin

4:57

PPL 7.4 - The run-time stack

Lecture Meivin

11:33

PPL 7.5 - RTS in action

Lecture Meivin

5:16

PPL 8.1 - Calling conventions

Lecture Meivin

7:37

PPL 8.2 - CDECL

Lecture Meivin

5:54

PPL 8.3 - STDCALL

Lecture Meivin

2:18

PPL 8.4 - FastCall

Lecture Meivin

1:08

PPL 8.5 - VS defaults

Lecture Meivin

9:41

PPL 9.1 - Object Oriented Programming Concepts

Lecture Meivin

2:47

PPL 9.2 - Polymorphism: Paradigm concept or mechanism

Lecture Meivin

2:20

PPL 9.3 - Object oriented programing paradigm

Lecture Meivin

7:46

PPL 9.4 - Data Consistency - Part 1

Lecture Meivin

11:18

PPL 9.5 - Data consistency - Part 2

Lecture Meivin

17:40

PPL 9.6 - OOP design issues

Lecture Meivin

10:10

PPL 9.7 - Polymorphism implementation

Lecture Meivin

5:50

PPL 9.8 - vTables and their influence on languages

Lecture Meivin

1:30

PPL 9.9 - OOP wrap-up