Type Systems Flashcards

1
Q

Hypotheses

A

state facts about sub-expressions

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Conclusions

A

state facts about entire expression

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Free variables

A

if not defined within the expression

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Bound variables

A

defined within the expression

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

An environment

A

is a function from variables to types. Maps variables to types.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Sound analysis

A

verifies absence of a class of errors

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

False positives

A

always terminates must occasionally generate spurious errors or
warnings

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

False negatives

A

failed to detect errors

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Side conditions

A

They are constraints that must be solved – that is, satisfied – in
order to verify that the inference rule is properly applied.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Abstract values

A

+, 0, - (Sets), TOP {all integers}, BOT = {}

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Flow insensitive analysis

A

independent of ordering of sub-expressions - analysis result unaffected by permuting statements

Usually very efficient and scalable

Cane be imprecise

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Flow-sensitive

A

analysis of sub-expressions ordered by environments - analysis result depends on order of statements

How well did you know this?
1
Not at all
2
3
4
5
Perfectly