Lecture

Protocols in Akka Typed

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Description

This lecture covers the implementation of protocols in Akka Typed, focusing on typing Akka actors to restrict ActorRef to sending the correct message types. It explains the process of adding type parameters to ActorRef, defining understood message types in traits, and removing context.sender. The lecture also demonstrates creating a minimal protocol, proper channels using algebraic data types, and modeling protocols with different message types. Additionally, it discusses running actor programs, handling typed responses, and summarizes the philosophy behind adding types to Akka actors.

Official source

Ontological neighbourhood

Theoretical computer science

Programming language theory: High-level programming languages

Related concepts (32)

Algebraic data type

In computer programming, especially functional programming and type theory, an algebraic data type (ADT) is a kind of composite type, i.e., a type formed by combining other types. Two common classes of algebraic types are product types (i.e., tuples and records) and sum types (i.e., tagged or disjoint unions, coproduct types or variant types). The values of a product type typically contain several values, called fields. All values of that type have the same combination of field types.

Communication

Communication is usually defined as the transmission of information. The term can also refer to the message itself, or the field of inquiry studying these transmissions, also known as communication studies. The precise definition of communication is disputed. Controversial issues are whether unintentional or failed transmissions are included and whether communication does not just transmit meaning but also create it. Models of communication aim to provide a simplified overview of its main components and their interaction.

Data type

In computer science and computer programming, a data type (or simply type) is a collection or grouping of data values, usually specified by a set of possible values, a set of allowed operations on these values, and/or a representation of these values as machine types. A data type specification in a program constrains the possible values that an expression, such as a variable or a function call, might take. On literal data, it tells the compiler or interpreter how the programmer intends to use the data.

Generalized algebraic data type

In functional programming, a generalized algebraic data type (GADT, also first-class phantom type, guarded recursive datatype, or equality-qualified type) is a generalization of parametric algebraic data types. In a GADT, the product constructors (called data constructors in Haskell) can provide an explicit instantiation of the ADT as the type instantiation of their return value. This allows defining functions with a more advanced type behaviour.

Recursive data type

In computer programming languages, a recursive data type (also known as a recursively-defined, inductively-defined or inductive data type) is a data type for values that may contain other values of the same type. Data of recursive types are usually viewed as directed graphs. An important application of recursion in computer science is in defining dynamic data structures such as Lists and Trees. Recursive data structures can dynamically grow to an arbitrarily large size in response to runtime requirements; in contrast, a static array's size requirements must be set at compile time.

Related lectures (64)

Image Processing Techniques: Seam Carving and Pixel Manipulation

Discusses image processing techniques, focusing on seam carving and pixel manipulation in Python programming.

Akka Typed Facilities

Covers Akka Typed Facilities for programming reactive systems, focusing on modeling protocols and implementing type-safe service discovery.

Control Flow in Python: Conditional Statements and Loops

Covers control flow in Python, focusing on conditional statements and loops.

Advanced C Data Types

Covers advanced data types and memory management in C programming, emphasizing type consistency and dynamic array allocation.

Programming Basics: Python Fundamentals