in Kotlin Andrey.Breslav@JetBrains.com This talk could have been named... • async/await/yield • fibers Suspendable Computations • [stackless] continuations ## Outline • Motivation/Examples • Solutions

Clients-server Video decoding ## Cooperative vs Preemptive Cooperative multithreading: Coroutines, fibers, green threads, first-class continuations - Userland, lightweight context switches - Cannot use

types. An equivalence of types A and B is defined as a map $ f: A \rightarrow B $ such that its fibers are contractible. fiber : ∀ {ℓ} {A B : Set ℓ} (f : A → B) (y : B) → Set ℓ fiber {A = A} f y = Σ[ univalence. ; The eta rule is available. ; The usual notions of proposition, - A map with contractible fibers - (Voevodsky's version of the notion). - The type of equivalences between two - A formulation

types. An equivalence of types A and B is defined as a map $ f: A \rightarrow B $ such that its fibers are contractible. fiber : ∀ {ℓ} {A B : Set ℓ} (f : A → B) (y : B) → Set ℓ fiber {A = A} f y = Σ[ notions of proposition, contractible type, set. ; isContr ; isSet ; isEquiv -- A map with contractible fibers ; _≈_ -- The type of equivalences between two given types. ; EquivContr -- A formulation of univalence

will pick them up and execute them according to certain dependency order on different threads or fibers etc. It’s also a general practice in game engine to have dedicated threads to handle specialized

between types. An equivalence of types A and B is defined as a map $ f : A \to B $ such that its fibers are contractible. fiber : ∀ {l} {A B : Set l} (f : A → B) (y : B) → Set l fiber {A = A} f y = Σ[x notions of proposition, contractible type, set. ; isContr ; isSet ; isEquiv -- A map with contractible fibers (continues on next page) (continued from previous page) -- (Voevodsky's version of the notion)

types. An equivalence of types A and B is defined as a map $ f : A \rightarrow B $ such that its fibers are contractible. fiber : ∀ {l} {A B : Set l} (f : A → B) (y : B) → Set l fiber {A = A} f y = Σ[x isSet (continues on next page) (continued from previous page) ; isEquiv -- A map with contractible fibers -- (Voevodsky's version of the notion). ; ___ -- The type of equivalences between two given types

types. An equivalence of types A and B is defined as a map $ f: A \rightarrow B $ such that its fibers are contractible. fiber : ∀ {ℓ} {A B : Set ℓ} (f : A → B) (y : B) → Set ℓ fiber {A = A} f y = Σ[ univalence. -- The eta rule is available. -- The usual notions of proposition, -- A map with contractible fibers -- (Voevodsky's version of the notion). -- The type of equivalences between two -- A formulation

types. An equivalence of types A and B is defined as a map $ f: A \rightarrow B $ such that its fibers are contractible. fiber : ∀ {ℓ} {A B : Set ℓ} (f : A → B) (y : B) → Set ℓ fiber {A = A} f y = Σ[ univalence. -- The eta rule is available. -- The usual notions of proposition, -- A map with contractible fibers -- (Voevodsky's version of the notion). -- The type of equivalences between two -- A formulation

types. An equivalence of types A and B is defined as a map $ f: A \rightarrow B $ such that its fibers are contractible. fiber : ∀ {ℓ} {A B : Set ℓ} (f : A → B) (y : B) → Set ℓ fiber {A = A} f y = Σ[ notions of proposition, contractible type, set. ; isContr ; isSet ; isEquiv -- A map with contractible fibers -- (Voevodsky's version of the notion). ; _~_ -- The type of equivalences between two given types