L11 Flashcards by P Q

Theoretic purpose of continuations

300

How well did you know this?

Not at all

Perfectly

TLC with continuations grammars

301

How well did you know this?

Not at all

Perfectly

Continuation typing rules

302

How well did you know this?

Not at all

Perfectly

Continuation APi in SML

303

How well did you know this?

Not at all

Perfectly

Design of multiply acc with escape continuations

304-306

How well did you know this?

Not at all

Perfectly

Amb primitive

307-312

How well did you know this?

Not at all

Perfectly

Filinski control theorem

313

How well did you know this?

Not at all

Perfectly

CHC relevance of dependent types

314

How well did you know this?

Not at all

Perfectly

Logical curiosity associated with Godel T and relevance to DepTypes

315-316

How well did you know this?

Not at all

Perfectly

Explain AGDA

317

How well did you know this?

Not at all

Perfectly

Explain basic datatypes in AGDA

318

How well did you know this?

Not at all

Perfectly

Explain what inductive datatypes are in agda

319

How well did you know this?

Not at all

Perfectly

Explain how polymorphic datatypes work in AGDA

320

How well did you know this?

Not at all

Perfectly

Explain how to implement indexed datatypes in agda

321-323

How well did you know this?

Not at all

Perfectly

Implement the identity type in AGDA

324

How well did you know this?

Not at all

Perfectly

Explain the identity type

325-328

Explain the form of an equivalence relation in agda

329

How would you prove commutativity of addition in agda

330

How does DT programming differ from ordinary programming?

331