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
- No, dynamic type systems are not inherently more openlexi-lambda.github.io
- Type system - Wikipediaen.wikipedia.org
- cool-manual.pdfweb.stanford.edu
- "We're building a new static type checker for Python" | Hacker Newsnews.ycombinator.com
- Type theory - Wikipediaen.wikipedia.org
- TypeScript: Documentation - The Basicstypescriptlang.org
- 2. Variable and Type - CS2030S Programming Methodology IInus-cs2030s.github.io
- Reading 1: Static Checkingweb.mit.edu
- Pyrefly vs. ty: Comparing Python’s Two New Rust-Based Type Checkers | Edward Li's Blogblog.edward-li.com
- Reading 1: Static Checkingweb.mit.edu
- Shikishiki.style