Haskell 2010 Language Report
Curried Applications and Lambda Abstractions . . . . . . . . . . . . . . . . . . . . . . . . 18 3.4 Operator Applications . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 18 3.5 -> | @ | ˜ | => Operator symbols are formed from one or more symbol characters, as defined above, and are lexically distin- guished into two namespaces (Section 1.4): • An operator symbol starting with with a colon is a constructor. • An operator symbol starting with any other character is an ordinary identifier. Notice that a colon by itself, “:”, is reserved solely for use as the Haskell list constructor;0 码力 | 329 页 | 1.43 MB | 1 年前3Agda User Manual v2.6.2
vector, and its type is Vec A 0, i.e. it is a vector of length 0. The second constructor is a mixfix operator named _∷_ (pronounced cons). For any number n : ℕ, it takes as input an object of A and a vector datatype declaration itself; therefore it is not indented. It establishes the precedence of the operator _∷_. Tip You can let Agda infer the type of an expression using the ‘Deduce type’ command (C-c This declaration means that the _+_ operation is left-associative. More information about mixfix operator like the arithmetic operations. You can also check this associativity example. To continue writing0 码力 | 348 页 | 414.11 KB | 1 年前3Agda User Manual v2.6.2.2
vector, and its type is Vec A 0, i.e. it is a vector of length 0. The second constructor is a mixfix operator named _∷_ (pronounced cons). For any number n : ℕ, it takes as input an object of A and a vector datatype declaration itself; therefore it is not indented. It establishes the precedence of the operator _∷_. Tip You can let Agda infer the type of an expression using the ‘Deduce type’ command (C-c This declaration means that the _+_ operation is left-associative. More information about mixfix operator like the arithmetic operations. You can also check this associativity example. To continue writing0 码力 | 354 页 | 433.60 KB | 1 年前3Agda User Manual v2.6.2.1
vector, and its type is Vec A 0, i.e. it is a vector of length 0. The second constructor is a mixfix operator named _∷_ (pronounced cons). For any number n : ℕ, it takes as input an object of A and a vector datatype declaration itself; therefore it is not indented. It establishes the precedence of the operator _∷_. Tip You can let Agda infer the type of an expression using the ‘Deduce type’ command (C-c This declaration means that the _+_ operation is left-associative. More information about mixfix operator like the arithmetic operations. You can also check this associativity example. To continue writing0 码力 | 350 页 | 416.80 KB | 1 年前3Agda User Manual v2.6.2
vector, and its type is Vec A 0, i.e. it is a vector of length 0. The second constructor is a mixfix operator named _::_ (pronounced cons). For any number n : N, it takes as input an object of A and a vector datatype declaration itself; therefore it is not indented. It establishes the precedence of the operator _::_. Tip: You can let Agda infer the type of an expression using the ‘Deduce type’ command (C-c This declaration means that the _+_ operation is left-associative. More information about mixfix operator like the arithmetic operations. You can also check this associativity example. To continue writing0 码力 | 255 页 | 1.13 MB | 1 年前3Agda User Manual v2.6.2.2
vector, and its type is Vec A 0, i.e. it is a vector of length 0. The second constructor is a mixfix operator named _::_ (pronounced cons). For any number n : N, it takes as input an object of A and a vector datatype declaration itself; therefore it is not indented. It establishes the precedence of the operator _::_. Tip: You can let Agda infer the type of an expression using the ‘Deduce type’ command (C-c This declaration means that the _+_ operation is left-associative. More information about mixfix operator like the arithmetic operations. You can also check this associativity example. To continue writing0 码力 | 257 页 | 1.16 MB | 1 年前3Agda User Manual v2.6.2.1
vector, and its type is Vec A 0, i.e. it is a vector of length 0. The second constructor is a mixfix operator named _::_ (pronounced cons). For any number n : N, it takes as input an object of A and a vector datatype declaration itself; therefore it is not indented. It establishes the precedence of the operator _::_. Tip: You can let Agda infer the type of an expression using the ‘Deduce type’ command (C-c This declaration means that the _+_ operation is left-associative. More information about mixfix operator like the arithmetic operations. You can also check this associativity example. To continue writing0 码力 | 255 页 | 1.14 MB | 1 年前3Agda User Manual v2.6.3
vector, and its type is Vec A 0, i.e. it is a vector of length 0. The second constructor is a mixfix operator named _∷_ (pronounced cons). For any number n : ℕ, it takes as input an object of A and a vector datatype declaration itself; therefore it is not indented. It establishes the precedence of the operator _∷_. Tip You can let Agda infer the type of an expression using the ‘Deduce type’ command (C-c This declaration means that the _+_ operation is left-associative. More information about mixfix operator like the arithmetic operations. You can also check this associativity example. To continue writing0 码力 | 379 页 | 354.83 KB | 1 年前3The Zig Programming Language 0.7.1 Documentation
the left side of the ! operator. When written this way, the error set type is a special kind of error union type that has an inferred error set type. The void after the ! operator tells the compiler that circumstances (i.e. no errors occur). Note to experienced programmers: Zig also has the boolean operator !a where a is a value of type bool. Error union types contain the name of the type in the syntax: 765625e-04 See also: @setFloatMode Division by Zero Operators There is no operator overloading. When you see an operator in Zig, you know that it is doing something from this table, and nothing else0 码力 | 225 页 | 5.74 MB | 1 年前3Agda User Manual v2.6.0.1
StandardLibrary]. Coinductive types can then be defined by labelling coinductive occurrences using the delay operator ∞: data Coℕ : Set where zero : Coℕ suc : ∞ Coℕ → Coℕ The type ∞ A can be seen as a suspended a;b, [_.._] The underscores in a name indicate where the arguments go when the name is used as an operator. For instance, the application _+_ 1 2 can be written as 1 + 2. See Mixfix Operators for more information Mixfix Operators A name containing one or more name parts and one or more _ can be used as an operator where the arguments go in place of the _. For instance, an application of the name if_then_else_0 码力 | 256 页 | 247.15 KB | 1 年前3
共 47 条
- 1
- 2
- 3
- 4
- 5