Agda User Manual v2.6.2.2
Definitions Function Types Generalization of Declared Variables Guarded Cubical Implicit Arguments Instance Arguments Irrelevance Lambda Abstraction Local Definitions: let and where Lexical Structure Literal [http://caml.inria.fr/] are typed languages, where functions come with a type expressing what type of arguments the program expects and what the result type is. Between these two families of languages come languages (Mat i k) and the type system can check that a program for matrix multiplication really takes arguments of the correct size. It can also check that matrix multiplication is only applied to matrices, where0 码力 | 354 页 | 433.60 KB | 1 年前3Celery 3.0 Documentation
# ln -s /run/shm /dev/shm Others: If you provide any of the --pidfile, --logfile or --statedb arguments, then you must make sure that they point to a file/directory that’s writable and readable by the prioritization, all described in the Routing Guide. You can get a complete list of command-line arguments by passing in the --help flag: $ celery worker --help These options are described in more detailed information about workers so you need to use the same command-line arguments when restarting. Only the same pidfile and logfile arguments must be used when stopping. By default it’ll create pid and log0 码力 | 2110 页 | 2.23 MB | 1 年前3Celery v4.0.0 Documentation
# ln -s /run/shm /dev/shm Others: If you provide any of the --pidfile, --logfile or --statedb arguments, then you must make sure that they point to a file/directory that’s writable and readable by the prioritization, all described in the Routing Guide. You can get a complete list of command-line arguments by passing in the --help flag: $ celery worker --help These options are described in more detailed information about workers so you need to use the same command-line arguments when restarting. Only the same pidfile and logfile arguments must be used when stopping. By default it’ll create pid and log0 码力 | 2106 页 | 2.23 MB | 1 年前3Agda User Manual v2.6.2.1
Definitions Function Types Generalization of Declared Variables Guarded Cubical Implicit Arguments Instance Arguments Irrelevance Lambda Abstraction Local Definitions: let and where Lexical Structure Literal [http://caml.inria.fr/] are typed languages, where functions come with a type expressing what type of arguments the program expects and what the result type is. Between these two families of languages come languages (Mat i k) and the type system can check that a program for matrix multiplication really takes arguments of the correct size. It can also check that matrix multiplication is only applied to matrices, where0 码力 | 350 页 | 416.80 KB | 1 年前3Agda User Manual v2.6.2
Definitions Function Types Generalization of Declared Variables Guarded Cubical Implicit Arguments Instance Arguments Irrelevance Lambda Abstraction Local Definitions: let and where Lexical Structure Literal [http://caml.inria.fr/] are typed languages, where functions come with a type expressing what type of arguments the program expects and what the result type is. Between these two families of languages come languages (Mat i k) and the type system can check that a program for matrix multiplication really takes arguments of the correct size. It can also check that matrix multiplication is only applied to matrices, where0 码力 | 348 页 | 414.11 KB | 1 年前3Agda User Manual v2.6.3
Definitions Function Types Generalization of Declared Variables Guarded Cubical Implicit Arguments Instance Arguments Irrelevance Lambda Abstraction Local Definitions: let and where Lexical Structure Literal [http://caml.inria.fr/] are typed languages, where functions come with a type expressing what type of arguments the program expects and what the result type is. Between these two families of languages come languages (Mat i k) and the type system can check that a program for matrix multiplication really takes arguments of the correct size. It can also check that matrix multiplication is only applied to matrices, where0 码力 | 379 页 | 354.83 KB | 1 年前3Agda User Manual v2.6.1.3
Interface Function Definitions Function Types Generalization of Declared Variables Implicit Arguments Instance Arguments Irrelevance Lambda Abstraction Local Definitions: let and where Lexical Structure Literal [http://caml.inria.fr/] are typed languages, where functions come with a type expressing what type of arguments the program expects and what the result type is. Between these two families of languages come languages (Mat i k) and the type system can check that a program for matrix multiplication really takes arguments of the correct size. It can also check that matrix multiplication is only applied to matrices, where0 码力 | 305 页 | 375.80 KB | 1 年前3Agda User Manual v2.6.1.2
Interface Function Definitions Function Types Generalization of Declared Variables Implicit Arguments Instance Arguments Irrelevance Lambda Abstraction Local Definitions: let and where Lexical Structure Literal [http://caml.inria.fr/] are typed languages, where functions come with a type expressing what type of arguments the program expects and what the result type is. Between these two families of languages come languages (Mat i k) and the type system can check that a program for matrix multiplication really takes arguments of the correct size. It can also check that matrix multiplication is only applied to matrices, where0 码力 | 304 页 | 375.60 KB | 1 年前3Agda User Manual v2.6.1.1
Interface Function Definitions Function Types Generalization of Declared Variables Implicit Arguments Instance Arguments Irrelevance Lambda Abstraction Local Definitions: let and where Lexical Structure Literal [http://caml.inria.fr/] are typed languages, where functions come with a type expressing what type of arguments the program expects and what the result type is. Between these two families of languages come languages (Mat i k) and the type system can check that a program for matrix multiplication really takes arguments of the correct size. It can also check that matrix multiplication is only applied to matrices, where0 码力 | 297 页 | 375.42 KB | 1 年前3Agda User Manual v2.6.1
Interface Function Definitions Function Types Generalization of Declared Variables Implicit Arguments Instance Arguments Irrelevance Lambda Abstraction Local Definitions: let and where Lexical Structure Literal [http://caml.inria.fr/] are typed languages, where functions come with a type expressing what type of arguments the program expects and what the result type is. Between these two families of languages come languages (Mat i k) and the type system can check that a program for matrix multiplication really takes arguments of the correct size. It can also check that matrix multiplication is only applied to matrices, where0 码力 | 297 页 | 375.42 KB | 1 年前3
共 560 条
- 1
- 2
- 3
- 4
- 5
- 6
- 56