## +24 ## Session Types in C++: A Programmer's Journey ## MIODRAG MISHA DJUKIC ## About me Faculty of Technical Sciences, University of Novi Sad, Serbia Teaching... a lot... Background in compilers never gives a thought about types. That is something which he has tough of and learned as a child. I, on the contrary, developed so slowly that I did not begin to wonder about types until I was an adult." never gives a thought about types. That is something which he has tough of and learned as a child. I, on the contrary, developed so slowly that I did not begin to wonder about types until I was an adult."

## Back to Basics: Algebraic Data Types I also do C++ training! arthur.j.odwyer@gmail.com ## Outline - Why the name “algebraic data types”? [3–18] o Memory layout diagrams. Why not std::any? • Quick [50–56] Questions? • More about pair and tuple [57–69] Questions? ## What do I mean by algebraic types? pair C++98. The original algebraic data type. tuple C++11. optional C++17. variant C++17 possible values| ## Pair and tuple are product types To find the size of the domain of a pair or tuple type, we take the product of the sizes of its element types. |A|A possible values| |---|---| |pair<A

3 Types and Functions 7 3.1 Primitive Types 7 3.2 Data Types 8 3.3 Functions 8 3.4 Dependent Types 10 3.5 I/O 12 3.6 "do" notation 13 3.7 Laziness 13 3.8 Useful Data Types 14 3.9 More Expressions 17 3.10 Dependent Records 18 4 Type Classes 21 4.1 Default Definitions 21 4.2 Extending Classes 22 4.3 Functors and Applicatives 23 4.4 Monads and do-notation 23 Interpreter 36 7.3 Testing 37 7.4 Running ..... 37 8 Views and the "with" rule ..... 39 8.1 Dependent pattern matching ..... 39 8.2 The with rule — matching intermediate values ..... 39 9 Theorem

jpg) The Idris Tutorial Version 1.3.3 ## Contents 1 Introduction 2 2 Getting Started 3 3 Types and Functions 5 4 Interfaces 22 5 Modules and Namespaces 31 6 Packages 35 7 Example: The Well-Typed conventional programming languages, there is a clear distinction between types and values. For example, in Haskell, the following are types, representing integers, characters, lists of characters, and lists inhabitants of those types: • 42, 'a', "Hello world!", [2,3,4,5,6] In a language with dependent types, however, the distinction is less clear. Dependent types allow types to “depend” on values

## EMBRACING USER DEFINED LITERALS SAFELY ## for Types that Behave as though Built-in Pablo Halpern phalpern@halpernwightsoftware.com CppCon 2021 ## literal [ lit-er-uhl ] ## adjective 1. in accordance KHLEBNIKOV | ALISDAIR MEREDITH ## Talks in this series: ■ Embracing User Defined Literals Safely for Types that Behave as though Built-in - Pablo Halpern, Tuesday 9am  ■ Embracing (and also destroying) Variant Types Safely - Andrei Alexandrescu, Thursday 9am Embracing PODs Safely Until They Die – Alisdair Meredith &

conventional programming languages, there is a clear distinction between types and values. For example, in Haskell, the following are types, representing integers, characters, lists of characters, and lists inhabitants of those types: • 42, 'a', "Hello world!", [2,3,4,5,6] In a language with dependent types, however, the distinction is less clear. Dependent types allow types to "depend" "depend" on values — in other words, types are a first class language construct and can be manipulated like any other value. The standard example is the type of lists of a given length $ ^{1} $ , Vect n a,

conventional programming languages, there is a clear distinction between types and values. For example, in Haskell, the following are types, representing integers, characters, lists of characters, and lists examples of inhabitants of those types: • 42, ’a’, "Hello world!", [2,3,4,5,6] In a language with dependent types, however, the distinction is less clear. Dependent types allow types to “depend” on values — in in other words, types are a first class language construct and can be manipulated like any other value. The standard example is the type of lists of a given length1, Vect n a, where a is the element type

## BEN DEANE / @ben_deane CPPCON 2021 ## I N THIS TALK 1. Composability defined 2. Composable types 3. Objects and patterns 4. Composability at compile time 5. Hierarchies and computation ## COMPOSABLE _composably() -> int; Spoiler: bool and int are in some sense the only two composable return types we need... ## WHY int? Of course, int can represent N (32?) bools, using bitand (&) and bitor COMPOSABILITY FROM PRINCIPLES At the core, steering behaviours is based on the composability of arithmetic types. A single function returns a force that can be accumulated and applied. The resulting framework

Go From Here 12 2 Defining Objects in Lean 13 2.1 Some Basic Types 14 2.2 Defining Functions 17 2.3 Defining New Types 20 2.4 Records and Structures 22 2.5 Nonconstructive Definitions Inhabited Types, Subtypes, and Option Types 32 3.4 Monads 34 3.5 Input and Output 35 3.6 An Example: Abstract Syntax 36 4 Theorem Proving in Lean 38 4.1 Assertions in Dependent Type Theory Theory 38 4.2 Propositions as Types 39 4.3 Induction and Calculation 42 4.4 Axioms 45 5 Using Automation in Lean 46 6 Metaprogramming in Lean 47 Bibliography # Overview This introduction

AWS SSO AWS Permissions GCP Credentials GCP SSO Local Client Configuration Connection Types Configure Connection Initialization Settings Tableau integration Transactions Auto and Manual context menu items for all types of objects that may appear in the tree. Note that the presence or absence of the context menu items for an object depends on the database and object types. |Menu item|Description| To reset the filter, click the Clear icon (✗) on the right end of the field. You can select the types of filtering objects in the drop-down list on the right. And also use the filter only for active connections