lecture10
web.stanford.edu · 2,081 words · saved by 1 readers
N/A
Type Checking II CS143 Lecture 10 Instructor: Fredrik Kjolstad Slide design by Prof. Alex Aiken, with modifications 1 Lecture Outline • Type systems and their expressiveness • Type checking with SELF_TYPE in COOL • Error recovery in semantic analysis 2 Expressiveness of Static Type Systems • Static type systems detect common errors • But some correct programs are disallowed – Some argue for dynamic type checking instead –…
related reading
- lecture09web.stanford.edu
- lecture13web.stanford.edu
- lecture02web.stanford.edu
- Type theory - Wikipediaen.wikipedia.org
- cool-manual.pdfweb.stanford.edu
- No, dynamic type systems are not inherently more openlexi-lambda.github.io
- web.stanford.edu/class/cs143/lectures/lecture06.pdfweb.stanford.edu
- Reading 11: Recursive Data Typesweb.mit.edu
- TypeScript: Documentation - The Basicstypescriptlang.org
- Reading 19: Little Languagesweb.mit.edu
- lecture11web.stanford.edu
- lecture12web.stanford.edu