Go’s Hidden #pragmas GopherChina 2017 ’ alt=‘OCR图片’/> @davecheney Go programmer from Sydney, Australia ’ alt=‘OCR图片’/> But first, a history lesson. Perl use strict; use strict “vars”; use strict “refs”; struct T { int i; short j; double k; }; Does Go have pragmas? Yes. Go has pragmas // They’re actually called pragmas in the source func pragmaValue(verb string) syntax.Pragma { switch

error. However, the implementation provides a means to disable these runtime checks. See the section Pragmas for details. Whether a panic results in an exception or in a fatal error is implementation specific FloatInexactDefect. These exceptions inherit from the FloatingPointDefect base class. Nim provides the pragmas nanChecks and infChecks to control whether the IEEE exceptions are ignored or trap a Nim exception: is also a floatChecks pragma that is a short-cut for the combination of nanChecks and infChecks pragmas. floatChecks are turned off as default. The only operations that are affected by the floatChecks

Mutual Recursion o Pattern Synonyms o Positivity Checking o Postulates o Pragmas o Record Types o Reflection o Rewriting o Safe Agda o Sized Types datatypes - Indexed datatypes - Strict positivity - Foreign Function Interface - Compiler Pragmas Haskell FFI JavaScript FFI Function Definitions Introduction General form Special patterns Positivity Checking - The NO POSitivity CHECK pragma - POLARITY pragmas - Postulates - Postulated built-ins - Pragmas - Index of pragmas - Record Types - Declaring, constructing and decomposing

Mutual Recursion o Pattern Synonyms o Positivity Checking o Postulates o Pragmas o Record Types o Reflection o Rewriting o Safe Agda o Sized Types datatypes - Indexed datatypes - Strict positivity - Foreign Function Interface - Compiler Pragmas Haskell FFI JavaScript FFI Function Definitions Introduction General form Special patterns Positivity Checking - The NO POSitivity CHECK pragma - POLARITY pragmas - Postulates - Postulated built-ins - Pragmas - Index of pragmas - Record Types - Declaring, constructing and decomposing

Mutual Recursion o Pattern Synonyms o Positivity Checking o Postulates o Pragmas o Record Types o Reflection o Rewriting o Safe Agda o Sized Types datatypes - Indexed datatypes - Strict positivity - Foreign Function Interface - Compiler Pragmas Haskell FFI JavaScript FFI Function Definitions Introduction General form Special patterns Positivity Checking - The NO POSitivity CHECK pragma - POLARITY pragmas - Postulates - Postulated built-ins - Pragmas - Index of pragmas - Record Types - Declaring, constructing and decomposing

Module System - Mutual Recursion ○ Pattern Synonyms ○ Positivity Checking ○ Postulates ○ Pragmas ○ Prop ○ Record Types ○ Reflection ○ Rewriting ○ Run-time Irrelevance ○ Safe Agda ○ String types from the Agda Builtin library. 2. A postulate of the function type putStrLn. 3. Two pragmas that tell Agda how to compile the function `putStrLn` 4. A definition of the function main. To • Flat Modality • Pattern Matching on @b • Foreign Function Interface • Compiler Pragmas • Haskell FFI • JavaScript FFI • Function Definitions • Introduction •

Operators Module System Mutual Recursion Pattern Synonyms Positivity Checking Postulates Pragmas Prop Record Types Reflection Rewriting Run-time Irrelevance Safe Agda Sized Types String types from the Agda Builtin library. 2. A postulate of the function type putStrLn. 3. Two pragmas that tell Agda how to compile the function `putStrLn` 4. A definition of the function main. To • Flat Modality • Pattern Matching on @b • Foreign Function Interface • Compiler Pragmas • Haskell FFI • JavaScript FFI • Function Definitions • Introduction •

Module System - Mutual Recursion ○ Pattern Synonyms ○ Positivity Checking ○ Postulates ○ Pragmas ○ Prop ○ Record Types ○ Reflection ○ Rewriting ○ Run-time Irrelevance ○ Safe Agda ○ String types from the Agda Builtin library. 2. A postulate of the function type putStrLn. 3. Two pragmas that tell Agda how to compile the function `putStrLn`. 4. A definition of the function main. To • Flat Modality. • Pattern Matching on @b • Foreign Function Interface • Compiler Pragmas • Haskell FFI • JavaScript FFI • Function Definitions • Introduction •

Module System o Mutual Recursion o Pattern Synonyms o Positivity Checking o Postulates o Pragmas o Prop o Record Types o Reflection o Rewriting o Run-time Irrelevance o Safe Agda o String types from the Agda Builtin library. 2. A postulate of the function type putStrLn. 3. Two pragmas that tell Agda how to compile the function `putStrLn` 4. A definition of the function main. To • Flat Modality • Pattern Matching on @b • Foreign Function Interface • Compiler Pragmas • Haskell FFI • JavaScript FFI • Function Definitions • Introduction •

19 Mutual Recursion 3.20 Pattern Synonyms 3.21 Positivity Checking 3.22 Postulates 3.23 Pragmas 3.24 Record Types 3.25 Reflection 3.26 Rewriting 3.27 Safe Agda 3.28 Sized Types 3.29 While it is possible to define your own versions of the built-in types and bind them using BUILTIN pragmas, it is recommended to use the definitions in the Agda.Builtin modules. These modules are installed #### 3.2.12 Universe levels module Agda.Primitive Universe levels are also declared using BUILTIN pragmas. In contrast to the Agda.Builtin modules, the Agda.Primitive module is auto-imported and thus it