L11 Flashcards

1
Q

Theoretic purpose of continuations

A

300

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

TLC with continuations grammars

A

301

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

Continuation typing rules

A

302

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

Continuation APi in SML

A

303

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

Design of multiply acc with escape continuations

A

304-306

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

Amb primitive

A

307-312

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

Filinski control theorem

A

313

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

CHC relevance of dependent types

A

314

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

Logical curiosity associated with Godel T and relevance to DepTypes

A

315-316

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

Explain AGDA

A

317

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

Explain basic datatypes in AGDA

A

318

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

Explain what inductive datatypes are in agda

A

319

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

Explain how polymorphic datatypes work in AGDA

A

320

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

Explain how to implement indexed datatypes in agda

A

321-323

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

Implement the identity type in AGDA

A

324

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

Explain the identity type

A

325-328

17
Q

Explain the form of an equivalence relation in agda

A

329

18
Q

How would you prove commutativity of addition in agda

A

330

19
Q

How does DT programming differ from ordinary programming?

A

331