L7 Flashcards
(20 cards)
1
Q
In what sense is SysF explicit?
A
176-177
2
Q
How does type inference work?
A
178
3
Q
What are effects?
A
179-182
4
Q
What is state?
A
183
5
Q
Give a type system for state
A
184
6
Q
Give opsem for StateLan
A
185-186
7
Q
Give term typing rules in StateLan
A
187-188
8
Q
Strategy for proving type safety in StateLan
A
189
9
Q
Store and configuration typing rules in StateLan
A
190
10
Q
Which naively stated safety theorem is broken?
A
191
11
Q
Store extension
A
192
12
Q
Substitution and structural properties of StateLan
A
193
13
Q
Progress for StateLan
A
194
14
Q
Preservation for StateLan
A
195
15
Q
Why state reduces ability to statically analyse
A
196-197
16
Q
Landin’s knot
A
198
17
Q
Why is termination no longer a theorem
A
199
18
Q
Explain whether we have to choose between state/effects and logical consistency
A
200
19
Q
- Using Landin’s knot, implement the fibonacci function.
A
201
20
Q
- The type safety proof for state would fail if we added a C-like free() operation to the reference API.
- 1 Give a plausible-looking typing rule and operational semantics for free.
- 2 Find an example of a program that would break.
A
202
