Exam Review

Writing type proofs

Mark & Sweep

2-space Copying Collector

Generational Collector

• know how garbage collectors work
• if given a picture of memory be able to draw picture of memory after GC
• know the pros and cons of different managments of memory

Self Passing

{bind [triangle = {(self n) => {if {<= n 0}
                                    0
                                    {+ n {self self {- n 1}}]
    {triangle triangle 100}}

Type Rule

a specific rule for a type

Type Proof

picture 1

a proof for a type of a piece of a program

2-space -> we know where memory goes

picture 2

“heres what memory looks like and the GC runs fraw me the after picture”

Referance Counting

every change to memory we update the referances everywhere

the reverse referance should not be enough to keep the node alive because they are out of convience so they should be weak referenaces.

Generational -> we know where memory goes